Pages that link to "Item:Q2003486"

The following pages link to Computing maximal and minimal trap spaces of Boolean networks (Q2003486):

Displaying 8 items.

• Computing bottom SCCs symbolically using transition guided reduction (Q832201) (← links)
• Modeling multi-valued biological interaction networks using fuzzy answer set programming (Q1795202) (← links)
• Variable stabilisation in Boolean monotonic model pools (Q2112145) (← links)
• Minimal trap spaces of logical models are maximal siphons of their Petri net encoding (Q2112149) (← links)
• Attractor separation and signed cycles in asynchronous Boolean networks (Q2682936) (← links)
• Correspondence of Trap Spaces in Different Models of Bioregulatory Networks (Q3176280) (← links)
• CONTROLLING THE CELL CYCLE RESTRICTION SWITCH ACROSS THE INFORMATION GRADIENT (Q6122182) (← links)
• Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding (Q6175523) (← links)