THPep: A machine learning-based approach for predicting tumor homing peptides

In the present era, a major drawback of current anti-cancer drugs is the lack of satisfactory specificity towards tumor cells. Despite the presence of several therapies against cancer, tumor homing peptides are gaining importance as therapeutic agents. In this regard, the huge number of therapeutic peptides generated in recent years, demands the need to develop an effective and interpretable computational model for rapidly, effectively and automatically predicting tumor homing peptides. Therefore, a sequence-based approach referred herein as THPep has been developed to predict and analyze tumor homing peptides by using an interpretable random forest classifier in concomitant with amino acid composition, dipeptide composition and pseudo amino acid composition. An overall accuracy and Matthews correlation coefficient of 90.13% and 0.76, respectively, were achieved from the independent test set on an objective benchmark dataset. Upon comparison, it was found that THPep was superior to the existing method and holds high potential as a useful tool for predicting tumor homing peptides. For the convenience of experimental scientists, a web server for this proposed method is provided publicly at http://codes.bio/thpep/.     

Importance of the choice of assumptions and models in the estimation of analytical quality specifications

The validity of any model depends on its ability to imagine the situation or problem to which it is applied. Further, the assumptions made in relation to the model are determining for the actual outcome. Within the field of clinical biochemistry a lot of models for analytical quality specifications, based on a variety of concepts and ’clinical settings’, have been proposed. A hierarchical structure for application of these approaches and models has been agreed on at several occasions in 1999. In this hierarchy, the highest rank is given to evaluation of analytical quality specifications based on ’clinical settings’/’clinical outcome’ models, followed by specifications based on biological variation and on ’clinicians opinions’. This contribution, deals with the problems of combining random and systematic errors and the implications of application of different models to a variety of clinical settings. Received: 1 June, 2002 Accepted: 17 July 2002 Presented at the European Conference on Quality in the Spotlight in Medical Laboratories, 7–9 October 2001, Antwerp, Belgium     

Analysis of RNA sequence structure maps by exhaustive enumeration I. Neutral networks

