forked from enormandeau/Scripts
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalignment_clean.py
executable file
·296 lines (244 loc) · 9.28 KB
/
alignment_clean.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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# Clean fasta DNA sequence alignment for sequencing errors
__authors__ = "Eric Normandeau"
__program_name__ = "alignment_clean"
__version_info__ = ('0', '0', '1')
__version__ = '.'.join(__version_info__)
__copyright__ = "Copyright (c) 2011 Eric Normandeau"
__license__ = "GPLv3"
__revision_date__ = "2011-06-10"
# Importing modules
import os
import sys
import re
import getopt
import platform
try:
from Bio import SeqIO
except:
print "This program requires the Biopython library"
sys.exit(0)
# Function definitions
def help():
"""Help attained by typing './program_name.py -h'
"""
_plateform = platform.system()
name = __program_name__
text = """
%s(1) User Commands %s(1)
\033[1mNAME\033[0m
\t%s - Clean fasta DNA sequence alignment for sequencing errors
\033[1mSYNOPSIS\033[0m
\t\033[1mpython %s.py \033[0m[\033[4mOPTIONS\033[0m]
\033[1mDESCRIPTION\033[0m
\tRemove bad regions/nucleotides from a fasta sequence alignment
\t%s takes a fasta alignment file for input and cleans it.
\033[1mOPTIONS\033[0m
\t\033[1m-h, --help\033[0m
\t\tDisplay the help of this program
\t\033[1m-i, --input\033[0m
\t\tInput file
\t\033[1m-o, --output\033[0m
\t\tOutput file
\t\033[1m-l, --lefttrim\033[0m
\t\tNumber of nucleotides to trim on the left
\t\033[1m-r, --righttrim\033[0m
\t\tNumber of nucleotides to trim on the right
\t\033[1m-I, --inserts\033[0m
\t\tRemove inserts found at less than a minimum frequency
\t\tNumber between 0 and 1 (eg: 0.01)
\t\033[1m-s, --snps\033[0m
\t\tRemove snp variants found at less than a minimum frequency
\t\tNumber between 0 and 1 (eg: 0.01)
\t\033[1m-p, --partial\033[0m
\t\tRemove partial duplicates
\t\tPatial duplicates are sequences that begin or end with '-'
\t\tcharacters but are otherwise identical to a sequence that
\t\tdoes not start or end with '-' characters
\t\033[1m-d, --duplicates\033[0m
\t\tRemove exact duplicates
\033[1mAUTHORS\033[0m
\t%s
%s %s %s %s(1)
"""%(name, name, name, name, name, __authors__, name, __version__, \
__revision_date__, name)
if _plateform != 'Windows' and "this is great news":
print text
else:
__Windows__ = "This is an abomination"
remove = ["\033[1m","\033[0m","\033[4m"]
for i in remove:
text = text.replace(i, "")
print text
del(__Windows__) # If only we could...
def short_help(msg):
"""Print short help in case of bad user input
"""
print msg
print "Use -h for help"
sys.exit(0)
def trim_left(names, sequences, lefttrim):
# print "Trimming left"
assert lefttrim < len(sequences[0]), "Left trimming by longer than the sequences"
return names, [s[lefttrim:] for s in sequences]
def trim_right(names, sequences, righttrim):
# print "Trimming right"
assert righttrim < len(sequences[0]), "Left trimming by longer than the sequences"
return names, [s[:-righttrim] for s in sequences]
def remove_inserts(names, sequences, inserts):
# print "Removing low frequency inserts"
for i in sorted(range(len(sequences[0])), reverse=True):
nuc = dict()
nuc["A"] = nuc["C"] = nuc["G"] = nuc["T"] = nuc["-"] = 0
for j in range(len(sequences)):
nuc[sequences[j][i]] += 1
nonuc = nuc["-"]
nucs = [nuc["A"], nuc["C"], nuc["G"], nuc["T"]]
if nonuc > max(nucs) and float(sum(nucs)) / (nonuc + sum(nucs)) < inserts:
sequences = [s[:i] + s[i+1:] for s in sequences]
return names, sequences
def remove_snps(names, sequences, snps):
# print "Removing low frequency snps"
for i in sorted(range(len(sequences[0])), reverse=True):
nuc = dict()
nuc["A"] = nuc["C"] = nuc["G"] = nuc["T"] = nuc["-"] = 0;nuc
for j in range(len(sequences)):
nuc[sequences[j][i]] += 1
nuc.pop("-")
most_frequent = "none"
maximum = 0
for n in nuc:
if nuc[n] > maximum:
maximum = nuc[n]
most_frequent = n
nucs = list(sorted([nuc["A"], nuc["C"], nuc["G"], nuc["T"]], reverse = True))
if nucs[0] > nucs[1] and float((sum(nucs) - nucs[0])) / sum(nucs) < snps:
sequences = [s[:i] + most_frequent + s[i+1:]
if s[i] != "-" else s for s in sequences]
return names, sequences
def remove_partial(names, sequences, partial):
# print "Removing redundant partial sequences"
for i in sorted(range(len(sequences)), reverse=True):
left_pad = len(re.findall("^-*", sequences[i])[0])
right_pad = len(re.findall("-*$", sequences[i])[0])
if left_pad > 0:
temp_sequences = [s[left_pad:] for s in sequences]
set_sequences = set(temp_sequences[:i] + temp_sequences[i+1:])
if temp_sequences[i] in set_sequences:
names = names[:i] + names[i+1:]
sequences = sequences[:i] + sequences[i+1:]
if right_pad > 0:
temp_sequences = [s[:right_pad] for s in sequences]
set_sequences = set(temp_sequences[:i] + temp_sequences[i+1:])
if temp_sequences[i] in set_sequences:
names = names[:i] + names[i+1:]
sequences = sequences[:i] + sequences[i+1:]
return names, sequences
def remove_duplicates(names, sequences):
# print "Removing duplicate sequences"
unique_sequences = set()
for i in sorted(xrange(len(sequences)), reverse=True):
seq = sequences[i]
name = names[i]
if seq not in unique_sequences:
unique_sequences.add(seq)
else:
names = names[:i] + names[i+1:]
sequences = sequences[:i] + sequences[i+1:]
return names, sequences
def output_sequences(names, sequences, output_file):
with open(output_file, "w") as f:
for i, name in enumerate(names):
f.write(">" + name + "\n" + sequences[i] + "\n")
# Does alignment_clean
# neatify your sequences
# up to your standards?
# The program itself
if __name__ == "__main__":
try:
opts, args = getopt.getopt(sys.argv[1:], "hi:o:l:r:I:s:pd", ["help",
"input=", "output=", "lefttrim=", "righttrim=", "inserts=",
"snps=", "partial", "duplicate"])
except getopt.GetoptError, e:
short_help("Input error. Use -h for help")
lefttrim = 0
righttrim = 0
inserts = 0
snps = 0
partial = False
duplicate = False
for option, value in opts:
if option in ('-h', '--help'):
help()
sys.exit(0)
elif option in ('-i', '--input'):
input_file = value
try:
with open(input_file) as test:
pass
except:
short_help("Input Error: No input file specified or file not found.")
elif option in ('-o', '--output'):
output_file = value
try:
with open(output_file, "w") as test:
pass
except:
short_help("Output Error: No output file specified or incorect path.")
elif option in ('-l', '--lefttrim'):
try:
lefttrim = int(value)
assert lefttrim >= 0
except:
short_help("Positive integer needed for 'lefttrim' option")
elif option in ('-r', '--righttrim'):
try:
righttrim = int(value)
assert righttrim >= 0
except:
short_help("Positive integer needed for 'righttrim' option")
elif option in ('-I', '--inserts'):
try:
inserts = float(value)
assert 0 <= inserts <= 1
except:
short_help("Number between 0 and 1 needed for 'inserts' option")
elif option in ('-s', '--snps'):
try:
snps = float(value)
assert 0 <= snps <= 1
except:
short_help("Number between 0 and 1 needed for 'snps' option")
elif option in ('-p', '--partial'):
partial = True
elif option in ('-d', '--duplicates'):
duplicate = True
# print __program_name__, __version__
# print __copyright__
# print
fasta_sequences = SeqIO.parse(open(input_file),'fasta')
names = []
sequences = []
for seq in fasta_sequences:
names.append(seq.id)
sequences.append(seq.seq.tostring())
# print " -", len(sequences[0]), len(sequences)
if lefttrim > 0:
names, sequences = trim_left(names, sequences, lefttrim)
# print " -", len(sequences[0]), len(sequences)
if righttrim > 0:
names, sequences = trim_right(names, sequences, righttrim)
# print " -", len(sequences[0]), len(sequences)
names, sequences = remove_inserts(names, sequences, inserts)
# print " -", len(sequences[0]), len(sequences)
names, sequences = remove_snps(names, sequences, snps)
# print " -", len(sequences[0]), len(sequences)
if partial == True:
names, sequences = remove_partial(names, sequences, partial)
# print " -", len(sequences[0]), len(sequences)
if duplicate == True:
names, sequences = remove_duplicates(names, sequences)
# print " -", len(sequences[0]), len(sequences)
output_sequences(names, sequences, output_file)
# print "Done"