Wordt geladen...
A scalable method for identifying frequent subtrees in sets of large phylogenetic trees
BACKGROUND: 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 address this problem for datasets with over a thousand taxa...
Bewaard in:
| Hoofdauteurs: | , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
BioMed Central
2012
|
| Onderwerpen: | |
| Online toegang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3543182/ https://ncbi.nlm.nih.gov/pubmed/23033843 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-13-256 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|