-
Notifications
You must be signed in to change notification settings - Fork 121
/
048_MOTZ.py
43 lines (34 loc) · 1.3 KB
/
048_MOTZ.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#!/usr/bin/env python
'''
A solution to a ROSALIND bioinformatics problem.
Problem Title: Motzkin Numbers and RNA Secondary Structures
Rosalind ID: MOTZ
Rosalind #: 048
URL: http://rosalind.info/problems/motz/
'''
from scripts import ReadFASTA
def Noncrossing(rna):
'''Returns the number of noncrossing bonding graphs for a given RNA sequence.'''
if len(rna) <= 1:
# Only one possible way to match if the length is at most one.
return 1
else:
# If we've already computed the value, return it!
if rna in noncross_dict:
return noncross_dict[rna]
# Otherwise, calculate the value, add it to the dictionary, and return it.
else:
subintervals = []
for i in xrange(1, len(rna)):
if rna[0] == matchings[rna[i]]:
subintervals.append([rna[1:i],rna[i+1:]])
# Reduce the problem to noncrossing matchings over the matching substrings, and the matchings for the next starting point.
noncross_dict[rna] = (sum([Noncrossing(subint[0])*Noncrossing(subint[1]) for subint in subintervals]) + Noncrossing(rna[1:])) % 1000000
return noncross_dict[rna]
rna = ReadFASTA('data/rosalind_motz.txt')[0][1]
matchings = {'A':'U', 'U':'A', 'C':'G', 'G':'C'}
noncross_dict = {}
noncross = Noncrossing(rna)
print noncross
with open('output/048_MOTZ.txt', 'w') as output_file:
output_file.write(str(noncross))