Shortest common supersequence: Difference between revisions
Content added Content deleted
m (omissions) |
(this is wrong) |
||
| Line 3: | Line 3: | ||
Given two strings u and v, find the shortest possible sequence s, which is the shortest common supersequence of u and v where both u and v are a subsequence of s. |
Given two strings u and v, find the shortest possible sequence s, which is the shortest common supersequence of u and v where both u and v are a subsequence of s. |
||
As an example, for the strings 'AACCTTGG' and 'ACACTGTGA' and you should get 'AACTGG'. Sometimes several solutions are possible, though they should all have the same length by definition. This example is taken from a [http://rosalind.info/problems/lcsq/ rosalind task]. |
|||
{{omit from|Brlcad}} |
{{omit from|Brlcad}} |
||