Shortest common supersequence: Difference between revisions
Content added Content deleted
(Added Elixir) |
m (added whitespace before the TOC (table of contents), added a ;Task: (bold) header.) |
||
| Line 1: | Line 1: | ||
{{draft task}} |
{{draft task}} |
||
The '''[[wp:shortest common supersequence|shortest common supersequence]]''' is a problem closely related to the [[longest common subsequence]], which you can use as an external function for this task. |
The '''[[wp:shortest common supersequence|shortest common supersequence]]''' is a problem closely related to the [[longest common subsequence]], which you can use as an external function for this task. |
||
| ⚫ | Given two strings <math>u</math> and <math>v</math>, find the shortest possible sequence <math>s</math>, which is the shortest common |
||
;Task: |
|||
| ⚫ | Given two strings <math>u</math> and <math>v</math>, find the shortest possible sequence <math>s</math>, which is the shortest common super-sequence of <math>u</math> and <math>v</math> where both <math>u</math> and <math>v</math> are a subsequence of <math>s</math>. Defined as such, <math>s</math> is not necessarily unique. |
||
Demonstrate this by printing <math>s</math> where <math>u = </math>“<tt>abcbdab</tt>” and <math>v = </math>“<tt>bdcaba</tt>”. |
Demonstrate this by printing <math>s</math> where <math>u = </math>“<tt>abcbdab</tt>” and <math>v = </math>“<tt>bdcaba</tt>”. |
||
<!-- This example is taken from the Wikipedia page. --> |
<!-- This example is taken from the Wikipedia page. --> |
||
<br><br> |
|||
=={{header|C}}== |
=={{header|C}}== |
||