- negate(Literal) - Static method in class mx.unam.iimas.griffin.logic.Literal
-
Creates a literal which is the negated form of the given literal
- NEGATED_BOOLEAN_STATE - Static variable in class mx.unam.iimas.griffin.grn.explorer.io.FileRegExp
-
Regular expression matching a boolean state
- NEGATIVE_REGULATION - Static variable in class mx.unam.iimas.griffin.grn.explorer.io.FileRegExp
-
Regular expression matching a positive regulation
- next() - Method in class mx.unam.iimas.griffin.grn.explorer.attractor.AttractorSetIterator
-
- next() - Method in class mx.unam.iimas.griffin.grn.explorer.topology.IncrementalDistanceIterator
-
- next() - Method in class mx.unam.iimas.griffin.grn.explorer.topology.RadialTopologyIterator
-
- next() - Method in class mx.unam.iimas.griffin.grn.explorer.topology.SequentialTopologyIterator
-
- next() - Method in class mx.unam.iimas.griffin.grn.explorer.topology.StructureIterator
-
- next() - Method in class mx.unam.iimas.griffin.math.Combinations
-
- next() - Method in class mx.unam.iimas.griffin.sat.ModelIterator
-
- NonDominanceTrapSetGraph - Class in mx.unam.iimas.griffin.grn.util
-
A dominance based graph with nodes that are trap sets
Trap sets are induced by stable and consistent sets of implicant relations.
- NonDominanceTrapSetGraph(BDDBooleanNetworkModule) - Constructor for class mx.unam.iimas.griffin.grn.util.NonDominanceTrapSetGraph
-
Creates the corresponding graph given the provided network
- Not - Class in mx.unam.iimas.griffin.logic
-
Negation of a formula tree
- Not(Formula) - Constructor for class mx.unam.iimas.griffin.logic.Not
-
Creates the negation of the tree formula