Results 61 to 70 of about 2,906,539 (296)

Unique circulating miRNAome signatures captured with distinct molecular states in Lynch syndrome and sporadic colorectal cancer

open access: yesMolecular Oncology, EarlyView.
Circulating microRNA profiles distinguish nonmalignant Lynch syndrome from cancer‐associated Lynch syndrome, sporadic colorectal cancer, and healthy controls. Age‐stratified analysis reveals disease‐specific regulatory states, and a six‐miRNA panel shows concordant separation in an independent colorectal tissue cohort.
Ramadhani Salum Chambuso   +5 more
wiley   +1 more source

The impact of leukocyte‐associated RNA retention on platelet RNA‐based cancer detection

open access: yesMolecular Oncology, EarlyView.
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

Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes

open access: yesFEBS Open Bio, EarlyView.
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

Random ultrametric trees and applications*

open access: yesESAIM: Proceedings and Surveys, 2017
Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time.
Lambert Amaury
doaj   +1 more source

Holonomic equations and efficient random generation of binary trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
Holonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj   +1 more source

Label-based parameters in increasing trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit ...
Markus Kuba, Alois Panholzer
doaj   +1 more source

An Ensemble Framework to Improve the Accuracy of Prediction Using Clustered Random-Forest and Shrinkage Methods

open access: yesApplied Sciences, 2022
Nowadays, in the topics related to prediction, in addition to increasing the accuracy of existing algorithms, the reduction of computational time is a challenging issue that has attracted much attention.
Zari Farhadi   +4 more
doaj   +1 more source

Accurate and noninvasive prostate cancer detection using plasma‐derived extracellular vesicle RNA

open access: yesFEBS Open Bio, EarlyView.
Plasma extracellular vesicles were captured with WGA‐conjugated magnetic beads and profiled for RNA biomarkers. A three‐RNA panel (NM_024955, NR_047469, and NR_002564) distinguished prostate cancer from healthy controls and benign prostatic hyperplasia, supporting a simple, noninvasive approach to improve prostate cancer detection.
Hanping Wei, Haoran Wu, Wei Feng
wiley   +1 more source

Random hyperplane search trees in high dimensions

open access: yesJournal of Computational Geometry, 2015
Given a set S of n ≥ d points in general position in Rd, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary space
Luc Devroye, James King
doaj   +1 more source

The Effect of Points Dispersion on the k-nn Search in Random Projection Forests

open access: yesIEEE Access, 2022
Partitioning trees are efficient data structures for $k$ -nearest neighbor search. Machine learning libraries commonly use a special type of partitioning trees called $k\text{d}$ -trees to perform $k$ -nn search. Unfortunately, $k\text{d}$ -trees can
Mashaan Alshammari   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy