Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/329827
Type: Congresso
Title: Parallel Computation For The All-pairs Suffix-prefix Problem
Author: Louza
Felipe A.; Gog
Simon; Zanotto
Leandro; Araujo
Guido; Telles
Guilherme P.
Abstract: 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.
Subject: Suffix-prefix Matching
Parallel Algorithm
Multithreading
Suffix Array
Lcp Array
Editor: Springer Int Publishing AG
Cham
Rights: fechado
Identifier DOI: 10.1007/978-3-319-46049-9_12
Address: https://link.springer.com/chapter/10.1007/978-3-319-46049-9_12
Date Issue: 2016
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000388437200012.pdf11.3 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.