Computational Complexity of Inferring Phylogenies by Compatibility

@inproceedings{William2010ComputationalCO,
  title={Computational Complexity of Inferring Phylogenies by Compatibility},
  author={William and H. E.W. and Day},
  year={2010}
}
-A well-known approach to inferring phylogenies involves finding a phylogeny with the largest number of characters that are perfectly compatible with it. Variations of this problem depend on whether characters are: cladistic (rooted) or qualitative (unrooted); binary (two states) or unconstrained (more than one state). The computational cost of known algorithms that guarantee solutions to these problems increases at least exponentially with problem size; practical computational considerations… CONTINUE READING
Highly Cited
This paper has 60 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

61 Citations

051015'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Computationally difficult parsimony problems in phylogenetic systematics

  • G. F. ESTABROOK, C. S. JOHNSON
  • J . Theor . Biol .
  • 1983

Numerical methods for infer

  • 1982

Unlikelihood that minimal phylogenies for a realistic

  • W. H. Freeman, R. L. San Francisco. GRAHAM, L. R. FOULDS
  • 1982

When is one estimate of evolutionary

  • G F.
  • AND F. R. MCMORRIS
  • 1980
3 Excerpts

When is one estimate of evolutionary relationships a refinement of another ?

  • J. S. FARRIS
  • J . Math . Biol .
  • 1980

On the compatibility

  • F R.
  • 1977
1 Excerpt

Phylogenetic analysis under Dollo's law

  • S.J.
  • Syst. Zool., 26:77-88. FARRIS,
  • 1977
1 Excerpt

The uniquely evolved

  • Zool, W. J. 23513-517. LE QUESNE
  • 1977

Similar Papers

Loading similar papers…