Results 91 to 100 of about 1,003,970 (287)
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
Centrality of Trees for Capacitated k-Center [PDF]
, 2013 There is a large discrepancy in our understanding of uncapacitated and capacitated versions of network location problems. This is perhaps best illustrated by the classical k-center problem: there is a simple tight 2-approximation algorithm for the ...
An, Hyung-Chan +2 more
core
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
Personalized Tour Itinerary Recommendation Algorithm Based on Tourist Comprehensive Satisfaction
Applied SciencesPersonalized travel itinerary recommendation algorithms are the focus of research in smart tourism and tourism GIS. Aiming to address issues present in travel itinerary recommendations for the increasingly popular “self-drive tour” mode, this study ...
Dingming Liu +4 more
doaj +1 more source
Approximation algorithms for spreading points
Journal of Algorithms, 2005 We consider the problem of placing n points, each one inside its own, prespecified disk, with the objective of maximizing the distance between the closest pair of them. The disks can overlap and have different sizes. The problem is NP-hard and does not admit a PTAS. In the L∞ metric, we give a 2-approximation algorithm running in $O(n{\sqrt n}log^{2}n)$
openaire +2 more sources
FEBS Open Bio, EarlyView.The dual roles of CC and CXC chemokines in distinguishing active, latent, and subclinical tuberculosis were reviewed, along with an evaluation of their potential as diagnostic biomarkers and therapeutic targets to advance precision medicine in tuberculosis management. The graphical abstract was generated with AI assistance (Gemini 3.0).
Xuying Yin, Dangsheng Xiao, Jiezuan Yang
wiley +1 more source
A Novel Method of Offset Approximation along the Normal Direction with High Precision
Mathematical and Computational Applications, 2017 A new algorithm is proposed for polynomial or rational approximation of the planar offset curve. The best rational Chebyshev approximation could be regarded as a kind of geometric approximation along the fixed direction.
Hongyan Zhao, Lian Zhou
doaj +1 more source
An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length. [PDF]
PLoS One, 2023 Shin D, Choi S.
europepmc +1 more source
Approximating some network problems with scenarios
, 2018 In this paper the shortest path and the minimum spanning tree problems in a graph with $n$ nodes and $K$ cost scenarios (objectives) are discussed. In order to choose a solution the min-max criterion is applied.
Kasperski, Adam, Zielinski, Pawel
core
Remote Monitoring in Myasthenia Gravis: Exploring Symptom Variability
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background Myasthenia gravis (MG) is a rare, autoimmune disorder characterized by fluctuating muscle weakness and potential life‐threatening crises. While continuous specialized care is essential, access barriers often delay timely interventions. To address this, we developed MyaLink, a telemedical platform for MG patients.
Maike Stein +13 more
wiley +1 more source