Parallel Lookups in String Indexes

Anders Roy Christiansen; Martín  Farach-Colton

doi:10.1007/978-3-319-46049-9_6

Parallel Lookups in String Indexes

Anders Roy Christiansen, Martín Farach-Colton

Department of Applied Mathematics and Computer Science

Rutgers University

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-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 language	English
Title of host publication	Proceedings of the 23rd International Symposium on String Processing and Information Retrieval (SPIRE 2016)
Publisher	Springer
Publication date	2016
Pages	61-67
ISBN (Print)	978-3-319-46048-2
ISBN (Electronic)	978-3-319-46049-9
DOIs	https://doi.org/10.1007/978-3-319-46049-9_6
Publication status	Published - 2016
Event	23rd International Symposium on String Processing and Information Retrieval - Beppu, Japan Duration: 18 Oct 2016 → 20 Oct 2016 Conference number: 23 https://sites.google.com/site/spire2016jp/

Conference

Conference	23rd International Symposium on String Processing and Information Retrieval
Number	23
Country/Territory	Japan
City	Beppu
Period	18/10/2016 → 20/10/2016
Internet address	https://sites.google.com/site/spire2016jp/

Series	Lecture Notes in Computer Science
Volume	9954
ISSN	0302-9743

Keywords

Parallel
Pattern Matching
Suffix trees
PRAM

Access to Document

10.1007/978-3-319-46049-9_6

OpenUrl availability

Full text

Cite this

@inproceedings{db2e3c43711f4381b7693fbf81fa8f77,

title = "Parallel Lookups in String Indexes",

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

keywords = "Parallel, Pattern Matching, Suffix trees, PRAM",

author = "Christiansen, {Anders Roy} and Mart{\'i}n Farach-Colton",

year = "2016",

doi = "10.1007/978-3-319-46049-9_6",

language = "English",

isbn = "978-3-319-46048-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "61--67",

booktitle = "Proceedings of the 23rd International Symposium on String Processing and Information Retrieval (SPIRE 2016)",

note = "23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016 ; Conference date: 18-10-2016 Through 20-10-2016",

url = "https://sites.google.com/site/spire2016jp/",

}

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

Parallel Lookups in String Indexes. / Christiansen, Anders Roy; Farach-Colton, Martín .
Proceedings of the 23rd International Symposium on String Processing and Information Retrieval (SPIRE 2016). Springer, 2016. p. 61-67 (Lecture Notes in Computer Science, Vol. 9954).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Parallel Lookups in String Indexes

AU - Christiansen, Anders Roy

AU - Farach-Colton, Martín

N1 - Conference code: 23

PY - 2016

Y1 - 2016

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

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

KW - Parallel

KW - Pattern Matching

KW - Suffix trees

KW - PRAM

U2 - 10.1007/978-3-319-46049-9_6

DO - 10.1007/978-3-319-46049-9_6

M3 - Article in proceedings

SN - 978-3-319-46048-2

T3 - Lecture Notes in Computer Science

SP - 61

EP - 67

BT - Proceedings of the 23rd International Symposium on String Processing and Information Retrieval (SPIRE 2016)

PB - Springer

T2 - 23rd International Symposium on String Processing and Information Retrieval

Y2 - 18 October 2016 through 20 October 2016

ER -

Parallel Lookups in String Indexes

Abstract

Conference

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this