Multi-break rearrangements and chromosomal evolution

DOI10.1016/j.tcs.2008.01.013zbMath1142.92011OpenAlexW2121949584WikidataQ57057013 ScholiaQ57057013MaRDI QIDQ932316

Max A. Alekseyev, Pavel A. Pevzner

Publication date: 10 July 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.013

zbMATH Keywords

transpositiongenome rearrangementgenomic distancetranslocationreversalbreakpoint graphmulti-break

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10)

Related Items (6)

Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics ⋮ Sorting by \(k\)-cuts on signed permutations ⋮ Linear algorithm for a cyclic graph transformation ⋮ The minimum-cost transformation of graphs ⋮ Linear algorithm for minimal rearrangement of structures ⋮ Approximation algorithms for sorting by \(k\)-cuts on signed permutations

Uses Software

• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 2-approximation algorithm for genome rearrangements by reversals and transpositions
• Efficient algorithms for multichromosomal genome rearrangements.
• A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
• Working on the Problem of Sorting by Transpositions on Genome Rearrangements
• Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
• Sorting by Transpositions
• Genome Rearrangements and Sorting by Reversals
• Reversals and Transpositions Over Finite Alphabets
• Signed genome rearrangement by reversals and transpositions: Models and approximations
• On computing Hilbert bases via the Elliot--MacMahon algorithm

This page was built for publication: Multi-break rearrangements and chromosomal evolution