Sciweavers

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

40

SOFSEM
2005
Springer

favoriteEmaildiscussreport

101views Theoretical Computer Science» more SOFSEM 2005»

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance

14 years 4 months ago

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance

Download dis.unal.edu.co

Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara

Real-time Traffic

SOFSEM 2005 | Theoretical Computer Science |

claim paper

Related Content

» A Fast BitVector Algorithm for Approximate String Matching Based on Dynamic Programming

» Restricted Transposition Invariant Approximate String Matching Under Edit Distance

» Fast Convolutions and Their Applications in Approximate String Matching

» A Fast Algorithm for Approximate String Matching on Gene Sequences

» BitParallel Witnesses and Their Applications to Approximate String Matching

» Neighborhood based fast graph search in large networks

» Near optimal multiple alignment within a band in polynomial time

» A hybrid systems modeling framework for fast and accurate simulation of data communication...

» Coresets in dynamic geometric data streams

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	SOFSEM
Authors	Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara

Comments (0)