scientific article; zbMATH DE number 1045405
From MaRDI portal
Publication:4347161
zbMath0874.68087MaRDI QIDQ4347161
Ayumi Shinohara, Marek Karpinski, Wojciech Rytter
Publication date: 18 September 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the complexity of pattern matching for highly compressed two-dimensional texts., Collage system: A unifying framework for compressed pattern matching., Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts, Access, Rank, and Select in Grammar-compressed Strings, Pattern-matching problems for 2-dimensional images described by finite automata, Self-indexed Text Compression Using Straight-Line Programs, Partially-Commutative Context-Free Processes, Prime normal form and equivalence of simple grammars, Unified compression-based acceleration of edit-distance computation, A fully compressed algorithm for computing the edit distance of run-length encoded strings, Application of Lempel-Ziv factorization to the approximation of grammar-based compression., Searching for smallest grammars on large sequences and application to DNA, Efficient retrieval of approximate palindromes in a run-length encoded string, A \textit{really} simple approximation of smallest grammar, Parameter reduction and automata evaluation for grammar-compressed trees, Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time, The smallest grammar problem as constituents choice and minimal grammar parsing, siEDM: an efficient string index and search algorithm for edit distance with moves, Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts, Partially-commutative context-free processes: expressibility and tractability, Computing Longest Common Substring and All Palindromes from Compressed Strings, Efficient algorithms to compute compressed longest common substrings and compressed palindromes, Tracing compressed curves in triangulated surfaces, A Space-Optimal Grammar Compression., Compressed automata for dictionary matching
