Results 81 to 90 of about 270,219 (278)
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
Potential therapeutic targeting of BKCa channels in glioblastoma treatment
Molecular Oncology, EarlyView.This review summarizes current insights into the role of BKCa and mitoBKCa channels in glioblastoma biology, their potential classification as oncochannels, and the emerging pharmacological strategies targeting these channels, emphasizing the translational challenges in developing BKCa‐directed therapies for glioblastoma treatment.
Kamila Maliszewska‐Olejniczak +4 more
wiley +1 more source
A graph-matching formulation of the interleaving distance between merge trees
AIMS MathematicsIn this work, we studied the interleaving distance between merge trees from a combinatorial point of view. In the first part of the paper, we used a particular type of matching between trees to obtain a novel formulation of the distance. This formulation
Matteo Pegoraro
doaj +1 more source
Linear space string correction algorithm using the Damerau-Levenshtein distance
BMC Bioinformatics, 2020 Background The Damerau-Levenshtein (DL) distance metric has been widely used in the biological science. It tries to identify the similar region of DNA,RNA and protein sequences by transforming one sequence to the another using the substitution, insertion,
Chunchun Zhao, Sartaj Sahni
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
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
Exploiting metabolic adaptations to overcome dabrafenib treatment resistance in melanoma cells
Molecular Oncology, EarlyView.We show that dabrafenib‐resistant melanoma cells undergo mitochondrial remodeling, leading to elevated respiration and ROS production balanced by stronger antioxidant defenses. This altered redox state promotes survival despite mitochondrial damage but renders resistant cells highly vulnerable to ROS‐inducing compounds such as PEITC, highlighting redox
Silvia Eller +17 more
wiley +1 more source
Convex Graph Invariant Relaxations For Graph Edit Distance [PDF]
, 2019 The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another.
Candogan, Utkan Onur +1 more
core +1 more source
Molecular Oncology, EarlyView.The cancer problem is increasing globally with projections up to the year 2050 showing unfavourable outcomes in terms of incidence and cancer‐related deaths. The main challenges are prevention, improved therapeutics resulting in increased cure rates and enhanced health‐related quality of life.
Ulrik Ringborg +43 more
wiley +1 more source
On the Generative Power of ReLU Network for Generating Similar Strings
IEEE AccessRecently, generative networks are widely used in different applied fields including computational biology for data augmentation, DNA sequence generation, and drug discovery.
Mamoona Ghafoor, Tatsuya Akutsu
doaj +1 more source