Finding Common Motifs with Gaps Using Finite Automata

Pavlos Antoniou 1 Jan Holub 2 Costas Iliopoulos 1 Borijov Melichar 2 Pierre Peterlongo 3
1 DCS - Department of Computer Science
2 Department of computer science and ingineering
3 LIGM - Laboratoire d'Informatique Gaspard-Monge
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/inria-00328124
Contributor : Pierre Peterlongo <>
Submitted on : Thursday, October 9, 2008 - 5:17:48 PM
Last modification on : Tuesday, January 29, 2019 - 10:02:08 PM

Links full text

istex

Identifiers

Collections

LIGM | LIGM_ALGO | UNIV-MLV | ENPC | PARISTECH | UPEC-UPEM | CNRS

Citation

Pavlos Antoniou, Jan Holub, Costas Iliopoulos, Borijov Melichar, Pierre Peterlongo. Finding Common Motifs with Gaps Using Finite Automata. Implementation and Application of Automata, Aug 2006, Taipei, Taiwan. pp.69-77, ⟨10.1007/11812128_8⟩. ⟨inria-00328124⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

120

Contact


archive-ouverte@inria.fr