Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
BIOINFORMATICS Vol. 20 no. 11 2004, pages 17461758
 

Summary: BIOINFORMATICS
Vol. 20 no. 11 2004, pages 17461758
doi:10.1093/bioinformatics/bth163
Efficient sampling algorithm for estimating
subgraph concentrations and detecting
network motifs
N. Kashtan1,3, S. Itzkovitz1,2, R. Milo1,2 and U. Alon1,2,
1Department of Molecular Cell biology, 2Department of Physics of Complex Systems
and 3Department of Computer Science and Applied Mathematics, Weizmann Institute
of Science, Rehovot 76100, Israel
Received on July 22, 2003; revised on December 2, 2003; accepted on January 8, 2004
Advance Access publication March 4, 2004
ABSTRACT
Summary: Biological and engineered networks have recently
been shown to display network motifs: a small set of charac-
teristic patterns that occur much more frequently than in ran-
domized networks with the same degree sequence. Network
motifs were demonstrated to play key information processing
roles in biological regulation networks. Existing algorithms for
detecting network motifs act by exhaustively enumerating all

  

Source: Alon, Uri - Departments of Molecular Cell Biology & Physics of Complex Systems, Weizmann Institute of Science

 

Collections: Biology and Medicine