Internal pattern matching queries in a text and applications
From MaRDI portal
Cites work
- A fast string searching algorithm
- A linear-space data structure for range-LCP queries in poly-logarithmic time
- A measure of relative entropy between individual sequences with application to universal classification
- A universal algorithm for sequential data compression
- Algorithms on Strings
- An application of pattern matching to a problem in geometrical complexity
- Approximating text-to-pattern Hamming distances
- Balancing Straight-line Programs
- Circular pattern matching with \(k\) mismatches
- Complexity measures and decision tree complexity: a survey.
- Constructing Efficient Dictionaries in Close to Sorting Time
- Cross-document pattern matching
- Detecting leftmost maximal periodicities
- Detecting one-variable patterns
- Detecting regularities on grammar-compressed strings
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Dynamic and internal longest common substring
- Dynamic suffix array with polylogarithmic queries and updates
- Dynamic text and static pattern matching
- Efficient Computation of 2-Covers of a String.
- Efficient Enumeration of Distinct Factors Using Package Representations
- Efficient randomized pattern-matching algorithms
- Efficient string matching
- Extracting powers and periods in a word from its runs structure
- Fast construction of wavelet trees
- Fast Pattern Matching in Strings
- Fast string matching with k differences
- Faster range LCP queries
- Finding all periods and initial palindromes of a string in parallel
- Free differential calculus. IV: The quotient groups of the lower central series
- Generalized substring compression
- scientific article; zbMATH DE number 1223734 (Why is no real title available?)
- scientific article; zbMATH DE number 1754624 (Why is no real title available?)
- scientific article; zbMATH DE number 6850408 (Why is no real title available?)
- scientific article; zbMATH DE number 7651193 (Why is no real title available?)
- scientific article; zbMATH DE number 7740885 (Why is no real title available?)
- Improved algorithms for the range next value problem and applications
- Improved approximation algorithms for Dyck edit distance and RNA folding
- Internal dictionary matching
- Internal masked prefix sums and its connection to fully internal measurement queries
- Internal pattern matching queries in a text and applications
- Internal Quasiperiod Queries
- Internal shortest absent word queries in constant time and linear space
- Jewels of Stringology
- Linear work suffix array construction
- Linear-time computation of cyclic roots and cyclic covers of a string
- Locally Consistent Parsing for Text Indexing in Small Space
- Longest unbordered factor in quasilinear time
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Minimal suffix and rotation of a substring in optimal time
- Multidimensional period recovery
- Near-optimal quantum algorithms for string problems
- Near-optimal search time in -optimal space
- On Burnside's Problem
- On the sorting-complexity of suffix tree construction
- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
- Pattern matching with variables: efficient algorithms and complexity results
- Period recovery of strings over the Hamming and edit distances
- Periods in strings
- Probability and Computing
- Quantum algorithm for lexicographically minimal string rotation
- Quantum speed-ups for string synchronizing sets, longest common substring, and \(k\)-mismatch matching
- Range LCP
- Range predecessor and Lempel-Ziv parsing
- Recompression: a simple and powerful technique for word equations
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- Repetition Detection in a Dynamic String
- Searching of gapped repeats and subrepetitions in a word
- Sorted range reporting
- String matching in O( n+ m) quantum time
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
- Substring compression problems
- Symmetry breaking for suffix tree construction
- The ``runs theorem
- The equation \(a_ M=b^ Nc^ P\) in a free group
- 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
- Toward a Definitive Compressibility Measure for Repetitive Sequences
- Towards optimal packed string matching
- Two-dimensional maximal repetitions
- Two-dimensional range successor in optimal time and almost linear space
- Uniqueness Theorems for Periodic Functions
- Wavelet trees meet suffix trees
- Weighted ancestors in suffix trees
- Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
Cited in
(7)- Internal quasiperiod queries
- Computing string covers in sublinear time
- Logarithmic-time internal pattern matching queries in compressed and dynamic texts
- Quasi-linear-time algorithm for a longest common circular factor
- Covers in optimal space
- Sorted consecutive occurrence queries in substrings
- Counting distinct square substrings in sublinear time
This page was built for publication: Internal pattern matching queries in a text and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621750)
