Results 51 to 60 of about 272,414 (271)
Constant-factor approximation of near-linear edit distance in near-linear time
We show that the edit distance between two strings of length $n$ can be computed within a factor of $f(\epsilon)$ in $n^{1+\epsilon}$ time as long as the edit distance is at least $n^{1-\delta}$ for some $\delta(\epsilon) > 0$.Comment: 40 pages, 4 ...
Brakensiek, Joshua, Rubinstein, Aviad
core +1 more source
Approximating Edit Distance Efficiently [PDF]
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 ...
Ziv Bar-Yossef +3 more
openaire +1 more source
ABSTRACT Background Survivors of childhood acute lymphoblastic leukemia (ALL) often exhibit early deficits in muscle and movement competence, which can compromise long‐term health. Integrative neuromuscular training (INT), a multifaceted approach combining fundamental movement activities with strength exercises, may help address these deficits during ...
Anna Maria Markarian +7 more
wiley +1 more source
Path histogram distance and complete subtree histogram distance for rooted labelled caterpillars
A rooted labelled caterpillar (a caterpillar, for short) is a rooted labelled unordered tree transformed to a path after removing all the leaves in it. In this paper, we discuss two histogram distance between caterpillars.
Taiga Kawaguchi +2 more
doaj +1 more source
We introduce fast-decodable indexing schemes for edit distance which can be used to speed up edit distance computations to near-linear time if one of the strings is indexed by an indexing string $I$.
Approximating +6 more
core +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
3GOLD: optimized Levenshtein distance for clustering third-generation sequencing data
Background Third-generation sequencing offers some advantages over next-generation sequencing predecessors, but with the caveat of harboring a much higher error rate. Clustering-related sequences is an essential task in modern biology.
Robert Logan +6 more
doaj +1 more source
The Edit Distance Function and Symmetrization [PDF]
The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The distance between a graph, G, and a hereditary property, ℋ, is the minimum of the distance between G and each G'∈ℋ. The edit distance function of ℋ is a function of p∈[0,1] and is the limit of the maximum normalized ...
openaire +3 more sources
We propose the neural string edit distance model for string-pair matching and string transduction based on learnable string edit distance. We modify the original expectation-maximization learned edit distance algorithm into a differentiable loss function, allowing us to integrate it into a neural network providing a contextual representation of the ...
Libovický, Jindřich, Fraser, Alexander
openaire +3 more sources
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source

