| dc.creator | Louza | |
| dc.creator | Felipe A.; Gog | |
| dc.creator | Simon; Zanotto | |
| dc.creator | Leandro; Araujo | |
| dc.creator | Guido; Telles | |
| dc.creator | Guilherme P. | |
| dc.date | 2016 | |
| dc.date | 2017-11-13T13:56:11Z | |
| dc.date | 2017-11-13T13:56:11Z | |
| dc.date.accessioned | 2018-03-29T06:09:39Z | |
| dc.date.available | 2018-03-29T06:09:39Z | |
| dc.identifier | 978-3-319-46049-9; 978-3-319-46048-2 | |
| dc.identifier | String Processing And Information Retrieval, Spire 2016 . Springer Int Publishing Ag, v. 9954, p. 122 - 132, 2016. | |
| dc.identifier | 0302-9743 | |
| dc.identifier | WOS:000388437200012 | |
| dc.identifier | 10.1007/978-3-319-46049-9_12 | |
| dc.identifier | https://link.springer.com/chapter/10.1007/978-3-319-46049-9_12 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/329827 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1366852 | |
| dc.description | 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. | |
| dc.description | 9954 | |
| dc.description | 122 | |
| dc.description | 132 | |
| dc.description | 23rd International Symposium on String Processing and Information Retrieval (SPIRE) | |
| dc.description | OCT 18-20, 2016 | |
| dc.description | Beppu, JAPAN | |
| dc.language | English | |
| dc.publisher | Springer Int Publishing AG | |
| dc.publisher | Cham | |
| dc.relation | String Processing and Information retrieval, Spire 2016 | |
| dc.rights | fechado | |
| dc.source | WOS | |
| dc.subject | Suffix-prefix Matching | |
| dc.subject | Parallel Algorithm | |
| dc.subject | Multithreading | |
| dc.subject | Suffix Array | |
| dc.subject | Lcp Array | |
| dc.title | Parallel Computation For The All-pairs Suffix-prefix Problem | |
| dc.type | Actas de congresos | |
