Cargando…
Collecting reliable clades using the Greedy Strict Consensus Merger
Supertree methods combine a set of phylogenetic trees into a single supertree. Similar to supermatrix methods, these methods provide a way to reconstruct larger parts of the Tree of Life, potentially evading the computational complexity of phylogenetic inference methods such as maximum likelihood. T...
Autores principales: | Fleischauer, Markus, Böcker, Sebastian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4928488/ https://www.ncbi.nlm.nih.gov/pubmed/27375971 http://dx.doi.org/10.7717/peerj.2172 |
Ejemplares similares
-
BCD Beam Search: considering suboptimal partial solutions in Bad Clade Deletion supertrees
por: Fleischauer, Markus, et al.
Publicado: (2018) -
Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm
por: Fleischauer, Markus, et al.
Publicado: (2017) -
Visualizing incompatibilities in phylogenetic trees using consensus outlines
por: Huson, Daniel H., et al.
Publicado: (2023) -
A new phylogenetic data standard for computable clade definitions: the Phyloreference Exchange Format (Phyx)
por: Vaidya, Gaurav, et al.
Publicado: (2022) -
consensusDE: an R package for assessing consensus of multiple RNA-seq algorithms with RUV correction
por: Waardenberg, Ashley J., et al.
Publicado: (2019)