Cargando…
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...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2012
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3577452/ https://www.ncbi.nlm.nih.gov/pubmed/23259766 http://dx.doi.org/10.1186/1745-6150-7-48 |