Results 261 to 270 of about 34,882 (289)
Some of the next articles are maybe not open access.
A survey of graph edit distance
Pattern Analysis and Applications, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xinbo Gao 0001 +3 more
openaire +2 more sources
Biological Network Edit Distance
Journal of Computational Biology, 2016Interactions among biological entities contain more information than purely the similarities between the entities. For example, interactions between genes, and gene products, can be more informative than the sequence similarities of the genes involved.
Martin McGrane, Michael A. Charleston
openaire +2 more sources
Homomorphic Computation of Edit Distance
2015These days genomic sequence analysis provides a key way of understanding the biology of an organism. However, since these sequences contain much private information, it can be very dangerous to reveal any part of them. It is desirable to protect this sensitive information when performing sequence analysis in public.
Jung Hee Cheon +2 more
openaire +2 more sources
Normalizing the weighted edit distance
Proceedings of the 12th IAPR International Conference on Pattern Recognition (Cat. No.94CH3440-5), 2002In this paper, we discuss the weighted edit distance and two well known normalizations, one based on editing path lengths and one based on the string lengths. We investigate the limitations of these approaches as well as the restrictions on the associated weight function including the triangular inequality. As a solution to the problems pointed out, we
Achim Weigel, Frank Fein
openaire +1 more source
2015
In pattern recognition and data mining applications, where the underlying data is characterized by complex structural relationships, graphs are often used as a formalism for object representation. Yet, the high representational power and flexibility of graphs is accompanied by a significant increase of the complexity of many algorithms.
Kaspar Riesen +3 more
openaire +1 more source
In pattern recognition and data mining applications, where the underlying data is characterized by complex structural relationships, graphs are often used as a formalism for object representation. Yet, the high representational power and flexibility of graphs is accompanied by a significant increase of the complexity of many algorithms.
Kaspar Riesen +3 more
openaire +1 more source
Edit-Distance of Weighted Automata
2003The 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, 1997Horst Bunke
exaly
Graph edit distance from spectral seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005Antonio Robles-Kelly, Edwin R Hancock
exaly
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing, 2009Kaspar Riesen, Horst Bunke
exaly