SpringerLink
Log in

The enumeration of minimal phylograms

  • Published:
Bulletin of Mathematical Biology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature

  • Camin, J. H. and R. R. Sokal. 1965. “A Method for Deducing Branching Sequences in Phylogeny.”Evolution,19, 311–326.

    Article  Google Scholar 

  • Dantzig, G. B. 1963.Linear Programming and Extensions. Princeton: Princeton University Press.

    MATH  Google Scholar 

  • 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 

  • Hendrickson, J. A. Jr. 1968. “Clustering in Numerical Cladistics: a Minimum-Length Directed Tree Problem.”Math. Biosci. 3, 371–381.

    Article  Google Scholar 

  • Levin, A. Ju. 1971. “Algorithm for the Shortest Connection of a Group of Graph Vertices.”Soviet Math. Dokl. 12, No. 5, 1477–1481.

    MATH  Google Scholar 

  • Jardine, N. and R. Sibson. 1971.Mathematical Taxonomy. New York: John Wiley.

    MATH  Google Scholar 

  • Sokal, R. R. and P. H. A. Sneath. 1963.Principles of Numerical Taxonomy. San Francisco: Freeman.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique, Université de Montréal, Montréal, Québec

    Ludwig Nastansky, Stanley M. Selkow & Neil F. Stewart

Authors
  1. Ludwig Nastansky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stanley M. Selkow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Neil F. Stewart
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nastansky, L., Selkow, S.M. & Stewart, N.F. The enumeration of minimal phylograms. Bltn Mathcal Biology 35, 525–533 (1973). https://doi.org/10.1007/BF02575195

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02575195

Keywords

Search

Navigation