scientific article; zbMATH DE number 1045405
From MaRDI portal
Publication:4347161
zbMATH Open0874.68087MaRDI QIDQ4347161FDOQ4347161
Authors: Ayumi Shinohara, Marek Karpinski, Wojciech Rytter 
Publication date: 18 September 1997
Title of this publication is not available (Why is that?)
Recommendations
Cited In (28)
- Compressed automata for dictionary matching
- Partially-commutative context-free processes: expressibility and tractability
- Fast Packed String Matching for Short Patterns
- Access, rank, and select in grammar-compressed strings
- Faster subsequence and don't-care pattern matching on compressed texts
- The smallest grammar problem as constituents choice and minimal grammar parsing
- Structural Pattern Matching - Succinctly.
- Searching for smallest grammars on large sequences and application to DNA
- Parameter reduction and automata evaluation for grammar-compressed trees
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Tracing compressed curves in triangulated surfaces
- Collage system: A unifying framework for compressed pattern matching.
- Efficient retrieval of approximate palindromes in a run-length encoded string
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- Self-indexed Text Compression Using Straight-Line Programs
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- Partially-Commutative Context-Free Processes
- A fully compressed algorithm for computing the edit distance of run-length encoded strings
- A simple fast hybrid pattern-matching algorithm
- Prime normal form and equivalence of simple grammars
- A space-optimal grammar compression
- A \textit{really} simple approximation of smallest grammar
- Pattern-matching problems for 2-dimensional images described by finite automata
- Computing \(q\)-gram non-overlapping frequencies on SLP compressed texts
- Unified compression-based acceleration of edit-distance computation
- Computing Longest Common Substring and All Palindromes from Compressed Strings
- siEDM: an efficient string index and search algorithm for edit distance with moves
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347161)
