837 search results - page 2 / 168 » Dynamic Burrows-Wheeler Transform |
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
CSB
2002
IEEE
13 years 9 months ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
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...
DCC
1998
IEEE
13 years 9 months ago
1998
IEEE
SODA
2004
ACM
13 years 6 months ago
2004
ACM
