Finding Frequent Subsequences in a Set of Texts

Alban Mancheron 1, * Jean-Émile Symphor 2
* Auteur correspondant
1 SEQUOIA - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : 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.
Type de document :
[Research Report] 2007, pp.13
Liste complète des métadonnées
Contributeur : Alban Mancheron <>
Soumis le : mardi 19 février 2008 - 16:25:59
Dernière modification le : vendredi 16 septembre 2016 - 15:07:04
Document(s) archivé(s) le : jeudi 20 mai 2010 - 22:50:38


Fichiers produits par l'(les) auteur(s)


  • 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>



Consultations de
la notice


Téléchargements du document