Sequence Alignment problem · 1. Trace back through the filled table, starting dp[m][n] . · 2. When (i, j) …..2a. if it was filled using case 1, go ...
確定! 回上一頁