So it's a trivial O(1) algorithm to calculate the overlap with the substring positions and lengths.S: CTGCCACCGCTGTGTTTCGGCCGGCGAXXXXXXXXXXXXXXXXXXXXX seq1: CTGCCACCGCTGT (Pos: 0) seq2: ACCGCTGTGTTTCGGCCGGCGA (Pos: 5)
In reply to Re^2: Intersecting Two Strings
by lima1
in thread Intersecting Two Strings
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |