A collection of C++11 headers useful for reverse engineering

From 2011: Quickly search for files in NTFS volumes parsing the Master File Table (MFT). A decent amount of how NTFS and MFT work was painstakingly reverse-engineered since it's undocumented.

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.

Practical String Searching

The research work on string search algorithms

[EN]Repository with C++ implementations of famous algorithms/ [PT-BR] Repositório com implementações em C++ de algoritmos famosos

A Boyer-Moore Approach for Two-Dimensional Matching

Searching for the needle in a haystack is easy because we have the algorithm by Boyer, Moore and Horspool.

Implementation of a number of string search algorithms in Common Lisp

Parallelize the Boyer Moore Horspool algorithm for text search (stringmatching) over large volumes of text.

Boyer–Moore–Horspool algorithm that works with JS Array & TypedArray

Play with the Boyer-Moore algorithm for search a substring in a string

[EN] Implementation of the Boyer-Moore-Horspool algorithm / [FR] Implémentation de l'algorithme Boyer-Moore-Horspool

A simple implementation of the Boyer-Moore-Horspool string search algorithm for use with buffers or typed arrays

The Boyer-Moore algorithm is a string search algorithm that efficiently searches for the occurrence of a pattern in a text. It works by pre-processing the pattern to determine the bad character rule and good suffix rule, which are used to quickly skip over sections of the text that cannot match the pattern. Time complexity of O(n/m)

⚓ Trabalho Prático 4 - AEDs III

Just the Boyer-Moore-Horspool algorithm coded in Java :)

Analysing different pattern-searching algorithms when finding for substring occurrences in a given DNA main string

Boyer-Moore-Horspool text search algorithm

Share, discuss and learn about algorithm implementations!