A comparison of BWT approaches to string pattern matching
From MaRDI portal
Recommendations
- Fragmented BWT: an extended BWT for full-text indexing
- Average linear time and compressed space construction of the Burrows-Wheeler transform
- Fast BWT in small space by blockwise suffix sorting
- Boyer-Moore string matching over Ziv-Lempel compressed text
- Algorithms to compute the Burrows-Wheeler similarity distribution
Cites work
Cited in
(4)
This page was built for publication: A comparison of BWT approaches to string pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704751)