Results 1 to 10 of about 4,837,596 (345)
A unified approach to protein domain parsing with inter-residue distance matrix. [PDF]
Motivation It is fundamental to cut multi-domain proteins into individual domains, for precise domain-based structural and functional studies. In the past, sequence-based and structure-based domain parsing was carried out independently with different ...
Zhu K, Su H, Peng Z, Yang J.
europepmc +2 more sources
Entropy measures of distance matrix [PDF]
Bonchev and Trinajstic defined two distance based entropy measures to measure the molecular branching of molecular graphs in 1977 [Information theory, distance matrix, and molecular branching, J. Chem. Phys., 38 (1977), 4517–4533]. In this paper we use these entropy measures which are based on distance matrices of graphs.
Bünyamin Şahin, Abdulgani Şahin
doaj +7 more sources
Every nonsingular spherical Euclidean Distance Matrix is a resistance distance matrix
Peer ...
Ernesto Estrada
semanticscholar +4 more sources
Keberadaan outlier pada dataset dapat menyebabkan rendahnya hasil akurasi pada proses klasifikasi. Outlier pada dataset dapat dihilangkan pada tahapan prapemrosesan algoritme klasifikasi.
Sugriyono Sugriyono, Maria Ulfah Siregar
doaj +2 more sources
Is Distance Matrix Enough for Geometric Deep Learning? [PDF]
Graph Neural Networks (GNNs) are often used for tasks involving the 3D geometry of a given graph, such as molecular dynamics simulation. While incorporating Euclidean distance into Message Passing Neural Networks (referred to as Vanilla DisGNN) is a ...
Zian Li +3 more
openalex +3 more sources
Spectral properties of the exponential distance matrix [PDF]
Given a graph $G$, the exponential distance matrix is defined entry-wise by letting the $(u,v)$-entry be $q^{\text{dist}(u,v)}$, where $\text{dist}(u,v)$ is the distance between the vertices $u$ and $v$ with the convention that if vertices are in ...
Steve Butler +4 more
openalex +2 more sources
Eigenvalues of the resistance-distance matrix of complete multipartite graphs. [PDF]
Let G=(V,E)$G=(V, E)$ be a simple graph. The resistance distance between i,j∈V$i,j\in V$, denoted by rij$r_{ij}$, is defined as the net effective resistance between nodes i and j in the corresponding electrical network constructed from G by replacing ...
Das KC, Yang Y.
europepmc +2 more sources
Restoring the Duality between Principal Components of a Distance Matrix and Linear Combinations of Predictors, with Application to Studies of the Microbiome. [PDF]
Appreciation of the importance of the microbiome is increasing, as sequencing technology has made it possible to ascertain the microbial content of a variety of samples.
Satten GA +3 more
europepmc +2 more sources
An improved distance matrix computation algorithm for multicore clusters. [PDF]
Distance matrix has diverse usage in different research areas. Its computation is typically an essential task in most bioinformatics applications, especially in multiple sequence alignment. The gigantic explosion of biological sequence databases leads to
Al-Neama MW, Reda NM, Ghaleb FF.
europepmc +2 more sources
The generalized distance matrix
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shu-Yu Cui, Jing-Xiang He, Gui-xian Tian
semanticscholar +2 more sources

