Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks
From MaRDI portal
Publication:626872
DOI10.1007/S11786-008-0063-5zbMath1205.90305OpenAlexW2017621833MaRDI QIDQ626872
Takeyuki Tamura, Tatsuya Akutsu
Publication date: 19 February 2011
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/99606
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) General biology and biomathematics (92B05)
Related Items (3)
Stability analysis for discrete biological models using algebraic methods ⋮ Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs ⋮ Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
This page was built for publication: Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks
