Revision as of 07:08, 31 March 2013 (view source) rosettacode>Markhobley m (omissions) ← Older edit		Revision as of 07:56, 1 April 2013 (view source) Grondilu (talk \| contribs) (this is wrong) Newer edit →
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. 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}}

Shortest common supersequence (view source)