期刊
BIOINFORMATICS
卷 34, 期 17, 页码 766-772出版社
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/bty567
关键词
-
类别
资金
- Coordenacao de Aperfei-coamento de Pessoal de Nivel Superior (CAPES)-Ciencia sem Fronteiras [BEX 13472/13-5]
- InfectControl 2020 Project [TFP-TV4]
- BMG Project 'Metagenome Analysis Tool' [2515NIK043]
- de.NBI network for bioinformatics infrastructure
- Intel SeqAn IPCC
- IMPRS for Scientific Computing and Computational Biology
Motivation: Mapping-based approaches have become limited in their application to very large sets of references since computing an FM-index for very large databases (e.g. >10 GB) has become a bottleneck. This affects many analyses that need such index as an essential step for approximate matching of the NGS reads to reference databases. For instance, in typical metagenomics analysis, the size of the reference sequences has become prohibitive to compute a single full-text index on standard machines. Even on large memory machines, computing such index takes about 1 day of computing time. As a result, updates of indices are rarely performed. Hence, it is desirable to create an alternative way of indexing while preserving fast search times. Results: To solve the index construction and update problem we propose the DREAM (Dynamic seaRchablE pArallel coMpressed index) framework and provide an implementation. The main contributions are the introduction of an approximate search distributor via a novel use of Bloom filters. We combine several Bloom filters to form an interleaved Bloom filter and use this new data structure to quickly exclude reads for parts of the databases where they cannot match. This allows us to keep the databases in several indices which can be easily rebuilt if parts are updated while maintaining a fast search time. The second main contribution is an implementation of DREAM-Yara a distributed version of a fully sensitive read mapper under the DREAM framework.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据