Approximate pattern matching and transitive closure logics.

DOI10.1016/S0304-3975(02)00484-XMaRDI QIDQ1874401zbMATH OpenFDO

Authors Kjell Lemström, Lauri Hella

Publication date 25 May 2003

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

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00484-X

zbMATH Keywords

Combinatorial pattern matchingLogic in computingMusic informationretrieval

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Reasoning about strings in databases
• Definable relations and first-order query languages over strings
• scientific article; zbMATH DE number 1173828
• scientific article; zbMATH DE number 1303588
• scientific article; zbMATH DE number 1954395

Cites work

• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Algorithms for approximate string matching
• Algorithms on Strings, Trees and Sequences
• Counting quantifiers, successor relations, and logarithmic space
• Fast string matching with k differences
• Finding approximate patterns in strings
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1142308 (Why is no real title available?)
• scientific article; zbMATH DE number 1173828 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• Relationships between nondeterministic and deterministic tape complexities
• The theory and computation of evolutionary distances: Pattern recognition

Cited in

(1)

• Definable relations and first-order query languages over strings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874401)