ロード中...
Improved Heuristics for Minimum-Flip Supertree Construction
The utility of the matrix representation with flipping (MRF) supertree method has been limited by the speed of its heuristic algorithms. We describe a new heuristic algorithm for MRF supertree construction that improves upon the speed of the previous heuristic by a factor of n (the number of taxa in...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Libertas Academica
2007
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2674677/ https://ncbi.nlm.nih.gov/pubmed/19455229 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|