Problem
The Lalign
program for finding multiple alternative matches via suboptimal alignment is available here.
Given: Two DNA strings and in FASTA format that share some short inexact repeat of 32-40 bp. By "inexact" we mean that may appear with slight modifications (each repeat differ by 3 changes/indels).
Return: The total number of occurrences of as a substring of , followed by the total number of occurrences of as a substring of .
将Lalign
用于通过次优比对发现多个备选匹配的程序,请点击这里。
给出:两个DNA字符串 和 以FASTA格式共享一些短的不精确重复的32-40 bp。所谓“不精确”,是指 可能会稍作修改(每个重复项之间的差异为 3次更改/插入)。
返回:出现的总数 作为的子串 ,然后是出现的总数 作为的子串 。
Sample Dataset
>Rosalind_12 GACTCCTTTGTTTGCCTTAAATAGATACATATTTACTCTTGACTCTTTTGTTGGCCTTAAATAGATACATATTTGTGCGACTCCACGAGTGATTCGTA >Rosalind_37 ATGGACTCCTTTGTTTGCCTTAAATAGATACATATTCAACAAGTGTGCACTTAGCCTTGCCGACTCCTTTGTTTGCCTTAAATAGATACATATTTG
Sample Output
2 2