Results 221 to 230 of about 80,587 (266)
Enhancing Super‐Resolution Spatial Transcriptomics Data by Transfer Learning
SpotZoomer employs a transfer‐learning‐based strategy to enhance the resolution of Visium data by leveraging available high‐resolution priors. The resulting super‐resolved maps enable sharper delineation of cell boundaries and more precise inference of cell–cell communication patterns that would otherwise remain obscured at native resolution.
Xiaoyu Li, Lihua Zhang, Wenwen Min
wiley +1 more source
A case of carbapenamase production in <i>Shigella flexneri</i> isolated in Ireland, 2025. [PDF]
Clarke C +8 more
europepmc +1 more source
A cytokinin pathway transcription factor, RR2b, was artificially selected during soybean domestication and improvement based on its differential transcriptional activity, which correlates with ATT repeat polymorphisms in its promoter. RR2b balances yield and defense by fine‐tuning its expression level and offers a promising target for decoupling trade ...
Qun Ma +11 more
wiley +1 more source
Genomic and phylogenomic analyses reveal extensive diversity among soil-derived Acinetobacter baumannii isolates from Nigeria. [PDF]
Olowo-Okere A, Skiebe E, Wilharm G.
europepmc +1 more source
Decoupling between activation time and steady-state level in input-output responses. [PDF]
Ravanelli G +3 more
europepmc +1 more source
A standardized, genome-guided MLST scheme for <i>Avibacterium paragallinarum</i>: enhanced epidemiological typing and validation against existing methods. [PDF]
Ghanem M +6 more
europepmc +1 more source
Phylogenetic and Population Genetic Analyses Reveal Patterns of Divergence Among Isolates of <i>Ceratocystis manginecans</i>. [PDF]
Lynn KMT +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2010
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as ...
Kenta Ozeki, Tomoki Yamashita
openaire +2 more sources
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as ...
Kenta Ozeki, Tomoki Yamashita
openaire +2 more sources

