A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming

Journal of the ACM - United States
doi 10.1145/316542.316550
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Vector Algorithms for Approximate String Matching

International Journal of Foundations of Computer Science
Computer Science
2002English

Fast Algorithms for Approximate Circular String Matching

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2014English

Approximate Dynamic Programming Using Support Vector Regression

2008English

A Comparison of Approximate String Matching Algorithms

Software - Practice and Experience
Software
1996English

Correction To: New Algorithms for Fixed-Length Approximate String Matching and Approximate Circular String Matching Under the Hamming Distance

Journal of Supercomputing
HardwareInformation SystemsTheoretical Computer ScienceArchitectureSoftware
2018English

Optimal Spaced Seeds for Faster Approximate String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Nested Counters in Bit-Parallel String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A Fast Search Algorithm for Vector Quantization Based on Associative Memories

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

A Fast Matching Algorithm With Feature Points Based on NCC

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy