A Constant Time Optimal Parallel Algorithm for Two-dimensional Pattern Matching

Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, Shanmugavelayutham Muthukrishnan, Wojciech Rytter

    Research output: Contribution to journalArticle

    Abstract

    We give an alphabet-independent deterministic parallel algorithm for finding all occurrences of a pattern array of size mh × mw in a text array of size nh × nw in the concurrentread-concurrent-write-parallel-random-access-machine (CRCW-PRAM) model. Our algorithm runs in O(1) time performing optimal, that is, O(nh × nw) work, following preprocessing of the pattern. This improves the previous best bound of O(log log m) time with optimal work [A. Amir, G. Benson, and M. Farach, Proceedings 5th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1993, pp. 79-85], following preprocessing of the pattern, where m = max{mh, mw}. The preprocessing required by our algorithm (and that due to Amir, Benson, and Farach) can be accomplished in O(log log m) time and O(mh × mw) work [M. Crochemore et al., manuscript, 1993], [R. Cole et al., manuscript, 1993].

    Original languageEnglish (US)
    Pages (from-to)668-681
    Number of pages14
    JournalSIAM Journal on Computing
    Volume27
    Issue number3
    DOIs
    StatePublished - Jan 1 1998

    Fingerprint

    Pattern matching
    Pattern Matching
    Time Constant
    Optimal Algorithm
    Parallel algorithms
    Parallel Algorithms
    Preprocessing
    Parallel architectures
    Random Access
    Parallel Architectures
    Deterministic Algorithm
    Annual
    Concurrent
    Model

    Keywords

    • Duelling
    • Pattern matching
    • Periodicity
    • PRAM
    • Two-dimensional
    • Witnesses

    ASJC Scopus subject areas

    • Computer Science(all)
    • Mathematics(all)

    Cite this

    Crochemore, M., Gasieniec, L., Hariharan, R., Muthukrishnan, S., & Rytter, W. (1998). A Constant Time Optimal Parallel Algorithm for Two-dimensional Pattern Matching. SIAM Journal on Computing, 27(3), 668-681. https://doi.org/10.1137/S0097539795280068

    A Constant Time Optimal Parallel Algorithm for Two-dimensional Pattern Matching. / Crochemore, Maxime; Gasieniec, Leszek; Hariharan, Ramesh; Muthukrishnan, Shanmugavelayutham; Rytter, Wojciech.

    In: SIAM Journal on Computing, Vol. 27, No. 3, 01.01.1998, p. 668-681.

    Research output: Contribution to journalArticle

    Crochemore, M, Gasieniec, L, Hariharan, R, Muthukrishnan, S & Rytter, W 1998, 'A Constant Time Optimal Parallel Algorithm for Two-dimensional Pattern Matching', SIAM Journal on Computing, vol. 27, no. 3, pp. 668-681. https://doi.org/10.1137/S0097539795280068
    Crochemore M, Gasieniec L, Hariharan R, Muthukrishnan S, Rytter W. A Constant Time Optimal Parallel Algorithm for Two-dimensional Pattern Matching. SIAM Journal on Computing. 1998 Jan 1;27(3):668-681. https://doi.org/10.1137/S0097539795280068
    Crochemore, Maxime ; Gasieniec, Leszek ; Hariharan, Ramesh ; Muthukrishnan, Shanmugavelayutham ; Rytter, Wojciech. / A Constant Time Optimal Parallel Algorithm for Two-dimensional Pattern Matching. In: SIAM Journal on Computing. 1998 ; Vol. 27, No. 3. pp. 668-681.
    @article{e4245bac1fb44fa3b190205bb087771d,
    title = "A Constant Time Optimal Parallel Algorithm for Two-dimensional Pattern Matching",
    abstract = "We give an alphabet-independent deterministic parallel algorithm for finding all occurrences of a pattern array of size mh × mw in a text array of size nh × nw in the concurrentread-concurrent-write-parallel-random-access-machine (CRCW-PRAM) model. Our algorithm runs in O(1) time performing optimal, that is, O(nh × nw) work, following preprocessing of the pattern. This improves the previous best bound of O(log log m) time with optimal work [A. Amir, G. Benson, and M. Farach, Proceedings 5th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1993, pp. 79-85], following preprocessing of the pattern, where m = max{mh, mw}. The preprocessing required by our algorithm (and that due to Amir, Benson, and Farach) can be accomplished in O(log log m) time and O(mh × mw) work [M. Crochemore et al., manuscript, 1993], [R. Cole et al., manuscript, 1993].",
    keywords = "Duelling, Pattern matching, Periodicity, PRAM, Two-dimensional, Witnesses",
    author = "Maxime Crochemore and Leszek Gasieniec and Ramesh Hariharan and Shanmugavelayutham Muthukrishnan and Wojciech Rytter",
    year = "1998",
    month = "1",
    day = "1",
    doi = "10.1137/S0097539795280068",
    language = "English (US)",
    volume = "27",
    pages = "668--681",
    journal = "SIAM Journal on Computing",
    issn = "0097-5397",
    publisher = "Society for Industrial and Applied Mathematics Publications",
    number = "3",

    }

    TY - JOUR

    T1 - A Constant Time Optimal Parallel Algorithm for Two-dimensional Pattern Matching

    AU - Crochemore, Maxime

    AU - Gasieniec, Leszek

    AU - Hariharan, Ramesh

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Rytter, Wojciech

    PY - 1998/1/1

    Y1 - 1998/1/1

    N2 - We give an alphabet-independent deterministic parallel algorithm for finding all occurrences of a pattern array of size mh × mw in a text array of size nh × nw in the concurrentread-concurrent-write-parallel-random-access-machine (CRCW-PRAM) model. Our algorithm runs in O(1) time performing optimal, that is, O(nh × nw) work, following preprocessing of the pattern. This improves the previous best bound of O(log log m) time with optimal work [A. Amir, G. Benson, and M. Farach, Proceedings 5th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1993, pp. 79-85], following preprocessing of the pattern, where m = max{mh, mw}. The preprocessing required by our algorithm (and that due to Amir, Benson, and Farach) can be accomplished in O(log log m) time and O(mh × mw) work [M. Crochemore et al., manuscript, 1993], [R. Cole et al., manuscript, 1993].

    AB - We give an alphabet-independent deterministic parallel algorithm for finding all occurrences of a pattern array of size mh × mw in a text array of size nh × nw in the concurrentread-concurrent-write-parallel-random-access-machine (CRCW-PRAM) model. Our algorithm runs in O(1) time performing optimal, that is, O(nh × nw) work, following preprocessing of the pattern. This improves the previous best bound of O(log log m) time with optimal work [A. Amir, G. Benson, and M. Farach, Proceedings 5th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1993, pp. 79-85], following preprocessing of the pattern, where m = max{mh, mw}. The preprocessing required by our algorithm (and that due to Amir, Benson, and Farach) can be accomplished in O(log log m) time and O(mh × mw) work [M. Crochemore et al., manuscript, 1993], [R. Cole et al., manuscript, 1993].

    KW - Duelling

    KW - Pattern matching

    KW - Periodicity

    KW - PRAM

    KW - Two-dimensional

    KW - Witnesses

    UR - http://www.scopus.com/inward/record.url?scp=0346984925&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0346984925&partnerID=8YFLogxK

    U2 - 10.1137/S0097539795280068

    DO - 10.1137/S0097539795280068

    M3 - Article

    AN - SCOPUS:0346984925

    VL - 27

    SP - 668

    EP - 681

    JO - SIAM Journal on Computing

    JF - SIAM Journal on Computing

    SN - 0097-5397

    IS - 3

    ER -