Problem
Given: A positive integer (), a DNA string of length at most 5 kbp representing a motif, and a DNA string of length at most 50 kbp representing a genome.
Return: All substrings of such that the edit distance is less than or equal to . Each substring should be encoded by a pair containing its location in followed by its length.
给定:正整数 (),DNA字符串 最长为5 kbp的长度 表示一个基序和一个DNA串 代表基因组的最大长度不超过50 kbp。
返回:所有子串 的 这样编辑距离 小于或等于 。每个子应该由包含其的一对被编码的位置 在 其次是长度。
Sample Dataset
2 ACGTAG ACGGATCGGCATCGT
Sample Output
1 4 1 5 1 6