Search bioRxiv⌕ Search

Biology subjects

Brookes, D. H.

Publications and source records attributed to Brookes, D. H..

2 recordsLinked to original sources

Machine learning-based library design improves packaging and diversity of adeno-associated virus (AAV) libraries

Adeno-associated viruses (AAVs) hold tremendous promise as delivery vectors for clinical gene therapy, but they need improvement. AAVs with enhanced properties, such as more efficient and/or cell-type specific infection, can be engineered by creating a large, diverse starting library and screening for desired phenotypes, in some cases iteratively. Although this approach has succeeded in numerous specific cases, such as infecting cell types from the brain to the lung, the starting libraries often contain a high proportion of variants unable to assemble or package their genomes, a general prerequisite for engineering any gene delivery goal. Herein, we develop and showcase a machine learning (ML)-based method for systematically designing more effective starting libraries -- ones that have broadly good packaging capabilities while being as diverse as possible. Such carefully designed but general libraries stand to significantly increase the chance of success in engineering any property of interest. Furthermore, we use this approach to design a clinically-relevant AAV peptide insertion library that achieves 5-fold higher packaging fitness than the state-of-the-art library, with negligible reduction in diversity. We demonstrate the general utility of this designed library on a downstream task to which our approach was agnostic: infection of primary human brain tissue. The ML-designed library had approximately 10-fold more successful variants than the current state-of-the-art library. Not only should our new library serve useful for any number of other engineering goals, but our library design approach itself can also be applied to other types of libraries for AAV and beyond.

bioengineering↗

On the sparsity of fitness functions and implications for learning

Fitness functions map biological sequences to a scalar property of interest. Accurate estimation of these functions yields biological insight and sets the foundation for model-based sequence design. However, the amount of fitness data available to learn these functions is typically small relative to the large combinatorial space of sequences; characterizing how much data is needed for accurate estimation remains an open problem. There is a growing body of evidence demonstrating that empirical fitness functions display substantial sparsity when represented in terms of epistatic interactions. Moreover, the theory of Compressed Sensing provides scaling laws for the number of samples required to exactly recover a sparse function. Motivated by these results, we develop a framework to study the sparsity of fitness functions sampled from a generalization of the NK model, a widely-used random field model of fitness functions. In particular, we present results that allow us to test the effect of the Generalized NK (GNK) models interpretable parameters--sequence length, alphabet size, and assumed interactions between sequence positions--on the sparsity of fitness functions sampled from the model and, consequently, the number of measurements required to exactly recover these functions. We validate our framework by demonstrating that GNK models with parameters set according to structural considerations can be used to accurately approximate the number of samples required to recover two empirical protein fitness functions and an RNA fitness function. In addition, we show that these GNK models identify important higher-order epistatic interactions in the empirical fitness functions using only structural information.

bioinformatics↗