Genomic Distances under Deletions and Insertions
- 6 October 2004
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 325 (3) , 347-360
- https://doi.org/10.1016/j.tcs.2004.02.039
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order DataPublished by Springer Nature ,2002
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyJournal of Computational Biology, 2001
- On the Practical Solution of the Reversal Median ProblemPublished by Springer Nature ,2001
- Finding an Optimal Inversion Median: Experimental ResultsPublished by Springer Nature ,2001
- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous SegmentsPublished by Springer Nature ,2000
- The Complexity of Calculating Exemplar DistancesPublished by Springer Nature ,2000
- Formulations and hardness of multiple sorting by reversalsPublished by Association for Computing Machinery (ACM) ,1999
- Chloroplast DNA Systematics: A Review of Methods and Data AnalysisAmerican Journal of Botany, 1994
- Chloroplast DNA Evidence on the Ancient Evolutionary Split in Vascular Land PlantsScience, 1992
- Use of Chloroplast DNA Rearrangements in Reconstructing Plant PhylogenyPublished by Springer Nature ,1992