untitled
<OAI-PMH schemaLocation=http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd>
<responseDate>2018-01-15T15:43:17Z</responseDate>
<request identifier=oai:HAL:inria-00257567v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:inria-00257567v1</identifier>
<datestamp>2018-01-11</datestamp>
<setSpec>type:REPORT</setSpec>
<setSpec>subject:info</setSpec>
<setSpec>collection:CNRS</setSpec>
<setSpec>collection:INRIA</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
<setSpec>collection:BNRMI</setSpec>
<setSpec>collection:UNIV-LILLE3</setSpec>
<setSpec>collection:INRIA-LILLE</setSpec>
<setSpec>collection:INRIA_TEST</setSpec>
<setSpec>collection:LARA</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=en>On-line & Incremental Update Properties of the Subsequence Automaton</title>
<creator>Mancheron, Alban</creator>
<creator>Symphor, Jean-Émile</creator>
<contributor>Sequential Learning (SEQUOIA) ; Laboratoire d'Informatique Fondamentale de Lille (LIFL) ; Université de Lille, Sciences et Technologies - Institut National de Recherche en Informatique et en Automatique (Inria) - Université de Lille, Sciences Humaines et Sociales - Centre National de la Recherche Scientifique (CNRS) - Université de Lille, Sciences et Technologies - Institut National de Recherche en Informatique et en Automatique (Inria) - Université de Lille, Sciences Humaines et Sociales - Centre National de la Recherche Scientifique (CNRS) - Inria Lille - Nord Europe ; Institut National de Recherche en Informatique et en Automatique (Inria)</contributor>
<contributor>Groupe de Recherche en Informatique et Mathématiques Appliquées Antilles-Guyane (GRIMAAG) ; Université des Antilles et de la Guyane (UAG)</contributor>
<identifier>inria-00257567</identifier>
<identifier>https://hal.inria.fr/inria-00257567</identifier>
<identifier>https://hal.inria.fr/inria-00257567/document</identifier>
<identifier>https://hal.inria.fr/inria-00257567/file/iSA.pdf</identifier>
<source>https://hal.inria.fr/inria-00257567</source>
<source>[Research Report] 2007, pp.13</source>
<language>en</language>
<subject lang=fr>Common Subsequence</subject>
<subject lang=fr>Automata</subject>
<subject lang=fr>Properties</subject>
<subject lang=fr>Incremental Update</subject>
<subject lang=fr>On-line Construction</subject>
<subject>[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]</subject>
<type>info:eu-repo/semantics/report</type>
<type>Reports</type>
<description lang=en>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.</description>
<date>2007</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>