Finding Frequent Subsequences in a Set of Texts - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2007

Finding Frequent Subsequences in a Set of Texts

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : inria-00257561 , version 1

Citer

Alban Mancheron, Jean-Émile Symphor. Finding Frequent Subsequences in a Set of Texts. [Research Report] 2007, pp.13. ⟨inria-00257561⟩
176 Consultations
158 Téléchargements

Partager

Gmail Facebook X LinkedIn More