Results 51 to 60 of about 309,634 (292)

Pseudodeterminants and perfect square spanning tree counts [PDF]

open access: yes, 2015
The pseudodeterminant $\textrm{pdet}(M)$ of a square matrix is the last nonzero coefficient in its characteristic polynomial; for a nonsingular matrix, this is just the determinant. If $\partial$ is a symmetric or skew-symmetric matrix then $\textrm{pdet}
Martin, Jeremy L.   +3 more
core   +3 more sources

Meta‐analysis fails to show any correlation between protein abundance and ubiquitination changes

open access: yesFEBS Open Bio, EarlyView.
We analyzed over 50 published proteomics datasets to explore the relationship between protein levels and ubiquitination changes across multiple experimental conditions and biological systems. Although ubiquitination is often associated with protein degradation, our analysis shows that changes in ubiquitination do not globally correlate with changes in ...
Nerea Osinalde   +3 more
wiley   +1 more source

Spanning trees with many leaves: new extremal results and an improved FPT algorithm [PDF]

open access: yes, 2006
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the ...
Bonsma, P.S.
core   +2 more sources

Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function

open access: yesFEBS Open Bio, EarlyView.
We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke   +4 more
wiley   +1 more source

A generalization of heterochromatic graphs

open access: yes, 2011
In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.
G. Hahn   +7 more
core   +1 more source

Structure–Function Decoupling of the Sensorimotor and Default Mode Networks in Black Americans With MS

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano   +11 more
wiley   +1 more source

Efficient and Effective Directed Minimum Spanning Tree Queries

open access: yesMathematics, 2023
Computing directed Minimum Spanning Tree (DMST) is a fundamental problem in graph theory. It is applied in a wide spectrum of fields from computer network and communication protocol design to revenue maximization in social networks and syntactic parsing ...
Zhuoran Wang   +4 more
doaj   +1 more source

Clinical Practice Guideline for Evaluation and Management of Peripheral Nervous System Manifestations in Sjögren's Disease

open access: yesArthritis Care &Research, EarlyView.
Objective Sjögren's disease is an autoimmune disorder that can impact multiple organ systems, including the peripheral nervous system (PNS). PNS manifestations, which can exist concurrently, include mononeuropathies, polyneuropathies, and autonomic nervous system neuropathies.
Anahita Deboo   +88 more
wiley   +1 more source

Efficient Computation of Expectations under Spanning Tree Distributions

open access: yesTransactions of the Association for Computational Linguistics, 2021
We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models.
Ran Zmigrod, Tim Vieira, Ryan Cotterell
doaj   +1 more source

Some NP-complete edge packing and partitioning problems in planar graphs [PDF]

open access: yes, 2014
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges ...
Yang, Jed
core  

Home - About - Disclaimer - Privacy