Trees, Taxonomy, and Strongly Compatible Multi-state Characters
- 1 July 1997
- journal article
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 19 (1) , 1-30
- https://doi.org/10.1006/aama.1996.0503
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is FixedSIAM Journal on Computing, 1994
- A combinatorial approach to p-adic geometryGeometriae Dedicata, 1993
- Split decomposition: A new and useful approach to phylogenetic analysis of distance dataMolecular Phylogenetics and Evolution, 1992
- Valuated matroidsAdvances in Mathematics, 1992
- Convex tree realizations of partitionsApplied Mathematics Letters, 1992
- Two strikes against perfect phylogenyPublished by Springer Nature ,1992
- Distance-hereditary graphsJournal of Combinatorial Theory, Series B, 1986
- Reconstructing the shape of a tree from observed dissimilarity dataAdvances in Applied Mathematics, 1986
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spacesAdvances in Mathematics, 1984
- An axiomatic system for tree-algebrasČasopis pro pěstování matematiky, 1983