Please use this identifier to cite or link to this item:
|Title:||Parallel Computation For The All-pairs Suffix-prefix Problem|
Felipe A.; Gog
|Abstract:||We show how to parallelize the optimal algorithm proposed by Tustumi et al.  to solve the all-pairs suffix-prefix matching problem for general alphabets. We compared our parallel algorithm with SOF , 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.|
|Editor:||Springer Int Publishing AG|
|Citation:||String Processing And Information Retrieval, Spire 2016 . Springer Int Publishing Ag, v. 9954, p. 122 - 132, 2016.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.