Increased bit-parallelism for approximate and multiple string matching

doi:10.1145/1064546.1180617

Increased bit-parallelism for approximate and multiple string matching

Full Text:

PDF

Buy this Article

Authors:	Heikki Hyyrö	University of Tampere, Finland
	Kimmo Fredriksson	University of Joensuu, Joensuu, Finland
	Gonzalo Navarro	University of Chile, Santiago, Chile

Published in:

· Journal

Journal of Experimental Algorithmics (JEA) JEA Homepage archive

Volume 10, 2005
Article No. 2.6
ACM New York, NY, USA
table of contents doi>10.1145/1064546.1180617

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 8 · Downloads (12 Months): 57 · Downloads (cumulative): 1,067 · Citation Count: 5

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms approximate string matching bit-parallelism computations on discrete structures multiple string matching pattern matching performance search process

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder