Sciweavers

75 search results - page 2 / 15
» DNA Sequence Compression Using the Burrows-Wheeler Transform
Sort
View
IPPS
2010
IEEE
13 years 3 months ago
Exploring parallelism in short sequence mapping using Burrows-Wheeler Transform
Next-generation high throughput sequencing instruments are capable of generating hundreds of millions of reads in a single run. Mapping those reads to a reference genome is an ext...
Doruk Bozdag, Ayat Hatem, Ümit V. Çata...
ALGORITHMICA
2010
164views more  ALGORITHMICA 2010»
13 years 5 months ago
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
Ulrich Lauther, Tamás Lukovszki
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 1 months ago
A Bijective String Sorting Transform
Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compressio...
Joseph Yossi Gil, David Allen Scott
COCOON
2008
Springer
13 years 7 months ago
Damaged BZip Files Are Difficult to Repair
bzip is a program written by Julian Seward that is often used under Unix to compress single files. It splits the file into blocks which are compressed individually using a combinat...
Christian Hundt, Ulf Ochsenfahrt
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
12 years 9 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi