Permuted scaled matching

DOI10.1016/j.tcs.2016.02.036zbMath1355.68299OpenAlexW2407207612MaRDI QIDQ294926

Ayelet Butman, J. Ian Munro, Noa Lewenstein

Publication date: 16 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.036

zbMATH Keywords

pattern matchingjumbled matchingscaled matching

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Sub-quadratic time and linear space data structures for permutation matching in binary strings
• On approximate jumbled pattern matching in strings
• Scaled and permuted string matching
• Faster two dimensional scaled matching
• Real two dimensional scaled matching
• Real scaled matching
• Efficient text fingerprinting via Parikh mapping
• Time-space-optimal string matching
• Efficient one-dimensional real scaled matching
• Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
• Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
• ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS
• Clustered Integer 3SUM via Additive Combinatorics
• Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
• A fast string searching algorithm
• Deterministic Sampling–A New Technique for Fast Pattern Matching
• Efficient randomized pattern-matching algorithms
• Efficient pattern matching with scaling
• Fast Pattern Matching in Strings
• Alphabet-Independent and Scaled Dictionary Matching
• Permuted Scaled Matching
• On Hardness of Jumbled Indexing

This page was built for publication: Permuted scaled matching