297 search results - page 5 / 60 » Every Sequence Is Decompressible from a Random One |
126
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length n such that the error probability goes to zero as n goes to infinity....
DCC
2002
IEEE
16 years 1 days ago
2002
IEEE
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...
73
Voted
BIOINFORMATICS
2010
15 years 17 days ago
2010
Motivation: To test whether protein folding constraints and secondary structure sequence preferences significantly reduce the space of amino acid words in proteins, we compared th...
117
click to vote
APPROX
2011
Springer
14 years 13 days ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
119
Voted
BMCBI
2007
15 years 17 days ago
2007
Background: Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such ...