Yüklüyor......
Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios
BACKGROUND: A long recognized problem is the inference of the supertree S that amalgamates a given set {G(j)} of trees G(j), with leaves in each G(j) being assigned homologous elements. We ground on an approach to find the tree S by minimizing the total cost of mappings α(j) of individual gene trees...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
BioMed Central
2012
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3577452/ https://ncbi.nlm.nih.gov/pubmed/23259766 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1745-6150-7-48 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|