On the complexity of indeterminate strings matching
From MaRDI portal
Cites work
- k-approximate quasiperiodicity under Hamming and edit distance
- A Compact Index for Cartesian Tree Matching
- A fast algorithm for order-preserving pattern matching
- A linear time algorithm for consecutive permutation pattern matching
- A theory of parameterized pattern matching
- A unifying look at data structures
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- Algorithms for jumbled pattern matching in strings
- Alphabet dependence in parameterized matching
- An introduction to abstract algebra
- Approximate Cartesian tree matching: an approach using swaps
- Approximate parameterized matching
- Binary jumbled string matching for highly run-length compressible texts
- Cartesian Tree Matching and Indexing
- Computational and Information Science
- Computing longest common subsequence under Cartesian-tree matching model
- Covering problems for partial words and for indeterminate strings
- Design and implementation of an efficient priority queue
- Edit distance in near-linear time: it's a constant factor
- Edit distance of run-length encoded strings.
- Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
- Efficient pattern matching in elastic-degenerate texts
- Efficient string matching with k mismatches
- Enhanced covers of regular and indeterminate strings using prefix tables
- Error detecting and error correcting codes
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Fast Cartesian tree matching
- Fast multiple pattern Cartesian tree matching
- Fast pattern-matching on indeterminate strings
- Finding patterns and periods in Cartesian tree matching
- Finding periods in Cartesian tree matching
- scientific article; zbMATH DE number 1809602 (Why is no real title available?)
- scientific article; zbMATH DE number 3949728 (Why is no real title available?)
- scientific article; zbMATH DE number 2119723 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- scientific article; zbMATH DE number 7724221 (Why is no real title available?)
- Indeterminate strings, prefix arrays \& undirected graphs
- k-Abelian Pattern Matching
- Lower bounds for the number of repetitions in 2D strings
- Matching patterns with variables under edit distance
- Order-preserving matching
- Order-preserving pattern matching indeterminate strings
- Order-preserving pattern matching with \(k\) mismatches
- Parameterized matching with mismatches
- Parameterized pattern matching: Algorithms and applications
- Pattern matching with don't cares and few errors
- Pattern Matching with Swaps
- Pattern Matching with Swaps for Short Patterns in Linear Time
- Pattern matching with swaps in practice
- Period recovery of strings over the Hamming and edit distances
- Reconstructing parameterized strings from parameterized suffix and LCP arrays
- Sequence similarity measures based on bounded Hamming distance
- String matching with up to k swaps and mismatches
- String matching with variable length gaps
- The string edit distance matching problem with moves
- The String-to-String Correction Problem
This page was built for publication: On the complexity of indeterminate strings matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851435)