Summary Global relations between RNA sequences and secondary structures are understood as mappings from sequence space into shape space. These mappings are investigated by exhaustive folding of allGC andAU sequences with chain lengths up to 30. The computed structural data are evaluated through exhaustive enumeration and used as an exact reference for testing analytical results derived from mathematical models and sampling based on statistical methods. Several new concepts of RNA sequence to secondary structure mappings are investigated, among them that ofneutral networks (being sets of sequences folding into the same structure). Exhaustive enumeration allows to test several previously suggested relations: the number of (minimum free energy) secondary structures as a function of the chain length as well as the frequency distribution of structures at constant chain length (commonly resulting in generalized forms ofZipf's law).

---

Analyse der Beziehungen zwischen RNA-Sequenzen und Sekundärstrukturen durch vollständige Faltung, 1. Mitt. Faltung, Neutrale Netzwerke

Zusammenfassung Die globalen Benziehungen zwischen RNA-Sequenzen und Sekundärstrukturen werden als Abbildungen aus einem Raum aller Sequenzen in einen Raum aller Strukturen aufgefaßt. Diese Abbildungen werden durch Falten aller binären Sequenzen desGC-undAU-Alphabets mit Kettenlängen bis zun=30 untersucht. Die berechneten Strukturdaten werden durch vollständiges Abzählen ausgewertet und als eine exakte Referenz zum Überprüfen analytischer Resultate aus mathematischen Modellen sowie zum Testen statistisch erhobener Proben verwendet. Einige neuartige Konzepte zur Beschreibung der Beziehungen zwischen Sequenzen und Strukturen werden eingehend untersucht, unter ihnen der Begriff derneutralen Netzwerke. Ein neutrales Netzwerk besteht aus allen Sequenzen, die eine bestimmte Struktur ausbilden. Vollständiges Abzählen ermöglicht beispielsweise die Bestimmung aller Strukturen minimaler freier Energie in Abhängigkeit von der Kettenlänge ebenso wie die Bestimmung der Häufigkeitsverteilungen der Strukturen bei konstanten Kettenlängen. Die letzteren folgen einer verallgemeinerten FormZipfschen Gesetzes.

     

Large cycles in random generalized Johnson graphs

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.     

带有随机初值的复值Ginzburg-Landau方程的弱平均动力学*

本文研究了无界域上的带有随机初值的复值Ginzburg-Landau方程.首先, 基于解过程的全局适定性, 建立了带有随机初值的Ginzburg-Landau方程的平均随机动力系统.然后, 证明了弱拉回平均随机吸引子的存在唯一性以及随机吸引子的周期性,并将其进一步推广到加权空间L²(?, L²_σ(R)).     

Spectra of graphs and fractal dimensions II

This paper continues the study of exponentsd(x), d (x), d _R (x) andd (x) for graphG; and the nearest neighbor random walk {X _n } _nN onG, if the starting pointX ₀=x is fixed. These exponents are responsible for the geometric, resistance, diffusion and spectral properties of the graph. The main concern of this paper is the relation of these exponents to the spectral density of the transition matrix. A series of new exponentse, e ,e _R ,e are introduced by allowingx to vary along the vertices. The results suggest that the geometric and resistance properties of the graph are responsible for the diffusion speed on the graph.     

Dynamic structure factor in a random diffusion model

Let {X _t:0} denote random walk in the random waiting time model, i.e., simple random walk with jump ratew ^–1(X _t), where {w(x):x^d} is an i.i.d. random field. We show that (under some mild conditions) theintermediate scattering function F(q,t)=E ₀ (q^d) is completely monotonic int (E ₀ denotes double expectation w.r.t. walk and field). We also show that thedynamic structure factor S(q, w)=2 ₀ cos(t)F(q, t) exists for 0 and is strictly positive. Ind=1, 2 it diverges as 1/||^1/2, resp. –ln(||), in the limit 0; ind3 its limit value is strictly larger than expected from hydrodynamics. This and further results support the conclusion that the hydrodynamic region is limited to smallq and small such that ||D |q|², whereD is the diffusion constant.     

On three conjectures by K. E. Shuler

Some fifteen years ago, Shuler formulated three conjectures relating to the large-time asymptotic properties of a nearest-neighbor random walk on ² that is allowed to make horizontal steps everywhere but vertical steps only on a random fraction of the columns. We give a proof of his conjectures for the situation where the column distribution is stationary and satisfies a certain mixing codition. We also prove a strong form of scaling to anisotropic Brownian motion as well as a local limit theorem. The main ingredient of the proofs is a large-deviation estimate for the number of visits to a random set made by a simple random walk on . We briefly discuss extensions to higher dimension and to other types of random walk.Dedicated to Prof. K. E. Shuler on the occasion of his 70th birthday, celebrated at a Symposium in his honor on July 13, 1992, at the University of California at San Diego, La Jolla, California.     

Structural aspects of antibody-antigen interaction revealed through small random peptide libraries

Summary Two small random peptide libraries, one composed of 4550 dodecapeptides and one of 8000 tripeptides, were synthesized in newly developed credit-card format miniPEPSCAN cards (miniPEPSCAN libraries). Each peptide was synthesized in a discrete well (455 peptides/card). The two miniPEPSCAN libraries were screened with three different monoclonal antibodies (Mabs). Two other random peptide libraries, expressed on the wall of bacteria (recombinant libraries) and composed of 10⁷ hexa- and octapeptides, were screened with the same three Mabs. The aim of this study was to compare the amino acid sequence of peptides selected from small and large pools of random peptides and, in this way, investigate the potential of small random peptide libraries. The screening of the two miniPEPSCAN libraries resulted in the identification of a surprisingly large number of antibody-binding peptides, while the screening of the large recombinant libraries, using the same Mabs, resulted in the identification of only a small number of peptides. The large number of peptides derived from the small random peptide libraries allowed the determination of consensus sequences. These consensus sequences could be related to small linear and nonlinear parts of the respective epitopes. The small number of peptides derived from the large random peptide libraries could only be related to linear epitopes that were previously mapped using small libraries of overlapping peptides covering the antigenic protein. Thus, with respect to the cost and speed of identifying peptides that resemble linear and nonlinear parts of epitopes, small diversity libraries based on synthetic peptides appear to be superior to large diversity libraries based on expression systems.Abbreviations ABTS 2,2-azino-di-3-ethylbenzthiazoline sulfonate - EGF epidermal growth factor - Mab monoclonal antibody - OD_ccd optical density obtained using CCD camera - RAMPO rabbit-antimouse peroxidase - SDS sodium dodecylsulfate - TGEV transmissible gastroenteritis virus     

A “Multiplicative Coboundary” theorem for some sequences of random matrices

Schmidt(¹⁰) showed that if the family of distributions of the partial sums of a strictly stationary random sequence is tight, then that random sequence is a coboundary. Here an analog of that result is proved for some sequences of random matrices, with partial sums replaced by matrix products.