Skip to main content
Journal ArticleOPEN ACCESS

Suffix Arrays in Parallel

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2790 338-341
DOI: 10.1007/978-3-540-45209-6_50
2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Suffix arrays are powerful data structures for text indexing. In this paper we present parallel algorithms devised to increase throughput of suffix arrays on a multiple-query setting. Experimental results show that efficient performance is indeed feasible in this strongly sequential and very poor locality data structure. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Marín, M., & Navarro, G. (2004). Suffix Arrays in Parallel. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 338–341. https://doi.org/10.1007/978-3-540-45209-6_50

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