Melichar, Bořivoj and Polcar, Tomáš (2003) The longest common subsequence problem a finite automata approach. In, Ibarra, Oscar H. and Dang, Zhe (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2759) Springer, pp. 294-296. (doi:10.1007/3-540-45089-0_27).
Abstract
A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in φ (|A|(|S1| + |S2| + Σa∈A|S1|a|S2|S 2|a)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and |Si|a is the number of occurrences of a ∈ A in Si.
This record has no associated files available for download.
More information
Identifiers
Catalogue record
Export record
Altmetrics
Contributors
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.