Exact Algorithms for the Longest Common Subsequence Problem for Arc-Annotated Sequences

[1]  M V Olson,et al.  A Time to Sequence , 1995, Science.

[2]  Zhi-Zhong Chen,et al.  The longest common subsequence problem for sequences with nested arc annotations , 2002, J. Comput. Syst. Sci..

[3]  Michael R. Fellows,et al.  Parameterized Complexity: The Main Ideas and Some Research Frontiers , 2009, ISAAC.

[4]  Paola Bonizzoni,et al.  Experimenting an approximation algorithm for the LCS , 2001, Discret. Appl. Math..

[5]  Robert D. Carr,et al.  101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem , 2001, RECOMB.

[6]  Rolf Niedermeier,et al.  Faster exact algorithms for hard problems: A parameterized point of view , 2001, Discret. Math..

[7]  Bin Ma,et al.  The Longest Common Subsequence Problem for Arc-Annotated Sequences , 2000, CPM.

[8]  Bin Ma,et al.  Near optimal multiple alignment within a band in polynomial time , 2000, STOC '00.

[9]  Christos H. Papadimitriou,et al.  Algorithmic aspects of protein structure similarity , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[10]  Patricia A. Evans.  Finding Common Subsequences with Arcs and Pseudoknots , 1999, CPM.

[11]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.

[12]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[13]  Joseph B. Kruskal,et al.  Time Warps, String Edits, and Macromolecules , 1999 .

[14]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[15]  R. Ravi,et al.  Computing Similarity between RNA Strings , 1996, CPM.

[16]  Michael R. Fellows,et al.  The Parameterized Complexity of Sequence Alignment and Consensus , 1994, CPM.

[17]  Michael R. Fellows,et al.  Parameterized complexity analysis in computational biology , 1995, Comput. Appl. Biosci..

[18]  Florence Corpet,et al.  RNAlign program: alignment of RNA sequences using both primary and secondary structures , 1994, Comput. Appl. Biosci..

[19]  Robert W. Irving,et al.  Two Algorithms for the Longest Common Subsequence of Three (or More) Strings , 1992, CPM.

[20]  Ricardo A. Baeza-Yates,et al.  Searching Subsequences , 1991, Theor. Comput. Sci..

[21]  King-Sun Fu,et al.  A Sentence-to-Sentence Clustering Procedure for Pattern Analysis , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[22]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.