RT Journal Article
JF IEEE/ACM Transactions on Computational Biology and Bioinformatics
TI A New Efficient Data Structure for Storage and Retrieval of Multiple Biosequences
A1 S. Steinbiss,
A1 S. Kurtz,
K1 Particle separators
K1 Data structures
K1 reusable libraries.
K1 Data storage representations
K1 biology and genetics
K1 software engineering
AB Today's genome analysis applications require sequence representations allowing for fast access to their contents while also being memory-efficient enough to facilitate analyses of large-scale data. While a wide variety of sequence representations exist, lack of a generic implementation of efficient sequence storage has led to a plethora of poorly reusable or programming language- specific implementations. We present a novel, space-efficient data structure (GtEncseq) for storing multiple biological sequences of variable alphabet size, with customizable character transformations, wildcard support, and an assortment of internal representations optimized for different distributions of wildcards and sequence lengths. For the human genome (3.1 gigabases, including 237 million wildcard characters) our representation requires only 2 + 8 · 10-6 bits per character. Implemented in C, our portable software implementation provides a variety of methods for random and sequential access to characters and substrings (including different reading directions) using an object-oriented interface. In addition, it includes access to metadata like sequence descriptions or character distributions. The library is extensible to be used from various scripting languages. GtEncseq is much more versatile than previous solutions, adding features that were previously unavailable. Benchmarks show that it is competitive with respect to space and time requirements.
PB IEEE Computer Society, [URL:http://www.computer.org]