Computationally difficult parsimony problems in phylogenetic systematics

[1]  D. A. Neumann.  Faithful consensus methods for n-trees , 1983 .

[2]  D. A. Neumann,et al.  Consensus functions defined on trees , 1983 .

[3]  R. Graham,et al.  Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time , 1982 .

[4]  F. Rohlf.  Consensus indices for comparing classifications , 1982 .

[5]  F. Papentin,et al.  On order and complexity. II. Application to chemical and biochemical structures. , 1982, Journal of theoretical biology.

[6]  Fred R. McMorris,et al.  Consensusn-trees , 1981 .

[7]  F. Papentin.  On order and complexity. I. General considerations , 1980 .

[8]  L. Foulds,et al.  Identification of phylogenetic trees of minimal length. , 1978, Journal of theoretical biology.

[9]  Walter M. Fitch,et al.  On the Problem of Discovering the Most Parsimonious Tree , 1977, The American Naturalist.

[10]  W. A. Beyer,et al.  Additive evolutionary trees. , 1977, Journal of theoretical biology.

[11]  G. Moore,et al.  An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets. , 1973, Journal of theoretical biology.

[12]  J. Farris.  Estimating Phylogenetic Trees from Distance Matrices , 1972, The American Naturalist.

[13]  J. Farris.  Methods for Computing Wagner Trees , 1970 .

[14]  J. Farris,et al.  Quantitative Phyletics and the Evolution of Anurans , 1969 .

[15]  G. Estabrook,et al.  A general solution in partial orders for the Camin-Sokal model in phylogeny. , 1968, Journal of theoretical biology.

[16]  L. Cavalli-Sforza,et al.  PHYLOGENETIC ANALYSIS: MODELS AND ESTIMATION PROCEDURES , 1967, Evolution; international journal of organic evolution.

[17]  James S. Farris,et al.  The Meaning of Relationship and Taxonomic Procedure , 1967 .

[18]  W. Fitch,et al.  Construction of phylogenetic trees. , 1967, Science.

[19]  R. Sokal,et al.  A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY , 1965 .

[20]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[21]  Bernard Monjardet,et al.  Metrics on partially ordered sets - A survey , 1981, Discret. Math..

[22]  Frank Harary,et al.  Graph Theory , 2016 .