Parallel Computation for the All-Pairs Suffix-Prefix Problem.
Felipe A. Louza|Simon Gog|Leandro Zanotto|Guido Araujo|Guilherme P. Telles
| Anthology ID: | DBLP:conf/spire/LouzaGZAT16 |
|---|---|
| Volume: | String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings |
| Year: | 2016 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Pages: | 122-132 |
| URL: | https://doi.org/10.1007/978-3-319-46049-9_12 |
| DOI: | https://doi.org/10.1007/978-3-319-46049-9_12 |
| DBLP: | conf/spire/LouzaGZAT16 |
| BibTeX: |
@inproceedings{louza-2016-parallel,
author = {Felipe A. Louza and
Simon Gog and
Leandro Zanotto and
Guido Araujo and
Guilherme P. Telles},
editor = {Shunsuke Inenaga and
Kunihiko Sadakane and
Tetsuya Sakai},
title = {{Parallel Computation for the All-Pairs Suffix-Prefix Problem}},
booktitle = {{String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {9954},
pages = {122--132},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-46049-9_12},
doi = {https://doi.org/10.1007/978-3-319-46049-9_12}
}