1154 search results - page 10 / 231 » On the editing distance of graphs |
107
click to vote
JCB
2002
14 years 11 months ago
2002
Arc-annotated sequences are useful in representing the structural information of RNA sequences. In general, RNA secondary and tertiary structures can be represented as a set of ne...
121
click to vote
ESA
1998
Springer
15 years 3 months ago
1998
Springer
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...
STOC
2009
ACM
16 years 8 days ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
103
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
SPIRE
2005
Springer
15 years 5 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...