Sciweavers

44 search results - page 6 / 9
» The Distance Between Randomly Constructed Genomes
Sort
View
CIKM
2005
Springer
15 years 5 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
15 years 9 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
COMBINATORICA
2011
13 years 11 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 11 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
BMCBI
2005
189views more  BMCBI 2005»
14 years 11 months ago
Quantitative inference of dynamic regulatory pathways via microarray data
Background: The cellular signaling pathway (network) is one of the main topics of organismic investigations. The intracellular interactions between genes in a signaling pathway ar...
Wen-Chieh Chang, Chang-Wei Li, Bor-Sen Chen