Results 61 to 70 of about 2,949,927 (358)
The k-adjacency operators and adjacency Jacobi matrix on distance-regular graphs
Boletín de la Sociedad Matemática Mexicana, 2023 We deal in this work with a class of graphs, namely, the class of distance-regular graphs, in which on the basis of $k$-adjacency operators, the adjacency operator $A$ of a distance-regular graph is identified as a Jacobi matrix. To get so, the set of the $k$-adjacency operators is recognized as a canonical basis in a certain Hilbert space, where the ...
openaire +2 more sources
The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity
FEBS Letters, EarlyView.The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley +1 more source
Mechanisms of parasite‐mediated disruption of brain vessels
FEBS Letters, EarlyView.Parasites can affect the blood vessels of the brain, often causing serious neurological problems. This review explains how different parasites interact with and disrupt these vessels, what this means for brain health, and why these processes matter. Understanding these mechanisms may help us develop better ways to prevent or treat brain infections in ...
Leonor Loira +3 more
wiley +1 more source
A new matrix representation of multidigraphs
AKCE International Journal of Graphs and Combinatorics, 2020 In this article, we introduce a new matrix associated with a multidigraph, named as the complex adjacency matrix. We study the spectral properties of bipartite multidigraphs corresponding to the complex adjacency matrix.
Sasmita Barik, Gopinath Sahoo
doaj +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Moment-Based Spectral Analysis of Large-Scale Generalized Random Graphs
IEEE Access, 2017 This paper investigates the spectra of the adjacency matrix and Laplacian matrix for an artificial complex network model-the generalized random graph. We deduce explicit expressions for the first four asymptotic spectral moments of the adjacency matrix ...
Qun Liu, Zhishan Dong, En Wang
doaj +1 more source
Contribution of directedness in graph spectra
Physical Review Research, 2022 In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such a simplification has not been thoroughly verified. In this study, we investigate how directedness affects the graph
Masaki Ochi, Tatsuro Kawamoto
doaj +1 more source
Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics [PDF]
Algorithms for Molecular Biology, 2019 Genomic data analyses such as Genome-Wide Association Studies (GWAS) or Hi-C studies are often faced with the problem of partitioning chromosomes into successive regions based on a similarity matrix of high-resolution, locus-level measurements.
C. Ambroise +4 more
semanticscholar +1 more source
Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids
Molecular Oncology, EarlyView.This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici +8 more
wiley +1 more source
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
Journal of Hebei University of Science and Technology, 2019 In order to discuss the minimum eigenvalue of adjacency matrix in the class of complementary graphs of the tricyclic graph with a given order of n and n－4 pendent vertexes, the unique graph whose minimum eigenvalue reaches the minimum is characterized ...
Hongjuan JU, Yingjie LEI
doaj +1 more source