Results 91 to 100 of about 1,378,752 (293)
On Optimal Binary Search Trees
, 2007 We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary ...
Alfredo De Santis, Roberto De Prisco
core
Advanced Science, EarlyView.A deep learning–driven pipeline mining 246 million protein sequences uncovers AhPETase, an evolutionarily distinct PET hydrolase. Engineered variant AhPETaseM1 degrades post‐consumer PET microplastics under physiological conditions and reverses microplasticinduced cytotoxicity in human lung and colon cells, establishing enzymatic microplastic ...
Yuxuan Wang +9 more
wiley +1 more source
Advanced Science, EarlyView.STWave transforms massive microscopic‐resolution spatial transcriptomics into interpretable fine‐scale tissue maps through patch‐wise inference, wavelet‐based multi‐scale encoding, and dual‐domain reconstruction. It reduces noise while preserving weak spatial signals, enabling efficient analysis of 6 40 000 spots of 2.47 GB GPU memory and revealing ...
Tao Jiang +9 more
wiley +1 more source
Enumeration of binary trees compatible with a perfect phylogeny. [PDF]
J Math Biol, 2022 Palacios JA +3 more
europepmc +1 more source
Advanced Science, EarlyView.A Transformer‐based AI framework, DLINP, screens millions of compounds to identify Co68, a cobalt‐pincer organometallic complex that biases TLR4‐MD2 signaling toward antitumor interferon activation while suppressing inflammatory toxicity through an early TLR4‐SYK‐STAT1 axis.
Xuefei Guo +10 more
wiley +1 more source
Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
Sensors, 2015 In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood ...
Wan-Yu Chang +2 more
doaj +1 more source
Association testing for binary trees-A Markov branching process approach. [PDF]
Stat Med, 2022 Wu X, Zhu H.
europepmc +1 more source
NICE: A Two‐Step Non‐Invasive Framework for Embryo cfDNA Read Enrichment and Quality Assessment
Advanced Science, EarlyView.The non‐invasive NICE framework, built on an ensemble stacking machine learning model, prioritizes embryos by analyzing cell‐free DNA from spent culture medium. By integrating multimodal signals, including genomic and epigenetic profiles, this automated approach standardizes morphological assessment without human bias, paving the way for more precise ...
Xueya Zhou +6 more
wiley +1 more source
Comparing Binary and Standard Probability Trees in Credal Networks Inference [PDF]
, 2011 This paper proposes the use of Binary Probability Trees in the propagation of credal networks. Standard and binary probability trees are suitable data structures for representing potentials because they allow to control the accuracy of inference ...
Serafín Moral +3 more
core
Advanced Science, EarlyView.Polymer‐based hydrogels have emerged as promising materials for atmospheric water harvesting (AWH) due to their high water affinity, tunable network structure, and excellent moisture adsorption‐desorption performance. Functional hydrogel systems enable efficient water capture and controlled release under low‐energy conditions, offering a sustainable ...
Swagata Datta +6 more
wiley +1 more source