Results 91 to 100 of about 5,239,116 (369)
On sample complexity for computational pattern recognition
, 2005 In statistical setting of the pattern recognition problem the number of examples required to approximate an unknown labelling function is linear in the VC dimension of the target learning class.
Ryabko, Daniil
core +1 more source
Molecular Oncology, EarlyView.Integrating ancestry, differential methylation analysis, and machine learning, we identified robust epigenetic signature genes (ESGs) and Core‐ESGs in Black and White women with endometrial cancer. Core‐ESGs (namely APOBEC1 and PLEKHG5) methylation levels were significantly associated with survival, with tumors from high African ancestry (THA) showing ...
Huma Asif, J. Julie Kim
wiley +1 more source
On computational complexity of Siegel Julia sets
, 2005 It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification.
Binder, I., Braverman, M., Yampolsky, M.
core +1 more source
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
BMC Bioinformatics, 2004 BackgroundIn a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUSCLE to achieve the highest scores reported to date on four alignment accuracy
Robert C. Edgar
semanticscholar +1 more source
Molecular Oncology, EarlyView.This study develops a semi‐supervised classifier integrating multi‐genomic data (1404 training/5893 validation samples) to improve homologous recombination deficiency (HRD) detection in breast cancer. Our method demonstrates prognostic value and predicts chemotherapy/PARP inhibitor sensitivity in HRD+ tumours.
Rong Zhu +12 more
wiley +1 more source
MathematicsWe investigate a nonlinear integral equation derived through moment approximation from the individual-based representation of spatial logistic dynamics. The equation describes how the densities of pairs of individuals represented by points in continuous ...
Mikhail Nikolaev +2 more
doaj +1 more source
Degrees of computational complexity
Journal of Computer and System Sciences, 1972 We consider a measure Φ of computational complexity. The measure Φ determinesa binary relation on the recursive functions; F is no harder to compute than G iff for every index g of G there is an index f of F such that for nearly all x, the difficulty of f at x (as measured by Φ) is no more than the difficulty of g at x.
openaire +3 more sources
Molecular Oncology, EarlyView.Human cytomegalovirus infection is common in normal prostate epithelium, prostate tumor tissue, and prostate cancer cell lines. CMV promotes cell survival, proliferation, and androgen receptor signaling. Anti‐CMV pharmaceutical compounds in clinical use inhibited cell expansion in prostate cancer models in vitro and in vivo, motivating investigation ...
Johanna Classon +13 more
wiley +1 more source
Complexity of computer algorithms [PDF]
Rocky Mountain Journal of Mathematics, 1987 This is an introductory text merging together some well known algorithms (Horner's rule for calculating polynomials, the fast Fourier transform, bubble sort, mergesort), with empirical evaluation of their complexity and various basic programming facts like the internal computer representation of numbers and characters. The intended reader is probably a
openaire +3 more sources
Molecular Oncology, EarlyView.This study presents a novel AI‐based diagnostic approach—comprehensive serum glycopeptide spectra analysis (CSGSA)—that integrates tumor markers and enriched glycopeptides from serum. Using a neural network model, this method accurately distinguishes liver and pancreatic cancers from healthy individuals.
Motoyuki Kohjima +6 more
wiley +1 more source