## The minimum evolution problem is hard: a link between tree inference and graph clustering problems

- Sarah Bastkowski, Vincent Moulton, Andreas Spillner, Taoyang Wu
- Bioinformatics
- 2016

Highly Influenced

@inproceedings{William2010ComputationalCO, title={Computational Complexity of Inferring Phylogenies by Compatibility}, author={William and H. E.W. and Day}, year={2010} }

- Published 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 per Year

Semantic Scholar estimates that this publication has **61** citations based on the available data.

See our **FAQ** for additional information.