scientific article; zbMATH DE number 742992
From MaRDI portal
Publication:4763432
Recommendations
Cited in
(30)- Optimal two-dimensional compressed matching
- Two-dimensional pattern matching by sampling
- A multidimensional critical factorization theorem
- On linear-time alphabet-independent 2-dimensional pattern matching
- Fast searching in packed strings
- A general compression algorithm that supports fast searching
- Collage system: A unifying framework for compressed pattern matching.
- Combinatorial analysis of the period mapping: the topology of 2D fibres
- Efficient retrieval of approximate palindromes in a run-length encoded string
- Alphabet-independent optimal parallel search for three-dimensional patterns
- Plane digitization and related combinatorial problems
- Hardness of comparing two run-length encoded strings
- On a conjecture on bidimensional words.
- Inplace run-length 2d compressed search.
- Two-dimensional maximal repetitions
- Motif patterns in 2D
- Finding patterns and periods in Cartesian tree matching
- Three-Dimensional Periodicity and Its Application to Pattern Matching
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- Periodicity in rectangular arrays
- The two-dimensional periodic box–ball system and its fundamental cycle
- Exact and inexact search for 2d side-sharing tandems
- Bidirectional adaptive compression
- Fast Searching in Packed Strings
- Fibonacci arrays and their two-dimensional repetitions
- 2D Lyndon words and applications
- Optimal discovery of repetitions in 2D
- Optimal Parallel Searching an Array for Certain Repetitions
- Compressibility measures for two-dimensional data
- On Fine and Wilf's theorem for bidimensional words.
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 Q4763432)
