期刊
BIOINFORMATICS
卷 36, 期 3, 页码 721-727出版社
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btz662
关键词
-
类别
资金
- NSF [DBI-1356529, CCF-551439057, IIS-1453527]
- PSU's College of Engineering Multidisciplinary Seed Grant Program
- National Institute Of General Medical Sciences of the National Institutes of Health [R01GM130691]
Motivation: Algorithmic solutions to index and search biological databases are a fundamental part of bioinformatics, providing underlying components to many end-user tools. Inexpensive next generation sequencing has filled publicly available databases such as the Sequence Read Archive beyond the capacity of traditional indexing methods. Recently, the Sequence Bloom Tree (SBT) and its derivatives were proposed as a way to efficiently index such data for queries about transcript presence. Results: We build on the SBT framework to construct the HowDe-SBT data structure, which uses a novel partitioning of information to reduce the construction and query time as well as the size of the index. Compared to previous SBT methods, on real RNA-seq data, HowDe-SBT can construct the index in less than 36% of the time and with 39% less space and can answer small-batch queries at least five times faster. We also develop a theoretical framework in which we can analyze and bound the space and query performance of HowDe-SBT compared to other SBT methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据