Parameterized Complexity and Biopolymer Sequence Comparison

by: Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances Rosamond, Yinglei Song

The Computer Journal, Vol. 51, No. 3. (27 June 2007), bxm035.

View FullText article

DOI, HighWire

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

AbnerCYH

Find related articles with these CiteULike tags

biology, complexity, parameterized

Abstract

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. 10.1093/comjnl/bxm035

@article{citeulike:1895357, abstract = {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. 10.1093/comjnl/bxm035}, author = {Cai, Liming and Huang, Xiuzhen and Liu, Chunmei and Rosamond, Frances and Song, Yinglei }, citeulike-article-id = {1895357}, doi = {10.1093/comjnl/bxm035}, journal = {The Computer Journal}, keywords = {biology, complexity, parameterized}, month = {June}, number = {3}, pages = {bxm035+}, posted-at = {2007-11-10 18:58:22}, priority = {2}, title = {Parameterized Complexity and Biopolymer Sequence Comparison}, url = {http://dx.doi.org/10.1093/comjnl/bxm035}, volume = {51}, year = {2007} }

RIS record

TY - JOUR ID - citeulike:1895357 L3 - citeulike-article-id:1895357 TI - Parameterized Complexity and Biopolymer Sequence Comparison JF - The Computer Journal VL - 51 IS - 3 SP - bxm035 N2 - 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. 10.1093/comjnl/bxm035 KW - biology KW - complexity KW - parameterized AU - Cai, Liming AU - Huang, Xiuzhen AU - Liu, Chunmei AU - Rosamond, Frances AU - Song, Yinglei PY - 2007/06/27/ UR - http://dx.doi.org/10.1093/comjnl/bxm035 ER -

RIS BibTeX