Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

ICANNGA
2009
Springer

favoriteEmaildiscussreport

130views Algorithms» more ICANNGA 2009»

String Distances and Uniformities

14 years 5 months ago

String Distances and Uniformities

Download labh-curien.univ-st-etienne.fr

Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (insertion, deletion, substitution) to obtain different types of classiﬁcations of sets of strings. As a more general and less constrained approach we introduce topological notions and in particular uniformities.

David W. Pearson, Jean-Christophe Janodet

Real-time Traffic

Algorithms | Character Strings | Constrained Approach | Edit Distance | ICANNGA 2009 |

claim paper

Related Content

» Bitparallel string matching under Hamming distance in Onmw worst case time

» Approximating Reversal Distance for Strings with Bounded Number of Duplicates

» Consensus Optimizing Both Distance Sum and Radius

» A comparison of two approaches to pseudorandomness

» Generalized vs Set Median Strings for HistogramBased Distances Algorithms and Classificati...

» Coding Solutions for the Secure Biometric Storage Problem

» TrieJoin Efficient Triebased String Similarity Joins with EditDistance Constraints

» On the Uniform Distribution of Strings

» Distance Based Indexing for String Proximity Search

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ICANNGA
Authors	David W. Pearson, Jean-Christophe Janodet

Comments (0)