The enormous complexity of biological systems at the molecular level must be answered
with powerful computational methods. Computational biology is a young field, but has seen …

It is well established that bitmap indices are efficient for read-only attributes with low attribute
cardinalities. For an attribute with a high cardinality, the size of the bitmap index can be very …

DNA sequencers output a large set of very long biological data strings that we should persist
in databases rather than basic text file systems. Many different data models and database …

Sequence datasets are ubiquitous in modern life-science applications, and querying
sequences is a common and critical operation in many of these applications. The suffix tree …

Publisher Summary This chapter introduces a new algorithm called online and accurate
search technique for Inferring local-alignments on sequences (OASIS), which improves …

With the exponential growth of biological sequence databases, it has become critical to
develop effective techniques for storing, querying, and analyzing these massive data. Suffix …

We present an efficient implementation of a write‐only top‐down construction for suffix trees.
Our implementation is based on a new, space‐efficient representation of suffix trees that …

Large string datasets are common in a number of emerging text and biological database
applications. Common queries over such datasets include both exact and approximate …

With the first human DNA being decoded into a sequence of about 2.8 billion characters,
much biological research has been centered on analyzing this sequence. Theoretically …

Mammalian genomes are typically 3 Gbps (gibabase pairs) in size. The largest public
database NCBI (National Center for Biotechnology Information (http://www. ncbi. nlm. nih …