Scaled and permuted string matching

DOI10.1016/J.IPL.2004.09.002MaRDI QIDQ834966zbMATH OpenOpenAlexFDO

Authors Ayelet Butman, Revital Eres, Gad M. Landau

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

algorithmsapproximate string matchingpermutationsscalings

Mathematics Subject Classification ID

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

Recommendations

• String Processing and Information Retrieval
• Permuted scaled matching
• Permuted scaled matching
• String Processing and Information Retrieval
• Permuted Pattern Matching on Multi-track Strings

Cites work

• 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
• 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?)
• 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
• Approximating the maximum consecutive subsums of a sequence
• New algorithms for binary jumbled pattern matching
• Computing abelian complexity of binary uniform morphic words
• Double string tandem repeats
• Orthogonal range searching for text indexing
• Algorithms for jumbled pattern matching in strings
• Permuted Pattern Matching on Multi-track Strings
• Permuted scaled matching
• Sub-quadratic time and linear space data structures for permutation matching in binary strings
• Two-way string-matching
• Dyck words, lattice paths, and abelian borders
• Permuted scaled matching
• Efficient indexes for jumbled pattern matching with constant-sized alphabet
• String Processing and Information Retrieval
• Dyck Words, Lattice Paths, and Abelian Borders
• On approximate jumbled pattern matching in strings
• On prefix normal words and prefix normal forms

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)