Quasi-median hulls in Hamming space are Steiner hulls

Discrete Applied Mathematics

Volumn 157, Issue 2, 2009, Pages 227-233

  Bandelt, Hans Jürgen ^a   Röhl, Arne ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Hamming space; Maximum parsimony; Quasi median operation; Steiner hull; Steiner minimal tree

Indexed keywords

DNA SEQUENCES; MEATS; NUCLEIC ACIDS; ORGANIC ACIDS;

HAMMING SPACE; MAXIMUM PARSIMONY; QUASI-MEDIAN OPERATION; STEINER HULL; STEINER MINIMAL TREE;

HAMMING DISTANCE;

EID: 56349145301     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.09.015     Document Type: Article

References (23)

1. Bandelt H.-J. Phylogenetic networks. Verh. Naturwiss. Ver. Hamburg (NF) 34 (1994) 51-71
2. Bandelt H.-J. Median hulls as Steiner hulls in rectilinear and molecular sequence spaces. Graph-Theoretic Concepts in Computer Science (27th International Workshop, WG 2001). Lecture Notes in Computer Science vol. 2204 (2001), Springer-Verlag 1-7
3. Bandelt H.-J., Forster P., and Röhl A. Median-joining networks for inferring intraspecific phylogenies. Mol. Biol. Evol. 16 (1999) 37-48
4. Bandelt H.-J., Forster P., Sykes B.C., and Richards M.B. Mitochondrial portraits of human populations using median networks. Genetics 141 (1995) 743-753
5. Bandelt H.-J., Huber K.T., and Moulton V. Quasi-median graphs from sets of partitions. Discrete Appl. Math. 122 (2002) 23-35
6. Bandelt H.-J., Mulder H.M., and Wilkeit E. Quasi-median graphs and algebras. J. Graph Theory 18 (1994) 681-703
7. Bergman G. On the existence of subalgebras of direct products with prescribed α-fold projections. Algebra Universalis 7 (1977) 341-356
8. Cieslik D. Steiner Minimal Trees (1998), Kluwer, Dordrecht
9. Farris J. Methods for computing Wagner trees. Syst. Zool. 19 (1970) 83-92
10. Fitch W.M. Toward defining the course of evolution: Minimal change for a specific tree topology. Syst. Zool. 20 (1971) 406-416
11. Foulds L.R., and Graham R.L. The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3 (1982) 43-49
12. Foulds L.R., Hendy M.D., and Penny D. A graph theoretic approach to the development of minimal phylogenetic trees. J. Mol. Evol. 13 (1979) 127-149
13. Fried E., and Pixley A.F. The dual discriminator in universal algebra. Acta. Sci. Math. (Szeged) 41 (1979) 83-100
14. Grätzer G. Universal Algebra. 2nd ed. (1979), Springer-Verlag, New York
15. Gusfield D. Algorithms on Strings, Trees, and Sequences (1997), Cambridge University Press, Cambridge
16. Hartigan J.A. Minimum mutation fits to a given tree. Biometrics 29 (1972) 53-65
17. Hwang F.K., Richards D.S., and Winter P. The Steiner Tree Problem (1992), North-Holland, Amsterdam
18. Isbell J.R. Median algebra. Trans. Amer. Math. Soc. 260 (1980) 319-362
19. Semple C., and Steel M. Phylogenetics (2003), Oxford University Press
20. Sankoff D. Minimal mutation trees of sequences. SIAM J. Appl. Math. 28 (1975) 35-42
21. Steel M. Sufficient conditions for two tree reconstruction techniques to succeed on sufficiently long sequences. SIAM J. Discrete Math. 14 (2000) 36-48
22. Swofford D.L., Olsen G.J., Waddell P.J., and Hillis D.M. Phylogenetic inference. In: Hillis D.M., Moritz C., and Mable B.K. (Eds). Molecular Systematics (1996), Sinauer, Sunderland, MA
23. van de Vel M.L.J. Theory of Convex Structures (1993), North-Holland, Amsterdam