dc.creatorLouza
dc.creatorFelipe A.; Gog
dc.creatorSimon; Zanotto
dc.creatorLeandro; Araujo
dc.creatorGuido; Telles
dc.creatorGuilherme P.
dc.date2016
dc.date2017-11-13T13:56:11Z
dc.date2017-11-13T13:56:11Z
dc.date.accessioned2018-03-29T06:09:39Z
dc.date.available2018-03-29T06:09:39Z
dc.identifier978-3-319-46049-9; 978-3-319-46048-2
dc.identifierString Processing And Information Retrieval, Spire 2016 . Springer Int Publishing Ag, v. 9954, p. 122 - 132, 2016.
dc.identifier0302-9743
dc.identifierWOS:000388437200012
dc.identifier10.1007/978-3-319-46049-9_12
dc.identifierhttps://link.springer.com/chapter/10.1007/978-3-319-46049-9_12
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/329827
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1366852
dc.descriptionWe 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.
dc.description9954
dc.description122
dc.description132
dc.description23rd International Symposium on String Processing and Information Retrieval (SPIRE)
dc.descriptionOCT 18-20, 2016
dc.descriptionBeppu, JAPAN
dc.languageEnglish
dc.publisherSpringer Int Publishing AG
dc.publisherCham
dc.relationString Processing and Information retrieval, Spire 2016
dc.rightsfechado
dc.sourceWOS
dc.subjectSuffix-prefix Matching
dc.subjectParallel Algorithm
dc.subjectMultithreading
dc.subjectSuffix Array
dc.subjectLcp Array
dc.titleParallel Computation For The All-pairs Suffix-prefix Problem
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución