Scaled and permuted string matching

DOI10.1016/j.ipl.2004.09.002zbMath1173.68462OpenAlexW2012621171MaRDI QIDQ834966

Gad M. Landau, Ayelet Butman, Revital Eres

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.002

zbMATH Keywords

permutationsalgorithmsapproximate string matchingscalings

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (12)

Permuted scaled matching ⋮ Computing abelian complexity of binary uniform morphic words ⋮ ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS ⋮ Dyck Words, Lattice Paths, and Abelian Borders ⋮ Approximating the maximum consecutive subsums of a sequence ⋮ Double string tandem repeats ⋮ Unnamed Item ⋮ New algorithms for binary jumbled pattern matching ⋮ Efficient indexes for jumbled pattern matching with constant-sized alphabet ⋮ On approximate jumbled pattern matching in strings ⋮ On prefix normal words and prefix normal forms ⋮ Orthogonal Range Searching for Text Indexing

Cites Work

• Matching patterns in strings subject to multi-linear transformations
• Real scaled matching
• Two-dimensional pattern matching with rotations
• A fast string searching algorithm
• Efficient randomized pattern-matching algorithms
• Efficient pattern matching with scaling
• Fast Pattern Matching in Strings
• Algorithms for the Longest Common Subsequence Problem
• Algorithms on Strings, Trees and Sequences
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scaled and permuted string matching