297 search results - page 7 / 60 » Every Sequence Is Decompressible from a Random One |
71
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
ALMOB
2007
14 years 11 months ago
2007
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
70
Voted
COMBINATORICS
2000
14 years 10 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
145
Voted
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
71
Voted
BMCBI
2007
14 years 11 months ago
2007
Background: False occurrences of functional motifs in protein sequences can be considered as random events due solely to the sequence composition of a proteome. Here we use a nume...