Abstract
In structural pattern matching, two n-length strings X and Y over \(\varSigma \) are said to match, if there exists a one-to-one function \(f:\varSigma \rightarrow \varSigma \) such that (i) for \(0\le i<n\), \(f(X[i])=Y[i]\) and (ii) for any \(x,y\in \varSigma \) whose complements are \(x'\) and \(y'\), respectively, if \(f(x)=y\) then \(f(x')=y'\). In this paper, we present a \(2n\lg \sigma +2n+o(n)\)-bit index for this problem. Although it does not theoretically achieve the succinctness for a general alphabet, the proposed method is more practical and the space requirement can be smaller than the previous succinct solution especially when \(\sigma \) is small. A source code is available at: https://github.com/sunghwank/spmindex.
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
Similar content being viewed by others
References
Beal, R., Adjeroh, D.: Efficient pattern matching for RNA secondary structures. Theoret. Comput. Sci. 592, 59–71 (2015). https://doi.org/10.1016/j.tcs.2015.05.016
Clark, D.: Compact pat trees. Ph.D. thesis, University of Waterloo (1996)
Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2), 20–es (2007). https://doi.org/10.1145/1240233.1240243
Fischer, J.: Optimal succinctness for range minimum queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158–169. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12200-2_16
Ganguly, A., Shah, R., Thankachan, S.V.: Structural pattern matching - succinctly. In: Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC), pp. 35:1–35:13 (2017). https://doi.org/10.4230/LIPIcs.ISAAC.2017.35
Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Proceedings of the 13th International Symposium on Experimental Algorithms (SEA), pp. 326–337 (2014). https://doi.org/10.1007/978-3-319-07959-2_28
Golynski, A., Grossi, R., Gupta, A., Raman, R., Rao, S.S.: On the size of succinct indices. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 371–382. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75520-3_34
Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841–850 (2003). https://doi.org/10.5555/644108.644250
Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 549–554 (1989). https://doi.org/10.1109/SFCS.1989.63533
Kim, S.H., Cho, H.G.: Indexing isodirectional pointer sequences. In: Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC), pp. 35:1–35:15 (2020). https://doi.org/10.4230/LIPIcs.ISAAC.2020.35
Navarro, G.: Wavelet trees for all. J. Discrete Algorithms 25, 2–20 (2014). https://doi.org/10.1016/j.jda.2013.07.004
Navarro, G., Sadakane, K.: Fully functional static and dynamic succinct trees. ACM Trans. Algorithms 10(3), 1–39 (2014). https://doi.org/10.1145/2601073
Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 134–149 (2010). https://doi.org/10.5555/1873601.1873614
Shibuya, T.: Generalization of a suffix tree for RNA structural pattern matching. In: SWAT 2000. LNCS, vol. 1851, pp. 393–406. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44985-X_34
Shibuya, T.: Generalization of a suffix tree for RNA structural pattern matching. Algorithmica 39, 1–19 (2004). https://doi.org/10.1007/s00453-003-1067-9
Acknowledgement
The authors would like to thank anonymous reviewers for their valuable comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Kim, SH., Cho, HG. (2022). Practical Space-Efficient Index for Structural Pattern Matching. In: Bazgan, C., Fernau, H. (eds) Combinatorial Algorithms. IWOCA 2022. Lecture Notes in Computer Science, vol 13270. Springer, Cham. https://doi.org/10.1007/978-3-031-06678-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-031-06678-8_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-06677-1
Online ISBN: 978-3-031-06678-8
eBook Packages: Computer ScienceComputer Science (R0)