0
$\begingroup$

So I was practicing optimal alignment algorithm and I was stuck with this question of finding optimal alignment for a string of length m with a string length n ? Also is it possible to run it in theta(n) times. Can anyone help me with this?

$\endgroup$
  • $\begingroup$ You are asking two questions. The usual rule is one question per post. Regarding your first question, consider what happens when all letters of both strings are the same. $\endgroup$ – Yuval Filmus Apr 26 '18 at 6:42
  • $\begingroup$ Please formally define your question. $\endgroup$ – xskxzr Apr 26 '18 at 14:22

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.