Results 71 to 80 of about 50,367 (275)
Molecular Oncology, EarlyView.We show that the majority of the 18 analyzed recurrent cancer‐associated ERBB4 mutations are transforming. The most potent mutations are activating, co‐operate with other ERBB receptors, and are sensitive to pan‐ERBB inhibitors. Activating ERBB4 mutations also promote therapy resistance in EGFR‐mutant lung cancer.
Veera K. Ojala +15 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
Automatic Wrapper Adaptation by Tree Edit Distance Matching [PDF]
, 2010 Information distributed through the Web keeps growing faster day by day,\ud and for this reason, several techniques for extracting Web data have been suggested\ud during last years.
Baumgartner, Robert, Ferrara, Emilio
core
The Smoothed Complexity of Edit Distance [PDF]
ACM Transactions on Algorithms, 2008 We initiate the study of the smoothed complexity of sequence alignment, by proposing a semi-random model of edit distance between two input strings, generated as follows: First, an adversary chooses two binary strings of length d and a longest common subsequence A of them.
Alexandr Andoni, Robert Krauthgamer
openaire +1 more source
Peroxidasin enables melanoma immune escape by inhibiting natural killer cell cytotoxicity
Molecular Oncology, EarlyView.Peroxidasin (PXDN) is secreted by melanoma cells and binds the NK cell receptor NKG2D, thereby suppressing NK cell activation and cytotoxicity. PXDN depletion restores NKG2D signaling and enables effective NK cell–mediated melanoma killing. These findings identify PXDN as a previously unrecognized immune evasion factor and a potential target to improve
Hsu‐Min Sung +17 more
wiley +1 more source
An O(n^3)-Time Algorithm for Tree Edit Distance
, 2006 The {\em edit distance} between two ordered trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes ...
Benjamin Rossman +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
Tandem repeats over the edit distance [PDF]
Bioinformatics, 2007 AbstractMotivation: A tandem repeat in DNA is a sequence of two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats occur in the genomes of both eukaryotic and prokaryotic organisms. They are important in numerous fields including disease diagnosis, mapping studies, human identity testing (DNA fingerprinting), sequence ...
Dina, Sokol +2 more
openaire +2 more sources
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
Error Tree: A Tree Structure for Hamming & Edit Distances & Wildcards Matching
, 2015 Error Tree is a novel tree structure that is mainly oriented to solve the approximate pattern matching problems, Hamming and edit distances, as well as the wildcards matching problem.
Al-Okaily, Anas
core +1 more source