Results 21 to 30 of about 1,895,967 (280)
Approximating Tree Edit Distance through String Edit Distance [PDF]
Algorithmica, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tatsuya Akutsu +2 more
openaire +4 more sources
On the editing distance of graphs [PDF]
Journal of Graph Theory, 2008 AbstractAn edge‐operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from G to $\cal G$ is the smallest number of edge‐operations needed to modify G into a graph from $\cal G$.
Maria Axenovich +2 more
openaire +3 more sources
AlBi-HHU/homo-edit-distance: Initial Release
, 2020 <p>Implementation of the homo-edit-distance algorithm.</p ...
Maren Brand +5 more
core +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 +6 more sources
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
Alexandr Andoni, Robert Krauthgamer
openaire +3 more sources
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
The extended edit distance metric [PDF]
2008 International Workshop on Content-Based Multimedia Indexing, 2008 Technical ...
Muhammad Fuad, Muhammad Marwan +1 more
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
Revisiting Volgenant-Jonker for Approximating Graph Edit Distance [PDF]
, 2015 Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task.
Andy King +5 more
core +1 more source
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