Minimum Common String Partition Parameterized
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
The paper surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest common supersequence, pairwise sequence alignment, multiple sequencing alignment, structure–sequence alignment and structure–structure alignment. Algorithm techniques, built on the structural-unit level as well as on the residue level, are discussed.