6365 search results - page 954 / 1273 » Fast Local Computation Algorithms |
196
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
211
click to vote
GIS
2010
ACM
15 years 4 months ago
2010
ACM
With modern LiDAR technology the amount of topographic data, in the form of massive point clouds, has increased dramatically. One of the most fundamental GIS tasks is to construct...
236
Voted
ISMB
1994
15 years 8 months ago
1994
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...
210
click to vote
PRIB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional...
163
click to vote
HPDC
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we describe Maestro, a dataflow computation framework for Ibis, our Java-based grid middleware. The novelty of Maestro is that it is a self-organizing peer-to-peer s...