Skip to Main content Skip to Navigation
New interface
Reports (Research report)

On-line & Incremental Update Properties of the Subsequence Automaton

Alban Mancheron 1, * Jean-Émile Symphor 2 
* Corresponding author
1 SEQUOIA - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : Many works deal with the subsequence matching problem using automata structures. It is to decide, given two sequences $s$ and $t$, whether $s$ is a subsequence of $t$. Automata like the Directed Acyclic Subsequence Graph (DASG) or the Subsequence Automaton (SA) accept all subsequences of a set of texts. We focus on this last structure and provide some useful results upon dynamically updates of the SA. Indeed, sequences are indexed as soon as they are processed, allowing to dynamically add or to remove sequences from the set of indexed texts. Moreover, the highlight of these properties also makes it possible to update this automaton whenever a sequence of the set is modified.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Alban Mancheron Connect in order to contact the contributor
Submitted on : Tuesday, February 19, 2008 - 4:56:42 PM
Last modification on : Thursday, October 27, 2022 - 4:02:36 AM
Long-term archiving on: : Thursday, May 20, 2010 - 10:51:21 PM


Files produced by the author(s)


  • HAL Id : inria-00257567, version 1


Alban Mancheron, Jean-Émile Symphor. On-line & Incremental Update Properties of the Subsequence Automaton. [Research Report] 2007, pp.13. ⟨inria-00257567⟩



Record views


Files downloads