Φορτώνει......
Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks
A Boolean network (BN) is a mathematical model of genetic networks. We propose several algorithms for control of singleton attractors in BN. We theoretically estimate the average-case time complexities of the proposed algorithms, and confirm them by computer experiments. The results suggest the impo...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , , , , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Springer
2008
|
| Θέματα: | |
| Διαθέσιμο Online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3171397/ https://ncbi.nlm.nih.gov/pubmed/18795107 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2008/521407 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|