ロード中...
Linear-time algorithms for phylogenetic tree completion under Robinson–Foulds distance
BACKGROUND: We consider two fundamental computational problems that arise when comparing phylogenetic trees, rooted or unrooted, with non-identical leaf sets. The first problem arises when comparing two trees where the leaf set of one tree is a proper subset of the other. The second problem arises w...
保存先:
| 出版年: | Algorithms Mol Biol |
|---|---|
| 第一著者: | |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
BioMed Central
2020
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7155338/ https://ncbi.nlm.nih.gov/pubmed/32313549 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13015-020-00166-1 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|