Scaled and permuted string matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1044854 (Why is no real title available?)
- scientific article; zbMATH DE number 2087057 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A fast string searching algorithm
- Algorithms for the Longest Common Subsequence Problem
- Algorithms on Strings, Trees and Sequences
- Combinatorial Pattern Matching
- Efficient pattern matching with scaling
- Efficient randomized pattern-matching algorithms
- Fast Pattern Matching in Strings
- Matching patterns in strings subject to multi-linear transformations
- Real scaled matching
- Two-dimensional pattern matching with rotations
Cited in
(18)- Permuted pattern matching algorithms on multi-track strings
- Computing abelian complexity of binary uniform morphic words
- New algorithms for binary jumbled pattern matching
- String Processing and Information Retrieval
- Permuted scaled matching
- Sub-quadratic time and linear space data structures for permutation matching in binary strings
- Permuted scaled matching
- Dyck Words, Lattice Paths, and Abelian Borders
- On prefix normal words and prefix normal forms
- Permuted Pattern Matching on Multi-track Strings
- On approximate jumbled pattern matching in strings
- Approximating the maximum consecutive subsums of a sequence
- Two-way string-matching
- Orthogonal range searching for text indexing
- Double string tandem repeats
- Algorithms for jumbled pattern matching in strings
- Dyck words, lattice paths, and abelian borders
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
This page was built for publication: Scaled and permuted string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834966)
