Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics

Hard graph problems are ubiquitous in Bioinformatics, inspiring the design of specialized Fixed-Parameter Tractable algorithms, many of which rely on a combination of tree-decomposition and dynamic programming. The time/space complexities of such approaches hinge critically on low values for the tre...

Descripción completa

Detalles Bibliográficos
Autores principales: Marchand, Bertrand, Ponty, Yann, Bulteau, Laurent
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2022
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8976393/
https://www.ncbi.nlm.nih.gov/pubmed/35366923
http://dx.doi.org/10.1186/s13015-022-00213-z

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8976393/
https://www.ncbi.nlm.nih.gov/pubmed/35366923
http://dx.doi.org/10.1186/s13015-022-00213-z

Ejemplares similares