Parameterized searching with mismatches for run-length encoded strings
type: Item
instance of: scholarly article
title: Parameterized searching with mismatches for run-length encoded strings
zbMATH Open document ID: 1247.68330
author: Alberto Apostolico
author: Péter L. Erdős
author: Alpár Jüttner
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68U15
zbMATH DE Number: 6093026
zbMATH Keywords: string searching
zbMATH Keywords: parameterized matching
zbMATH Keywords: bipartite graphs
zbMATH Keywords: parametric graph matching
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.03.018
OpenAlex ID: W2077046517
cites work: Alphabet dependence in parameterized matching
cites work: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
cites work: Parameterized pattern matching: Algorithms and applications
cites work: Parameterized matching with mismatches
cites work: Approximate parameterized matching
cites work: Q4247441
cites work: Q3056948
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
DOI: 10.1016/J.TCS.2012.03.018
description: scientific article; zbMATH DE number 6093026