Actas de congresos
Parallel Computation For The All-pairs Suffix-prefix Problem
Registro en:
978-3-319-46049-9; 978-3-319-46048-2
String Processing And Information Retrieval, Spire 2016 . Springer Int Publishing Ag, v. 9954, p. 122 - 132, 2016.
0302-9743
WOS:000388437200012
10.1007/978-3-319-46049-9_12
Autor
Louza
Felipe A.; Gog
Simon; Zanotto
Leandro; Araujo
Guido; Telles
Guilherme P.
Institución
Resumen
We show how to parallelize the optimal algorithm proposed by Tustumi et al. [19] to solve the all-pairs suffix-prefix matching problem for general alphabets. We compared our parallel algorithm with SOF [17], a practical solution for DNA sequences that exhibits good time and space performance in multithreading environments. The experimental results showed that our parallel algorithm achieves a consistent speedup when compared with the sequential algorithm, and it is competitive with SOF when the minimum overlap length is small. 9954 122 132 23rd International Symposium on String Processing and Information Retrieval (SPIRE) OCT 18-20, 2016 Beppu, JAPAN