This shortest common supersequence problem is closely related to the longest common subsequence problem. Given two sequences X = and Y = , a sequence U = is a common supersequence of X and Y if U is a supersequence of both X and Y.
The problems of finding a longest common subsequence of two sequences A and B and a shortest edit scr ipt for transforming A into B have long been known to be dual problems. In this paper, they are shown to be equivalent to finding a shortest/longes
Windowed subsequence matching over deterministic strings has been studied in previous work in the contexts of knowledge discovery, data mining, and molecular biology. However, we observe that in these applications, as well as in data stream monitori
