scientific article; zbMATH DE number 2052917

zbMATH Open1065.68057MaRDI QIDQ4454547FDOQ4454547

Heikki Hyyrö

Publication date: 8 March 2004

Title of this publication is not available (Why is that?)

zbMATH Keywords

approximate string matchingbit-parallelism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (5)

• Computation of edit probabilities and edit distances for the A5-type keystream generator
• Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds
• Lossless Seeds for Searching Short Patterns with High Error Rates
• Levenshtein graphs: resolvability, automorphisms \& determining sets
• Indexed dynamic programming to boost edit distance and LCSS computation

   Recommendations

• String Processing and Information Retrieval 👍 👎
• Bit-parallel approximate string matching algorithms with transposition 👍 👎
• Title not available (Why is that?) 👍 👎
• Dynamic edit distance table under a general weighted cost function 👍 👎
• String editing under a combination of constraints 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454547)