Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array.
Pierre Peterlongo|Nadia Pisanti|Frédéric Boyer|Marie-France Sagot
| Anthology ID: | DBLP:conf/spire/PeterlongoPBS05 |
|---|---|
| Volume: | String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings |
| Year: | 2005 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 179-190 |
| URL: | https://doi.org/10.1007/11575832_20 |
| DOI: | https://doi.org/10.1007/11575832_20 |
| DBLP: | conf/spire/PeterlongoPBS05 |
| BibTeX: |
@inproceedings{peterlongo-2005-lossless,
author = {Pierre Peterlongo and
Nadia Pisanti and
Fr\'{e}d\'{e}ric Boyer and
Marie-France Sagot},
editor = {Mariano P. Consens and
Gonzalo Navarro},
title = {{Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array}},
booktitle = {{String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {3772},
pages = {179--190},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11575832_20},
doi = {https://doi.org/10.1007/11575832_20}
}