Efficient and accurate search in petabase-scale sequence repositories

在PB级序列库中进行高效、准确的搜索

阅读:1

Abstract

The amount of biological sequencing data available in public repositories is growing rapidly, forming a critical resource for biomedicine. However, making these data efficiently and accurately full-text searchable remains challenging. Here we build on efficient data structures and algorithms for representing large sequence sets(1-6). We present MetaGraph, a methodological framework that enables us to scalably index large sets of DNA, RNA or protein sequences using annotated de Bruijn graphs. Integrating data from seven public sources(7-13), we make 18.8 million unique DNA and RNA sequence sets and 210 billion amino acid residues across all clades of life-including viruses, bacteria, fungi, plants, animals and humans-full-text searchable. We demonstrate the feasibility of a cost-effective full-text search in large sequence repositories (67 petabase pairs (Pbp) of raw sequence) at an on-demand cost of around US$100 for small queries up to 1 megabase pairs (Mbp) and down to US$0.74 per queried Mbp for large queries. We show that the highly compressed representation of all public biological sequences could fit on a few consumer hard drives (total cost of around US$2,500), making it cost-effective to use and readily transportable for further analysis. We explore several practical use cases to mine existing archives for interesting associations, demonstrating the use of our indexes for integrative analyses, and illustrating that such capabilities are poised to catalyse advancements in biomedical research.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。