Patchworks

Advances in Mathematics

Volumn 157, Issue 1, 2001, Pages 1-21

  Böcker, Sebastian ^a   Dress, Andreas W M ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Cluster systems; lattices; hierarchical clustering; hierarchies; maximal hierarchies; finitary cluster systems; ample cluster systems; patchworks; the category of cluster systems

Indexed keywords

EID: 0035863995     PISSN: 00018708     EISSN: None     Source Type: Journal    
DOI: 10.1006/aima.1999.1912     Document Type: Article

References (8)

1. Bandelt H.-J., Dress A. Reconstructing the shape of a tree from observed dissimilarity data. Adv. in Appl. Math. 7:1986;309-343.
2. Böcker S., Bryant D., Dress A. W. M., Steel M. Algorithmic aspects of tree amalgamation. J. Algorithms. 37:2000;522-537.
3. S. Böcker, and, A. W. M. Dress, A note on maximal hierarchies, Adv. Math, in press.
4. S. Böcker, A. W. M. Dress, and, M. Steel, Most parsimonious quartet encodings of binary trees, in preparation.
5. Böcker S., Dress A. W. M., Steel M. Patching up X-trees. Ann. Comb. 3:1999;1-12.
6. Bryant D. Hunting for trees in binary character sets: efficient algorithms for extraction, enumeration, and optimization. J. Comp. Biol. 3:1996;275-288.
7. Colonius H., Schulze H.-H. Tree structures for proximity data. British J. Math. Statist. Psych. 34:1981;167-180.
8. Dress A., Moulton V., Steel M. Trees, taxonomy, and strongly compatible multi-state characters. Adv. in Appl. Math. 19:1997;1-30.