Parallel lookups in string indexes

Anders Roy Christiansen, Martín Farach-Colton

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 (US)
    Title of host publicationString Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings
    EditorsShunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai
    PublisherSpringer Verlag
    Pages61-67
    Number of pages7
    ISBN (Print)9783319460482
    DOIs
    StatePublished - 2016
    Event23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016 - Beppu, Japan
    Duration: Oct 18 2016Oct 20 2016

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume9954 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016
    Country/TerritoryJapan
    CityBeppu
    Period10/18/1610/20/16

    Keywords

    • PRAM
    • Parallel
    • Pattern matching
    • Suffix trees

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science

    Fingerprint

    Dive into the research topics of 'Parallel lookups in string indexes'. Together they form a unique fingerprint.

    Cite this