Results 241 to 250 of about 270,219 (278)
Some of the next articles are maybe not open access.
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
Fundamenta Informaticae, 2009This article proposes an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that σ/2 ≤ τ ≤ (h +
Aratsu, Taku +2 more
openaire +1 more source
Edit distance modulo bisimulation
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 2014When a user learns to use a new device, her understanding of it evolves. A progressive comparison of the evolving user models towards the device target model, for analysing learning, involves determining the behavioral proximity between them. To quantify the gap between a user model and a target model, we introduce an edit distance metric for measuring
Himanshu Zade +4 more
openaire +1 more source
2015
Graph edit distance measures distances between two graphs \(g_1\) and \(g_2\) by the amount of distortion that is needed to transform \(g_1\) into \(g_2\). The basic distortion operations of graph edit distance can cope with arbitrary labels on both nodes and edges as well as with directed or undirected edges.
openaire +1 more source
Graph edit distance measures distances between two graphs \(g_1\) and \(g_2\) by the amount of distortion that is needed to transform \(g_1\) into \(g_2\). The basic distortion operations of graph edit distance can cope with arbitrary labels on both nodes and edges as well as with directed or undirected edges.
openaire +1 more source
Peak alignment using restricted edit distances
Biomolecular Engineering, 2007A peak is a pair of real values (x,y), where x is the time when peak of height y is registered. In the peak alignment problem, we are given two sequences of peaks, and our task is to align the sequences allowing some basic edit operations on the peaks.
openaire +3 more sources
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
Analysis of Tree Edit Distance Algorithms
2003In this article, we study the behaviour of dynamic programming methods for the tree edit distance problem, such as [4] and [2]. We show that those two algorithms may be described in a more general framework of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.
Dulucq, Serge, Touzet, Hélène
openaire +2 more sources
2020
This short note introduces a new distance between strings, where the cost of an insertion or deletion is inversely proportional to the string length. It improves upon previous results by admitting a simple, explicit formula involving only the length of the longest common subsequence and satisfying the triangle inequality at the same time, while not ...
openaire +1 more source
This short note introduces a new distance between strings, where the cost of an insertion or deletion is inversely proportional to the string length. It improves upon previous results by admitting a simple, explicit formula involving only the length of the longest common subsequence and satisfying the triangle inequality at the same time, while not ...
openaire +1 more source
2015
In this chapter, we reformulate the graph edit distance problem to a quadratic assignment problem. This reformulation actually builds the basis for a recent approximation algorithm, which in turn builds the core algorithm for the second part of the present book.
openaire +1 more source
In this chapter, we reformulate the graph edit distance problem to a quadratic assignment problem. This reformulation actually builds the basis for a recent approximation algorithm, which in turn builds the core algorithm for the second part of the present book.
openaire +1 more source
Molecule Edit Graph Attention Network: Modeling Chemical Reactions as Sequences of Graph Edits
Journal of Chemical Information and Modeling, 2021Rafał Loska, Stanisław Jastrzębski
exaly
Efficacy of Diltiazem to Improve Coronary Vasomotor Dysfunction in ANOCA
JACC: Cardiovascular Imaging, 2022Tijn P J Jansen +2 more
exaly