Parameterized Complexity and Biopolymer Sequence Comparison

Abstract

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.

Topics

    24 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)