Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import string
- def countSubStringMatchRecursive(target, key):
- position = string.find(target, key)
- if position == -1:
- return 0
- else:
- target = target[position + len(key):]
- counter = countSubStringMatchRecursive(target, key) + 1
- return counter
- def countSubStringMatch(target, key):
- counter = 0
- position = string.find(target, key)
- while position != -1:
- counter += 1
- target = target[position + len(key):]
- position = string.find(target, key)
- return counter
- ##target1 = 'atgacatgcacaagtatgcat'
- ##target2 = 'atgaatgcatggatgtaaatgcag'
- ##
- ### key strings
- ##
- ##key10 = 'a'
- ##key11 = 'atg'
- ##key12 = 'atgc'
- ##key13 = 'atgca'
- ##
- ##print countSubStringMatch(target1, key10)
- ##print countSubStringMatch(target1, key11)
- ##print countSubStringMatch(target1, key12)
- ##print countSubStringMatch(target1, key13)
- ##print countSubStringMatch(target2, key10)
- ##print countSubStringMatch(target2, key11)
- ##print countSubStringMatch(target2, key12)
- ##print countSubStringMatch(target2, key13)
- ##print
- ##print countSubStringMatchRecursive(target1, key10)
- ##print countSubStringMatchRecursive(target1, key11)
- ##print countSubStringMatchRecursive(target1, key12)
- ##print countSubStringMatchRecursive(target1, key13)
- ##print countSubStringMatchRecursive(target2, key10)
- ##print countSubStringMatchRecursive(target2, key11)
- ##print countSubStringMatchRecursive(target2, key12)
- ##print countSubStringMatchRecursive(target2, key13)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement