678 search results - page 114 / 136 » On Complexity Measures for Biological Sequences |
APAL
2010
14 years 11 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
163
click to vote
GIS
2009
ACM
16 years 8 days ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
102
click to vote
CIE
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
116
click to vote
JMLR
2012
13 years 1 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
BMCBI
2010
14 years 11 months ago
2010
Background: Glycobiology pertains to the study of carbohydrate sugar chains, or glycans, in a particular cell or organism. Many computational approaches have been proposed for ana...