Nastansky, Ludwig; Selkow, Stanley M.; Stewart, Neil F.: The enumeration of minimal phylograms, in: Bulletin of Mathematical Biology, Volume 35, Issue 4, Springer, New York 1973, pp. 525-533.

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.

THEMES: Nastansky, Ludwig\...\Operations Res... | Selkow, Stanley M. | Stewart, Neil F.
META STRUCTURES: LN\Papers
YEAR: 1973
Login Login
User: Anonymous

LABEL: CDC-6600 | Cladistics | Enumeration | FORTRAN | Graph Theory | Mathematical Programming - 0-1 | Phylogram | Software Engineering | Tree
ORGANIZATIONS: Université de Montréal
PEOPLE: Nastansky, Ludwig | Selkow, Stanley M. | Steward, Neill F.
PLACES: Montréal
THINGS: Biology | Evolution
 
Comments/attachments: Close