On limitations of using scalar equations for analyzing synchronous Boolean networks
Other Title(s)
حول القيود التي تحد استخدام المعادلات المقياسية في تحليل الشبكات البولانية المتزامنة
Joint Authors
al-Utaybi, Sultan Ubayd Sad
Rushdi, Ali Muhammad Ali
Source
Journal of King Abdulaziz University : Engineering Sciences
Issue
Vol. 19, Issue 2 (31 Dec. 2008), pp.41-49, 9 p.
Publisher
King Abdulaziz University Scientific Publishing Center
Publication Date
2008-12-31
Country of Publication
Saudi Arabia
No. of Pages
9
Main Subjects
Abstract EN
A total description of a synchronous Boolean network is typically achieved by a matrix recurrence equation.
A simpler description is possible when such a matrix equation is replaced by a scalar equation or a reduced scalar equation.
Unfortunately, the scalarequation technique suffers from several shortcomings and limitations, both in procedure and results.
We discuss these shortcomings and support our arguments with two illustrative examples.
American Psychological Association (APA)
Rushdi, Ali Muhammad Ali& al-Utaybi, Sultan Ubayd Sad. 2008. On limitations of using scalar equations for analyzing synchronous Boolean networks. Journal of King Abdulaziz University : Engineering Sciences،Vol. 19, no. 2, pp.41-49.
https://search.emarefa.net/detail/BIM-329945
Modern Language Association (MLA)
Rushdi, Ali Muhammad Ali& al-Utaybi, Sultan Ubayd Sad. On limitations of using scalar equations for analyzing synchronous Boolean networks. Journal of King Abdulaziz University : Engineering Sciences Vol. 19, no. 2 (2008), pp.41-49.
https://search.emarefa.net/detail/BIM-329945
American Medical Association (AMA)
Rushdi, Ali Muhammad Ali& al-Utaybi, Sultan Ubayd Sad. On limitations of using scalar equations for analyzing synchronous Boolean networks. Journal of King Abdulaziz University : Engineering Sciences. 2008. Vol. 19, no. 2, pp.41-49.
https://search.emarefa.net/detail/BIM-329945
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 48
Record ID
BIM-329945