Fast and Simple Computation of All Longest Common Subsequences
Document Type
Technical Report
Publication Date
3-2011
Publication Title
Computer Science Research Repository
Abstract
This paper shows that a simple algorithm produces the all-prefixes-LCSs-graph in O(mn) time for two input sequences of size m and n. Given any prefix p of the first input sequence and any prefix q of the second input sequence, all longest common subsequences (LCSs) of p and q can be generated in time proportional to the output size, once the all-prefixes-LCSs-graph has been constructed. The problem can be solved in the context of generating all the distinct character strings that represent an LCS or in the context of generating all ways of embedding an LCS in the two input strings.
Identifier
arXiv:cs/0211001
Recommended Citation
Ronald I. Greenberg. Fast and simple computation of all longest common subsequences. Technical report, Computer Science Research Repository (http://arXiv.org), 2011. Article ID cs/0211001v2.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
Comments
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.