Abstract
Pattern matching with wildcards and length constraints under the one-off condition is a challenging topic. We propose an algorithm BPBM, based on bit parallelism and the Boyer-Moore algorithm, that outputs an occurrence of a given pattern P as soon as the pattern appears in the given sequence. The experimental results show that our BPBM algorithm has an improved time performance of over 50% with the same matching results when compared with SAIL, a state-of-the-art algorithm of this matching problem. The superiority is even more remarkable when the scale of the pattern increases.
This research is supported by the National Natural Science Foundation of China (NSFC) under grant 60828005 and the 973 Program of China under award 2009CB326203.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akutsu, T.: Approximate string matching with variable length don’t care characters. IEICE Trans. Info. Syst. E79-D(9), 1353–1354 (1996)
Boyer, R.S., Moore, J.S.: A fast string searching algorithm. CACM 20(10), 762–772 (1977)
Chen, G., Wu, X., Zhu, X., Arslan, A.N., He, Y.: Efficient String Matching with Wildcards and Length Constraints. Knowledge and Information Systems 10(4), 399–419 (2006)
Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don’t cares. In: Proceedings of the 36th ACM Symposium on the Theory of Computing, pp. 91–100. ACM Press, New York (2004)
Fischer, M.J., Paterson, M.S.: String matching and other products. In: Karp, R.M. (ed.) Complexity of computation, vol. 7, pp. 113–125. Massachusetts Institute of Technology, Cambridge (1974)
Gusfield, D.: Algorithms on strings, trees, and sequences–Computer science and computational biology. Cambridge University Press, Cambridge (1997)
Kalai, A.: Efficient pattern-matching with don’t cares. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, pp. 655–656. Society for Industrial and Applied Mathematics, Philadelphia (2002)
Kucherov, G., Rusinowitch, M.: Matching a set of strings with variable length don’t cares. In: Proceedings of the 6th Symposium on Combinatorial Pattern Matching, pp. 230–247. Springer, Heidelberg (1995)
Manber, U., Baeza-Yates, R.: An algorithm for string matching with a sequence of don’t cares. Inf. Proc. Lett. 37(3), 133–136 (1991)
Navarro, G., Raffinot, M.: Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching. J. Computational Biology 10(6) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, XL., Wu, X., Hu, XG., Liu, YL., Gao, J., Wu, GQ. (2009). BPBM: An Algorithm for String Matching with Wildcards and Length Constraints. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_63
Download citation
DOI: https://doi.org/10.1007/978-3-642-10646-0_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10645-3
Online ISBN: 978-3-642-10646-0
eBook Packages: Computer ScienceComputer Science (R0)