A faster quick search algorithm
From MaRDI portal
Publication:1736618
DOI10.3390/A7020253zbMATH Open1461.68269OpenAlexW2165292775MaRDI QIDQ1736618FDOQ1736618
Donald Adjeroh, Jie Lin, Yue Jiang
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a7020253
Recommendations
Protein sequences, DNA sequences (92D20) Searching and sorting (68P10) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Efficient randomized pattern-matching algorithms
- On improving the worst case running time of the Boyer-Moore string matching algorithm
- A fast string searching algorithm
- The Boyer–Moore–Galil String Searching Strategies Revisited
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal canonization of all substrings of a string
- The exact online string matching problem: a review of the most recent results
- Average-optimal string matching
- A simple fast hybrid pattern-matching algorithm
- Pattern matching in compressed texts and images
Cited In (4)
This page was built for publication: A faster quick search algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736618)