We consider the problem of finding a minimal tree to a set of nodes (of species represented byd characters) in a space ofd-dimensions subject to the hypothesis that evolution is nonconvergent and irreversible. A solution to this problem is formulated, using integer linear programming techniques.
KeywordsLinear Programming Problem Steiner Problem Direct Predecessor Research Center Report Evolutionary Descent
- Dreyfus, S. E. and R. A. Wagner. 1970. “The Steiner Problem in Graphs.” Operation Research Center Report ORC-70-32, Berkeley: University of California Press.Google Scholar
- Hadley, G. 1963.Linear Programming. Reading, Massachusetts: Addison-Wesley.Google Scholar
- Sokal, R. R. and P. H. A. Sneath. 1963.Principles of Numerical Taxonomy. San Francisco: Freeman.Google Scholar