The following pages link to Compressed text indexes (Q5406182):
Displaying 21 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- String matching with alphabet sampling (Q414445) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- Distribution-aware compressed full-text indexes (Q2017875) (← links)
- Grammar index by induced suffix sorting (Q2146128) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← links)
- Locally compressed suffix arrays (Q2828176) (← links)
- Lossless Seeds for Searching Short Patterns with High Error Rates (Q2946072) (← links)
- Compressed Text Indexes with Fast Locate (Q3506924) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- (Q5501319) (← links)
- Comparative genomics with succinct colored de Bruijn graphs (Q6658084) (← links)
