-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSequenceAllign.py
More file actions
68 lines (58 loc) · 1.91 KB
/
Copy pathSequenceAllign.py
File metadata and controls
68 lines (58 loc) · 1.91 KB
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
import sys
def read_sequence(file_path):
with open(file_path, 'r') as file:
return file.readline().strip()
def global_alignment(seq1, seq2, match_score=1, gap_cost=1):
m, n = len(seq1), len(seq2)
dp = [[0 for _ in range(n+1)] for _ in range(m+1)]
for i in range(m+1):
dp[i][0] = -i * gap_cost
for j in range(n+1):
dp[0][j] = -j * gap_cost
for i in range(1, m+1):
for j in range(1, n+1):
match = dp[i-1][j-1] + (match_score if seq1[i-1] == seq2[j-1] else -match_score)
delete = dp[i-1][j] - gap_cost
insert = dp[i][j-1] - gap_cost
dp[i][j] = max(match, delete, insert)
align1, align2 = "", ""
i, j = m, n
while i > 0 and j > 0:
score_current = dp[i][j]
score_diagonal = dp[i-1][j-1]
score_up = dp[i][j-1]
score_left = dp[i-1][j]
if score_current == score_diagonal + (match_score if seq1[i-1] == seq2[j-1] else -match_score):
align1 += seq1[i-1]
align2 += seq2[j-1]
i -= 1
j -= 1
elif score_current == score_left - gap_cost:
align1 += seq1[i-1]
align2 += '-'
i -= 1
elif score_current == score_up - gap_cost:
align1 += '-'
align2 += seq2[j-1]
j -= 1
while i > 0:
align1 += seq1[i-1]
align2 += '-'
i -= 1
while j > 0:
align1 += '-'
align2 += seq2[j-1]
j -= 1
align1 = align1[::-1]
align2 = align2[::-1]
return align1, align2
def main():
file_path1 = sys.argv[1]
file_path2 = sys.argv[2]
seq1 = read_sequence(file_path1)
seq2 = read_sequence(file_path2)
align1, align2 = global_alignment(seq1, seq2)
print(align1)
print(align2)
if __name__ == "__main__":
main()