Results 41 to 50 of about 18,990 (308)
Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
InformationThe edit distance is a metric of dissimilarity between strings, widely applied in computational biology, speech recognition, and machine learning. Let ek(n) denote the average edit distance between random, independent strings of n characters from an ...
Gianfranco Bilardi, Michele Schimd
doaj +1 more source
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings [PDF]
, 2022 Dynamic Time Warping (DTW) is a widely used similarity measure for comparing strings that encode time series data, with applications to areas including bioinformatics, signature verification, and speech recognition.
Xi, Zoe, Kuszmaul, William
core +1 more source
Optimized Signature Selection for Efficient String Similarity Search
IEEE Access, 2020 In this paper, we study the problem of string similarity search to retrieve in a database all strings similar to a query string within a given threshold. To measure the similarity between strings, we use edit distance.
Taegyoung Lee, Tae-Sun Chung, Jongik Kim
doaj +1 more source
Direct Visualisation of Skyrmion Lattice Defect Alignment at Grain Boundaries
Nanoscale Research Letters, 2022 We present a method to directly visualise a statistical analysis of skyrmion defect alignment at grain boundaries in the skyrmion host $$\hbox {Cu}_2$$ Cu 2 OSeO3.
Thomas Schönenberger +6 more
doaj +1 more source
Modeling emergence of Wolbachia toxin-antidote protein functions with an evolutionary algorithm
Frontiers in Microbiology, 2023 Evolutionary algorithms (EAs) simulate Darwinian evolution and adeptly mimic natural evolution. Most EA applications in biology encode high levels of abstraction in top-down population ecology models.
John Beckmann +2 more
doaj +1 more source
Efficient top-k string similarity query algorithms
Tongxin xuebao, 2014 Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to ...
Zi-yang CHEN +3 more
doaj +2 more sources
PMS6MC: A Multicore Algorithm for Motif Discovery
Algorithms, 2013 We develop an efficient multicore algorithm, PMS6MC, for the (l; d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is
Shibdas Bandyopadhyay +2 more
doaj +1 more source
Indeterminate string inference algorithms
Journal of Discrete Algorithms, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sumaiya Nazeen +2 more
openaire +2 more sources
Integrality, duality and finiteness in combinatoric topological strings
Journal of High Energy Physics, 2022 A remarkable result at the intersection of number theory and group theory states that the order of a finite group G (denoted |G|) is divisible by the dimension d R of any irreducible complex representation of G.
Robert de Mello Koch +3 more
doaj +1 more source
Molecular Oncology, EarlyView.EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source