String match problem
<p>I have two strings:</p>

<p>string1 = "ABCD" </p>

<p>string2 = "-A---C-D-"</p>

<p>and I want to adjust string1 to become sth like "-AB--C-D-" which has max similarity (i.e. min Levenshtein Distance)  with string2.</p>

<p>How can I do that? </p>

<p>Thanks</p>

<hr>

<p>Guys, thanks for replying.</p>

<p>Actually this is a biological problem : align two sequences. </p>

<p>Maybe you guys know BLAST (basic local alignment search tool) which fits I requirement perfectly. Just wandering is there any easier way to accomplish it.</p>
