Parameterized Complexity and Biopolymer Sequence Comparison
2008
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.
Keywords:
- Theoretical computer science
- Structural alignment
- Multiple sequence alignment
- Longest common subsequence problem
- Pairwise comparison
- Sequence analysis
- Sequence alignment
- Alignment-free sequence analysis
- Parameterized complexity
- Computer science
- Bioinformatics
- sequence comparison
- Shortest common supersequence
- pairwise sequence alignment
- parameterized algorithms
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
82
References
9
Citations
NaN
KQI