The Longest Common Subsequence Problem

Algorithms on sequences of symbols have been studied for a long time and now form a fundamental part of computer science. One of the very important problems in analysis of sequences is the longest common subsequence problem. For the general case of an arbitrary number of input sequences, the problem is NP-hard. We describe an approach to solve this problem. This approach is based on constructing a logical model for the longest common subsequence problem.

[1]  D Sankoff,et al.  Matching sequences under deletion-insertion constraints. , 1972, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[3]  Daniel S. Hirschberg,et al.  The longest common subsequence problem. , 1975 .

[4]  Daniel S. Hirschberg,et al.  Complexity of Common Subsequence Problems , 1977, FCT.

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

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

[7]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[8]  P. Pevzner.  Multiple alignment, communication cost, and graph matching , 1992 .

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

[10]  Pavel A. Pevzner.  Multiple Alignment with Guaranteed Error Bounds and Communication Cost , 1992, CPM.

[11]  Fred R. McMorris,et al.  Discovering Consensus Molecular Sequences , 1993 .

[12]  Fred R. McMorris,et al.  The computation of consensus patterns in DNA sequences , 1993 .

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

[14]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[15]  On equational theories of varieties of anticommutative rings , 1999 .

[16]  Decidability boundaries for some classes of nilpotent and solvable groups , 2000 .

[17]  A Ring Variety without an Independent Basis , 2001 .

[18]  V. Y. Popov.  The approximate period problem for DNA alphabet , 2003, Theor. Comput. Sci..

[19]  The property of having independent basis in semigroup varieties , 2005 .

[20]  V. Popov.  Computational complexity of problems related to DNA sequencing by hybridization , 2005 .

[21]  The Word Problem for Relatively Free Semigroups , 2006 .

[22]  V. Y. Popov,et al.  Multiple genome rearrangement by swaps and by element duplications , 2007, Theor. Comput. Sci..

[23]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[24]  Vladimir Yu . Popov,et al.  The Approximate Period Problem , 2009 .

[25]  Vladimir Yu . Popov.  Sorting by Prefix Reversals , 2010 .

[26]  Anna Gorbenko,et al.  Programming for Modular Reconfigurable Robots , 2011 .

[27]  Anna Gorbenko,et al.  The problem of placement of visual landmarks , 2011 .

[28]  A. Gorbenko,et al.  Planning a Typical Working Day for Indoor Service Robots , 2011 .

[29]  Andrey Sheka,et al.  Robot self-awareness: Temporal relation based data mining , 2011 .

[30]  A. Gorbenko,et al.  Algebras of Stepping Motor Programs , 2011 .

[31]  A. Gorbenko,et al.  The longest common parameterized subsequence problem , 2012 .

[32]  Anna Gorbenko,et al.  A Real-World Experiments Setup for Investigations of the Problem of Visual Landmarks Selection for Mobile Robots , 2012 .

[33]  Anna Gorbenko,et al.  Computational Experiments for the Problem of Selection of a Minimal Set of Visual Landmarks , 2012 .

[34]  Anna Gorbenko,et al.  On the Optimal Reconfiguration Planning for Modular Self-Reconfigurable DNA Nanomechanical Robots , 2012 .

[35]  Anna Gorbenko,et al.  The Problem of Sensor Placement , 2012 .

[36]  Anna Gorbenko,et al.  The Binary Paint Shop Problem , 2012 .

[37]  Anna Gorbenko,et al.  Robot Self-Awareness: Occam's Razor for Fluents , 2012 .

[38]  Anna Gorbenko,et al.  Element Duplication Centre Problem and Railroad Tracks Recognition , 2012 .

[39]  Vladimir Yu. Popov,et al.  The set of parameterized k-covers problem , 2012, Theor. Comput. Sci..

[40]  Andrey Sheka,et al.  Localization on Discrete Grid Graphs , 2012 .

[41]  Andrey Sheka,et al.  Robot Self-Awareness: Exploration of Internal States , 2012 .