Genomic distances under deletions and insertions

DOI10.1016/j.tcs.2004.02.039zbMath1071.92503OpenAlexW1507091143MaRDI QIDQ1884838

Krister M. Swenson, Mark Marron, Bernard M. E. Moret

Publication date: 27 October 2004

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

Full work available at URL: https://infoscience.epfl.ch/record/97882/files/tcs04.pdf

zbMATH Keywords

minimal edit sequences

Mathematics Subject Classification ID

Problems related to evolution (92D15) Genetics and epigenetics (92D10)

Related Items (5)

An algebraic model for inversion and deletion in bacterial genome rearrangement ⋮ On the inapproximability of the exemplar conserved interval distance problem of genomes ⋮ On the Approximability of Comparing Genomes with Duplicates ⋮ Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Genomic Distances under Deletions and Insertions
• Finding an Optimal Inversion Median: Experimental Results
• On the Practical Solution of the Reversal Median Problem

This page was built for publication: Genomic distances under deletions and insertions