Pages that link to "Item:Q1874240"
From MaRDI portal
The following pages link to Collage system: A unifying framework for compressed pattern matching. (Q1874240):
Displayed 19 items.
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- Two fast constructions of compact representations of binary words with given set of periods (Q507396) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- On stricter reachable repetitiveness measures (Q2146140) (← links)
- Block trees (Q2221797) (← links)
- Compressed automata for dictionary matching (Q2344744) (← links)
- A fully linear-time approximation algorithm for grammar-based compression (Q2569418) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA (Q3395142) (← links)
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (Q3602815) (← links)
- Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS (Q5714664) (← links)
- Substring complexities on run-length compressed strings (Q6111584) (← links)