Generalized String Matching
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Towards unified approximate pattern matching for Hamming and \(L_1\) distance
- Extending alignments with k-mismatches and -gaps
- Modulated string searching
- Approximate pattern matching on elastic-degenerate text
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- Recent advances in text-to-pattern distance algorithms
- Algorithmic combinatorics on partial words
- A unified view to string matching algorithms
- Approximate circular pattern matching
- Resource scheduling with variable requirements over time
- Faster pattern matching with character classes using prime number encoding
- scientific article; zbMATH DE number 1045405 (Why is no real title available?)
- Filtering degenerate patterns with application to protein sequence analysis
- Fast and simple computations using prefix tables under Hamming and edit distance
- Pattern matching with address errors: rearrangement distances
- An algorithm for string matching with a sequence of don't cares
- Swap and mismatch edit distance
- The finite automata approaches in stringology
- Practical KMP/BM style pattern-matching on indeterminate strings
- Pattern matching in a digitized image
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- A black box for online approximate pattern matching
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle
- Can we recover the cover?
- Approximating Approximate Pattern Matching
- Pattern matching in the Hamming distance with thresholds
- An acceleration of FFT-based algorithms for the match-count problem
- A subquadratic algorithm for approximate limited expression matching
- Comparing Degenerate Strings
- String range matching
- Efficient special cases of pattern matching with swaps
- String searching with mismatches using AVX2 and AVX-512 instructions
- Degenerate string comparison and applications
- Even faster elastic-degenerate string matching via fast matrix multiplication
- A randomized numerical aligner (rNA)
- A Black Box for Online Approximate Pattern Matching
- Two-dimensional pattern matching with rotations
- Hardness of comparing two run-length encoded strings
- On the relationship between histogram indexing and block-mass indexing
- The approximate swap and mismatch edit distance
- Computing covers using prefix tables
- A lower-variance randomized algorithm for approximate string matching
- Data structures and algorithms for approximate string matching
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- \(L_{1}\) pattern matching lower bound
- Indeterminate string inference algorithms
- Indexing a sequence for mapping reads with a single mismatch
- \(k\)-difference matching in amortized linear time for all the words in a text
- Indeterminate strings, prefix arrays \& undirected graphs
- scientific article; zbMATH DE number 7758348 (Why is no real title available?)
- Squares and primitivity in partial words
- Hamming Distance Completeness
- Fast algorithms for approximately counting mismatches
- THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
- Two-way string-matching
- Fast pattern-matching on indeterminate strings
- Secure two-party input-size reduction: challenges, solutions and applications
- Longest common extension
- A unifying taxonomy of pattern matching in degenerate strings and founder graphs
- The complexity of approximate pattern matching on de Bruijn graphs
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Time-space tradeoffs for algebraic problems on general sequential machines
- Pattern matching with mismatches and wildcards
- Computing primitively-rooted squares and runs in partial words
- On pattern matching with \(k\) mismatches and few don't cares
- Computing primitively-rooted squares and runs in partial words
- Fast and practical approximate string matching
- Approximate swapped matching.
- Mismatch sampling
- Cumulative memory lower bounds for randomized and quantum computation
- String matching under a general matching relation
- Matching with don't-cares and a small number of mismatches
- Maximal degenerate palindromes with gaps and mismatches
- Algorithms and Computation
- A new approach to regular \& indeterminate strings
- String editing under pattern constraints
- The Burrows-Wheeler transform of an elastic-degenerate string and its application to pattern matching
- On lower bounds for read-\(k\)-times branching programs
- Fast average-case pattern matching by multiplexing sparse tables
- Reconstructing general matching graphs
- An adaptive hybrid pattern-matching algorithm on indeterminate strings
- Pattern matching with don't cares and few errors
- Efficient matching of nonrectangular shapes.
- Circular pattern matching with \(k\) mismatches
- IDPM: an improved degenerate pattern matching algorithm for biological sequences
- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- Quantum time-space tradeoffs for matrix problems
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES
- Generalized function matching
- scientific article; zbMATH DE number 7758337 (Why is no real title available?)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- Finite automata for generalized approach to backward pattern matching
- Inferring an indeterminate string from a prefix graph
- A filtering algorithm for k-mismatch with don't cares
- Pattern matching in hypertext
- Upper and lower bounds for dynamic data structures on strings
- Faster Online Elastic Degenerate String Matching
- On string matching with mismatches
This page was built for publication: Generalized String Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3790661)