Results 71 to 80 of about 270,219 (278)
Molecular Oncology, EarlyView.Clinical trials on PARP inhibitors in urothelial carcinoma (UC) showed limited efficacy and a lack of predictive biomarkers. We propose SLFN5, SLFN11, and OAS1 as UC‐specific response predictors. We suggest Talazoparib as the better PARP inhibitor for UC than Olaparib.
Jutta Schmitz +15 more
wiley +1 more source
Approximating Edit Distance Efficiently [PDF]
45th Annual IEEE Symposium on Foundations of Computer Science, 2004 Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to approximate it to within a modest factor. Furthermore, for various natural algorithmic problems such as low-distortion embeddings into normed spaces, approximate nearest ...
Z. Bar-Yossef +3 more
openaire +1 more source
Molecular Oncology, EarlyView.We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck +12 more
wiley +1 more source
Strength through diversity: how cancers thrive when clones cooperate
Molecular Oncology, EarlyView.Intratumor heterogeneity can offer direct benefits to the tumor through cooperation between different clones. In this review, Kuiken et al. discuss existing evidence for clonal cooperativity to identify overarching principles, and highlight how novel technological developments could address remaining open questions.
Marije C. Kuiken +3 more
wiley +1 more source
Application of Genetic Algorithms for Finding Edit Distance between Process Models
Моделирование и анализ информационных систем, 2018 Finding graph-edit distance (graph similarity) is an important task in many computer science areas, such as image analysis, machine learning, chemicalinformatics.
Anna A. Kalenkova, Danil A. Kolesnikov
doaj +1 more source
Journal of Discrete Algorithms, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, Sung-Ryul, Park, Kunsoo
openaire +2 more sources
Molecular Oncology, EarlyView.We developed a cost‐effective methylation‐specific droplet digital PCR multiplex assay containing tissue‐conserved and tumor‐specific methylation markers. The assay can detect circulating tumor DNA with high accuracy in patients with localized and metastatic colorectal cancer.
Luisa Matos do Canto +8 more
wiley +1 more source
Lossless filter for multiple repeats with bounded edit distance
Algorithms for Molecular Biology, 2009 Background Identifying local similarity between two or more sequences, or identifying repeats occurring at least twice in a sequence, is an essential part in the analysis of biological sequences and of their phylogenetic relationship.
Pisanti Nadia +4 more
doaj +1 more source
Online Pattern Matching for String Edit Distance with Moves
, 2014 Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string to the other.
D. Shapira +7 more
core +1 more source
, 2020 In information theory, linguistics and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.
openaire +1 more source