Results 11 to 20 of about 272,414 (271)
The Extended Edit Distance Metric [PDF]
2008 International Workshop on Content-Based Multimedia Indexing, 2007 Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high dimensional data
Fuad, Muhammad Marwan Muhammad +1 more
core +5 more sources
Edit Distance with Block Deletions [PDF]
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +3 more sources
Bayesian graph edit distance [PDF]
Proceedings 10th International Conference on Image Analysis and Processing, 2000 This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1].
Hancock, E.R., Myers, R., Wilson, R.C.
core +3 more sources
Toward Efficient Similarity Search under Edit Distance on Hybrid Architectures
Information, 2022 Edit distance is the most widely used method to quantify similarity between two strings. We investigate the problem of similarity search under edit distance.
Madiha Khalid +2 more
doaj +1 more source
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 +2 more sources
Military realm entity links based on improved editing distances [PDF]
Zhihui kongzhi yu fangzhen, 2023 In order to accurately link the entity references in the commander’s demand statement to the standardized entity nodes in the knowledge graph, an entity linking method in the military domain based on improved edit distance is proposed. By summarizing the
XIA Xudong, YU Ronghuan
doaj +1 more source
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 +2 more sources
A New String Edit Distance and Applications
Algorithms, 2022 String edit distances have been used for decades in applications ranging from spelling correction and web search suggestions to DNA analysis. Most string edit distances are variations of the Levenshtein distance and consider only single-character edits ...
Taylor Petty +3 more
doaj +1 more source
A contextual normalised edit distance [PDF]
2008 IEEE 24th International Conference on Data Engineering Workshop, 2008 In order to better fit a variety of pattern recognition problems over strings, using a normalised version of the edit or Levenshtein distance is considered to be an appropriate approach. The goal of normalisation is to take into account the lengths of the strings.
Colin de la Higuera, Luisa Micó
openaire +2 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 of them.
Alexandr Andoni, Robert Krauthgamer
openaire +1 more source