Tree reconstruction from multi-state characters

Advances in Applied Mathematics

Volumn 28, Issue 2, 2002, Pages 169-184

  Semple, Charles ^a   Steel, Mike ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Character compatibility; Chordal graph; Phylogeny; Tree

Indexed keywords

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

References (10)

1. A polynomial-time algorithm for the phylogeny problem when the number of character states is fixed
2. A characterisation of rigid circuit graphs
3. On the distribution of lengths of evolutionary trees
4. A fast algorithm for the computation and enumeration of perfect phylogenies
5. Triangulating vertex coloured graphs
6. Theoretical and computational considerations of the compatibility of qualitative taxonomic characters
7. Rare genomic changes as a tool for phylogenetics
8. Phylogenetic supertrees: Assembling the trees of life
9. A characterization for a set of partial partitions to define an X-tree
10. The complexity of reconstructing trees from qualitative characters and subtrees