I ran your search subroutine on some hard data, three 'needles', and three different 'haystacks'. I realised that you didn't set a lower limit of consecutive matches, as you'll see from the output below, it even matches when just the first letter of the needle matches the last letter of the haystack.
I was going to try and edit your code myself, but the collection of return statements had me confused, so I was wondering, what would you do to your code to set that lower limit, which should probably be a higher number, like 6, now that I think about it.
Cheers
Sam
Update: Removed redundant linesTTGTCAGCGAAAAAAATTAAAGCGCAAGATTGTTGGTTTTTGCGTGATGGTGACCGGGCAGCCTAAAGGC +TATCCTTAACCAGGGAGCTGATT GCGAAAAAAATTAAAGCGCAAGATTGTTGGTTTTTGCGTGATGGTGAC TTGTCAGCGAAAAAAATTAAAGCG +CAAGATTGTTGGTTTTTGCGTGATGGTGACCGGGCAGCCTAAAGGCTATCCTTAACCAGGGAGCTGATT CGCGACAACCGGAATATGAAAGCAAAGCGCAGCGTCTGAATAACGTTT GAATGTTTTAGCAATCTCTTTCTGTCATGAATCCATGGCAGTGACCATACTA +ATGGTGACTGCCATTGATGGAGGGAGACACAGTGCACTGGCAAACTCACAC CATTACATTGCTGGATAAGAATGTTTTAGCAATCTCTTTCTGTCATGA GAATGTTTTAGCAATCTCTTTCTGTCATGAATCCATGGCAGTGACCATACTAATGGTGACTGCCATTGAT +GGAGGGAGACACAGTGCACTGGCAAACTCACAC + CGCGACAACCGGAATATGAAAGCAAAGCGCAGCGTCT +GAATAACGTTT TAATCAAAACCAATAAACACGAAATAATCCCCATGCCGGTGAAGAAGGGGCGTGACTTTAGCGAAATGTT +GCCGTCGCGACAACCGGAATATGAAAGCAAAGCGCAGCGTCTGAATAACGTTTATGCTGAAAGCGGATG +AATAAGGAGATGCG + + GCGAAAAAAATTAAAGCGCAAGATTGTTGGTTTTTGCGTGATGGTGAC TAATCAAAACCAATAAACACGAAATAATCCCCATGCCGGTGAAGAAGGGGCGTGACTTTAGCGAAATGTT +GCCGTCGCGACAACCGGAATATGAAAGCAAAGCGCAGCGTCTGAATAACGTTTATGCTGAAAGCGGATG +AATAAGGAGATGCG + CGCGACAACCGGAATATGAAAGCAAAGCGCAGCGTCTGAATAACGTTT
In reply to Re^2: Searching for a word that may only exist in part
by seaver
in thread Searching for a word that may only exist in part
by seaver
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |