Trees, taxonomy, and strongly compatible multi-state characters

Advances in Applied Mathematics

Volumn 19, Issue 1, 1997, Pages 1-30

  Dress, Andreas ^a   Moulton, Vincent ^a   Steel, Michael ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031185302     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1996.0503     Document Type: Article

References (22)

1. Agarwala R., Fernández-Baca D. A polynomial time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM J. Comput. 23:1994;1216-1224.
2. Bandelt H.-J. Ein Axiomensystem für Baum-Algebren. Čas. Pěst. Mat. 108:1983;353-355.
3. Bandelt H.-J., Dress A. Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7:1986;309-343.
4. Bandelt H.-J., Dress A. A new and useful approach to phylogenetic analysis of distance data. Molec. Phylogenet. and Evol. 1:Sept. 1992;242-252.
5. Bandelt H.-J., Mulder H. Distance-hereditary graphs. J. Combin. Theory Ser. B. 41:1986;182-208.
6. Berge C. Graphs and Hypergraphs. 1976;North-Holland, Amsterdam.
7. H. Bodlaender, M. Fellows, T. Warnow, Two strikes against perfect phylogeny, Proc. of the 19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, 273, 283, Springer-Verlag, New York/Berlin.
8. Bollobás B. Graph Theory. 1979;Springer-Verlag, New York/Berlin.
9. Buneman P. The recovery of trees from measures of dissimilarity. Mathematics in the Archaeological and Historical Sciences. 1971;Edinburgh University Press, Edinburgh. p. 387-395.
10. Dress A. Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces. Adv. in Math. 53:1984;321-402.
11. A. Dress, The Calculus of Barriers.
12. A. Dress, V. Moulton, W. Terhalle, T-Theory - An overview, Europ. J. Combin.
13. Dress A., Steel M. Convex tree realizations of partitions. App. Math. Lett. 5:1992;3-6.
14. Dress A., Terhalle W. A combinatorial approach to p-adic geometry. I. The process of completion. Geom. Dedicata. 46:1993;127-148.
15. Dress A., Wenzel W. Valuated matroids. Adv. in Math. 93:1992;214-250.
16. Howorka E. On metric properties of certain clique graphs. J. Combin. Theory, Ser. B. 27:1979;67-74.
17. McMorris F., Warnow T., Wimer T. Triangulating vertex colored graphs. SIAM J. Discrete Math. 7:1994;296-306.
18. C. Meacham, Theoretical and computational considerations of the compatibility of qualitative taxonomic characters, Numerical Taxonomy, J. Felsenstein, NATO ASI Series, G1, 304, 314, Springer-Verlag, Berlin/Heidelberg.
19. Mulder H. The Interval Function of a Graph. Mathematical Center Tract. 132. 1980;Mathematische Centrum, Amsterdam.
20. Steel M. The complexity of reconstructing trees from qualitative characters and subtrees. J. Classification. 9:1992;91-116.
21. W. Terhalle, 1992, Ein kombinatorischer Zugang zu p-adischer Geometrie: Bewertete Matroide, Bäume and Gebäude, Universität Bielefeld.
22. Zelinka B. Infinite tree algebras. Čas. Pěst. Mat. 107:1982;59-68.