-
Notifications
You must be signed in to change notification settings - Fork 158
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
Utilizing FM-index in "locate" and "grep" #14
Comments
@shenwei356 see the bwt repo. have the following questions: from a design perspective, whats the difference between the locate and grep commands? could this be done for the locate command first? How do you envision this struct fitting in? noticed burrows , wheeler is a compression algorithm: whats the goal to make search faster? how does compression help? to what degree should mismatch be allowed? |
The optimization of Parameter |
Hi, question pertaining to memory and speed. I would like to use locate on an ncbi database (~50 to 100 million sequences), for finding sequences that match specific patterns. Currently locate does not make use of the fasta index, can i make use of that to increase speed? Any other suggestions? Thanks |
Try BLAST? |
Sorry to be clear, i am searching for either degenerate sequence or using regular expressions (for protein motifs) so blast wont help for either case.. |
So we can make the searching faster and allow mismatch.
I've written a package, bwt (Burrows-Wheeler Transform, and FM-index in golang). So it won't be too long.
update: there are some bugs...
The text was updated successfully, but these errors were encountered: