You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
NewAlexandria
5a081a62c2
|
5 years ago | |
|---|---|---|
| .. | ||
| README.md | 5 years ago | |
README.md
Stringology
Stringology refers to one of the various kinds of string processing algorithms.
🧭 Part of the pattern-matching group, in PWL
External Papers
-
A Taxonomy of Suffix Array Construction Algorithms
- A great introduction to suffix arrays, but also a survey paper that is more than the sum of its citations, clarifying the presentation of all the algorithms with a unifying framework.
-
- This paper describes techniques to improve the performance of the Boyer–Moore string search algorithm.