Efficient randomized pattern-matching algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Information recovery from randomly mixed-up message text
- Average-optimal string matching
- Efficient string matching with k mismatches
- Distributed algorithms in synchronous broadcasting networks
- Fast string matching with k differences
- Matching patterns in strings subject to multi-linear transformations
- An introduction to randomized algorithms
- Approximate string-matching with q-grams and maximal matches
- Identifying periodic occurrences of a template with applications to protein structure
- Fast two-dimensional pattern matching
- Alphabet-independent optimal parallel search for three-dimensional patterns
- Occam's razor, partially specified Boolean functions, string matching, and independent sets
- Sublinear approximate string matching and biological applications
- Efficient multiway radix search trees
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Dictionary matching with a bounded gap in pattern or in text
- Universal compressed text indexing
- A faster quick search algorithm
- Streaming pattern matching with \(d\) wildcards
- On the string matching with \(k\) mismatches
- A randomized numerical aligner (rNA)
- Efficient and secure outsourced approximate pattern matching protocol
- Time-space-optimal string matching
- Sending compressed messages to a learned receiver on a bidirectional line.
- Sensitivity analysis and efficient method for identifying optimal spaced seeds
- When can you fold a map?
- Multiple filtration and approximate pattern matching
- Super-pattern matching
- p-suffix sorting as arithmetic coding
- Permuted pattern matching algorithms on multi-track strings
- Two-dimensional pattern matching against local and regular-like picture languages
- The circulant hash revisited
- Top tree compression of tries
- Quantum algorithms for string processing
- Approximate hashing for bioinformatics
- Computing the maximum exponent in a stream
- Streaming dictionary matching with mismatches
- Efficient computation of sequence mappability
- Efficient computation of shortest absent words in complete genomes
- Dynamic and internal longest common substring
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Block trees
- Fast parallel and serial multidimensional approximate array matching
- Succinct non-overlapping indexing
- Index structures for fast similarity search for symbol strings
- Dynamic determination of variable sizes of chunks in a deduplication system
- Streaming \(k\)-mismatch with error correcting and applications
- Tight tradeoffs for real-time approximation of longest palindromes in streams
- Finger search in grammar-compressed strings
- Sliding suffix tree
- Weighted approximate parameterized string matching
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Longest common substring with approximately \(k\) mismatches
- Time-space trade-offs for longest common extensions
- A lower-variance randomized algorithm for approximate string matching
- Constrained tree inclusion
- Document listing on repetitive collections with guaranteed performance
- Can Burrows-Wheeler transform be replaced in chain code compression?
- Compressed string dictionary search with edit distance one
- A very fast string matching algorithm based on condensed alphabets
- Time-Space Trade-Offs for Longest Common Extensions
- Longest common extensions in sublinear space
- Succinct Non-overlapping Indexing
- Dictionary matching with uneven gaps
- More than 1700 years of word equations
- Permuted scaled matching
- Real-time streaming string-matching
- Simple real-time constant-space string matching
- Indexing and querying color sets of images
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Solutions to twisted word equations and equations in virtually free groups
- String-matching and alignment algorithms for finding motifs in NGS data
- Kings, name days, lazy servants and magic
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Access, rank, and select in grammar-compressed strings
- Dictionary matching in a stream
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- An artificial neural network based approach for online string matching/filtering of large databases
- LCS Approximation via Embedding into Local Non-repetitive Strings
- Fast Searching in Packed Strings
- scientific article; zbMATH DE number 3976360 (Why is no real title available?)
- Simple real-time constant-space string matching
- Various improvements to text fingerprinting
- Compact q-gram profiling of compressed strings
- Layouts for improved hierarchical parallel computations
- Simple, compact and robust approximate string dictionary
- Fast and flexible packed string matching
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- scientific article; zbMATH DE number 4126695 (Why is no real title available?)
- A New String Matching Algorithm
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
- scientific article; zbMATH DE number 2119723 (Why is no real title available?)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- Improving deduplication techniques by accelerating remainder calculations
- Streaming periodicity with mismatches
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- Fast entropy-bounded string dictionary look-up with mismatches
- On the decision tree complexity of string matching
- Fast algorithms for two dimensional and multiple pattern matching
- Dynamic algorithms for the Dyck languages
This page was built for publication: Efficient randomized pattern-matching algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799643)
