A Lower Bound for the Breakpoint Phylogeny Problem
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 235-247
- https://doi.org/10.1007/3-540-45123-4_21
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Gene Order Breakpoint Evidence in Animal Mitochondrial PhylogenyJournal of Molecular Evolution, 1999
- Formulations and hardness of multiple sorting by reversalsPublished by Association for Computing Machinery (ACM) ,1999
- The Organelle Genome Database Project (GOBASE)Nucleic Acids Research, 1998
- Multiple Genome Rearrangement and Breakpoint PhylogenyJournal of Computational Biology, 1998
- STEINER POINTS IN THE SPACE OF GENOME REARRANGEMENTSInternational Journal of Foundations of Computer Science, 1996
- Genome Sequence Comparison and Scenarios for Gene Rearrangements: A Test CaseGenomics, 1995
- Edit distance for genome comparison based on non-local operationsPublished by Springer Nature ,1992
- Locating the vertices of a steiner tree in an arbitrary metric spaceMathematical Programming, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970