Skip to content
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.

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

Make suffix array pattern matching faster using binary search #18

Closed
lxndio opened this issue Nov 15, 2020 · 0 comments
Closed

Make suffix array pattern matching faster using binary search #18

lxndio opened this issue Nov 15, 2020 · 0 comments
Labels
improvement Improve an existing feature

Comments

@lxndio
Copy link
Owner

lxndio commented Nov 15, 2020

The pattern matching algorithm using suffix arrays would probably be faster using binary search instead of the current variant which is constructed after the formal definition.

@lxndio lxndio added the improvement Improve an existing feature label Nov 15, 2020
@lxndio lxndio closed this as completed in b0241af Nov 27, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
improvement Improve an existing feature
Projects
None yet
Development

No branches or pull requests

1 participant