A scalable method for identifying frequent subtrees in sets of large phylogenetic trees
<p>Abstract</p> <p>Background</p> <p>We consider the problem of finding the maximum frequent agreement subtrees (MFASTs) in a collection of phylogenetic trees. Existing methods for this problem often do not scale beyond datasets with around 100 taxa. Our goal is to addr...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2012-10-01
|
| Series: | BMC Bioinformatics |
| Subjects: | |
| Online Access: | http://www.biomedcentral.com/1471-2105/13/256 |