On the computation of fixed points in Boolean networks (Q2511059): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967292023 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1010.0359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of fixed points of the majority rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum number of fixed points in regulatory Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points and maximal independent sets in AND-OR networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear analysis of switching nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithm for Enumerating Maximal Cliques in Complex Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: All maximal independent sets and dynamic dominance for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration aspects of maximal cliques and bicliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Finite Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamics of conjunctive and disjunctive Boolean network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A log-star distributed maximal independent set algorithm for growth-bounded graphs / rank
 
Normal rank

Latest revision as of 20:51, 8 July 2024

scientific article
Language Label Description Also known as
English
On the computation of fixed points in Boolean networks
scientific article

    Statements

    On the computation of fixed points in Boolean networks (English)
    0 references
    0 references
    5 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    Boolean network
    0 references
    fixed points
    0 references
    maximal independent sets
    0 references
    network dynamics
    0 references
    0 references
    0 references