Related papers: Statistical Properties of Contact Maps
Protein one-dimensional (1D) structures such as secondary structure and contact number provide intuitive pictures to understand how the native three-dimensional (3D) structure of a protein is encoded in the amino acid sequence. However, it…
We study via Monte Carlo simulation a generalisation of the so-called vertex interacting self-avoiding walk (VISAW) model on the square lattice. The configurations are actually not self-avoiding walks but rather restricted self-avoiding…
While all the information required for the folding of a protein is contained in its amino acid sequence, one has not yet learned how to extract this information to predict the three--dimensional, biologically active, native conformation of…
Modern biological techniques such as Hi-C permit to measure probabilities that different chromosomal regions are close in space. These probabilities can be visualised as matrices called contact maps. In this paper, we introduce a…
Proteins form a very important class of polymers. In spite of major advances in the understanding of polymer science, the protein problem has remained largely unsolved. Here, we show that a polymer chain viewed as a tube not only captures…
The pathway is a biological term that refers to a series of interactions between molecules in a cell that causes a certain product or a change in the cell. Pathway analysis is a powerful method for gene expression analysis. Through pathway…
The random map model is a deterministic dynamical system in a finite phase space with n points. The map that establishes the dynamics of the system is constructed by randomly choosing, for every point, another one as being its image. We…
The high computational cost of carrying out molecular dynamics simulations of even small-size proteins is a major obstacle in the study, at atomic detail and in explicit solvent, of the physical mechanism which is at the basis of the…
We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding…
A two-dimensional square-lattice model for the formation of secondary structures in proteins, the hydrogen-bonding model, is extended to include the effects of solvent quality. This is achieved by allowing configuration-dependent…
Locally activated random walks are defined as random processes, whose dynamical parameters are modified upon visits to given activation sites. Such dynamics naturally emerge in living systems as varied as immune and cancer cells interacting…
Proteins in complex with small molecule ligands represent the core of structure-based drug discovery. However, three-dimensional representations are absent from most deep-learning-based generative models. We here present a graph-based…
Since Darwin, species trees have been used as a simplified description of the relationships which summarize the complicated network $N$ of reality. Recent evidence of hybridization and lateral gene transfer, however, suggest that there are…
We discuss a stochastic approach for reconstructing the native structures of proteins from the knowledge of the "effective connectivity", which is a one-dimensional structural profile constructed as a linear combination of the eigenvectors…
We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected…
We develop a path-based approach to continuous-time random walks on networks with arbitrarily weighted edges. We describe an efficient numerical algorithm for calculating statistical properties of the stochastic path ensemble. After…
The distribution of monomers in a coating of grafted and adsorbing polymers is modelled using a grafted staircase polygon in the square lattice. The adsorbing staircase polygon consists of a bottom and a top lattice path (branches) and the…
The three dimensional structure of DNA in the nucleus (chromatin) plays an important role in many cellular processes. Recent experimental advances have led to high-throughput methods of capturing information about chromatin conformation on…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…