A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A weighted string, also known as a position weight matrix, is a sequence of probability distributions over some alphabet. We revisit the Weighted Shortest Common Supersequence (WSCS) problem, introduced by Amir et al. [SPIRE 2011], that is, the SCS problem on weighted strings. In the WSCS problem, we are given two weighted strings W_1 and W_2 and a threshold Freq on probability, and we are asked to compute the shortest (standard) string S such that both W_1 and W_2 match subsequences of S (notarXiv:1909.11433v1 fatcat:wazrrs4fvfaw7jgtd53bbhvnoe