New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Also benchmark mismatches #1

Open

almondtools opened this issue Aug 13, 2016 · 0 comments

Owner

almondtools commented Aug 13, 2016

Currently the naive algorithm seems to perform quite well for large alphabets and small patterns. There are some reasons for that:

small patterns means that backtracking cost is low
most patterns to be searched can be found in the text
large alphabets lead to early backtracking (most break at the first or second character)

To get a more balanced benchmark, we should modify it by

inserting mismatching patterns
inserting patterns that mismatch at the last pattern position

almondtools mentioned this issue

Performance Issue with small alphabets and long texts nishihatapalmer/byteseek#11

Closed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment