Cargando…
Treewidth-based algorithms for the small parsimony problem on networks
BACKGROUND: Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms is modeled by the Small Parsimony problem: given a tree T and an assignment of character-states to its leaves, assign states to the internal...
Autores principales: | Scornavacca, Celine, Weller, Mathias |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9392953/ https://www.ncbi.nlm.nih.gov/pubmed/35987645 http://dx.doi.org/10.1186/s13015-022-00216-w |
Ejemplares similares
-
On the Treewidths of Graphs of Bounded Degree
por: Song, Yinglei, et al.
Publicado: (2015) -
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics
por: Marchand, Bertrand, et al.
Publicado: (2022) -
Benchmarking treewidth as a practical component of tensor network simulations
por: Dumitrescu, Eugene F., et al.
Publicado: (2018) -
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
por: Slivovsky, Friedrich, et al.
Publicado: (2020) -
Counting Linear Extensions: Parameterizations by Treewidth
por: Eiben, E., et al.
Publicado: (2018)