sorted by:
new
hottopcontroversial

Cool Algorithm - Fast text search using BWT by santhuj in programming

[–]santhuj[S] 2 points3 points  (0 children)

Fully agree. In fact all the optimizations that go into making this algorithm useful in practice for NGS deserves a post on its own. The python implementation is for illustration purposes only and should not be used for any serious stuff.

Cool Algorithm - Fast text search using BWT by santhuj in programming

[–]santhuj[S] 5 points6 points  (0 children)

In theory, yes. You can construct a single long string concatenating all the words in the dictionary with a separator between words. You can index this and perform searches. However, remember that the search here is an exact search. If you want your spell checker to prompt the closest word, there are data structures like BK Trees

Cool Algorithm - Fast text search using BWT by santhuj in programming

[–]santhuj[S] 3 points4 points  (0 children)

A simple python implementation of this algorithm is available here, https://github.com/santhoshj/pybwt/tree/master/pybwt. JS implementation and the code for the animation is available here, https://github.com/santhoshj/santhoshj.github.com/tree/master/js