scientific article; zbMATH DE number 2052917
From MaRDI portal
Publication:4454547
zbMATH Open1065.68057MaRDI QIDQ4454547FDOQ4454547
Authors: Heikki Hyyrö 
Publication date: 8 March 2004
Title of this publication is not available (Why is that?)
Recommendations
- Bit-parallel approximate string matching algorithms with transposition.
- Bit-parallel approximate string matching algorithms with transposition
- scientific article; zbMATH DE number 3845091
- Dynamic edit distance table under a general weighted cost function
- String editing under a combination of constraints
Cited In (10)
- Notes on generating completely condensed \(d\)-neighborhoods
- Computation of edit probabilities and edit distances for the A5-type keystream generator
- Lossless seeds for searching short patterns with high error rates
- Bit-parallel approximate string matching algorithms with transposition
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds
- Bit-parallel approximate string matching algorithms with transposition.
- Levenshtein graphs: resolvability, automorphisms \& determining sets
- Indexed dynamic programming to boost edit distance and LCSS computation
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm
- Title not available (Why is that?)
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)
