Approximate pattern matching and transitive closure logics.
type: Item
instance of: scholarly article
title: Approximate pattern matching and transitive closure logics.
zbMATH Open document ID: 1040.68035
DOI: 10.1016/S0304-3975(02)00484-X
author: Kjell Lemström
author: Lauri Hella
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1915577
zbMATH Keywords: Logic in computing
zbMATH Keywords: Combinatorial pattern matching
zbMATH Keywords: Music information
zbMATH Keywords: retrieval
MaRDI profile type: Publication
cites work: Q4849531
cites work: Counting quantifiers, successor relations, and logarithmic space
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q4227581
cites work: Fast string matching with k differences
cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming
cites work: Q4397727
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: The theory and computation of evolutionary distances: Pattern recognition
cites work: Algorithms for approximate string matching
cites work: Finding approximate patterns in strings
cites work: Q4385524
description: scientific article; zbMATH DE number 1915577