Sciweavers

7106 search results - page 788 / 1422
» Restricted Complexity, General Complexity
Sort
View
178
Voted
RECOMB
2004
Springer
16 years 7 months ago
Discovering temporal relations in molecular pathways using protein-protein interactions
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mi...
Martin Farach-Colton, Yang Huang, John L. L. Woolf...
RECOMB
2004
Springer
16 years 7 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh
206
Voted
RECOMB
2003
Springer
16 years 7 months ago
Modeling dependencies in protein-DNA binding sites
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
Yoseph Barash, Gal Elidan, Nir Friedman, Tommy Kap...
254
Voted
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 7 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 7 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein