Efficient randomized pattern-matching algorithms
From MaRDI portal
Publication:3799643
Recommendations
Cited in
(only showing first 100 items - show all)- Sublinear approximate string matching and biological applications
- Improving deduplication techniques by accelerating remainder calculations
- Succinct Non-overlapping Indexing
- Compressed string dictionary search with edit distance one
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Efficient computation of shortest absent words in complete genomes
- Approximate string-matching with \(q\)-grams and maximal matches
- Data compression with long repeated strings
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- On using q-gram locations in approximate string matching
- Sensitivity analysis and efficient method for identifying optimal spaced seeds
- Shift finding in sub-linear time
- Time-space trade-offs for longest common extensions
- Longest common extensions in sublinear space
- A faster quick search algorithm
- Fast two-dimensional pattern matching
- Missing pattern discovery
- Real-time streaming string-matching
- Universal compressed text indexing
- An analysis of the Karp-Rabin string matching algorithm
- Various improvements to text fingerprinting
- Fast and flexible packed string matching
- Layouts for improved hierarchical parallel computations
- Fast searching in packed strings
- Simple, compact and robust approximate string dictionary
- Fast algorithms for two dimensional and multiple pattern matching
- Average-optimal string matching
- A fast algorithm for string matching with mismatches
- On the string matching with \(k\) mismatches
- Streaming periodicity with mismatches
- Compact q-gram profiling of compressed strings
- Multiple filtration and approximate pattern matching
- Fast exact string matching algorithms
- Streaming pattern matching with \(d\) wildcards
- Succinct non-overlapping indexing
- A lower-variance randomized algorithm for approximate string matching
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- scientific article; zbMATH DE number 2119723 (Why is no real title available?)
- Time-space-optimal string matching
- scientific article; zbMATH DE number 4126695 (Why is no real title available?)
- A randomized algorithm for approximate string matching
- Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search
- \(p\)-suffix sorting as arithmetic coding
- Improving on-line construction of two-dimensional suffix trees for square matrices
- Simple real-time constant-space string matching
- Indexing and querying color sets of images
- When can you fold a map?
- Fast Searching in Packed Strings
- Scaled and permuted string matching
- Fast string matching with k differences
- LCS Approximation via Embedding into Local Non-repetitive Strings
- Fast parallel and serial multidimensional approximate array matching
- Bounded similarity querying for time-series data
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Information recovery from randomly mixed-up message text
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- scientific article; zbMATH DE number 3976360 (Why is no real title available?)
- Designing optimal- and fast-on-average pattern matching algorithms
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Resilient dynamic programming
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Efficient index for retrieving top-\(k\) most frequent documents
- Permuted scaled matching
- Simple real-time constant-space string matching
- Constrained tree inclusion
- Efficient string matching with k mismatches
- LCS approximation via embedding into locally non-repetitive strings
- Hardness of optimal spaced seed design
- Time-Space Trade-Offs for Longest Common Extensions
- An introduction to randomized algorithms
- Matching patterns in strings subject to multi-linear transformations
- String Indexing with Compressed Patterns
- Index structures for fast similarity search for symbol strings
- Internal pattern matching queries in a text and applications
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
- Bouma2 -- a high-performance input-aware multiple string-match algorithm
- scientific article; zbMATH DE number 7378715 (Why is no real title available?)
- Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
- Identifying periodic occurrences of a template with applications to protein structure
- Permuted pattern matching algorithms on multi-track strings
- Repetition Detection in a Dynamic String
- Time-space trade-offs for Lempel-Ziv compressed indexing
- A very fast string matching algorithm based on condensed alphabets
- Approximate hashing for bioinformatics
- Computing the maximum exponent in a stream
- Streaming dictionary matching with mismatches
- Can Burrows-Wheeler transform be replaced in chain code compression?
- The complexity of the multiple pattern matching problem for random strings
- A simple grammar-based index for finding approximately longest common substrings
- Bounds for \(c\)-ideal hashing
- Locally consistent decomposition of strings with applications to edit distance sketching
- Space-efficient conversions from SLPs
- Sparse suffix and LCP array: simple, direct, small, and fast
- Weighted approximate parameterized string matching
- Finger search in grammar-compressed strings
- Two-dimensional pattern matching against local and regular-like picture languages
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- scientific article; zbMATH DE number 7758348 (Why is no real title available?)
- Dynamic determination of variable sizes of chunks in a deduplication system
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)
