Problem
Say that we have two strings and of respective lengths and and an alignment score. Let's define a matrix corresponding to and by setting equal to the maximum score of any alignment that aligns with . So each entry in can be equal to at most the maximum score of any alignment of and .
Given: Two DNA strings and in FASTA format, each having length at most 1000 bp.
Return: The maximum alignment score of a global alignment of and , followed by the sum of all elements of the matrix corresponding to and that was defined above. Apply the mismatch score introduced in “Finding a Motif with Modifications”.
说我们有两个字符串 和 各自长度 和 和对齐分数。让我们定义一个矩阵 对应于 和 通过设置 等于任何对齐的最大分数 与 。因此,每个条目 最多等于任何对齐方式的最大分数 和 。
给出:两个DNA字符串 和 以FASTA格式,每个长度最多1000 bp。
返回值:全局对齐方式的最大对齐方式得分 和 ,然后是矩阵所有元素的总和 对应于 和 上面定义的 应用“查找具有修饰的图案”中引入的不匹配分数
Sample Dataset
>Rosalind_35 ATAGATA >Rosalind_5 ACAGGTA
Sample Output
3 -139