Sciweavers

882 search results - page 149 / 177
» Visibility-driven transfer functions
Sort
View
JOC
2008
86views more  JOC 2008»
13 years 7 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
SPAA
1996
ACM
13 years 12 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
BMCBI
2008
130views more  BMCBI 2008»
13 years 7 months ago
A database of phylogenetically atypical genes in archaeal and bacterial genomes, identified using the DarkHorse algorithm
Background: The process of horizontal gene transfer (HGT) is believed to be widespread in Bacteria and Archaea, but little comparative data is available addressing its occurrence ...
Sheila Podell, Terry Gaasterland, Eric E. Allen
BMCBI
2007
176views more  BMCBI 2007»
13 years 7 months ago
The Firegoose: two-way integration of diverse data from different bioinformatics web resources with desktop applications
Background: Information resources on the World Wide Web play an indispensable role in modern biology. But integrating data from multiple sources is often encumbered by the need to...
J. Christopher Bare, Paul T. Shannon, Amy K. Schmi...
BMCBI
2008
132views more  BMCBI 2008»
13 years 7 months ago
The SeqWord Genome Browser: an online tool for the identification and visualization of atypical regions of bacterial genomes thr
Background: Data mining in large DNA sequences is a major challenge in microbial genomics and bioinformatics. Oligonucleotide usage (OU) patterns provide a wealth of information f...
Hamilton Ganesan, Anna S. Rakitianskaia, Colin F. ...