Efficient algorithms for multichromosomal genome rearrangements.

DOI10.1016/S0022-0000(02)00011-9zbMath1059.68160OpenAlexW2113035810MaRDI QIDQ1872727

Glenn Tesler

Publication date: 14 May 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(02)00011-9

zbMATH Keywords

InversionReversalHomologyFusionGenesGenome rearrangementsBreakpoint graphChromosomesFissionTranslocation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)

Related Items

Genome rearrangements: a correct algorithm for optimal capping ⋮ HP Distance Via Double Cut and Join Distance ⋮ Multi-break rearrangements and chromosomal evolution ⋮ Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies ⋮ Genome rearrangements with partially ordered chromosomes ⋮ A new linear time algorithm to compute the genomic distance via the double cut and join distance ⋮ Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? ⋮ The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances

Cites Work

• Unnamed Item
• Unnamed Item
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Transforming cabbage into turnip
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals