Network approach to mutagenesis sheds insight on phage resistance in mycobacteria.

A rigorous yet general mathematical approach to mutagenesis, especially one capable of delivering systems-level perspectives would be invaluable. Such systems-level understanding of phage resistance is also highly desirable for phage-bacteria interactions and phage therapy research. Independently, the ability to distinguish between two graphs with a set of common or identical nodes and identify the implications thereof, is important in network science. Herein, we propose a measure called shortest path alteration fraction (SPAF) to compare any two networks by shortest paths, using sets. When SPAF is one, it can identify node pairs connected by at least one shortest path, which are present in either network but not both. Similarly, SPAF equalling zero identifies identical shortest paths, which are simultaneously present between a node pair in both networks. We study the utility of our measure theoretically in five diverse microbial species, to capture reported effects of well-studied mutations and predict new ones. We also scrutinize the effectiveness of our procedure through theoretical and experimental tests on Mycobacterium smegmatis mc2155 and by generating a mutant of mc2155, which is resistant to mycobacteriophage D29. This mutant of mc2155, which is resistant to D29 exhibits significant phenotypic alterations. Whole-genome sequencing identifies mutations, which cannot readily explain the observed phenotypes. Exhaustive analyses of protein-protein interaction network of the mutant and wild-type, using the machinery of topological metrics and differential networks does not yield a clear picture. However, SPAF coherently identifies pairs of proteins at the end of a subset of shortest paths, from amongst hundreds of thousands of viable shortest paths in the networks. The altered functions associated with the protein pairs are strongly correlated with the observed phenotypes. Supplementary data are available at Bioinformatics online.

Informations de copyright

© The Author(s) 2021. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: [e-mail].