Results 251 to 260 of about 272,414 (271)

Edit-Distance of Weighted Automata

2003
The edit-distance of two strings is the minimal cost of a sequence of symbol insertions, deletions, or substitutions transforming one string into the other. The definition is used in various contexts to give a measure of the difference or similarity between two strings.
openaire   +1 more source

On a relation between graph edit distance and maximum common subgraph

Pattern Recognition Letters, 1997
Horst Bunke
exaly  

Graph edit distance: Restrictions to be a metric

Pattern Recognition, 2019
Francesc Serratosa
exaly  

Approximate graph edit distance computation by means of bipartite graph matching

Image and Vision Computing, 2009
Kaspar Riesen, Horst Bunke
exaly  

Efficient Computation of the Tree Edit Distance

ACM Transactions on Database Systems, 2015
Mateusz Pawlik, Nikolaus Augsten
exaly  

Burst Edit Distance

Itai Boneh, Shay Golan 0001, Avivit Levy, Ely Porat, B. Riva Shalom   +4 more
openaire   +1 more source

Automatic learning of cost functions for graph edit distance

Information Sciences, 2007
Michel Neuhaus, Horst Bunke
exaly  

Graph edit distance as a quadratic assignment problem

Pattern Recognition Letters, 2017
Sébastien Bougleux, Luc Brun, Vincenzo Carletti   +2 more
exaly  

A dynamic edit distance table

Journal of Discrete Algorithms, 2004
Kunsoo Park
exaly  

On the exact computation of the graph edit distance

Pattern Recognition Letters, 2020
David B Blumenthal, Johann Gamper
exaly