consistent_subsequence (352B)
1 # Consistent subsequence 2 3 Given a positive set of strings P and negative set of strings N, a *consistent subsequence* is a string S which: 4 - is a [subsequence] of every string in P ([common_subsequence]) 5 - and is a [subsequence] of no string in N ([common_non_subsequence]) 6 7 [Computational_problem]: [consistent_subsequence_problem] 8 9 Up: [subsequence]