Algorithms for jumbled pattern matching in strings
type: Item
instance of: scholarly article
zbMATH Open document ID: 1246.68273
DOI: 10.1142/S0129054112400175
author: Péter Burcsi
author: Ferdinando Cicalese
author: Gabriele Fici
author: Zsuzsanna Lipták
published in: International Journal of Foundations of Computer Science
publication date: 2012-08-30T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68U15
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 6073948
zbMATH Keywords: Parikh vectors
zbMATH Keywords: permuted strings
zbMATH Keywords: pattern matching
zbMATH Keywords: string algorithms
zbMATH Keywords: average case analysis
MaRDI profile type: Publication
cites work: Efficient text fingerprinting via Parikh mapping
cites work: The Boyer–Moore–Galil String Searching Strategies Revisited
cites work: A fast string searching algorithm
cites work: Scaled and permuted string matching
cites work: Algorithmic complexity of protein identification: Combinatorics of weighted strings
cites work: Q5538132
cites work: Fast Pattern Matching in Strings
title: Algorithms for jumbled pattern matching in strings
description: scientific article; zbMATH DE number 6073948