Question: Suffix Array Vs. Compressed Suffix Array Vs. Bwt Search
7
gravatar for Rob
4.5 years ago by
Rob2.4k
United States
Rob2.4k wrote:

Hi all,

I was wondering if there is a good reference on what the (practically) fastest data structure for exact sequence search is. Specifically, I'm curious about the speed of finding all occurrences (exactly) of a string in a large corpus using backward search in a BWT versus search in a (presumably uncompressed) suffix array. I understand that they can both be performed asymptotically in O(m), where m is the length of the pattern string, with both structures. However, I'm curious if there are significant practical differences in the search speed. Any references or benchmarks would be greatly appreciated.

Thanks,

Rob

alignment search • 1.6k views
ADD COMMENTlink written 4.5 years ago by Rob2.4k
Please log in to add an answer.

Help
Access

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.
Powered by Biostar version 2.3.0
Traffic: 1486 users visited in the last hour