Sciweavers

1005 search results - page 66 / 201
» On genomic coding theory
Sort
View
BMCBI
2010
214views more  BMCBI 2010»
13 years 8 months ago
AutoSOME: a clustering method for identifying gene expression modules without prior knowledge of cluster number
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
Aaron M. Newman, James B. Cooper
BMCBI
2010
156views more  BMCBI 2010»
13 years 8 months ago
Comparative classification of species and the study of pathway evolution based on the alignment of metabolic pathways
Background: Pathways provide topical descriptions of cellular circuitry. Comparing analogous pathways reveals intricate insights into individual functional differences among speci...
Adi Mano, Tamir Tuller, Oded Béjà, R...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 8 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 2 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
EUROCRYPT
2005
Springer
14 years 1 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...