Conference Proceedings

Parallel lookups in string indexes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9954 LNCS 61-67
DOI: 10.1007/978-3-319-46049-9_6
1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, the first PRAM algorithms were presented for looking up a pattern in a suffix tree. We improve the bounds, achieving optimal results.

Author supplied keywords

Cite

CITATION STYLE

APA

Christiansen, A. R., & Farach-Colton, M. (2016). Parallel lookups in string indexes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9954 LNCS, pp. 61–67). Springer Verlag. https://doi.org/10.1007/978-3-319-46049-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free