This disclosure provides systems and methods for sample processing and data analysis. Sample processing may include nucleic acid sample processing and subsequent sequencing. Some or all of a nucleic acid sample may be sequenced to provide sequence information, which may be stored or otherwise maintained in an electronic storage location. The sequence information may be analyzed with the aid of a computer processor, and the analyzed sequence information may be stored in an electronic storage location that may include a pool or collection of sequence information and analyzed sequence information generated from the nucleic acid sample. Methods and systems of the present disclosure can be used, for example, for the analysis of a nucleic acid sample, for producing one or more libraries, and for producing biomedical reports. Methods and systems of the disclosure can aid in the diagnosis, monitoring, treatment, and prevention of one or more diseases and conditions.

This disclosure provides systems and methods for sample processing and data analysis. Sample processing may include nucleic acid sample processing and subsequent sequencing. Some or all of a nucleic acid sample may be sequenced to provide sequence information, which may be stored or otherwise maintained in an electronic storage location. The sequence information may be analyzed with the aid of a computer processor, and the analyzed sequence information may be stored in an electronic storage location that may include a pool or collection of sequence information and analyzed sequence information generated from the nucleic acid sample. Methods and systems of the present disclosure can be used, for example, for the analysis of a nucleic acid sample, for producing one or more libraries, and for producing biomedical reports. Methods and systems of the disclosure can aid in the diagnosis, monitoring, treatment, and prevention of one or more diseases and conditions.

The invention relates to an in silico screening method to identify candidate excipients for reducing aggregation of a protein in a formulation. The method combines computational molecular modeling and molecular dynamics simulations to identify sites on a protein where non-specific self-interaction and interaction of different test excipients may occur, determine the relative binding energies of such interactions, and select one or more test excipients that meet specified interaction criteria for use as candidate excipients in empirical screening studies.

The invention relates to an in silico screening method to identify candidate excipients for reducing aggregation of a protein in a formulation. The method combines computational molecular modeling and molecular dynamics simulations to identify sites on a protein where non-specific self-interaction and interaction of different test excipients may occur, determine the relative binding energies of such interactions, and select one or more test excipients that meet specified interaction criteria for use as candidate excipients in empirical screening studies.

Methods of designing a polynucleotide sequence for expressing a polypeptide-of-interest in a cell are provided. Also provided are artificial transcript sequences generated according to the present teachings. Further provided are methods of estimating the adaptiveness of a transcript sequence encoding a polypeptide-of-interest to a gene expression machinery in a cell.

Methods of designing a polynucleotide sequence for expressing a polypeptide-of-interest in a cell are provided. Also provided are artificial transcript sequences generated according to the present teachings. Further provided are methods of estimating the adaptiveness of a transcript sequence encoding a polypeptide-of-interest to a gene expression machinery in a cell.

A method for generating binding peptides presented by any given Major Histocompatibility Complex (MHC) protein is presented. The method includes, given a peptide and an MHC protein pair, enabling a Reinforcement Learning (RL) agent to interact with and exploit a peptide mutation environment by repeatedly mutating the peptide and observing an observation score of the peptide, learning to form a mutation policy, via a mutation policy network, to iteratively mutate amino acids of the peptide to obtain desired presentation scores, and generating, based on the desired presentation scores, qualified peptides and binding motifs of MHC Class I proteins.

A method for generating binding peptides presented by any given Major Histocompatibility Complex (MHC) protein is presented. The method includes, given a peptide and an MHC protein pair, enabling a Reinforcement Learning (RL) agent to interact with and exploit a peptide mutation environment by repeatedly mutating the peptide and observing an observation score of the peptide, learning to form a mutation policy, via a mutation policy network, to iteratively mutate amino acids of the peptide to obtain desired presentation scores, and generating, based on the desired presentation scores, qualified peptides and binding motifs of MHC Class I proteins.

Cell free nucleic acids from a test sample obtained from an individual are analyzed to identify possible fusion events. Cell free nucleic acids are sequenced and processed to generate fragments. Fragments are decomposed into kmers and the kmers are either analyzed de novo or compared to targeted nucleic acid sequences that are known to be associated with fusion gene pairs of interest. Thus, kmers that may have originated from a fusion event can be identified. These kmers are consolidated to generate gene ranges from various genes that match sequences in the fragment. A candidate fusion event can be called given the spanning of one or more gene ranges across the fragment.

Cell free nucleic acids from a test sample obtained from an individual are analyzed to identify possible fusion events. Cell free nucleic acids are sequenced and processed to generate fragments. Fragments are decomposed into kmers and the kmers are either analyzed de novo or compared to targeted nucleic acid sequences that are known to be associated with fusion gene pairs of interest. Thus, kmers that may have originated from a fusion event can be identified. These kmers are consolidated to generate gene ranges from various genes that match sequences in the fragment. A candidate fusion event can be called given the spanning of one or more gene ranges across the fragment.