Performance Analysis of Selected String Matching Algorithms Based on Good Suffix and Bad Character Rule

International Journal of Computer Applications
doi 10.5120/ijca2016909445
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Foundation of Computer Science

Related search

Analysis of String Matching Compression Algorithms

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2008English

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

Fast Algorithms for Approximate Circular String Matching

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2014English

A Review of String Matching Algorithms and Recent Implementations Using GPU

International Journal of Security and its Applications
Computer Science
2017English

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

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

2006English

Optical Character Recognition Based on Genetic Algorithms and Machine Learning

International Journal of Computer Applications
2017English

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