Abstract
In this paper we present a general approach to string matching based on multiple sliding text-windows, and show how it can be applied to some among the most efficient algorithms for the problem based on nondeterministic automata and comparison of characters.
From our experimental results it turns out that the new multiple sliding windows approach leads to algorithms which obtain better results than the original ones when searching texts over relatively large alphabets. Best improvements are obtained especially for short patterns.
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
Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762–772 (1977)
Cantone, D., Faro, S.: Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. J. Autom. Lang. Comb. 10(5/6), 589–608 (2005)
Cantone, D., Faro, S., Giaquinta, E.: Bit-(Parallelism)2: Getting to the next level of parallelism. In: Boldi, P. (ed.) FUN 2010. LNCS, vol. 6099, pp. 166–177. Springer, Heidelberg (2010)
Durian, B., Holub, J., Peltola, H., Tarhio, J.: Tuning BNDM with q-grams. In: Finocchi, I., Hershberger, J. (eds.) Workshop on Algorithm Engineering and Experiments, pp. 29–37 (2009)
Ďurian, B., Peltola, H., Salmela, L., Tarhio, J.: Bit-Parallel Search Algorithms for Long Patterns. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 129–140. Springer, Heidelberg (2010)
Faro, S., Lecroq, T.: Efficient variants of the Backward-Oracle-Matching algorithm. In: Holub, J., Žďárek, J. (eds.) Prague Stringology Conference 2008, pp. 146–160. Czech Technical University in Prague, Czech Republic (2008)
Faro, S., Lecroq, T.: An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol. 5577, pp. 106–115. Springer, Heidelberg (2009)
Faro, S., Lecroq, T.: Smart: a string matching algorithm research tool. University of Catania and University of Rouen (2011), http://www.dmi.unict.it/~faro/smart/
Holub, J., Durian, B.: Talk: Fast variants of bit parallel approach to suffix automata. In: The Second Haifa Annual International Stringology Research Workshop of the Israeli Science Foundation (2005), http://www.cri.haifa.ac.il/events/2005/string/presentations/Holub.pdf
Horspool, R.N.: Practical fast searching in strings. Softw. Pract. Exp. 10(6), 501–506 (1980)
Hudaib, A., Al-Khalid, R., Suleiman, D., Itriq, M., Al-Anani, A.: A fast pattern matching algorithm with two sliding windows (TSW). J. Comput. Sci. 4(5), 393–401 (2008)
Lecroq, T.: Fast exact string matching algorithms. Inf. Process. Lett. 102(6), 229–235 (2007)
Navarro, G., Raffinot, M.: A Bit-parallel Approach to Suffix Automata: Fast Extended String Matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 14–33. Springer, Heidelberg (1998)
Peltola, H., Tarhio, J.: Alternative Algorithms for Bit-parallel String Matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol. 2857, pp. 80–93. Springer, Heidelberg (2003)
Peltola, H., Tarhio, J.: Variations of forward-SBNDM. In: Holub, J., Žďárek, J. (eds.) Prague Stringology Conference 2011, pp. 3–14. Czech Technical University in Prague, Czech Republic (2011)
Thathoo, R., Virmani, A., Lakshmi, S.S., Balakrishnan, N., Sekar, K.: TVSBS: A fast exact pattern matching algorithm for biological sequences. J. Indian Acad. Sci., Current Sci. 91(1), 47–53 (2006)
Wu, S., Manber, U.: Fast text searching: allowing errors. Commun. ACM 35, 83–91 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Faro, S., Lecroq, T. (2012). A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. In: Klasing, R. (eds) Experimental Algorithms. SEA 2012. Lecture Notes in Computer Science, vol 7276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30850-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-30850-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30849-9
Online ISBN: 978-3-642-30850-5
eBook Packages: Computer ScienceComputer Science (R0)