Sciweavers

15 search results - page 2 / 3
» A Guaranteed Compression Scheme for Repetitive DNA Sequences
Sort
View
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Compressed Pattern Matching in DNA Sequences
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
Lei Chen, Shiyong Lu, Jeffrey L. Ram
DCC
2007
IEEE
14 years 7 months ago
A Simple Statistical Algorithm for Biological Sequence Compression
This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is ma...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison, Chris ...
DCC
2009
IEEE
14 years 8 months ago
Source Coding Scheme for Multiple Sequence Alignments
Rapid development of DNA sequencing technologies exponentially increases the amount of publicly available genomic data. Whole genome multiple sequence alignments represent a parti...
Pavol Hanus, Janis Dingel, Georg Chalkidis, Joachi...
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
14 years 2 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
DCC
2010
IEEE
14 years 2 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro