2 papers
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…
cs.DS2016
Longest Common Subsequence in at Least Length Order-Isomorphic Substrings
Yohei Ueki, Diptarama, Masatoshi Kurihara +6
We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least length substrings. First, we show a…