Problem
A local alignment of two strings and is an alignment of substrings and of and , respectively. Let denote the score of an optimal alignment of and with respect to some predetermined alignment score.
Given: Two protein strings and in FASTA format (each having length at most 1000 aa).
Return: A maximum alignment score along with substrings and of and , respectively, which produce this maximum alignment score (multiple solutions may exist, in which case you may output any one). Use:
- The PAM250 scoring matrix.
- Linear gap penalty equal to 5.
甲局部比对两个串 和是对准子串和 的和,分别。让表示一个的得分最佳比对的和相对于某一预定的比对评分。
给定:两个蛋白质串 ,格式为FASTA(每个长度最大为1000aa)。
返回:与子沿最大比对分数和的和,分别,即产生该最大比对得分(多个解决方案可能存在,在这种情况下,你可输出任何一种)。采用:
Sample Dataset
>Rosalind_80 MEANLYPRTEINSTRING >Rosalind_21 PLEASANTLYEINSTEIN
Sample Output
23 LYPRTEINSTRIN LYEINSTEIN