837 search results - page 2 / 168 » Dynamic Burrows-Wheeler Transform |
177
Voted
SPIRE
2009
Springer
16 years 27 days 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 ...
176
Voted
CSB
2002
IEEE
15 years 11 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...
178
Voted
IPPS
2010
IEEE
15 years 4 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...
111
Voted
DCC
1998
IEEE
15 years 10 months ago
1998
IEEE
146
Voted
SODA
2004
ACM
15 years 7 months ago
2004
ACM
