Abstract
Suffix trees and suffix arrays are two well-known index data structures for strings. It is known that the latter can be easily transformed into the former: Iliopoulos and Rytter [5] showed two simple transformation algorithms on the CREW PRAM model. However, the PRAM model is a theoretical one and we need a practical parallel model. The Message Passing Interface (MPI) is a standard widely used on both massively parallel machines and on clusters.
In this paper, we show how to implement the algorithms of Iliopoulos and Rytter on the MPI environment. Our contribution includes the modification of algorithms due to the lack of shared memory, small number of processors, communication costs between processors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2(1), 53–86 (2004)
Abouelhoda, M.I., Ohlebusch, E., Kurtz, S.: The Enhanced Suffix Array and Its Applications to Genome Analysis. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 449–463. Springer, Heidelberg (2002)
Dementiev, R., et al.: Better External Memory Suffix Array Construction. ACM Journal of Experimental Algorithmics, to appear.
Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
Iliopoulos, C.S., Rytter, W.: On parallel transformations of suffix arrays into suffix trees. In: Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA’04) (2004)
Kim, D.K., Jeon, J.E., Park, H.: An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size. In: Proceedings of 11th International Conference on String Processing and Information Retrieval (SPIRE 2004), pp. 138–149 (2004)
Kim, D.K., Park, H.: A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 33–44. Springer, Heidelberg (2005)
Kärkkäinen, J., Sanders, P.: Simpler linear work suffix array construction. In: Baeten, J.C.M., et al. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943–945. Springer, Heidelberg (2003)
Kasai, T., et al.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181–192. Springer, Heidelberg (2001)
Kim, D.K., et al.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 186–199. Springer, Heidelberg (2003)
Ko, P., Aluru, S.: Space-efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 200–210. Springer, Heidelberg (2003)
Navarro, G., Marín, M.: Suffix Arrays in Parallel. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 338–341. Springer, Heidelberg (2003)
Marín, M., Navarro, G.: Distributed Query Processing using Suffix Arrays. In: Proceedings of the 10th International Symposium on String Processing and Information Retrieval (SPIRE 2003), pp. 311–325 (2003)
McCreight, E.M.: A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM 23(2), 262–272 (1976)
Puglisi, S.J., Smyth, W.F., Turpin, A.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys, to appear.
Ukkonen, E.: On-line Construction of Suffix Trees. Algorithmica 14, 249–260 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, I., Iliopoulos, C.S., Ohn, SY. (2007). Transformation of Suffix Arrays into Suffix Trees on the MPI Environment. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-72530-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72529-9
Online ISBN: 978-3-540-72530-5
eBook Packages: Computer ScienceComputer Science (R0)