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 pattern and the string T text. We consider the case of multiple texts and show how to solve the subsequence matching problem in time linear in the length of pattern. For this purpose we build the automaton that accepts all subsequences of given texts. The automaton is called Directed Acyclic Subsequence Graph (DASG) and we present an algorithm for its building. We also prove upper bound for its number of states. Further, we consider 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 the language L. We also mention applications of DASG to some problems related to subsequences. R'esum'e Le probl`eme de recherche de sous-s'equence consist...

Citations