Cargando…
Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm
Supertree methods merge a set of overlapping phylogenetic trees into a supertree containing all taxa of the input trees. The challenge in supertree reconstruction is the way of dealing with conflicting information in the input trees. Many different algorithms for different objective functions have b...
Autores principales: | Fleischauer, Markus, Böcker, Sebastian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5850620/ https://www.ncbi.nlm.nih.gov/pubmed/28873954 http://dx.doi.org/10.1093/molbev/msx191 |
Ejemplares similares
-
BCD Beam Search: considering suboptimal partial solutions in Bad Clade Deletion supertrees
por: Fleischauer, Markus, et al.
Publicado: (2018) -
Polynomial Supertree Methods Revisited
por: Brinkmeyer, Malte, et al.
Publicado: (2011) -
Robinson-Foulds Supertrees
por: Bansal, Mukul S, et al.
Publicado: (2010) -
The Supertree Tool Kit
por: Davis, Katie E, et al.
Publicado: (2010) -
FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization
por: Vachaspati, Pranjal, et al.
Publicado: (2017)