Sciweavers

247 search results - page 3 / 50
» Scalable propagation-based call graph construction algorithm...
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 9 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 3 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
ESCIENCE
2007
IEEE
13 years 11 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 7 months ago
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
Louis Ibarra