Fast Algorithms for Approximate Circular String Matching

Algorithms for Molecular Biology - United Kingdom
doi 10.1186/1748-7188-9-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

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

Vector Algorithms for Approximate String Matching

International Journal of Foundations of Computer Science
Computer Science
2002English

A Comparison of Approximate String Matching Algorithms

Software - Practice and Experience
Software
1996English

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

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1999English

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

2006English

Optimal Spaced Seeds for Faster Approximate String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

ADaM: Augmenting Existing Approximate Fast Matching Algorithms With Efficient and Exact Range Queries

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2014English

Analysis of String Matching Compression Algorithms

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2008English

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

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy