We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the logexpectation score, and refinement using treedependent restricted partitioning. The speed and accuracy of MUSCLE are compared with T-Coffee, MAFFT and CLUSTALW on four test sets of reference alignments: BAliBASE, SABmark, SMART and a new benchmark, PREFAB. MUSCLE achieves the highest, or joint highest, rank in accuracy on each of these sets. Without refinement, MUSCLE achieves average accuracy statistically indistinguishable from T-Coffee and MAFFT, and is the fastest of the tested methods for large numbers of sequences, aligning 5000 sequences of average length 350 in 7 min on a current desktop computer. The MUSCLE program, source code and PREFAB test data are freely available at http://www.drive5. com/muscle.

MUSCLE: multiple sequence alignment with high accuracy and high throughput

Summary. We propose the elastic net, a new regularization and variable selection method. Real world data and a simulation study show that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation. In addition, the elastic net encourages a grouping effect, where strongly correlated predictors tend to be in or out of the model together.The elastic net is particularly useful when the number of predictors (p) is much bigger than the number of observations (n). By contrast, the lasso is not a very satisfactory variable selection method in the

/pdf/regularization-and-variable-selection-via-the-elastic-net-4z8q6j5o0i.pdf

Regularization and variable selection via the elastic net

WHO CLASSIFICATION OF TUMOURS OF HAEMATOPOIETIC AND LYMPHOID TISSUES , WHO CLASSIFICATION OF TUMOURS OF HAEMATOPOIETIC AND LYMPHOID TISSUES , کتابخانه مرکزی دانشگاه علوم پزشکی تهران

WHO Classification of Tumours of Haematopoietic and Lymphoid Tissues

Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

Breast cancer patients with the same stage of disease can have markedly different treatment responses and overall outcome. The strongest predictors for metastases (for example, lymph node status and histological grade) fail to classify accurately breast tumours according to their clinical behaviour. Chemotherapy or hormonal therapy reduces the risk of distant metastases by approximately one-third; however, 70-80% of patients receiving this treatment would have survived without it. None of the signatures of breast cancer gene expression reported to date allow for patient-tailored therapy strategies. Here we used DNA microarray analysis on primary breast tumours of 117 young patients, and applied supervised classification to identify a gene expression signature strongly predictive of a short interval to distant metastases ('poor prognosis' signature) in patients without tumour cells in local lymph nodes at diagnosis (lymph node negative). In addition, we established a signature that identifies tumours of BRCA1 carriers. The poor prognosis signature consists of genes regulating cell cycle, invasion, metastasis and angiogenesis. This gene expression profile will outperform all currently used clinical parameters in predicting disease outcome. Our findings provide a strategy to select patients who would benefit from adjuvant therapy.

/pdf/gene-expression-profiling-predicts-clinical-outcome-of-5bu8dmnf6h.pdf

Gene expression profiling predicts clinical outcome of breast cancer

Identification of chronic kidney disease patients at risk of progressing to end-stage renal disease (ESRD) is essential for treatment decision-making and clinical trial design. Here, we explored whether proton nuclear magnetic resonance (NMR) spectroscopy of blood plasma improves the currently best performing kidney failure risk equation, the so-called Tangri score. Our study cohort comprised 4640 participants from the German Chronic Kidney Disease (GCKD) study, of whom 185 (3.99%) progressed over a mean observation time of 3.70 ± 0.88 years to ESRD requiring either dialysis or transplantation. The original four-variable Tangri risk equation yielded a C statistic of 0.863 (95% CI, 0.831-0.900). Upon inclusion of NMR features by state-of-the-art machine learning methods, the C statistic improved to 0.875 (95% CI, 0.850-0.911), thereby outperforming the Tangri score in 94 out of 100 subsampling rounds. Of the 24 NMR features included in the model, creatinine, high-density lipoprotein, valine, acetyl groups of glycoproteins, and Ca2+-EDTA carried the highest weights. In conclusion, proton NMR-based plasma fingerprinting improved markedly the detection of patients at risk of developing ESRD, thus enabling enhanced patient treatment.

A Novel Metabolic Signature To Predict the Requirement of Dialysis or Renal Transplantation in Patients with Chronic Kidney Disease.

We describe a new algorithm for amino acid sequence classification and the detection of remote homologues. The rationale is to exploit both vertical and horizontal information of a multiple alignment in a well balanced manner. This is in contrast to established methods like profiles and hidden Markov models which focus on vertical information as they model the columns of the alignment independently. In our setting, we want to select from a given database of "candidate sequences" those proteins that belong to a given superfamily. In order to do so, each candidate sequence is separately tested against a multiple alignment of the known members of the superfamily by means of a new jumping alignment algorithm. This algorithm is an extension of the Smith-Waterman algorithm and computes a local alignment of a single sequence and a multiple alignment. In contrast to traditional methods, however, this alignment is not based on a summary of the individual columns of the multiple alignment. Rather, the candidate sequence at each position is aligned to one sequence of the multiple alignment, called the "reference sequence". In addition, the reference sequence may change within the alignment, while each such jump is penalized. To evaluate the discriminative quality of the jumping alignment algorithm, we compared it to hidden Markov models on a subset of the SCOP database of protein domains. The discriminative quality was assessed by counting the number of false positives that ranked higher than the first true positive (FP-count). For moderate FP-counts above five, the number of successful searches with our method was considerably higher than with hidden Markov models.

/pdf/sequence-database-search-using-jumping-alignments-492e78jw4j.pdf

Sequence Database Search Using Jumping Alignments

Spindle-Cell Variants of Primary Cutaneous Follicle Center B-Cell Lymphomas Are Germinal Center B-Cell Lymphomas by Gene Expression Profiling Using a Formalin-Fixed Paraffin-Embedded Specimen.

Motivation: In biomedical research transcriptomic, proteomic or metabolomic profiles of patient samples are often combined with genomic profiles from experiments in cell lines or animal models. Integrating experimental data with patient data is still a challenging task due to the lack of tailored statistical tools.

Results: Here we introduce guided clustering, a new data integration strategy that combines experimental and clinical high-throughput data. Guided clustering identifies sets of genes that stand out in experimental data while at the same time display coherent expression in clinical data. We report on two potential applications: The integration of clinical microarray data with (i) genome-wide chromatin immunoprecipitation assays and (ii) with cell perturbation assays. Unlike other analysis strategies, guided clustering does not analyze the two datasets sequentially but instead in a single joint analysis. In a simulation study and in several biological applications, guided clustering performs favorably when compared with sequential analysis approaches.

Availability:Guided clustering is available as a R-package from http://compdiag.uni-regensburg.de/software/guidedClustering.shtml. Documented R code of all our analysis is included in the Supplementary Materials. All newly generated data are available at the GEO database (GSE29700).

Contact: rainer.spang@klinik.uni-regensburg.de

Supplementary information:Supplementary data are available at Bioinformatics online.

Genomic data integration using guided clustering

MYC is a heterogeneously expressed transcription factor that plays a multifunctional role in many biological processes such as cell proliferation and differentiation. It is also associated with many types of cancer including the malignant lymphomas. There are two types of aggressive B-cell lymphoma, namely Burkitt lymphoma (BL) and a subgroup of diffuse large cell lymphoma (DLBCL), which both carry MYC translocations and overexpress MYC but both differ significantly in their clinical outcome. In DLBCL, MYC translocations are associated with an aggressive behavior and poor outcome, whereas MYC-positive BL show a superior outcome. To shed light on this phenomenon, we investigated the different modes of actions of MYC in aggressive B-cell lymphoma cell lines subdivided into three groups: (i) MYC-positive BL, (ii) DLBCL with MYC translocation (DLBCLpos) and (iii) DLBCL without MYC translocation (DLBCLneg) for control. In order to identify genome-wide MYC-DNA binding sites a chromatin immunoprecipitation followed by high-throughput sequencing (ChIP-Seq) was performed. In addition, ChIP-Seq for H3K4me3 was used for determination of genomic regions accessible for transcriptional activity. These data were supplemented with gene expression data derived from RNA-Seq. Bioinformatics integration of all data sets revealed different MYC-binding patterns and transcriptional profiles in MYC-positive BL and DLBCL cell lines indicating different functional roles of MYC for gene regulation in aggressive B-cell lymphomas. Based on this multi-omics analysis we identified ADGRE5 (alias CD97) - a member of the EGF-TM7 subfamily of adhesion G protein-coupled receptors - as a MYC target gene, which is specifically expressed in BL but not in DLBCL regardless of MYC translocation. Our study describes a diverse genome-wide MYC-DNA binding pattern in BL and DLBCL cell lines with and without MYC translocations. Furthermore, we identified ADREG5 as a MYC target gene able to discriminate between BL and DLBCL irrespectively of the presence of MYC breaks in DLBCL. Since ADGRE5 plays an important role in tumor cell formation, metastasis and invasion, it might also be instrumental to better understand the different pathobiology of BL and DLBCL and help to explain discrepant clinical characteristics of BL and DLBCL.

/pdf/identification-of-adgre5-as-discriminating-myc-target-3ogj128v49.pdf

Rainer Spang

Papers

A Novel Metabolic Signature To Predict the Requirement of Dialysis or Renal Transplantation in Patients with Chronic Kidney Disease.

Sequence Database Search Using Jumping Alignments

Spindle-Cell Variants of Primary Cutaneous Follicle Center B-Cell Lymphomas Are Germinal Center B-Cell Lymphomas by Gene Expression Profiling Using a Formalin-Fixed Paraffin-Embedded Specimen.

Genomic data integration using guided clustering

Identification of ADGRE5 as discriminating MYC target between Burkitt lymphoma and diffuse large B-cell lymphoma