Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array

Pierre Peterlongo 1 Nadia Pisanti 2 Frederique Boyer 3, 4 Marie-France Sagot 3, 5
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 Department of Computer Science [Pisa]
3 HELIX - Computer science and genomics
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
4 LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
5 Baobab
PEGASE - Département PEGASE [LBBE]
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/inria-00328129
Contributor : Pierre Peterlongo <>
Submitted on : Thursday, October 9, 2008 - 5:26:52 PM
Last modification on : Thursday, November 21, 2019 - 1:14:13 PM

Identifiers

Collections

CNRS | INRIA | UNIV-MLV | LIGM_ALGO | LIGM | ENPC | PARISTECH | UPEC-UPEM | BIOENVIS | UNIV-LYON1 | UDL

Citation

Pierre Peterlongo, Nadia Pisanti, Frederique Boyer, Marie-France Sagot. Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array. String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Nov 2005, Buenos Aires, Argentina. pp.179-190, ⟨10.1007/11575832⟩. ⟨inria-00328129⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

423

 

 

Contact

archive-ouverte@inria.fr