ロード中...
A practical O(n log(2 )n) time algorithm for computing the triplet distance on binary trees
The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two roo...
保存先:
| 主要な著者: | , , , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
BioMed Central
2013
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3549851/ https://ncbi.nlm.nih.gov/pubmed/23368759 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-14-S2-S18 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|