Pages that link to "Item:Q2856587"
From MaRDI portal
The following pages link to String Processing and Information Retrieval (Q2856587):
Displaying 49 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)
- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy (Q3523001) (← links)
- Configurations and Minority in the String Consensus Problem (Q4913724) (← links)
- Efficient LZ78 Factorization of Grammar Compressed Text (Q4913725) (← links)
- Computing Discriminating and Generic Words (Q4913726) (← links)
- Greedy Shortest Common Superstring Approximation in Compact Space (Q5150914) (← links)
- Longest Common Factor After One Edit Operation (Q5150915) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- LZ78 Compression in Low Main Memory Space (Q5150917) (← links)
- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (Q5150918) (← links)
- On Suffix Tree Breadth (Q5150919) (← links)
- Pattern Matching on Elastic-Degenerate Text with Errors (Q5150920) (← links)
- Succinct Partial Sums and Fenwick Trees (Q5150921) (← links)
- Tight Bounds for Top Tree Compression (Q5150922) (← links)
- Efficient Compression and Indexing of Trajectories (Q5150923) (← links)
- Fast Construction of Compressed Web Graphs (Q5150926) (← links)
- Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract) (Q5150927) (← links)
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Q5150928) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
- Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings (Q5150932) (← links)
- Mining Bit-Parallel LCS-length Algorithms (Q5150933) (← links)
- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries (Q5150934) (← links)
- Faster Practical Block Compression for Rank/Select Dictionaries (Q5150935) (← links)
- Optimal Skeleton Huffman Trees (Q5150936) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
- Order Preserving Pattern Matching on Trees and DAGs (Q5150939) (← links)
- A Self-index on Block Trees (Q5150940) (← links)
- Counting Palindromes in Substrings (Q5150941) (← links)
- Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression (Q5150942) (← links)
- Relative Lempel-Ziv with Constant-Time Random Access (Q5498705) (← links)
- Succinct Indexes for Reporting Discriminating and Generic Words (Q5498706) (← links)
- On the String Consensus Problem and the Manhattan Sequence Consensus Problem (Q5498707) (← links)
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections (Q5505395) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5916286) (← links)
- Maximal unbordered factors of random strings (Q5916287) (← links)
