Results 181 to 190 of about 52,163 (250)

Tree Independence Number III. Thetas, Prisms and Stars

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky, Sepehr Hajebi, Nicolas Trotignon   +2 more
wiley   +1 more source

A Multi-Stage Hybrid Learning Model with Advanced Feature Fusion for Enhanced Prostate Cancer Classification. [PDF]

Diagnostics (Basel)
Abd El-Ghany S, Abd El-Aziz AA.
europepmc   +1 more source

On Odd Covers of Cliques and Disjoint Unions

Journal of Graph Theory, EarlyView.
ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan, Alexander Clifton, Eric Culver, Péter Frankl, Jiaxi Nie, Kenta Ozeki, Puck Rombach, Mei Yin   +7 more
wiley   +1 more source

TriosCompass: a snakemake workflow for integrated detection of SNVs, indels, STRs, and structural de novo variants in parent-child trios. [PDF]

Bioinformatics
Zhu W, Yeager M, Dawson ET, Jain K, Hicks B, Dean M, Chanock SJ, Wong WSW.   +7 more
europepmc   +1 more source

Sparse Graphs With Local Covering Conditions on Edges

Journal of Graph Theory, EarlyView.
ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari, Babak Miraftab   +3 more
wiley   +1 more source

Deep learning based attention enhanced phylogenetic radial basis function networks (AE-PRBFN) for genomic codon usage classification across species. [PDF]

Sci Rep
Hussein YS, Ali A, Shahzad A, Mehmood T, Ilyas M, Abdulnabi MS.   +5 more
europepmc   +1 more source

On Sparsity Conditions Guaranteeing a Fractional Coloring

Journal of Graph Theory, EarlyView.
ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley   +1 more source

Resilient Sinkhorn-Based Optimal Transport Late Fusion Framework for Breast Cancer Diagnosis. [PDF]

Cancer Inform
Asiedu Asare M, Acquah I, Yeboah BA, Owusu E.   +3 more
europepmc   +1 more source

Image Quality of 1.5 T MRI Using Dual‐Type Deep Learning Reconstruction for Pancreatic Cystic Lesions: An Exploratory Comparison With Conventional 3 T MRI Without Deep Learning Reconstruction

Journal of Magnetic Resonance Imaging, EarlyView.
ABSTRACT Background Dual‐type deep learning reconstruction (DLR) may improve the pancreatic MRI image quality; however, the effects of different DLR strengths at 1.5 T compared with the conventional 1.5 T and 3 T MRI without DLR remain unclear. Purpose To evaluate the image quality of 1.5 T MRI reconstructed with different DLR strengths for pancreatic ...
Masaki Tsuda, Taiki Nozaki, Koji Sumi, Minobu Kamo, Ippei Ozaki, Fumio Morimura, Eugene Nishi, Yohsuke Suyama, Hiroaki Sugiura, Hiromi Edo   +9 more
wiley   +1 more source

Reply to Zhang: Causal identification, social networks, and biological aging. [PDF]

Proc Natl Acad Sci U S A
Lee B, Ciciurkaite G, Peng S, Mitchell C, Perry BL.   +4 more
europepmc   +1 more source