Finding Common Motifs with Gaps using Finite Automata

P. Antoniou J. Holub C. S. Iliopoulos B. Melichar P. Peterlongo 1
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
Document type :
Conference papers
Complete list of metadatas
https://hal-upec-upem.archives-ouvertes.fr/hal-00619849
Contributor : Pierre Peterlongo <>
Submitted on : Tuesday, September 6, 2011 - 9:38:44 PM
Last modification on : Wednesday, April 11, 2018 - 12:12:02 PM

Identifiers

  • HAL Id : hal-00619849, version 1

Collections

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

Citation

P. Antoniou, J. Holub, C. S. Iliopoulos, B. Melichar, P. Peterlongo. Finding Common Motifs with Gaps using Finite Automata. 11th International Conference on Implementation and Application of Automata (CIAA'06), Aug 2006, Taipei, Taiwan, Taiwan. pp.69-77. ⟨hal-00619849⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

192

Contact

Informations

CCSD