154 search results - page 16 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
CSB
2005
IEEE
15 years 5 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
ICNP
2007
IEEE
15 years 6 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
111
click to vote
SODA
2010
ACM
14 years 10 months ago
2010
ACM
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...
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
ICSM
2002
IEEE
15 years 4 months ago
2002
IEEE
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...