scientific article; zbMATH DE number 7724221

DOI10.4230/LIPICS.MFCS.2021.48MaRDI QIDQ6168464zbMATH OpenFDO

Authors Paweł Gawrychowski, Florin Manea, Stefan Siemer

Publication date 8 August 2023

Full work available at URL https://arxiv.org/abs/2106.06249

zbMATH Keywords

conditional lower boundsHamming distancematching algorithmspattern with variablespatterns with structural restrictions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(8)

• Evaluation of string comparators for record linkage in Chinese environment
• Matching patterns with variables under edit distance
• Matching patterns with variables under Simon's congruence
• The equivalence problem of E-pattern languages with regular constraints is undecidable
• On the complexity of indeterminate strings matching
• The equivalence problem of E-pattern languages with length constraints is undecidable
• The equivalence problem of E-pattern languages with regular constraints is undecidable
• Pattern matching with pair correlation distance

This page was built for publication:

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