forked from Shivi91/Rosalind-1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
039_LEXV.py
31 lines (25 loc) · 883 Bytes
/
039_LEXV.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
#!/usr/bin/env python
'''
A solution to a ROSALIND bioinformatics problem.
Problem Title: Ordering Strings of Varying Length Lexicographically
Rosalind ID: LEXV
Rosalind #: 039
URL: http://rosalind.info/problems/lexv/
'''
from itertools import product
with open('data/rosalind_lexv.txt') as input_data:
A, n = [line.strip() for line in input_data.readlines()]
A = ['*'] + A.split()
n = int(n)
lexv = []
for item in product(A, repeat = n):
# Include all items without *'s.
if '*' not in item:
lexv.append(''.join(item))
else:
# Items with only trailing *'s should also be included with the *'s removed.
for i in range(1,n):
if ''.join(item[i:n]) == '*'*(n-i) and '*' not in item[:i]:
lexv.append(''.join(item).replace('*',''))
with open('output/039_LEXV.txt', 'w') as output_data:
output_data.write('\n'.join(lexv))