计算序列之间的相似性矩阵

# Let's read the sequences from the uploaded file and calculate the sequence similarity matrix.

# Read the sequences from the uploaded file
file_path = '/mnt/data/similar_seq.txt'
with open(file_path, 'r') as file:
    sequences = file.read().split('>')[1:]  # Split the sequences and ignore the first empty split

# Parse the sequences into a dictionary
seq_dict = {}
for seq in sequences:
    lines = seq.strip().split('\n')
    header = lines[0].split()[0]
    sequence = ''.join(lines[1:])
    seq_dict[header] = sequence

# Extract headers and sequences
headers = list(seq_dict.keys())
sequences = list(seq_dict.values())

# Function to calculate sequence similarity
def calculate_similarity(seq1, seq2):
    matches = sum(a == b for a, b in zip(seq1, seq2))
    return matches / min(len(seq1), len(seq2))  # Normalize by the length of the shorter sequence

# Calculate the similarity matrix
import numpy as np

num_sequences = len(sequences)
similarity_matrix = np.zeros((num_sequences, num_sequences))

for i in range(num_sequences):
    for j in range(num_sequences):
        similarity_matrix[i, j] = calculate_similarity(sequences[i], sequences[j])

similarity_matrix, headers

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

终是蝶衣梦晓楼

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值