Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

BIOINFORMATICS
2004

favoriteEmaildiscussreport

67views more BIOINFORMATICS 2004»

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

13 years 10 months ago

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

Download www.weizmann.ac.il

Nadav Kashtan, Shalev Itzkovitz, Ron Milo, Uri Alo

Real-time Traffic

BIOINFORMATICS 2004 |

claim paper

Related Content

» Counting Stars and Other Small Subgraphs in Sublinear Time

» Efficient classification of complete parameter regions based on semidefinite programming

» Impact of sensorenhanced mobility prediction on the design of energyefficient localization

» Sketching unaggregated data streams for subpopulationsize queries

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	BIOINFORMATICS
Authors	Nadav Kashtan, Shalev Itzkovitz, Ron Milo, Uri Alon

Comments (0)