Network growth models and genetic regulatory networks

dc.creatorFoster, D. V.
dc.creatorKauffman, S. A.
dc.creatorSocolar, J. E. S.
dc.date2005-10-04
dc.date2006-05-23
dc.date.accessioned2026-07-07T06:48:36Z
dc.date.available2026-07-07T06:48:36Z
dc.descriptionWe study a class of growth algorithms for directed graphs that are candidate models for the evolution of genetic regulatory networks. The algorithms involve partial duplication of nodes and their links, together with innovation of new links, allowing for the possibility that input and output links from a newly created node may have different probabilities of survival. We find some counterintuitive trends as parameters are varied, including the broadening of indegree distribution when the probability for retaining input links is decreased. We also find that both the scaling of transcription factors with genome size and the measured degree distributions for genes in yeast can be reproduced by the growth algorithm if and only if a special seed is used to initiate the process.
dc.description8 pages with 7 eps figures; uses revtex4. Added references, cleaner figures
dc.identifierhttps://arxiv.org/abs/q-bio/0510009
dc.identifierhttp://arxiv.org/abs/q-bio/0510009
dc.identifierPhys. Rev. E, Vol. 73, 031912 (2006)
dc.identifierdoi:10.1103/PhysRevE.73.031912
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104066
dc.subjectMolecular Networks
dc.titleNetwork growth models and genetic regulatory networks
dc.typetext

Files

Collections