A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...
Yu Peng, Raymond Chi-Wing Wong, Liangliang Ye, Phi...