Fast-SL: An efficient algorithm to identify synthetic lethal reaction sets in metabolic networks

TL;DR

Fast-SL is a novel algorithm that significantly accelerates the identification of synthetic lethal reaction sets in metabolic networks by reducing the search space, enabling higher-order lethal set analysis more efficiently.

Contribution

The paper introduces Fast-SL, an efficient algorithm that drastically reduces computational time for finding synthetic lethal reaction sets, outperforming existing methods like SL Finder.

Findings

Fast-SL reduces the search space for lethal triplets by over 4000-fold in E. coli.

Fast-SL achieves substantial speed-up compared to exhaustive methods.

Fast-SL outperforms SL Finder in computational efficiency.

Abstract

Synthetic lethal reaction/gene-sets are sets of reactions/genes where only the simultaneous removal of all reactions/genes in the set abolishes growth of an organism. In silico, synthetic lethal sets can be identified by simulating the effect of removal of gene sets from the reconstructed genome-scale metabolic network of an organism. Flux balance analysis (FBA), based on linear programming, has emerged as a powerful tool for the in silico analyses of metabolic networks. To identify all possible synthetic lethal reactions combinations, an exhaustive sampling of all possible combinations is computationally expensive. We surmount the computational complexity of exhaustive search by iteratively restricting the sample space of reaction combinations for search, resulting in a substantial reduction in the running time. We here propose an algorithm, Fast-SL, which provides an efficient way to analyse metabolic networks for higher order lethal reaction sets. Fast-SL offers a substantial speed-up through a massive reduction in the search space for synthetic lethals; in the case of E. coli, Fast-SL reduces the search space for synthetic lethal triplets by over 4000-fold. Fast-SL also compares favourably with SL Finder, an algorithm for identifying synthetic lethal sets, by Suthers et al (2009), which involves the solution of a bi-level Mixed Integer Linear Programming problem. We have implemented the Fast-SL algorithm in MATLAB, building upon COBRA toolbox v2.0.