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:18Z</responseDate>
<request identifier=oai:HAL:inria-00257561v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:inria-00257561v1</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>Finding Frequent Subsequences in a Set of Texts</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-00257561</identifier>
<identifier>https://hal.inria.fr/inria-00257561</identifier>
<identifier>https://hal.inria.fr/inria-00257561/document</identifier>
<identifier>https://hal.inria.fr/inria-00257561/file/CSAq.pdf</identifier>
<source>https://hal.inria.fr/inria-00257561</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>Quorum</subject>
<subject lang=fr>Text Algorithm</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>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.</description>
<date>2007</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>
