Sciweavers

75 search results - page 14 / 15
» DNA Sequence Compression Using the Burrows-Wheeler Transform
Sort
View
BMCBI
2007
89views more  BMCBI 2007»
13 years 5 months ago
Comparing segmentations by applying randomization techniques
Background: There exist many segmentation techniques for genomic sequences, and the segmentations can also be based on many different biological features. We show how to evaluate ...
Niina Haiminen, Heikki Mannila, Evimaria Terzi
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 5 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
LCN
1998
IEEE
13 years 10 months ago
Performance of TCP over ABR with Long-Range Dependent VBR Background Traffic over Terrestrial and Satellite ATM networks
Compressed video is well known to be self-similar in nature. We model VBR carrying long-range dependent, multiplexed MPEG-2 video sources traffic. The actual traffic for the model...
Shivkumar Kalyanaraman, Bobby Vandalore, Raj Jain,...
BMCBI
2008
139views more  BMCBI 2008»
13 years 5 months ago
Hierarchical structure of cascade of primary and secondary periodicities in Fourier power spectrum of alphoid higher order repea
Background: Identification of approximate tandem repeats is an important task of broad significance and still remains a challenging problem of computational genomics. Often there ...
Vladimir Paar, Nenad Pavin, Ivan Basar, Marija Ros...
IANDC
2008
141views more  IANDC 2008»
13 years 5 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...