Number of different binary functions generated by NK -Kauffman networks and the emergence of genetic robustness
Por:
Romero D., Zertuche F.
Publicada:
1 ene 2007
Resumen:
We determine the average number (N,K) of NK -Kauffman networks that give rise to the same binary function. We show that for N1, there exists a connectivity critical value Kc such that (N,K) ? eN (>0) for K< Kc and (N,K) ?1 for K> Kc. We find that Kc is not a constant but scales very slowly with N as Kc ? log2 log2 (2Nln 2). The problem of genetic robustness emerges as a statistical property of the ensemble of NK -Kauffman networks and impose tight constraints in the average number of epistatic interactions that the genotype-phenotype map can have. © 2007 American Institute of Physics.
Filiaciones:
Romero D.:
Instituto de Matemáticas, Universidad Nacional Autónoma de ?xico, Unidad Cuernavaca, A.P. 273-3, Cuernavaca, Morebs 62251, Mexico
Zertuche F.:
Instituto de Matemáticas, Universidad Nacional Autónoma de ?xico, Unidad Cuernavaca, A.P. 273-3, Cuernavaca, Morebs 62251, Mexico
All Open Access; Green
|