The enumeration of minimal phylograms

✍ Scribed by Ludwig Nastansky; Stanley M. Selkow; Neil F. Stewart

• Publisher: Springer
• Year: 1973
• Tongue: English
• Weight: 381 KB
• Volume: 35
• Category: Article
• ISSN: 1522-9602
• DOI: 10.1016/s0092-8240(73)80051-5

✦ Synopsis

We consider the problem of finding a minimal tree to a set of nodes (of species represented by d characters) in a space of d-dimensions subject to the hypothesis that evolution is nonconvergent and irreversible. A solution to this problem is formulated, using integer linear programming techniques.