Parallel algorithm for pattern matching problems under substring consistent equivalence relations

DOI10.4230/LIPICS.CPM.2022.28MaRDI QIDQ6496858zbMATH OpenFDO

Authors Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara

Publication date 6 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2022.28

zbMATH Keywords

parallel algorithmpattern matchingsubstring consistent equivalence relation

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(3)

• Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm
• Computing maximal palindromes in non-standard matching models
• Computing maximal palindromes in non-standard matching models

This page was built for publication: Parallel algorithm for pattern matching problems under substring consistent equivalence relations

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