From ae4ff6889aeb3cbbecf5a2569a4b9112357a49fb Mon Sep 17 00:00:00 2001 From: Samuel Pastva Date: Wed, 18 Sep 2024 12:59:45 +0200 Subject: [PATCH] Typo. --- biobalm/_sd_attractors/attractor_candidates.py | 2 +- biobalm/succession_diagram.py | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/biobalm/_sd_attractors/attractor_candidates.py b/biobalm/_sd_attractors/attractor_candidates.py index ed70dd8..f49894c 100644 --- a/biobalm/_sd_attractors/attractor_candidates.py +++ b/biobalm/_sd_attractors/attractor_candidates.py @@ -124,7 +124,7 @@ def compute_attractor_candidates( ] if node_data["skipped"]: - # For skip nodes, it does not holds that the successors are the maximal subspaces. + # For skip nodes, it does not hold that the successors are the maximal subspaces. # This means that a skip node can intersect with some other SD node and that intersection # is not a subset of one of its children. In such case, we can use this intersection # to further simplify the attractor detection process. diff --git a/biobalm/succession_diagram.py b/biobalm/succession_diagram.py index 2a2dd70..b67e6d9 100644 --- a/biobalm/succession_diagram.py +++ b/biobalm/succession_diagram.py @@ -1253,7 +1253,7 @@ def expand_block( all attractors, meaning it can get "stuck". However, assuming you want to run full attractor detection anyway, this might save you some time, as you won't need to re-run the failed candidate detection. (This is only relevant for models where the attractors are very - complex and the candidate state detection can fail with default settings) + complex and the candidate state detection can fail with default settings). """ return expand_source_blocks( self,