This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Parallel algorithm for pattern matching problems under substring consistent equivalence relations

Davaajav Jargalsaikhan    Diptarama Hendrian    Ryo Yoshinaka    Ayumi Shinohara
keywords:
parallel algorithm, substring consistent equivalence relation, pattern matching
category:
\relatedversion

Graduate School of Information Sciences, Tohoku University, Sendai, [email protected] Graduate School of Information Sciences, Tohoku University, Sendai, [email protected]://orcid.org/0000-0002-8168-7312JSPS KAKENHI Grant Number JP19K20208 Graduate School of Information Sciences, Tohoku University, Sendai, [email protected]://orcid.org/0000-0002-5175-465XJSPS KAKENHI Grant Numbers JP18K11150 and JP20H05703 Graduate School of Information Sciences, Tohoku University, Sendai, [email protected]://orcid.org/0000-0002-4978-8316JSPS KAKENHI Grant Number JP21K11745 \CopyrightDavaajav Jargalsaikhan et al.\ccsdesc[500]Theory of computation Pattern matching appears in the proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022) [JargalsaikhanHYS22]\hideLIPIcs