Cargando…
Finding a most parsimonious or likely tree in a network with respect to an alignment
Phylogenetic networks are often constructed by merging multiple conflicting phylogenetic signals into a directed acyclic graph. It is interesting to explore whether a network constructed in this way induces biologically-relevant phylogenetic signals that were not present in the input. Here we show t...
Autores principales: | Kelk, Steven, Pardi, Fabio, Scornavacca, Celine, van Iersel, Leo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6437133/ https://www.ncbi.nlm.nih.gov/pubmed/30121824 http://dx.doi.org/10.1007/s00285-018-1282-2 |
Ejemplares similares
-
Joint amalgamation of most parsimonious reconciled gene trees
por: Scornavacca, Celine, et al.
Publicado: (2015) -
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees
por: Iersel, Leo van, et al.
Publicado: (2014) -
Rearrangement moves on rooted phylogenetic networks
por: Gambette, Philippe, et al.
Publicado: (2017) -
Treewidth-based algorithms for the small parsimony problem on networks
por: Scornavacca, Celine, et al.
Publicado: (2022) -
Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable
por: Pardi, Fabio, et al.
Publicado: (2015)