The following pages link to (Q4347161):
Displaying 25 items.
- Searching for smallest grammars on large sequences and application to DNA (Q414452) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (Q1401326) (← links)
- The smallest grammar problem as constituents choice and minimal grammar parsing (Q1736491) (← links)
- siEDM: an efficient string index and search algorithm for edit distance with moves (Q1736784) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- Compressed automata for dictionary matching (Q2344744) (← links)
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts (Q2891377) (← links)
- Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts (Q3011864) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Partially-Commutative Context-Free Processes (Q3184678) (← links)
- Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- Pattern-matching problems for 2-dimensional images described by finite automata (Q5055939) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
