Approximate pattern matching and transitive closure logics.

DOI10.1016/S0304-3975(02)00484-XzbMath1040.68035MaRDI QIDQ1874401

Lauri Hella, Kjell Lemström

Publication date: 25 May 2003

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

zbMATH Keywords

Combinatorial pattern matchingretrievalLogic in computingMusic information

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast string matching with k differences
• Counting quantifiers, successor relations, and logarithmic space
• Relationships between nondeterministic and deterministic tape complexities
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Finding approximate patterns in strings
• Algorithms for approximate string matching
• The theory and computation of evolutionary distances: Pattern recognition
• Algorithms on Strings, Trees and Sequences

This page was built for publication: Approximate pattern matching and transitive closure logics.