Sciweavers

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

11

BIRTHDAY
2010
Springer

favoriteEmaildiscussreport

159views Applied Computing» more BIRTHDAY 2010»

A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches

13 years 6 months ago

A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches

Download www.dcs.kcl.ac.uk

Maxime Crochemore, Costas S. Iliopoulos, Solon P.

Real-time Traffic

Applied Computing | BIRTHDAY 2010 |

claim paper

Related Content

» A Fast Algorithm for Approximate String Matching on Gene Sequences

» BitParallel Witnesses and Their Applications to Approximate String Matching

» RMESH Algorithms for Parallel String Matching

» Increased BitParallelism for Approximate String Matching

» Implementation of a programmable array processor architecture for approximate string match...

» Processor array architectures for flexible approximate string matching

» Approximate String Matching in LDAP Based on Edit Distance

» Approximate String Matching in DNA Sequences

» Using Parallel Algorithms for Searching Molecular Sequence Databases

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2010
Where	BIRTHDAY
Authors	Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis

Comments (0)