Results 21 to 30 of about 50,367 (275)
FEDS - Filtered Edit Distance Surrogate [PDF]
, 2021 ICDAR 2021 camera-ready ...
Yash Patel, Jiří Matas
openaire +2 more sources
Approximating the Geometric Edit Distance
Algorithmica, 2022 Edit distance is a measurement of similarity between two sequences such as strings, point sequences, or polygonal curves. Many matching problems from a variety of areas, such as signal analysis, bioinformatics, etc., need to be solved in a geometric space. Therefore, the geometric edit distance (GED) has been studied.
Kyle Fox, Xinyi Li
openaire +4 more sources
Coding for interactive communication correcting insertions and deletions [PDF]
, 2016 We consider the question of interactive communication, in which two remote parties perform a computation while their communication channel is (adversarially) noisy. We extend here the discussion into a more general and stronger class of noise, namely, we
Braverman, Mark +3 more
core +2 more sources
Recurrence analysis of extreme event-like data [PDF]
Nonlinear Processes in Geophysics, 2021 The identification of recurrences at various timescales in extreme event-like time series is challenging because of the rare occurrence of events which are separated by large temporal gaps.
A. Banerjee +11 more
doaj +1 more source
Similar Supergraph Search Based on Graph Edit Distance
Algorithms, 2021 Subgraph and supergraph search methods are promising techniques for the development of new drugs. For example, the chemical structure of favipiravir—an antiviral treatment for influenza—resembles the structure of some components of RNA.
Masataka Yamada, Akihiro Inokuchi
doaj +1 more source
Edit distance measure for graphs [PDF]
Czechoslovak Mathematical Journal, 2015 The edit number \(s(G,F)\) of two graphs \(G,F\) of order \(n\) is the minimum number of edges needed to be added/deleted from the graph \(G\) to obtain a graph isomorphic to \(F\). In this paper, the author provides values and bounds for \(g(n,l)\), the maximum number \(k\) for which there are \(l\) graphs of order \(n\), each two having edit distance
Dzido, Tomasz, Krzywdziński, Krzysztof
openaire +2 more sources
The Edit Distance as a Measure of Perceived Rhythmic Similarity
Empirical Musicology Review, 2012 The ‘edit distance’ (or ‘Levenshtein distance’) measure of distance between two data sets is defined as the minimum number of editing operations – insertions, deletions, and substitutions – that are required to transform one data set to the other (Orpen ...
Olaf Post, Godfried Toussaint
doaj +1 more source
Edit distance for timed automata [PDF]
Proceedings of the 17th international conference on Hybrid systems: computation and control, 2014 The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory ...
Chatterjee, Krishnendu +2 more
openaire +2 more sources
Constant-factor approximation of near-linear edit distance in near-linear time
, 2020 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
Fifty years of spellchecking [PDF]
, 2010 A short history of spellchecking from the late 1950s to the present day, describing its development through dictionary lookup, affix stripping, correction, confusion sets, and edit distance to the use of gigantic ...
Blair CR +27 more
core +1 more source