There are 0 repository under substring-search topic.
A string type for Rust that is not required to be valid UTF-8.
A fast implementation of single-pattern substring search using SIMD acceleration.
efficient string matching in Golang via the aho-corasick algorithm.
Very fast C# implementation of Aho Corasick algorithm based on Double Array Trie.
memchr vs stringzilla - up to 7x throughput difference between two SIMD-accelerated substring search libraries in Rust
Pure js multiselect implementation
Package cs-algorithms provides C# implementation of algorithms for data structures and manipulation, as well as graph and string processing
Notes of Algorithms Learning
[VLDB'22] Cardinality Estimation of Approximate Substring Queries using Deep Learning.
dna coding challenge
Benchmark various aho-carosick node libraries against large corpus text and pattern lengths
Repositiry for substring search problem
A Small Python Script that looks for a Password/User Entered String in a File
Basic seed-and-extend DNA sequence read aligner
Suffix Array implemented in c/c++ exposed to python through cython.
Tiny fzf integration for history substring search in PowerShell
Algorithms and implementations for data structures
Cython bindings on C++ aho_corasick libarary
Useful Algorithms covering multiple topics completed in Java.
Multithreading is used in this program to improve the efficiency of searching for substrings within large strings. POSIX thread libraries were used to support multiple threads. Standard C/C++ thread APIs are provided by the POSIX thread libraries. New concurrent processes can be spawned with this method.
Console application to remove a substring from all filenames in the folder it was run in
Implementation of common algorithms as part of the COMP20290 module
Naive algorith to search substring in string
substring_between_letters() takes a string named _word_, a single character named _start_, and another character named _end_. This function should return the substring between the first occurrence of _start_ and _end_ in word. If _start_ or _end_ are not in _word_, the function should return _word_. For example, substring_between_letters("apple", "p", "e") should return "pl".
refresher project from Hackerrank to practice writing a custom Comparator (original problem at https://www.hackerrank.com/challenges/java-string-compare/problem).
gives positions of occurrence of a substring using rolling hash functions
Algorithms of finding a substring in a string