Sciweavers

309 search results - page 4 / 62
» Edit distance between two RNA structures
Sort
View
GBRPR
2007
Springer
13 years 12 months ago
A Quadratic Programming Approach to the Graph Edit Distance Problem
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
Michel Neuhaus, Horst Bunke
WABI
2004
Springer
13 years 11 months ago
Novel Tree Edit Operations for RNA Secondary Structure Comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the...
Julien Allali, Marie-France Sagot
JEA
2008
97views more  JEA 2008»
13 years 5 months ago
Approximating the true evolutionary distance between two genomes
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
Krister M. Swenson, Mark Marron, Joel V. Earnest-D...
PVLDB
2010
195views more  PVLDB 2010»
13 years 16 days ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
ESA
1998
Springer
175views Algorithms» more  ESA 1998»
13 years 10 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein