Amanote Research

Amanote Research

    RegisterSign In

New and Efficient Recursive-Based String Matching Algorithm (RSMA-FLFC)

International Journal of Computer Applications
doi 10.5120/15058-3190
Full Text
Open PDF
Abstract

Available in full text

Date

January 16, 2014

Authors
Jehad Q.Odeh
Publisher

Foundation of Computer Science


Related search

Parallel String Matching Algorithm Using Grid

International Journal of Distributed and Parallel systems
2012English

An Efficient Graph-Based Algorithm for Fingerprint Representation and Matching

2013English

Parallel Optimization of String Mode Matching Algorithm Based on Multi-Core Computing

Journal of Software Engineering
Software
2015English

Fast-Join: An Efficient Method for Fuzzy Token Matching Based String Similarity Join

2011English

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

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1999English

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

Parallel String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Quick-Skip Search Hybrid Algorithm for the Exact String Matching Problem

International Journal of Computer Theory and Engineering
2012English

VIRE and Recursive-Verify Based RFID Location Algorithm

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy