Results 91 to 100 of about 38,188 (290)
Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers
Molecular Oncology, EarlyView.This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel +6 more
wiley +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
A new SAR image despeckling using directional smoothing filter and method noise thresholding
Engineering Science and Technology, an International Journal, 2018 The removal of granular pattern multiplicative speckle noise is the major issue in Synthetic Aperture Radar (SAR) images. Theoretically, multiplicative noise is considered as the ratio of the standard deviation to the signal value.
Prabhishek Singh, Raj Shree
doaj +1 more source
A Filter-Based Approach for Approximate Circular Pattern Matching
, 2015 This paper deals with the Approximate Circular Pattern Matching (ACPM) problem, which appears as an interesting problem in many biological contexts. Here the goal is to find all approximate occurrences of the rotations of a pattern P of length m in a ...
Rahman, M. Sohel +3 more
core +1 more source
Automata Approach to Approximate Tree Pattern Matching [PDF]
, 2020 Tato práce se zabývá přibližným vyhledáváním ve stromech pomocí zásobníkového automatu. Využívá edit operace pro stromy, které byly definovány Selkowem.
Lukáš Renc
core
Algorithms for Order-Preserving Matching [PDF]
, 2016 String matching is a widely studied problem in Computer Science. There have been many recent developments in this field. One fascinating problem considered lately is the order-preserving matching (OPM) problem.
Chhabra, Tamanna
core +1 more source
Approximate String Matching with Compressed Indexes
Algorithms, 2009 A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed
Pedro Morales +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Pre‐analytical handling critically determines liquid biopsy performance. This study defines practical best‐practice conditions for cell‐free DNA (cfDNA) and extracellular vesicle–derived DNA (evDNA), showing how processing time, storage conditions, tube type, and plasma input volume affect DNA integrity and mutation detection.
Jonas Dohmen +11 more
wiley +1 more source
Approximate pattern matching and its applications.
, 1992 In this thesis, we study approximate pattern matching problems. Our study is based on the Levenshtein distance model, where errors considered are 'insertions', 'deletions', and 'substitutions'. In general, given a text string, a pattern, and an integer k,
Wu, Sun.
core
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
Molecular Oncology, EarlyView.COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +1 more source