Results 21 to 30 of about 272,414 (271)
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property ð£ is the asymptotically largest edit distance between a graph of density p â [0, 1] and ð£. Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source
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
The Duality of Similarity and Metric Spaces
Applied Sciences, 2021 We introduce a new mathematical basis for similarity space. For the first time, we describe the relationship between distance and similarity from set theory. Then, we derive generally valid relations for the conversion between similarity and a metric and
OndÅej Rozinek, Jan MareÅ¡
doaj +1 more source
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
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
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
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 ...
Krishnendu Chatterjee +2 more
openaire +3 more sources
Edit Distance and its Computation [PDF]
The Electronic Journal of Combinatorics, 2008 In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without using Szemerédi's Regularity Lemma directly. Using this new method, we are able to compute the edit distance from hereditary properties for which it was ...
József Balogh, Ryan R. Martin
openaire +4 more sources
Redefining the Graph Edit Distance [PDF]
SN Computer Science, 2021 AbstractGraph edit distance has been used since 1983 to compare objects in machine learning when these objects are represented by attributed graphs instead of vectors. In these cases, the graph edit distance is usually applied to deduce a distance between attributed graphs.
openaire +1 more source
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