Directed acyclic subsequence graph: overview

Authors:
Maxime Crochemore;Borivoj Melichar;Zdenek Tronícek
Affiliations:
Institute Gaspard-Monge, University of Marne-la-Vallée, France;Department of Computer Science and Engineering, FEE CTU Prague, Czech Republic;Department of Computer Science and Engineering, FEE CTU Prague, Czech Republic
Venue:
Journal of Discrete Algorithms
Year:
2003

Citing 2
Cited 6

Searching subsequences

Theoretical Computer Science
Fast text searching: allowing errors

Communications of the ACM

Episode directed acyclic subsequence graph

Nordic Journal of Computing
The size of subsequence automaton

Theoretical Computer Science
Fast and compact regular expression matching

Theoretical Computer Science
Longest common subsequence as private search

Proceedings of the 8th ACM workshop on Privacy in the electronic society
On trace inclusion optimization problems

Cybernetics and Systems Analysis
Quadratic-time algorithm for a string constrained LCS problem

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The subsequence matching problem is to decide, for given strings S and T, whether S is a subsequence of T. The string S is called the pattern and the string T the text. We consider the case of multiple texts and show how to solve the subsequence matching problem in time linear in the length of the pattern. For this purpose we build an automaton that accepts all subsequences of given texts. This automaton is called the Directed Acyclic Subsequence Graph (DASG). We prove an upper bound for its number of states. Furthermore, we consider a modification of the subsequence matching problem: given a string S and a finite language L, we are to decide whether S is a subsequence of any string in L. We suppose that a finite automaton accepting L is given and present an algorithm for building the DASG for language L. We also mention applications of the DASG to some problems related to subsequences.