Parameterized complexity and biopolymer sequence comparison | NOVA. The University of Newcastle's Digital Repository

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/43368

Title: Parameterized complexity and biopolymer sequence comparison
Author/Creator: Cai, Liming; Huang, Xiuzhen; Liu, Chunmei; Rosamond, Frances; Song, Yinglei
Institution: The University of Newcastle. Research Division, Office of the Deputy Vice-Chancellor (Research)
Description: 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.
Relation: Computer Journal Vol. 51, Issue 3, p. 270-291
Publisher Link: http://dx.doi.org/10.1093/comjnl/bxm035
Date: 2008
Publisher: Oxford University Press
Keyword(s): parameterized complexity; parameterized algorithms; pairwise sequence alignment; multiple sequence alignment; sequence-structure alignment; structure-structure alignment; tree width; tree decomposition
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/43368
Identifier: ISSN:0010-4620

19 Visitors

21 Hits

NOVA. The University of Newcastle's Digital Repository