Principles of Adaptive Sorting Revealed by In Silico Evolution

Abstract

Many biological networks have to filter out useful information from a vast excess of spurious interactions. We use computational evolution to predict design features of networks processing ligand categorization. The important problem of early immune response is considered as a case-study. Rounds of evolution with different constraints uncover elaborations of the same network motif we name adaptive sorting. Corresponding network substructures can be identified in current models of immune recognition. Our work draws a deep analogy between immune recognition and biochemical adaptation.

50 pages, 28 figures, including supplementary information

Cited by in corpus (12)

• Intrinsic limits to gene regulation by global crosstalk
• Quantitative Immunology for Physicists
• Physical limit to concentration sensing amid spurious ligands
• Noise and information transmission in promoters with multiple internal states
• The case for absolute ligand discrimination : modeling information processing and decision by immune T cells
• Receptor crosstalk improves concentration sensing of multiple ligands
• Identifying feasible operating regimes for early T-cell recognition: The speed, energy, accuracy trade-off in kinetic proofreading and adaptive sorting
• Untangling the hairball: fitness based asymptotic reduction of biological networks
• Phenotypic spandrel: absolute discrimination and ligand antagonism
• Balancing specificity, sensitivity and speed of ligand discrimination by zero-order ultraspecificity
• Attack and defence in cellular decision-making: lessons from machine learning
• Reliable ligand discrimination in stochastic multistep kinetic proofreading: First passage time vs. product counting strategies