Bit-(Parallelism)2: Getting to the Next Level of Parallelism-Reference-Cited by-同舟云学术

Bit-(Parallelism)2: Getting to the Next Level of Parallelism

Published:2010 Issue: Volume: Page:166-177
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cantone Domenico,Faro Simone,Giaquinta Emanuele

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13122-6_18.pdf

Reference10 articles.

1. Arndt, J.: Matters Computational (2009), http://www.jjj.de/fxt/

2. Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)

3. He, L., Fang, B., Sui, J.: The wide window string matching algorithm. Theor. Comput. Sci. 332(1-3), 391–404 (2005)

4. Hyyrö, H., Fredriksson, K., Navarro, G.: Increased bit-parallelism for approximate and multiple string matching. J. Exp. Algorithmics 10(2.6), 1–27 (2005)

5. Kaplan, K., Burge III, L.L., Garuba, M.: A parallel algorithm for approximate string matching. In: Arabnia, H.R., Mun, Y. (eds.) Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2003, pp. 1844–1848 (2003)

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

1. A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol;PLOS ONE;2017-04-11

2. Parallel String Matching;Euro-Par 2016: Parallel Processing Workshops;2017

3. Fast bitwise pattern-matching algorithm for DNA sequences on modern hardware;TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES;2015

4. Hybrid string matching algorithm with a pivot;Journal of Information Science;2014-11-05

5. The exact online string matching problem;ACM Computing Surveys;2013-02