Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
PR
2011
9 years 9 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...
PKDD
2010
Springer
194views Data Mining» more  PKDD 2010»
10 years 14 days ago
Weighted Symbols-Based Edit Distance for String-Structured Image Classification
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
Cécile Barat, Christophe Ducottet, É...
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
10 years 29 days ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
RSA
2008
103views more  RSA 2008»
10 years 2 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
JCB
2002
111views more  JCB 2002»
10 years 2 months ago
A General Edit Distance between RNA Structures
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...
Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang
ISCI
2007
170views more  ISCI 2007»
10 years 2 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
PR
2006
152views more  PR 2006»
10 years 2 months ago
Edit distance-based kernel functions for structural pattern classification
A common approach in structural pattern classification is to define a dissimilarity measure on patterns and apply a distance-based nearest-neighbor classifier. In this paper, we i...
Michel Neuhaus, Horst Bunke
IANDC
2007
117views more  IANDC 2007»
10 years 2 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
HEURISTICS
2007
103views more  HEURISTICS 2007»
10 years 2 months ago
Distance measures based on the edit distance for permutation-type representations
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
Kenneth Sörensen
JIIS
2008
95views more  JIIS 2008»
10 years 2 months ago
Approximate schemas, source-consistency and query answering
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
Michel de Rougemont, Adrien Vieilleribière
books