{'fraction_non_alphanumeric': 0.023809523809523808, 'fraction_numerical': 0.0015873015873015873, 'mean_word_length': 5.373737373737374, '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}}
Parameterized Complexity of Finding Elementary Modes in Metabolic Networks

The concept of elementary (flux) modes provides a rigorous description of pathways in metabolic networks. Finding the elementary modes with minimum number of reactions (shortest elementary modes) is an interesting problem and has potential uses in various applications. However, this problem is NP-hard. This work is an initial step to analyze this problem from a parameterized computation view. With the number of reactions in elementary modes as natural parameter, we prove that finding the shortest elementary modes in metabolic networks is W[1]-hard.