Results 71 to 80 of about 877,649 (269)
Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact recent analysis shows that the geometric multiplicity theory for the eigenvalues of such matrices closely parallels that for real symmetric (and complex ...
Saiago Carlos M.
doaj +1 more source
Trees, Stumps, and Applications
The traditional derivation of Runge–Kutta methods is based on the use of the scalar test problem y′(x)=f(x,y(x)). However, above order 4, this gives less restrictive order conditions than those obtained from a vector test problem using a tree-
John C. Butcher
doaj +1 more source
Accurate and noninvasive prostate cancer detection using plasma‐derived extracellular vesicle RNA
Plasma extracellular vesicles were captured with WGA‐conjugated magnetic beads and profiled for RNA biomarkers. A three‐RNA panel (NM_024955, NR_047469, and NR_002564) distinguished prostate cancer from healthy controls and benign prostatic hyperplasia, supporting a simple, noninvasive approach to improve prostate cancer detection.
Hanping Wei, Haoran Wu, Wei Feng
wiley +1 more source
Weakly connected domination critical graphs [PDF]
A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\).
Magdalena Lemańska, Agnieszka Patyk
doaj
A posteriori GPR Evaluation of Tree Stability: A Case Study in Rome (Italy)
Following the frequent and harmful collapses of trees that have plagued the municipal territory of Rome in recent years, a protocol of understanding was initiated between the Department of Environmental Protection of ROMA CAPITALE, the American ...
Pier Matteo Barone, Carlotta Ferrara
doaj +1 more source
Tree Transducers and Tree Compressions [PDF]
A tree can be compressed into a DAG by sharing common subtrees. The resulting DAG is at most exponentially smaller than the original tree. Consider an attribute grammar that generates trees as output. It is well known that, given an input tree s, a DAG representation of the corresponding output tree can be computed in time linear in the size of s.
Sebastian Maneth, Giorgio Busatto
openaire +1 more source
Heterotropic regulation and negative homotropic cooperativity
We identified a structural module common to some proteins that couple negative cooperativity with heterotropic regulation, two features that rarely coexist. These proteins are ring‐like and present an ordered asymmetry whereby noncontacting subunits are symmetric, and their tertiary structure differs from that of contacting subunits.
Veronica Morea +5 more
wiley +1 more source
Cartesian trees and Lyndon trees
The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of numbers. It shows how to efficiently compute runs, that is, maximal periodicities occurring in a word.
Maxime Crochemore, Luís M. S. Russo
openaire +2 more sources
The presence of biotin‐binding avidin proteins in fish and their biological significance are poorly characterized. We cataloged fish avidins and demonstrate that they are widely present and evolutionarily conserved. We created avd knockout zebrafish and show that zebavidin is dispensable for development and that resistance of avd knockout embryos in ...
Anni K. Saralahti +5 more
wiley +1 more source
Changing and Unchanging 2-Rainbow Independent Domination
Domination number is of practical interest in several theoretical and applied scenes. In the problem of wireless networking, the dominating idea is used to deduce an efficient route within the adhoc mobilenetworks.
Xiaolong Shi +6 more
doaj +1 more source

