Internal pattern matching in small space and applications
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 7651096 (Why is no real title available?)
- scientific article; zbMATH DE number 7740885 (Why is no real title available?)
- scientific article; zbMATH DE number 7695994 (Why is no real title available?)
- A black box for online approximate pattern matching
- Alphabet-dependent string searching with wexponential search trees
- Approximate circular pattern matching
- Approximate circular pattern matching under edit distance
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Average-optimal string matching
- Circular pattern matching with \(k\) mismatches
- Constructing Efficient Dictionaries in Close to Sorting Time
- Construction of sparse suffix trees and LCE indexes in optimal time and space
- Counting distinct patterns in internal dictionary matching
- Detecting one-variable patterns
- Dynamic and internal longest common substring
- Dynamic suffix array with polylogarithmic queries and updates
- Dynamic text and static pattern matching
- Efficient Enumeration of Distinct Factors Using Package Representations
- Factorizing words over an ordered alphabet
- Faster approximate pattern matching: a unified approach
- Faster pattern matching under edit distance: a reduction to dynamic puzzle matching and the seaweed monoid of permutation matrices
- Generalized substring compression
- Improved approximation algorithms for Dyck edit distance and RNA folding
- Information cost tradeoffs for augmented index and streaming language recognition
- Internal Quasiperiod Queries
- Internal dictionary matching
- Internal longest palindrome queries in optimal time
- Internal masked prefix sums and its connection to fully internal measurement queries
- Internal pattern matching queries in a text and applications
- Internal shortest absent word queries in constant time and linear space
- Linear-time computation of cyclic roots and cyclic covers of a string
- Locally Consistent Parsing for Text Indexing in Small Space
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Longest unbordered factor in quasilinear time
- Multidimensional period recovery
- Orthogonal range searching for text indexing
- Orthogonal range searching on the RAM, revisited
- Pattern matching with variables: efficient algorithms and complexity results
- Period recovery of strings over the Hamming and edit distances
- Polylogarithmic approximation for edit distance and the asymmetric query complexity
- Repetition Detection in a Dynamic String
- Resolution of the Burrows-Wheeler transform conjecture
- Searching and indexing circular patterns
- Searching of gapped repeats and subrepetitions in a word
- Simple real-time constant-space string matching
- Small-space algorithms for the online language distance problem for palindromes and squares
- Space Efficient Multi-dimensional Range Reporting
- Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
- Space-efficient construction algorithm for the circular suffix tree
- Sublinear space algorithms for the longest common substring problem
- Succinct indexes for circular patterns
- Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
- Time-space trade-offs for longest common extensions
- Time-space trade-offs for the longest common substring problem
- Uniqueness Theorems for Periodic Functions
- Wavelet trees meet suffix trees
Cited in
(2)
This page was built for publication: Internal pattern matching in small space and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891097)
