5804 search results - page 1037 / 1161 » Doing more with less |
177
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
234
click to vote
RECOMB
2001
Springer
16 years 6 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
178
click to vote
RECOMB
2001
Springer
16 years 6 months ago
2001
Springer
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
155
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
155
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...