Answers are grounded in this paper and cite their sources.
Bioinformatics regularly poses new challenges to algorithm engineers and theoretical computer scientists. This work surveys recent developments of parameterized algorithms and complexity for important NP-hard problems in bioinformatics. We cover sequence assembly and analysis, genome comparison and completion, and haplotyping and phylogenetics. Aside from reporting the state of the art, we give challenges and open problems for each topic.
No takes yet. Share an insight, caveat, or question.
Bulteau et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: