Parameterized Complexity and Biopolymer Sequence Comparison

The article 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.

• Type: Journal
• Year: 2008
• Where: CJ
• Authors: Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A. Rosamond, Yinglei Song
• Keywords: CJ 2008, Longest Common Subsequence, Multiple Sequencing Alignment, Shortest Common Supersequence