Finding Frequent Subsequences in a Set of Texts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Finding Frequent Subsequences in a Set of Texts


Given a set of strings, the Common Subsequence Automaton accepts all common subsequences of these strings. Such an automaton can be deduced from other automata like the Directed Acyclic Subsequence Graph or the Subsequence Automaton. In this paper, we introduce some new issues in text algorithm on the basis of Common Subsequences related problems. Firstly, we make an overview of different existing automata, focusing on their similarities and differences. Secondly, we present a new automaton, the Constrained Subsequence Automaton, which extends the Common Subsequence Automaton, by adding an integer $q$ denoted quorum.
Fichier principal
Vignette du fichier
CSAq.pdf (240.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00257561 , version 1 (19-02-2008)


  • HAL Id : inria-00257561 , version 1


Alban Mancheron, Jean-Émile Symphor. Finding Frequent Subsequences in a Set of Texts. [Research Report] 2007, pp.13. ⟨inria-00257561⟩
172 View
153 Download


Gmail Facebook Twitter LinkedIn More