Abstract
Suffix tree is a fundamental data structure in the area of combinatorial pattern matching. It has many elegant applications in almost all areas of data mining. This is an efficient data structure for finding solutions in these areas but occupying good amount of space is the major disadvantage of it. Optimizing this data structure has been an active area of research ever since this data structure has been introduced. Presenting major works on optimization of suffix tree is the matter of this article. Optimization in terms of space required to store the suffix tree or time complexity associated with the construction of the tree or performing operation like searching on the tree are major attraction for researcher over the years. In this article, we have presented different forms of this data structure and comparison between them have been studied. A comparative study on different algorithms of these data structures which turns out to be optimized versions of suffix tree in terms of space and time or both required to construct the tree or the time required to perform a search operation on the tree have been presented.
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
References
M. Kay, Suffix Trees, Stanford University, 2004.
P. Weiner, Linear Pattern Matching Algorithms, SWAT 73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory, Pages: 1–11, 1973.
R. Giegerich and S. Kurtz, From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction, Algorithmica 19, Pages: 331–353, 1997.
L. M. S. Russo, G. Navarro and A. L. Oliveira, Fully-Compressed Suffix Trees, LATIN, Vol. 4957, LNCS, Pages: 362–373, 2008.
L. Colussi and A. De Col, A time and space efficient data structure for string searching on large texts, Inf. Process. Lett. 58(5), Pages: 217–222, 1996.
M. Farach, Optimal Suffix Tree Construction with Large Alphabets, FOCS, IEEE Computer Society, Pages: 137–143, 1997.
S. Kurtz, Reducing the Space Requirement of Suffix Trees, Softw. Pract. Exper. 29(13), Pages: 1149–1171, 1999.
R. Kolpakov, G. Kucherov, T. Starikovskaya, Pattern Matching on Sparse Suffix Trees, in Data Compression, Communications and Processing (CCP), 2011 First International Conference on, pp. 92–97, 2011.
L. Wang, K. Huang, J. Zhang, J. Yao, A Complete Suffix Array-Based String Match Search Algorithm of Sliding Windows, in 2012 Fifth International Symposium on Computational Intelligence and Design (ISCID), vol. 2, pp. 210–213, 2012.
J. Shun, Fast Parallel Computation of Longest Common Prefixes, in SC14: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 387–398, 2014.
J. Karkkainen, Suffix Cactus: A cross between Suffix Tree and Suffix Array, CPM, Pages: 191–204, 1995.
A. Andersson and S. Nilsson, Efficient Implementation of Suffix Trees, Softw. Pract. Exper. 25(2), Pages: 129–141, 1995.
S. J. Bedathur and J. R. Haritsa, Search-Optimized Suffix-Tree Storage for Biological Applications, HiPC, Vol. 3769, LNCS, Springer, Pages: 29–39, 2005.
A. Amir, T. Kopelowitz, M. Lewenstein, N. Lewenstein, Towards Real-Time Suffix Tree Construction, SPIRE, Vol. 3772, LNCS, Pages: 67–78, 2005.
M. Farach and S. Muthukrishnan, Optimal Logarithmic Time Randomized Suffix Tree Construction, ICALP, Vol. 1099, LNCS, Pages: 1–18, 1995.
T. Yang, Z. Mi, R. Duan, X. Guo, J. Lu, S. Zhang, X. Sun, B. Liu, An ultra-fast universal incremental update algorithm for trie-based routing lookup, in 2012 20th IEEE International Conference on Network Protocols (ICNP), pp. 1–10, 2012.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this paper
Cite this paper
Mondal, K.C., Ankur Paul, Anindita Sarkar (2017). Brief Review on Optimal Suffix Data Structures. In: Mandal, J., Satapathy, S., Sanyal, M., Bhateja, V. (eds) Proceedings of the First International Conference on Intelligent Computing and Communication. Advances in Intelligent Systems and Computing, vol 458. Springer, Singapore. https://doi.org/10.1007/978-981-10-2035-3_22
Download citation
DOI: https://doi.org/10.1007/978-981-10-2035-3_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-2034-6
Online ISBN: 978-981-10-2035-3
eBook Packages: EngineeringEngineering (R0)