-
Notifications
You must be signed in to change notification settings - Fork 0
/
SCNLS.py
319 lines (249 loc) · 11.7 KB
/
SCNLS.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
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
from itertools import product
from utils import load_mydict
import numpy as np
from collections import Counter
import multiprocessing
from collections import defaultdict
from itertools import islice
def generate_combinations(length, k):
# generate all possible composition
numbers = list(range(1,k + 1))
all_combinations = list(product(numbers, repeat=length))
return all_combinations
def calculate_entropy_with_expectation(sequence, unknown_symbol='*', amino_acids='ACDEFGHIKLMNPQRSTVWY'):
"""
To calculate the Shannon entropy of an amino acid sequence containing unknown amino acids, the method of maximum entropy is used.
Parameters:
sequence (str): The amino acid sequence containing unknown amino acids (with unknown amino acids represented by *)
unknown_symbol (str): The symbol representing unknown amino acids
amino_acids (str): All possible amino acid characters
Returns:
float: The Shannon entropy of the amino acid sequence
"""
known_part = [aa for aa in sequence if aa != unknown_symbol]
length_known = len(known_part)
length_total = len(sequence)
frequencies_known = Counter(known_part)
frequencies_total = {aa: frequencies_known.get(aa, 0) for aa in amino_acids}
num_unknowns = sequence.count(unknown_symbol)
probability_unknown_each = num_unknowns / len(amino_acids)
for aa in amino_acids:
frequencies_total[aa] += probability_unknown_each
probabilities_total = {aa: freq / length_total for aa, freq in frequencies_total.items()}
entropy = -sum(p * np.log2(p) for p in probabilities_total.values() if p > 0)
return entropy
def get_patterns(sequence, feature_groups, pattern_dict,entropth):
for name in feature_groups:
patterns = feature_groups[name]
for pattern in patterns:
for start_idx in range(0, len(sequence)):
subseq = sequence[start_idx:]
if sum(pattern) > len(subseq):
continue
current_pos = 0
pattern_str = ""
failed_flag = False
for i, num in enumerate(pattern):
if i % 2 == 0: # Keep the sequence part
pattern_str += subseq[current_pos:current_pos + num]
else: # Replace the sequence part with '*'
pattern_str += '*' * num
current_pos += num
if not failed_flag and calculate_entropy_with_expectation(pattern_str)>entropth:
if pattern_str in pattern_dict:
pattern_dict[pattern_str] += 1
else:
pattern_dict[pattern_str] = 1
return pattern_dict
def counting_star(set_name):
i = 0
for item in set_name:
if item == '*':
i+=1
return i
def counting_diversity(set_name):
li = []
for item in set_name:
li.append(item)
return len(set(li))
def filter_gap_sets(select_lent,least_stars_n,entropy_th,final_cout,min_times):
rt_dict = {}
for sets in final_cout:
if len(sets)==select_lent and counting_star(sets)>=least_stars_n and calculate_entropy_with_expectation(sets)>=entropy_th and final_cout[sets]>=min_times:
# print(f'{sets}:{final_cout[sets]}')
rt_dict[sets] = final_cout[sets]
return rt_dict
def pos2seg(seq,listss):
res = []
for posit in listss:
res.append(seq[posit[0]:posit[1]])
return res
def process_segment(index, seg_li, f_ge,maxl,entropthss):
liss = defaultdict(int)
for i, seg in enumerate(seg_li):
#This place to set the minimum entropy of discontinous
local_liss = get_patterns(seg, {maxl: f_ge[maxl]}, {}, entropthss)
for key, value in local_liss.items():
liss[key] += value
print(f'Chunk {index}: process the {i+1} sequence')
print(f'Chunk {index} {len(seg_li)} sequence in total')
return liss
def SCNLS_f(seq_li, f_ge, processnumber,maxl,entropthss):
print(f'There are a total of {len(seq_li)} segments that need to be mined.')
# Split the seq_li into processnumber pieces.
def chunks(data, n):
it = iter(data)
for _ in range(0, len(data), n):
yield list(islice(it, n))
chunked_seq_li = list(chunks(seq_li, len(seq_li) // processnumber))
liss = defaultdict(int)
with multiprocessing.Pool(processes=processnumber) as pool:
results = [pool.apply_async(process_segment, args=(i, chunk, f_ge,maxl,entropthss)) for i, chunk in enumerate(chunked_seq_li)]
for i, result in enumerate(results):
try:
segment_liss = result.get()
for key, value in segment_liss.items():
liss[key] += value
print(f'----------- Completed mining segment {i} --------')
except Exception as e:
print(f'Error processing chunk {i+1}: {e}')
sorted_substring_counts = dict(sorted(liss.items(), key=lambda item: item[1], reverse=True))
final_cout = {}
for name in sorted_substring_counts:
couttt = sorted_substring_counts[name]
n_ame = name.strip('*')
if n_ame not in final_cout:
final_cout[n_ame] = couttt
return final_cout
#define how many processors you used for calculation
#Maxl indicates the length of the list, and k represents the maximum length for a gap or a single continuous segment.
def function_mode(for_digg,k,maxl,processorsnumber,entropthss):
f_ge = {}
# k = 3
# maxl = 8
# processorsnumber = 2
for l in range(1,maxl+1):
combinations = generate_combinations( k,l)
f_ge[l] = combinations
# print(f_ge)
print(f"When the length of the k-th order subset is {k} and the maximum single item length is {l}, there are a total of {len(combinations)} possible scenarios.")
RE = SCNLS_f(for_digg, f_ge, processorsnumber,maxl,entropthss)
Show = 10
for item in RE:
print(f'Pattern:{item}')
print(f'Occurence:{RE[item]}')
Show-=1
if Show==0:
break
from collections import defaultdict
def get_continuous_patterns(s):
substr_freq = defaultdict(int)
for i in range(len(s)):
for j in range(i + 1, len(s) + 1):
substr_freq[s[i:j]] += 1
sorted_freq = sorted(substr_freq.items(), key=lambda x: x[1], reverse=True)
ardicts = {substr: freq for substr, freq in sorted_freq}
return ardicts
def merge_dictionaries(dict1, dict2):
# 创建一个新字典,用于存储合并后的结果
merged_dict = dict1.copy()
for key, value in dict2.items():
if key in merged_dict:
merged_dict[key] += value # 如果键存在,值相加
else:
merged_dict[key] = value # 如果键不存在,直接添加
return merged_dict
def sort_dict_by_value(d, reverse=False):
# 使用 sorted() 函数按值排序,返回一个按键值对排序的列表
sorted_items = sorted(d.items(), key=lambda item: item[1], reverse=reverse)
# 将排序后的键值对列表转换为字典
sorted_dict = dict(sorted_items)
return sorted_dict
def Continuous_mode(segment,cotsm= 10):
results_cd = {}
for strs in segment:
tmp = get_continuous_patterns(strs)
results_cd = merge_dictionaries(results_cd , tmp)
# if ' ' in results_cd:
# del results_cd[' ']
results_cd = sort_dict_by_value(results_cd, reverse=True)
cots = 0
for item in results_cd :
print(item)
print(results_cd[item])
if cots==cotsm:
break
cots+=1
# SCNLS_N(transfered,f_ge,processorsnumber)
# final_count = get_final_dic(transfered,f_ge,processorsnumber)
import argparse
import pandas as pd
def main():
parser = argparse.ArgumentParser(description="Process some parameters.")
# Add parameters
parser.add_argument('--mode', type=str, required=True, help='Mode of operation (e.g., f)')
parser.add_argument('--material', type=str, help='Path to the material file (e.g., example.csv)')
parser.add_argument('--maxgap', type=int, help='Maximum gap allowed (e.g., 5)')
parser.add_argument('--kths', type=int, help='Threshold value (e.g., 3)')
parser.add_argument('--processor', type=int, help='Number of processors to use (e.g., 10)')
parser.add_argument('--entropythreshold', type=float,default=0, help='the entropy threshold')
# Parse parameters
args = parser.parse_args()
#default entropy
entropthss = args.entropythreshold
# Parameters usage
print(f"Mode: {args.mode}")
# Continueous segment extraction
if args.mode == 'f':
# for_digg = ['MQAKINSFFKPSSSSSGQSDFLLRHCAECGAKYAPGDELDEKNHQSFHKDYMYGLPFKGWQNEKAFTSPLKAQLIDTHFS',
# 'FIKNRIVMVSENDSPAHRNKVQEVVKMMEVELGEDWILHQHCKVYLFISSQRISGCLVAEPIKEAFKLIASPDDERQLQKESSSSPSTSIQFGNIVLQREVSKRCRTSDDRLDNGVIVCEEEAKPAVCGIRAIWVSPSNRRKGIATWLLDTTRESFCNNGCMLEKSQLAFSQPSSIGRSFGSKYFGTCSFLLY',
# 'IAASVTTDTDDGLAVWENNRNAIVNTYQRRSAITERSEVLKGCIEKTLKKGSSSVPKNHKKKRNYTQFHLEL']
path = args.material
data = pd.read_csv(path)
# print(data)
segment = list(data['Recommended Segment'])
# print(segment)
# assert(0)
print('Discontinous mode')
function_mode(segment, args.kths, args.maxgap, args.processor,entropthss)
print('--------------------')
print('Continous mode')
Continuous_mode(segment,10)
elif args.mode == 's':
# if not args.segment:
# parser.error("--segment is required when mode is 's'")
for_digg = [args.material]
print('Discontinous mode')
function_mode(for_digg, args.kths, args.maxgap, args.processor,entropthss)
print('--------------------')
print('Continous mode')
Continuous_mode(for_digg,10)
elif args.mode == 'n':
from utils import load_mydict
path = args.material
tranfer_data = load_mydict(path)
transfered = []
for item in tranfer_data:
seq = item[0]
ac = item[2]
segls = item[3]
segmetl = pos2seg(seq,segls)
transfered+= segmetl
# print(transfered)
print('Discontinous mode')
function_mode(transfered, args.kths, args.maxgap, args.processor,entropthss)
print('--------------------')
print('Continous mode')
Continuous_mode(transfered,10)
pass
else:
parser.error(f"Invalid mode: {args.mode}")
if __name__ == "__main__":
main()
# python SCNLS.py --mode f --material example.csv --maxgap 3 --kths 3 --processor 3
# python SCNLS.py --mode n --material 'Arabidopsis thaliana_0.5' --maxgap 3 --kths 3 --processor 10
# python SCNLS.py --mode s --material KKKKRRRJJJJKSJSAIJCOSJAOJD --maxgap 3 --kths 3 --processor 1
"从上述的数据库的收集结果可以看出, 目前可靠的核定位信号的数目太少,这也是目前核定位信号预测方面的主要难点之一。 本文我主要是要利用 NLSdb2003 版以及 NLSdb 2017 版的核定位信号数据库来构建基于核定位信号与非核定位信号的分类模型的数据集。"
'''python SCNLS.py --mode s --material "从上述的数据库的收集结果可以看出, 目前可靠的核定位信号的数目太少,这也是目前核定位 信号预测方面的主要难点之一。 本文我主要是要利用 NLSdb2003 版以及 NLSdb 2017 版的核定位信号数据库来构建基于核定位信号与非核定位信号的分类模型的数据集。" --maxgap 5 --kths
5 --processor 1'''
''' python SCNLS.py --mode s --material KKKKRRRJJrrJJccKSJSArrIJccCOSrrJAccOJDrrasccda --maxgap 3 --entropythreshold 0 --kths 3 --processor 1 '''