Common subsequence automaton

Authors:
Zdeněk Troníček
Affiliations:
Dept. of Comp. Science and Eng., FEE CTU Prague, Prague 2, Czech Republic
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 5
Cited 0

Searching subsequences

Theoretical Computer Science
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences

Communications of the ACM
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Online Construction of Subsequence Automata for Multiple Texts

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of strings, a common subsequence of this set is a string that is a subsequence of each string in this set. We describe an on-line algorithm building the finite automaton that accepts all common subsequences of the given set of strings.