The following pages link to The string B-tree (Q3158537):
Displaying 35 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- On the weak prefix-search problem (Q390882) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Efficient processing of substring match queries with inverted variable-length gram indexes (Q508702) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- Two-dimensional substring indexing. (Q1401971) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- I/O efficient dynamic data structures for longest prefix queries (Q1939656) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Space-efficient B trees via load-balancing (Q2169966) (← links)
- Online parameterized dictionary matching with one gap (Q2207509) (← links)
- I/O-efficient data structures for non-overlapping indexing (Q2220773) (← links)
- Parameterized dictionary matching and recognition with one gap (Q2220853) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- Worst-case optimal tree layout in external memory (Q2354018) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
- Distributed suffix trees (Q2569396) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
- On the Weak Prefix-Search Problem (Q3011860) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS (Q5312640) (← links)
