Cargando…
Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem
BACKGROUND: Recent coevolutionary analysis has considered tree topology as a means to reduce the asymptotic complexity associated with inferring the complex coevolutionary interrelationships that arise between phylogenetic trees. Targeted algorithmic design for specific tree topologies has to date b...
Autores principales: | Drinkwater, Benjamin, Charleston, Michael A. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4875752/ https://www.ncbi.nlm.nih.gov/pubmed/27213010 http://dx.doi.org/10.1186/s13015-016-0077-5 |
Ejemplares similares
-
Introducing TreeCollapse: a novel greedy algorithm to solve the cophylogeny reconstruction problem
por: Drinkwater, Benjamin, et al.
Publicado: (2014) -
Structural properties of the reconciliation space and their applications in enumerating nearly-optimal reconciliations between a gene tree and a species tree
por: Wu, Taoyang, et al.
Publicado: (2011) -
Reconciliation of Gene and Species Trees
por: Rusin, L. Y., et al.
Publicado: (2014) -
On the complexity of non-binary tree reconciliation with endosymbiotic gene transfer
por: Gascon, Mathieu, et al.
Publicado: (2023) -
On the solution of equality constrained quadratic programming problems arising in optimization
por: Gould, N I M, et al.
Publicado: (1998)