Parallel Lookups in String Indexes

  • Anders Roy ChristiansenEmail author
  • Martín Farach-Colton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9954)


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


Parallel Pattern matching Suffix trees PRAM 


  1. 1.
    Amir, A., Farach, M., Matias, Y.: Efficient randomized dictionary matching algorithms. In: Proceedings of the 3rd CPM, pp. 262–275 (1992)Google Scholar
  2. 2.
    Bast, H., Hagerup, T.: Fast and reliable parallel hashing. In: Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 50–61. ACM (1991)Google Scholar
  3. 3.
    Cole, R., Vishkin, U.: Approximate and exact parallel scheduling with applications to list, tree and graph problems. In: Proceedings of the IEEE 27th Annual Symposium on Foundations of Computer Science, pp. 478–491 (1986)Google Scholar
  4. 4.
    Cook, S., Dwork, C., Reischuk, R.: Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput. 15(1), 87–97 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Czumaj, A., Galil, Z., GŒąsieniec, L., Park, K., Plandowski, W.: Work-time-optimal parallel algorithms for string problems. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, pp. 713–722. ACM (1995)Google Scholar
  6. 6.
    Fich, F.E., Ragde, P., Wigderson, A.: Relations between concurrent-write models of parallel computation. SIAM J. Comput. 17(3), 606–627 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Fischer, J., Köppl, D., Kurpicz, F.: On the benefit of merging suffix array intervals for parallel pattern matching. In: Proceedings of the 27th CPM (2016)Google Scholar
  8. 8.
    Galil, Z.: A constant-time optimal parallel string-matching algorithm. J. ACM (JACM) 42(4), 908–918 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    JáJá, J.: An Introduction to Parallel Algorithms. Addison Wesley, Redwood City (1992)zbMATHGoogle Scholar
  10. 10.
    Jekovec, M., Brodnik, A.: Parallel query in the suffix tree. arXiv preprint arXiv:1509.06167 (2015)
  11. 11.
    Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918–936 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249–260 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM (JACM) 27(4), 831–838 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935–948 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Vishkin, U.: Optimal parallel pattern matching in strings. Inf. Control 67(1–3), 91–113 (1985)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Anders Roy Christiansen
    • 1
    Email author
  • Martín Farach-Colton
    • 2
  1. 1.The Technical University of DenmarkKongens LyngbyDenmark
  2. 2.Rutgers UniversityNew BrunswickUSA

Personalised recommendations