Squared distance matrix of a weighted tree [PDF]
Electronic Journal of Graph Theory and Applications, 2019 Let T be a tree with vertex set {1, …, n} such that each edge is assigned a nonzero weight. The squared distance matrix of T, denoted by Δ, is the n × n matrix with (i, j)-element d(i, j)2, where d(i, j) is the sum of the weights of the edges on the ...
Ravindra B. Bapat
doaj +6 more sources
A unified approach to protein domain parsing with inter-residue distance matrix. [PDF]
Bioinformatics, 2023 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]
Discrete Mathematics Letters, 2022 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 +5 more sources
Structural brain connectivity and cognitive ability differences: A multivariate distance matrix regression analysis. [PDF]
Hum Brain Mapp, 2017 Ponsoda V +7 more
europepmc +4 more sources
Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
Linear Algebra and its Applications, 2023 Peer ...
Ernesto Estrada
openaire +3 more sources
Jurnal Teknologi dan Sistem Komputer, 2020 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
Eigenvalues of the resistance-distance matrix of complete multipartite graphs. [PDF]
J Inequal Appl, 2017 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
FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix
Molecular biology and evolution, 2009 Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability.
Morgan N. Price +2 more
openalex +3 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]
PLoS One, 2017 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]
Biomed Res Int, 2014 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