Limit cycles and update digraphs in boolean networks

dc.date.accessioned2016-11-29T19:54:55Z
dc.date.available2016-11-29T19:54:55Z
dc.date.created2016-11-29T19:54:55Z
dc.date.issued2013
dc.identifier0166-218X
dc.identifierhttp://hdl.handle.net/10533/129452
dc.identifier1090549
dc.identifierWOS:000310406200001
dc.languageeng
dc.publisherELSEVIER SCIENCE BV
dc.relationhttps://doi.org/10.1016/j.dam.2012.07.003
dc.relation10.1016/j.dam.2012.07.003
dc.relationinfo:eu-repo/grantAgreement/Fondecyt/1090549
dc.relationinfo:eu-repo/semantics/dataset/hdl.handle.net/10533/93477
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleLimit cycles and update digraphs in boolean networks
dc.typeArticulo


Este ítem pertenece a la siguiente institución