Data-independent acquisition (DIA) is becoming a leading analysis method in biomedical mass spectrometry. The main advantages include greater reproducibility and sensitivity and a greater dynamic range compared with data-dependent acquisition (DDA). However, the data analysis is complex and often requires expert knowledge when dealing with large-scale data sets.
View Article and Find Full Text PDFBackground: The human leucocyte antigen (HLA) complex controls adaptive immunity by presenting defined fractions of the intracellular and extracellular protein content to immune cells. Understanding the benign HLA ligand repertoire is a prerequisite to define safe T-cell-based immunotherapies against cancer. Due to the poor availability of benign tissues, if available, normal tissue adjacent to the tumor has been used as a benign surrogate when defining tumor-associated antigens.
View Article and Find Full Text PDFPersonalized multipeptide vaccines are currently being discussed intensively for tumor immunotherapy. In order to identify epitopes-short, immunogenic peptides-suitable for eliciting a tumor-specific immune response, human leukocyte antigen-presented peptides are isolated by immunoaffinity purification from cancer tissue samples and analyzed by liquid chromatography-coupled tandem mass spectrometry (LC-MS/MS). Here, we present MHCquant, a fully automated, portable computational pipeline able to process LC-MS/MS data automatically and generate annotated, false discovery rate-controlled lists of (neo-)epitopes with associated relative quantification information.
View Article and Find Full Text PDFReactivation of the BK polyomavirus is known to lead to severe complications in kidney transplant patients. The current treatment strategy relies on decreasing the immunosuppression to allow the immune system to clear the virus. Recently, we demonstrated a clear association between the resolution of BKV reactivation and reconstitution of BKV-specific CD4 T-cells.
View Article and Find Full Text PDFInfluenza vaccination is a common approach to prevent seasonal and pandemic influenza. Pre-existing antibodies against close viral strains might impair antibody formation against previously unseen strains-a process called original antigenic sin. The role of this pre-existing cellular immunity in this process is, despite some hints from animal models, not clear.
View Article and Find Full Text PDFGene-order-based comparison of multiple genomes provides signals for functional analysis of genes and the evolutionary process of genome organization. Gene clusters are regions of co-localized genes on genomes of different species. The rapid increase in sequenced genomes necessitates bioinformatics tools for finding gene clusters in hundreds of genomes.
View Article and Find Full Text PDFMotivation: Recombined T- and B-cell receptor repertoires are increasingly being studied using next generation sequencing (NGS) in order to interrogate the repertoire composition as well as changes in the distribution of receptor clones under different physiological and disease states. This type of analysis requires efficient and unambiguous clonotype assignment to a large number of NGS read sequences, including the identification of the incorporated V and J gene segments and the CDR3 sequence. Current tools have deficits with respect to performance, accuracy and documentation of their underlying algorithms and usage.
View Article and Find Full Text PDFMotivation: Large insertions of novel sequence are an important type of structural variants. Previous studies used traditional de novo assemblers for assembling non-mapping high-throughput sequencing (HTS) or capillary reads and then tried to anchor them in the reference using paired read information.
Results: We present approaches for detecting insertion breakpoints and targeted assembly of large insertions from HTS paired data: BASIL and ANISE.
Background: The center string (or closest string) problem is a classic computer science problem with important applications in computational biology. Given k input strings and a distance threshold d, we search for a string within Hamming distance at most d to each input string. This problem is NP complete.
View Article and Find Full Text PDF