Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics
Abstract 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 fo...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
BMC
2022-04-01
|
| Серія: | Algorithms for Molecular Biology |
| Предмети: | |
| Онлайн доступ: | https://doi.org/10.1186/s13015-022-00213-z |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|