Results 111 to 120 of about 449,948 (311)
FEBS Open Bio, EarlyView.Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young +7 more
wiley +1 more source
On the complexity of MMSNP [PDF]
, 2012 International audienceMonotone monadic strict NP (MMSNP) is a class of computational problems that is closely related to the class of constraint satisfaction problems for constraint languages over finite domains. It is known that one of those classes has
Feder, Tomas +2 more
core
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Quantum Computational Complexity of Matrix Functions
PRX QuantumWe investigate the dividing line between classical and quantum computational power in estimating properties of matrix functions. More precisely, we study the computational complexity of two primitive problems: given a function f and a Hermitian matrix A,
Santiago Cifuentes +4 more
doaj +1 more source
Frontiers in Genetics, 2019 Analysis of gene regulatory networks allows the identification of master transcriptional factors that control specific groups of genes. In this work, we inferred a gene regulatory network from a large dataset of breast cancer samples to identify the ...
Diana Tapia-Carrillo +5 more
doaj +1 more source
Computability and Complexity in Analysis.
J. Univers. Comput. Sci., 2009 Computability and Complexity in ...
Brattka,Vasco +2 more
openaire +3 more sources
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
FEBS Open Bio, EarlyView.RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour +2 more
wiley +1 more source
Computational Complexity in the Design of Voting Rules [PDF]
This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games.
Koji Takamiya, Akira Tanaka
core
The complexity of explicit construction problems [PDF]
Explicit constructions of pseudorandom objects play a central role in theoretical computer science. Unfortunately, for many properties of interest, while a randomly chosen object would satisfy them with high probability, deterministically constructing ...
Ren, Hanlin
core +2 more sources
07411 Executive Summary – Algebraic Methods in Computational Complexity [PDF]
, 2008 The seminar brought together almost 50 researchers covering a wide spectrum of complexity theory. The focus on algebraic methods showed once again the great importance of algebraic techniques for theoretical computer science. We had almost 30 talks of
Agrawal, Manindra +3 more
core +1 more source