65 search results - page 2 / 13 » On the Kolmogorov-Chaitin Complexity for short sequences |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
MIA
2011
13 years 3 months ago
2011
For the last 15 years, Magnetic Resonance Imaging (MRI) has become a reference examination for cardiac morphology, function and perfusion in humans. Yet, due to the characteristic...
BICOB
2009
Springer
14 years 3 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
BMCBI
2008
13 years 8 months ago
2008
Background: The structure of many eukaryotic cell regulatory proteins is highly modular. They are assembled from globular domains, segments of natively disordered polypeptides and...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...