String Matching with Mismatches by Real-Valued FFT-Reference-Cited by-同舟云学术

String Matching with Mismatches by Real-Valued FFT

Published:2010 Issue: Volume: Page:273-283
ISSN:0302-9743
Container-title:Computational Science and Its Applications – ICCSA 2010
language:
Short-container-title:

Author:

Baba Kensuke

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12189-0_24.pdf

Reference11 articles.

1. Atallah, M.J., Chyzak, F., Dumas, P.: A randomized algorithm for approximate string matching. Algorithmica 29(3), 468–486 (2001)

2. 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)

3. 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)

4. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

5. Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Filtering Documents for Plagiarism Detection;Discovery Science;2018

2. Fast Plagiarism Detection Using Approximate String Matching and Vector Representation of Words;International Series on Computer Entertainment and Media Technology;2018

3. An extension of the FFT-based algorithm for the match-count problem to weighted scores;IEEJ Transactions on Electrical and Electronic Engineering;2017-12

4. An acceleration of FFT-based algorithms for the match-count problem;Information Processing Letters;2017-09

5. A Preprocessing for Approximate String Matching;Informatics Engineering and Information Science;2011