基于稀疏矩阵的分布式多对多蛋白质序列比对
Distributed Many-to-Many Protein Sequence Alignment using Sparse Matrices
摘要:
相似蛋白质序列的识别是许多计算生物学流程中的核心步骤,例如同源蛋白质序列的检测,用于下游分析的相似蛋白质图的生成,功能注释和基因定位。蛋白质相似性搜索的性能和可扩展性已被证明是许多生物信息学管道中的瓶颈,这是由于廉价且丰富的测序数据的增加。本文介绍了一种新的分布式存储软件PASTIS。PASTIS依赖于稀疏矩阵计算来有效识别可能相似的蛋白质。我们使用分布式稀疏矩阵的可扩展性,并表明稀疏矩阵基础设施是一个非常适合蛋白质相似性搜索时,再加上一个完全分布式的字典的序列,允许远程序列请求得到满足。我们的算法在不改变基本稀疏矩阵模型的情况下,在搜索中引入了氨基酸序列替换的独特偏差,从而实现了理想的扩展到数百万个蛋白质序列。
英文摘要:
Identifying similar protein sequences is a core step in many computational biology pipelines such as detection of homologous protein sequences, generation of similarity protein graphs for downstream analysis, functional annotation and gene location. Performance and scalability of protein similarity searches have proven to be a bottleneck in many bioinformatics pipelines due to increases in cheap and abundant sequencing data. This work presents a new distributed-memory software, PASTIS. PASTIS relies on sparse matrix computations for efficient identification of possibly similar proteins. We use distributed sparse matrices for scalability and show that the sparse matrix infrastructure is a great fit for protein similarity searches when coupled with a fully-distributed dictionary of sequences that allows remote sequence requests to be fulfilled. Our algorithm incorporates the unique bias in amino acid sequence substitution in searches without altering the basic sparse matrix model, and in turn, achieves ideal scaling up to millions of protein sequences.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。