首页> 外文会议>Advances in bioinformatics and computational biology. >Efficiently Querying Protein Sequences with the Proteinus Index
【24h】

Efficiently Querying Protein Sequences with the Proteinus Index

机译:使用蛋白质索引有效查询蛋白质序列

获取原文
获取原文并翻译 | 示例

摘要

Finding similarities in protein sequences is a core problem in bioinformatics. It represents the first step in the functional characterization of novel protein sequences, and is also employed in protein evolution studies and for predicting biological structure. In this paper, we propose Proteinus, a new index aimed at similarity search of protein sequences. Proteinus is characterized by using a reduced amino acid alphabet to represent protein sequences and also by providing a persistent storage of the index on disk, as well as by allowing the execution of range queries. Performance tests with real-world protein sequences showed that the Proteinus index was very efficient. Compared with the BLASTP tool, Proteinus provided an impressive performance gain from 45% up to 93% for range query processing.
机译:在蛋白质序列中寻找相似性是生物信息学的核心问题。它代表了新蛋白质序列功能表征的第一步,也用于蛋白质进化研究和预测生物学结构。在本文中,我们提出了Proteinus,一种旨在对蛋白质序列进行相似性搜索的新索引。 Proteinus的特征是使用减少的氨基酸字母代表蛋白质序列,还通过在磁盘上提供索引的持久存储,以及允许执行范围查询。对真实蛋白质序列的性能测试表明,Proteinus指数非常有效。与BLASTP工具相比,Proteinus为范围查询处理提供了令人印象深刻的性能提升,从45%到93%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号