| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Finding Common Motifs with Gaps Using Finite Automata
Pierre Peterlongo 3
Author IdHAL : pierre-peterlongo ORCID : https://orcid.org/0000-0003-0776-6407
1
DCS - Department of Computer Science (Strand, London WC2R 2LS, England, United Kingdom. Tel +44 (0)20 7836 5454 - United Kingdom)
- King‘s College London (Strand Campus, London WC2R 2LS - United Kingdom)
2
Department of computer science and ingineering (Czech Republic)
3
ligm - Laboratoire d'Informatique Gaspard-Monge (Université de Paris-Est Marne-la-Vallée, Cité Descartes, Bâtiment Copernic, 5 bd Descartes, 77454 Marne-la-Vallée Cedex 2 - France)
- CNRS - Centre National de la Recherche Scientifique : UMR8049 (France)
- Fédération de Recherche Bézout (France)
- ESIEE Paris (2 boulevard Blaise Pascal Cité Descartes BP 99 93162 Noisy-le-Grand Cedex - France)
- ENPC - École des Ponts ParisTech (École des Ponts ParisTech 6-8 avenue Blaise-Pascal Cité Descartes 77455 Champs-sur-Marne Marne-la-Vallée cedex 2 - France)
- UPEM - Université Paris-Est Marne-la-Vallée (5 boulevard Descartes - Champs-sur-Marne - 77454 Marne-la-Vallée Cedex 2 - France)
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 : Wednesday, February 26, 2020 - 7:06:05 PM
Contributor : Pierre Peterlongo <>
Submitted on : Thursday, October 9, 2008 - 5:17:48 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Links full text
Identifiers
- HAL Id : inria-00328124, version 1
- DOI : 10.1007/11812128_8
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⟩
Metrics
Record views