Pages that link to "Item:Q4575762"
From MaRDI portal
The following pages link to pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems (Q4575762):
Displaying 12 items.
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Simpler FM-index for parameterized string matching (Q2224844) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- The parameterized suffix tray (Q2692728) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- An Encoding for Order-Preserving Matching. (Q5111725) (← links)
- Structural Pattern Matching - Succinctly. (Q5136254) (← links)
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets (Q6536267) (← links)
