Pages that link to "Item:Q2856587"
From MaRDI portal
The following pages link to String Processing and Information Retrieval (Q2856587):
Displaying 13 items.
- Compressed range minimum queries (Q2297849) (← links)
- Linear-time online algorithm for inferring the shortest path graph from a walk label (Q2297861) (← links)
- Minimal Discriminating Words Problem Revisited (Q2856588) (← links)
- Faster Range LCP Queries (Q2856589) (← links)
- Adaptive Computation of the Swap-Insert Correction Distance (Q2949833) (← links)
- On Prefix/Suffix-Square Free Words (Q2949834) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- Prefix and Suffix Reversals on Strings (Q2949837) (← links)
- Longest Common Prefix with Mismatches (Q2949838) (← links)
- Fingerprinting Ratings for Collaborative Filtering — Theoretical and Empirical Analysis (Q3162878) (← links)
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval (Q3162880) (← links)
- A Compressed Enhanced Suffix Array Supporting Fast String Matching (Q3399127) (← links)
- Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems (Q3399128) (← links)
