Results 61 to 70 of about 2,194,803 (325)

The Inconsistency of the Algorithms of Jaro–Winkler and Needleman–Wunsch Applied to DNA Chain Similarity Results

open access: yesMathematics
There are many different algorithms for calculating the distances between DNA chains. Different algorithms for determining such distances give different results.
Boris Melnikov
doaj   +1 more source

Clustering the objective interestingness measures based on tendency of variation in statistical implications

open access: yesEAI Endorsed Transactions on Context-aware Systems and Applications, 2016
In recent years, the research cluster of objective interestingness measures has rapidly developed in order to assist users to choose the appropriate measure for their application.
Nghia Quoc Phan   +3 more
doaj   +1 more source

On spectral radius and Nordhaus-Gaddum type inequalities of the generalized distance matrix of graphs

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2022
If $Tr(G)$ and $D(G)$ are respectively the diagonal matrix of vertex transmission degrees and distance matrix of a connected graph $G$, the generalized distance matrix $D_{\alpha}(G)$ is defined as $D_{\alpha}(G)=\alpha ~Tr(G)+(1-\alpha)~D(G)$, where $0 ...
M. Merajuddin, S. Bhatnagar, S. Pirzada
doaj   +1 more source

In vitro models of cancer‐associated fibroblast heterogeneity uncover subtype‐specific effects of CRISPR perturbations

open access: yesMolecular Oncology, EarlyView.
Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra   +10 more
wiley   +1 more source

The second immanant of some combinatorial matrices [PDF]

open access: yesTransactions on Combinatorics, 2015
Let $A = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrix where $n geq 2$. Let $dt(A)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$.
R. B. Bapat   +1 more
doaj  

Extremal Unicyclic Graphs With Minimal Distance Spectral Radius

open access: yesDiscussiones Mathematicae Graph Theory, 2014
The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj   +1 more source

K-Matrix: A Novel Change-Pattern Mining Method for SAR Image Time Series

open access: yesRemote Sensing, 2019
In this paper, we present a novel method for change-pattern mining in Synthetic Aperture Radar (SAR) image time series based on a distance matrix clustering algorithm, called K-Matrix.
Dong Peng   +3 more
doaj   +1 more source

Study of Air Pressure on Arc Ion Plating on Epoxy Resin Matrix Composites at Meter Range Working Distance [PDF]

open access: diamond, 2023
Chao Meng   +5 more
openalex   +1 more source

Strength through diversity: how cancers thrive when clones cooperate

open access: yesMolecular Oncology, EarlyView.
Intratumor heterogeneity can offer direct benefits to the tumor through cooperation between different clones. In this review, Kuiken et al. discuss existing evidence for clonal cooperativity to identify overarching principles, and highlight how novel technological developments could address remaining open questions.
Marije C. Kuiken   +3 more
wiley   +1 more source

Leibniz seminorms for "Matrix algebras converge to the sphere" [PDF]

open access: yes, 2010
In an earlier paper of mine relating vector bundles and Gromov-Hausdorff distance for ordinary compact metric spaces, it was crucial that the Lipschitz seminorms from the metrics satisfy a strong Leibniz property.
Rieffel, Marc A.
core  

Home - About - Disclaimer - Privacy