Optimal Spaced Seeds for Faster Approximate String Matching

Lecture Notes in Computer Science - Germany
doi 10.1007/11523468_101
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

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

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

A Comparison of Approximate String Matching Algorithms

Software - Practice and Experience
Software
1996English

Catchem: A Browser Plugin for the Panama Papers Using Approximate String Matching

2017English

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

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1999English

An Optimal Implementation of the Approximate String Matching on the Hierarchical Memory Machine, With Performance Evaluation on the GPU

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2014English

Implementation of a Programmable Array Processor Architecture for Approximate String Matching Algorithms on FPGAs

2006English

Parallel String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy