ロード中...

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...

詳細記述

保存先:
書誌詳細
主要な著者: Ramu, Avinash, Kahveci, Tamer, Burleigh, J Gordon
フォーマット: Artigo
言語:Inglês
出版事項: BioMed Central 2012
主題:
オンライン・アクセス: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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!