Results 71 to 80 of about 347,865 (289)
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras [PDF]
We describe a framework for maintaining forest algebra representations that are of logarithmic height for unranked trees. Such representations can be computed in O(n) time and updated in O(log(n)) time.
Sarah Kleest-Meißner +2 more
doaj +1 more source
Tumour‐proximal deep serum proteomics identifies biomarkers associated with ovarian cancer
New biomarkers are needed for early ovarian cancer detection. Ovarian (tumour‐proximal) and peripheral vein serum from healthy women and patients with benign or malignant tumours underwent nanoparticle‐enriched deep proteomics. Ovarian serum yielded more protein identifications and revealed tumour‐reflective signatures.
Darren Lau +9 more
wiley +1 more source
Visualization of Data Structures and Algorithms
Cilj ovog rada je pokazati mogućnosti i prednosti korištenja vizualizacije u učenju struktura podataka i algoritama. Kroz rad ćemo se upoznati s najvažnijim strukturama podataka, te njihovom primjenom.
Rukavina, Ivan Karlo
core +2 more sources
The impact of leukocyte‐associated RNA retention on platelet RNA‐based cancer detection
Platelets carry RNA signals that may help detect cancer, but platelet samples can also retain RNA from white blood cells. We found that this retained white blood cell signal did not significantly affect machine learning cancer classification, suggesting that the cancer‐related RNA signal in platelets is largely independent of leukocyte‐associated RNA ...
Michał Sieczczyński +12 more
wiley +1 more source
RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source
Randomized Communication and Implicit Graph Representations [PDF]
We initiate the focused study of constant-cost randomized communication, with emphasis on its connection to graph representations. We observe that constant-cost randomized communication problems are equivalent to hereditary (i.e.
Nathaniel Harms +2 more
doaj +1 more source
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
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
Algorithms and Data Structures for Sparse Polynomial Arithmetic
We provide a comprehensive presentation of algorithms, data structures, and implementation techniques for high-performance sparse multivariate polynomial arithmetic over the integers and rational numbers as implemented in the freely available Basic ...
Mohammadali Asadi +3 more
doaj +1 more source
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +1 more source
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries [PDF]
We study the enumeration of answers to Unions of Conjunctive Queries (UCQs) with optimal time guarantees. More precisely, we wish to identify the queries that can be solved with linear preprocessing time and constant delay.
Karl Bringmann, Nofar Carmeli
doaj +1 more source

