Sciweavers

15 search results - page 1 / 3
» A Guaranteed Compression Scheme for Repetitive DNA Sequences
Sort
View
DCC
1996
IEEE
13 years 11 months ago
A Guaranteed Compression Scheme for Repetitive DNA Sequences
Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Oliv...
CSB
2002
IEEE
221views Bioinformatics» more  CSB 2002»
14 years 13 days ago
DNA Sequence Compression Using the Burrows-Wheeler Transform
-- 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...
Donald A. Adjeroh, Yong Zhang, Amar Mukherjee, Mat...
BIBE
2010
IEEE
142views Bioinformatics» more  BIBE 2010»
13 years 2 months ago
Compressed q-Gram Indexing for Highly Repetitive Biological Sequences
The study of compressed storage schemes for highly repetitive sequence collections has been recently boosted by the availability of cheaper sequencing technologies and the flood of...
Francisco Claude, Antonio Fariña, Miguel A....
BMCBI
2007
147views more  BMCBI 2007»
13 years 7 months ago
Comparative analysis of long DNA sequences by per element information content using different contexts
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...
Trevor I. Dix, David R. Powell, Lloyd Allison, Jul...
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
14 years 1 months ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson