Results 51 to 60 of about 163,989 (311)

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

Molecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur, Joel Rodrigues Vitória, Manuel Saiselet, Ligia Craciun, Denis Larsimont, Anne Lefort, Frédérick Libert, Carine Maenhaut, Sabine Costagliola, Maxime Tarabichi, Mirian Romitti, Vincent Detours   +11 more
wiley   +1 more source

Numerical evidence for phase transitions of NP-complete problems for instances drawn from Lévy-stable distributions [PDF]

, 2011
Random NP-Complete problems have come under study as an important tool used in the analysis of optimization algorithms and help in our understanding of how to properly address issues of computational intractability.
Connelly, Abram, Abram Connelly
core   +1 more source

Fifty years of scheduling: a survey of milestones [PDF]

, 2009
Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A., Strusevich, V.A., Potts, Christopher N., Potts, C.N., C N Potts, V A Strusevich   +5 more
core   +1 more source

B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem [PDF]

Journal of Artificial Intelligence and Soft Computing Research, 2013
Abstract This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP).
Marco Antonio Cruz Chvez, Alina Martnez Oropeza   +1 more
openaire   +1 more source

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

FEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli, Mohammad Nour Alsamsam, Ugnė Bagdonaitė, Van Truc Vu, Chun‐Jen Huang, Polina Kuzhir, Mindaugas Zaremba, Aurimas Kopūstas, Marijonas Tutkus   +8 more
wiley   +1 more source

On the probabilistic min spanning tree Problem [PDF]

, 2010
International audienceWe study a probabilistic optimization model for min spanning tree, where any vertex v i of the input-graph G(V, E) has some presence probability p i in the final instance G′ ⊂ G that will effectively be optimized.
Paschos, V.T., V. T. Paschos, Cécile Murat, Nicolas Boria, C. Murat, Vangelis Th Paschos, Vangelis Paschos, Paschos, Vangelis, Boria, Nicolas, Murat, C., Murat, Cécile   +10 more
core   +1 more source

Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank

FEBS Open Bio, EarlyView.
Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer, Pawel Rubach, Zbigniew Dauter, Wojciech Dec, Dariusz Brzezinski, Marta Kulik, Wladek Minor, Mariusz Jaskolski   +7 more
wiley   +1 more source

Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem

Journal of Numerical Analysis and Approximation Theory, 2011
In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented. The algorithm is based on Nesterov-Todd search directions and on a suitable proximity for tracing approximately the central-path.
Mohamed Achache, Naima Boudiaf
openaire   +3 more sources

Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif, Diane Demailly, Gabriella A. Horvàth, Juan Dario Ortigoza Escobar, Nathalie Dorison, Mayté Castro Jiménez, Cécile A. Hubsch, Thomas Wirth, Gun‐Marie Hariz, Sophie Huby, Morgan Dornadic, Zohra Souei, Muhammad Mushhood Ur Rehman, Simone Hemm, Mehdi Boulaymen, Eduardo M. Moraud, Jocelyne Bloch, Xavier Vasques   +17 more
wiley   +1 more source

Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis

IEEE Access
Online algorithms are crucial for real-time decision-making and adaptability across diverse fields, such as operations research, computer science, and combinatorics. These algorithms handle data incrementally and make decisions without prior knowledge of
Christine Markarian, Claude Fachkha, Noura Yassine   +2 more
doaj   +1 more source