Old Web
English
Sign In
Acemap
>
Paper
>
Longest Common Subsequence Problem for Numerical Sequences by using Order-Isomorphic-Substrings
Longest Common Subsequence Problem for Numerical Sequences by using Order-Isomorphic-Substrings
2016
Kurihara Masatoshi
Narisawa Kazuyuki
Shinohara Ayumi
Keywords:
Combinatorics
Longest common subsequence problem
Isomorphism
Longest alternating subsequence
Substring
Order isomorphism
Longest increasing subsequence
Dynamic programming
Discrete mathematics
Maximum common subgraph isomorphism problem
Mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]