Home > other >  [for] two sequences with a Python implementation of global alignment/dynamic programming
[for] two sequences with a Python implementation of global alignment/dynamic programming

Time:10-18

Sequence 1: AACGTACTCA;
The sequence 2: TCGTACTCT,
Requirements: using the python language programming to achieve the above two sequences based on the thought of dynamic planning of global alignment, and output, respectively, the following rate under the rule of optimal ratio on the results,
Scoring rules:
(1) the match: 9, mismatch=6, insertion deletion of==- 2 points;
(2) the match: 9, mismatch=3, insertion deletion of==- 2 points.

Everyone who help me the meat chicken QAQ
  • Related