Results 1 to 10 of about 34,882 (289)
Edit Distance for Pushdown Automata [PDF]
Logical Methods in Computer Science, 2017 The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$.
Krishnendu Chatterjee +3 more
doaj +10 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 +4 more sources
A k-mismatch string matching for generalized edit distance using diagonal skipping method. [PDF]
PLoS ONE, 2021 This paper proposes an approximate string matching with k-mismatches when calculating the generalized edit distance. When the edit distance is generalized, more sophisticated string matching can be provided.
HyunJin Kim
doaj +2 more sources
Locality-sensitive bucketing functions for the edit distance [PDF]
Algorithms for Molecular Biology, 2023 Background Many bioinformatics applications involve bucketing a set of sequences where each sequence is allowed to be assigned into multiple buckets.
Ke Chen, Mingfu Shao
doaj +2 more sources
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 +3 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 +4 more sources
Map Edit Distance vs. Graph Edit Distance for Matching Images [PDF]
, 2013 Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). Recently, we have introduced a map edit distance.
Camille Combier +2 more
openaire +2 more sources
Journal of Discrete Algorithms, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sung-Ryul Kim, Kunsoo Park
openaire +3 more sources
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 +4 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 +2 more sources