Minimizing phylogenetic number to find good evolutionary trees
Open Access
- 1 December 1996
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 71 (1-3) , 111-136
- https://doi.org/10.1016/s0166-218x(96)00060-1
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHSInternational Journal of Foundations of Computer Science, 1996
- Four Strikes Against Physical Mapping of DNAJournal of Computational Biology, 1995
- Inferring Evolutionary History From DNA SequencesSIAM Journal on Computing, 1994
- Triangulating Vertex-Colored GraphsSIAM Journal on Discrete Mathematics, 1994
- Computational Complexity of Inferring Phylogenies by CompatibilitySystematic Zoology, 1986
- Computationally difficult parsimony problems in phylogenetic systematicsJournal of Theoretical Biology, 1983
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- Toward Defining the Course of Evolution: Minimum Change for a Specific Tree TopologySystematic Zoology, 1971
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957