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

Optimize search distance #22

Open
ezorita opened this issue Jan 31, 2018 · 1 comment
Open

Optimize search distance #22

ezorita opened this issue Jan 31, 2018 · 1 comment
Assignees

Comments

@ezorita
Copy link
Owner

ezorita commented Jan 31, 2018

Reduce max tau during trie search if a sequence of tau < tau_max is found.

For instance, for a trie search of 3 mismatches, a sequence of distance 1 is found. Since we're only interested in the closest neighbor, set tau_max = 1 for the rest of this search.

@ezorita
Copy link
Owner Author

ezorita commented Feb 21, 2018

To maximize the probability of finding such close sequence as fast as possible, start the search from the right of the trie and extend from right to left, instead of doing left-right search.

@ezorita ezorita mentioned this issue May 17, 2018
2 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant