Internal pattern matching queries in a text and applications

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Fast construction of wavelet trees
Extracting powers and periods in a word from its runs structure
Cross-document pattern matching
Improved algorithms for the range next value problem and applications
Maintaining dynamic sequences under equality tests in polylogarithmic time
The equation \(a_ M=b^ Nc^ P\) in a free group
String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
Two-dimensional range successor in optimal time and almost linear space
Fast string matching with k differences
Periods in strings
An application of pattern matching to a problem in geometrical complexity
Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
Searching of gapped repeats and subrepetitions in a word
Period recovery of strings over the Hamming and edit distances
Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets
Detecting leftmost maximal periodicities
Complexity measures and decision tree complexity: a survey.
Finding all periods and initial palindromes of a string in parallel
Internal dictionary matching
Multidimensional period recovery
Dynamic and internal longest common substring
Two-dimensional maximal repetitions
Generalized substring compression
Towards optimal packed string matching
Detecting regularities on grammar-compressed strings
Internal shortest absent word queries in constant time and linear space
Symmetry breaking for suffix tree construction
Faster Fully Compressed Pattern Matching by Recompression
Faster Range LCP Queries
Sorted Range Reporting
Weighted Ancestors in Suffix Trees
Dynamic text and static pattern matching
A fast string searching algorithm
Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
Recompression
Deterministic Sampling–A New Technique for Fast Pattern Matching
Linear work suffix array construction
Constructing Efficient Dictionaries in Close to Sorting Time
Efficient randomized pattern-matching algorithms
Efficient string matching
Fast Pattern Matching in Strings
A universal algorithm for sequential data compression
A measure of relative entropy between individual sequences with application to universal classification
Jewels of Stringology
Range Predecessor and Lempel-Ziv Parsing
Pattern Matching with Variables
Balancing Straight-line Programs
Repetition Detection in a Dynamic String
Approximating text-to-pattern Hamming distances
Locally Consistent Parsing for Text Indexing in Small Space
Detecting One-Variable Patterns
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
Uniqueness Theorems for Periodic Functions
The “Runs” Theorem
Internal Pattern Matching Queries in a Text and Applications
Wavelet Trees Meet Suffix Trees
Minimal Suffix and Rotation of a Substring in Optimal Time
Algorithms on Strings
Probability and Computing
On the sorting-complexity of suffix tree construction
On Burnside's Problem
Efficient Computation of 2-Covers of a String.
Free differential calculus. IV: The quotient groups of the lower central series
A linear-space data structure for range-LCP queries in poly-logarithmic time
Circular pattern matching with \(k\) mismatches
Range LCP
Finding top-\(k\) longest palindromes in substrings
Dynamic suffix array with polylogarithmic queries and updates
Internal masked prefix sums and its connection to fully internal measurement queries
Quantum algorithm for lexicographically minimal string rotation
Toward a Definitive Compressibility Measure for Repetitive Sequences
Near-optimal search time in \(\delta \)-optimal space
Near-optimal quantum algorithms for string problems
Internal Quasiperiod Queries
Efficient Enumeration of Distinct Factors Using Package Representations
Quantum speed-ups for string synchronizing sets, longest common substring, and \(k\)-mismatch matching
Improved approximation algorithms for Dyck edit distance and RNA folding
Linear-time computation of cyclic roots and cyclic covers of a string

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)