Results 91 to 100 of about 5,765,386 (368)

Interaction vesicles as emerging mediators of host‐pathogen molecular crosstalk and their implications for infection dynamics

open access: yesFEBS Letters, EarlyView.
Interaction extracellular vesicles (iEVs) are hybrid vesicles formed through host‐pathogen communication. They facilitate immune evasion, transfer pathogens' molecules, increase host cell uptake, and enhance virulence. This Perspective article illustrates the multifunctional roles of iEVs and highlights their emerging relevance in infection dynamics ...
Bruna Sabatke   +2 more
wiley   +1 more source

Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs [PDF]

open access: yesarXiv, 2015
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their efficiency on some simplicial complexes, the devoid complexes of graphs, which are simplicial complexes parametrized ...
arxiv  

Quantum Hamiltonian Complexity

open access: yes, 2015
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint ...
Gharibian, Sevag   +3 more
core   +1 more source

Ion channel function of polycystin‐2/polycystin‐1 heteromer revealed by structure‐guided mutagenesis

open access: yesFEBS Letters, EarlyView.
Mutations in polycystin‐1 (PC1) or polycystin‐2 (PC2) cause autosomal‐dominant polycystic kidney disease (ADPKD). We generated a novel gain‐of‐function PC2/PC1 heteromeric ion channel by mutating pore‐blocking residues. Moreover, we demonstrated that PC2 will preferentially assemble with PC1 to form heteromeric complexes when PC1 is co‐expressed ...
Tobias Staudner   +7 more
wiley   +1 more source

Directed Network Comparison Using Motifs

open access: yesEntropy
Analyzing and characterizing the differences between networks is a fundamental and challenging problem in network science. Most previous network comparison methods that rely on topological properties have been restricted to measuring differences between ...
Chenwei Xie   +4 more
doaj   +1 more source

Infinite Communication Complexity [PDF]

open access: yes, 2014
Suppose that Alice and Bob are given each an infinite string, and they want to decide whether their two strings are in a given relation. How much communication do they need? How can communication be even defined and measured for infinite strings? In this
Guillon, Pierre, Jeandel, Emmanuel
core   +3 more sources

Binary Determinantal Complexity

open access: yes, 2015
We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required.
Hüttenhain, Jesko, Ikenmeyer, Christian
core   +1 more source

The complexity of divisibility

open access: yesLinear Algebra and its Applications, 2016
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic maps is an NP-complete problem, and extend this result to nonnegative matrices, and ...
Bausch, Johannes, Cubitt, Toby
openaire   +5 more sources

Decoding the dual role of autophagy in cancer through transcriptional and epigenetic regulation

open access: yesFEBS Letters, EarlyView.
Transcriptional and epigenetic regulation controls autophagy, which exerts context‐dependent effects on cancer: Autophagy suppresses tumorigenesis by maintaining cellular homeostasis or promotes tumor progression by supporting survival under stress. In this “In a Nutshell” article, we explore the intricate mechanisms of the dual function of autophagy ...
Young Suk Yu, Ik Soo Kim, Sung Hee Baek
wiley   +1 more source

Complexes of trees and nested set complexes [PDF]

open access: yesarXiv, 2004
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be obtained from the complex of trees by a sequence of stellar subdivisions.
arxiv  

Home - About - Disclaimer - Privacy