Abstract
Recently, the first PRAM algorithms were presented for looking up a pattern in a suffix tree. We improve the bounds, achieving optimal results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Suffix trees of subsets of characters, hash tables, etc.
- 2.
Both earlier results involve hashing, as does ours. We give our bounds using fast, randomized perfect hashing, rather than slow, deterministic perfect hashing.
- 3.
Though, in fact, the suffix tree of T can be constructed in \(O(\log ^2 n)\) time, \(O(n \log n)\) work and O(n) space [11] for general alphabets.
References
Amir, A., Farach, M., Matias, Y.: Efficient randomized dictionary matching algorithms. In: Proceedings of the 3rd CPM, pp. 262–275 (1992)
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)
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)
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)
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)
Fich, F.E., Ragde, P., Wigderson, A.: Relations between concurrent-write models of parallel computation. SIAM J. Comput. 17(3), 606–627 (1988)
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)
Galil, Z.: A constant-time optimal parallel string-matching algorithm. J. ACM (JACM) 42(4), 908–918 (1995)
JáJá, J.: An Introduction to Parallel Algorithms. Addison Wesley, Redwood City (1992)
Jekovec, M., Brodnik, A.: Parallel query in the suffix tree. arXiv preprint arXiv:1509.06167 (2015)
Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918–936 (2006)
Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249–260 (1987)
Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM (JACM) 27(4), 831–838 (1980)
Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935–948 (1993)
Vishkin, U.: Optimal parallel pattern matching in strings. Inf. Control 67(1–3), 91–113 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Christiansen, A.R., Farach-Colton, M. (2016). Parallel Lookups in String Indexes. In: Inenaga, S., Sadakane, K., Sakai, T. (eds) String Processing and Information Retrieval. SPIRE 2016. Lecture Notes in Computer Science(), vol 9954. Springer, Cham. https://doi.org/10.1007/978-3-319-46049-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-46049-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46048-2
Online ISBN: 978-3-319-46049-9
eBook Packages: Computer ScienceComputer Science (R0)