Approximate String Matching with Reduced Alphabet

12 years 11 months ago

Download www.cs.hut.fi

Abstract. We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned version of the approximate Boyer

Leena Salmela, Jorma Tarhio

Real-time Traffic

Alphabet Reduction | Alphabet Reduction Scheme | Applied Computing | Approximate Boyer Moore | BIRTHDAY 2010 |

claim paper

» On building minimal automaton for subset matching queries

» Parameterized matching with mismatches

» Restricted Transposition Invariant Approximate String Matching Under Edit Distance

» A New Indexing Method for Approximate String Matching

» OnLine Approximate String Matching with Bounded Errors

» Approximate String Matching over ZivLempel Compressed Text

» BitParallel Witnesses and Their Applications to Approximate String Matching

» Finding approximate palindromes in strings

Post Info
More Details (n/a)

Added	12 May 2011
Updated	12 May 2011
Type	Journal
Year	2010
Where	BIRTHDAY
Authors	Leena Salmela, Jorma Tarhio

Comments (0)

Sciweavers

Approximate String Matching with Reduced Alphabet

Alphabet Reduction | Alphabet Reduction Scheme | Applied Computing | Approximate Boyer Moore | BIRTHDAY 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Sciweavers

Approximate String Matching with Reduced Alphabet

Alphabet Reduction | Alphabet Reduction Scheme | Applied Computing | Approximate Boyer­ Moore | BIRTHDAY 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Alphabet Reduction | Alphabet Reduction Scheme | Applied Computing | Approximate Boyer Moore | BIRTHDAY 2010 |