Two-way string-matching
From MaRDI portal
Recommendations
- String matching under a general matching relation
- On string matching with mismatches
- String matching with involutions
- Generalized String Matching
- Publication:4206395
- String Processing and Information Retrieval
- Efficient string-matching allowing for non-overlapping inversions
- Scaled and permuted string matching
- scientific article; zbMATH DE number 4078846
Cited in
(58)- The factors analysis and algorithm implementation of single-pattern matching
- Unbordered partial words
- Repetitions in strings: algorithms and combinatorics
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- String-matching on ordered alphabets
- Efficient CRCW-PRAM algorithms for universal substring searching
- Constant-space string-matching in sublinear average time
- Three one-way heads cannot do string matching
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- The zooming method: A recursive approach to time-space efficient string-matching
- Partial words and the critical factorization theorem
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
- Squares, cubes, and time-space efficient string searching
- Bifix codes and Sturmian words
- Indeterminate string factorizations and degenerate text transformations
- String matching with simple devices
- Inferring strings from Lyndon factorization
- Towards optimal packed string matching
- Partial words and the critical factorization theorem revisited
- On unique factorizations of primitive words.
- Periods in extensions of words
- A multidimensional critical factorization theorem
- Words with unbounded periodicity complexity
- Simple real-time constant-space string matching
- Dictionary matching in a stream
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- scientific article; zbMATH DE number 4135398 (Why is no real title available?)
- On the Relation between Periodicity and Unbordered Factors of Finite Words
- scientific article; zbMATH DE number 4078846 (Why is no real title available?)
- Simple real-time constant-space string matching
- A note on a simple computation of the maximal suffix of a string
- Fast parallel Lyndon factorization with applications
- An algorithmic toolbox for periodic partial words
- Density of Critical Factorizations
- Generic Algorithms for Factoring Strings
- String matching with lookahead
- Constructing words with high distinct square densities
- Critical factorisation in square-free words
- On the density of Lyndon roots in factors
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Longest Lyndon Substring After Edit
- Watson-Crick Conjugate and Commutative Words
- A proof of the extended Duval's conjecture
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- Recurrence and periodicity in infinite words from local periods
- Operation insertion on the conjugacy and commutativity of words
- Efficient parameterized pattern matching in sublinear space
- N-cube string matching algorithm with long texts
- The Ehrenfeucht-Silberger problem
- How the character comparison order shapes the shift function of on-line pattern matching algorithms
- Subsequence matching and LCS with segment number constraints
- Substring complexity in sublinear space
- Linear-time computation of local periods
- Characteristic Sturmian words are extremal for the critical factorization theorem
- Finding an optimal alphabet ordering for Lyndon factorization is hard
- Covers in optimal space
- The structure of subword graphs and suffix trees of Fibonacci words
- Necklaces and bracelets in R
This page was built for publication: Two-way string-matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302850)
