{'fraction_non_alphanumeric': 0.007920792079207921, 'fraction_numerical': 0.005940594059405941, 'mean_word_length': 5.607843137254902, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reduction of Combinatorial Space of Adjustable Kinetic Parameters of Biochemical Network Models in Optimisation Task

The search for minimal set of adjustable parameters through optimising a kinetic model of biochemical networks is needed in industrial biotechnology to increase the productivity of industrial organism strains while keeping low the chance of causing unwanted side effects of implemented changes. As the search for minimal set of adjustable parameters is of combinatorial nature, the search space becomes very large even at relatively small number of parameters. The presented approach of search space reduction is demonstrated on the example of kinetic model of yeast glycolysis. In parallel to the estimation of remaining range of optimisation potential the full search of combinations was combined with forward selection that allows reaching 91.4% of potential after optimising 625 parameter combinations. This result was reached by involving just seven out of fifteen adjustable parameters.