2 papers
cs.DS2022
Parallel algorithm for pattern matching problems under substring consistent equivalence relations
Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka +1
Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrences of the pattern in the text. An equivalence relation is called a sub…
cs.DS2017
Duel and sweep algorithm for order-preserving pattern matching
Davaajav Jargalsaikhan, Diptarama, Ryo Yoshinaka +1
Given a text and a pattern over alphabet , the classic exact matching problem searches for all occurrences of pattern in text . Unlike exact matching problem, ord…