Parallel Lookups in String Indexes

Anders Roy Christiansen, Martín Farach-Colton

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

Recently, the first PRAM algorithms were presented for looking up a pattern in a suffix tree. We improve the bounds, achieving optimal results.
Original languageEnglish
Title of host publicationProceedings of the 23rd International Symposium on String Processing and Information Retrieval (SPIRE 2016)
PublisherSpringer
Publication date2016
Pages61-67
ISBN (Print)978-3-319-46048-2
ISBN (Electronic)978-3-319-46049-9
DOIs
Publication statusPublished - 2016
Event23rd International Symposium on String Processing and Information Retrieval (SPIRE 2016) - Beppu, Japan
Duration: 18 Oct 201620 Oct 2016
Conference number: 23
https://sites.google.com/site/spire2016jp/

Conference

Conference23rd International Symposium on String Processing and Information Retrieval (SPIRE 2016)
Number23
CountryJapan
CityBeppu
Period18/10/201620/10/2016
Internet address
SeriesLecture Notes in Computer Science
Volume9954
ISSN0302-9743

Keywords

  • Parallel
  • Pattern Matching
  • Suffix trees
  • PRAM

Cite this

Christiansen, A. R., & Farach-Colton, M. (2016). Parallel Lookups in String Indexes. In Proceedings of the 23rd International Symposium on String Processing and Information Retrieval (SPIRE 2016) (pp. 61-67). Springer. Lecture Notes in Computer Science, Vol.. 9954 https://doi.org/10.1007/978-3-319-46049-9_6