Abstract
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string matching with mismatches, which computes an estimate with accuracy. The algorithm consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers. Therefore, a reduction of the computation time is obtained by the speed-up for FFT, which leads an improvement of the variance of the estimates. This paper analyzes the variance of the estimates in the algorithm and compares it with the variances in existing algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Atallah, M.J., Chyzak, F., Dumas, P.: A randomized algorithm for approximate string matching. Algorithmica 29(3), 468–486 (2001)
Baba, K., Shinohara, A., Takeda, M., Inenaga, S., Arikawa, S.: A note on randomized algorithm for string matching with mismatches. Nordic Journal of Computing 10(1), 2–12 (2003)
Baba, K., Tanaka, Y., Nakatoh, T., Shinohara, A.: A generalization of FFT algorithms for string matching. In: Proc. International Symposium on Information Science and Electrical Engineering 2003 (ISEE 2003), pp. 191–194. Kyushu University (2003)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)
Fischer, M.J., Paterson, M.S.: String-matching and other products. Complexity of Computation (SIAM-AMS Proceedings), 113–125 (1974)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
Nakatoh, T., Baba, K., Ikeda, D., Yamada, Y., Hirokawa, S.: An efficient mapping for scores of string matching. Journal of Automata, Languages and Combinatorics 10(5/6), 697–704 (2005)
Nakatoh, T., Baba, K., Mori, M., Hirokawa, S.: An optimal mapping for score of string matching with FFT. DBSJ Letters 6(3), 25–28 (2007) (in Japanese)
Schoenmeyr, T., Yu-Zhang, D.: FFT-based algorithms for the string matching with mismatches problem. Journal of Algorithms 57, 130–139 (2005)
Sorensen, H.V., Jones, D.L., Heideman, M.T., Burrus, C.S.: Real-valued fast Fourier transform algorithms. IEEE Trans. Acoust., Speech, Signal Processing, ASSP 35(6), 849–863 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baba, K. (2010). String Matching with Mismatches by Real-Valued FFT. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds) Computational Science and Its Applications – ICCSA 2010. ICCSA 2010. Lecture Notes in Computer Science, vol 6019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12189-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-12189-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12188-3
Online ISBN: 978-3-642-12189-0
eBook Packages: Computer ScienceComputer Science (R0)