Fast string search using Boyer-Moore algorithm in pony
-
Updated
Sep 2, 2016 - Pony
Fast string search using Boyer-Moore algorithm in pony
Backup for Advanced Data Structures class labs
Implementation and performance comparison of Boyer Moore, Horspool and Brute Force in c programming language.
A repository to store algorithms written in Go
Bop is a very fast Boyer-Moore parser/matcher for String or Buffer patterns.
Auntie, my dear ultra-fast module for untying/splitting/counting a stream of data by a chosen separator sequence.
Pattern searching with differents algorithms
Sharpen your problem solving and data organization skills using Java data structures and algorithms
Around 35 of the fastest and most widely used full text search algorithms. Written in c, compiled with llvm.clang for iOS and everything else. Boyer-Moore , Knuth-Morris-Pratt, Reverse Colussi even the Zhu-Takaoka algorithm. And 32 more.
Boyer-Moore-Horspool text search algorithm
Fast alignment of genomic sequences using Boyer-Moore with linear time construction of indexes using Z algorithm.
A string manipulation library in Golang
Laboratory work on text search course
Turn a sentence of a language into a bizzare, unreadable dialected language with inspirations from another language.
This is a C++ project for my Analysis of Algorithms class.
Implementation of string search algorithms for CZ2001 Project 1
Extract SysCfg data from corrupted or unreadable NAND dumps.
Real-time writing prediction and correction model based on the trie data structure, the Boyer-Moore algorithm for string matching, and the Levenshtein distance (using dynamic programming) for string similarity. This was designed and implemented as the final project of the "Design and Analysis of Algorithms" and "Programming for Data Analysis" cl…
Add a description, image, and links to the boyer-moore topic page so that developers can more easily learn about it.
To associate your repository with the boyer-moore topic, visit your repo's landing page and select "manage topics."