Table of Contents
15 relations: Address space, Big O notation, Boyer–Moore string-search algorithm, C standard library, Computer science, Dominique Perrin, Fibonacci sequence, Glibc, Golden ratio, Knuth–Morris–Pratt algorithm, Maxime Crochemore, Musl, Newlib, String (computer science), String-searching algorithm.
- String matching algorithms
Address space
In computing, an address space defines a range of discrete addresses, each of which may correspond to a network host, peripheral device, disk sector, a memory cell or other logical or physical entity.
See Two-way string-matching algorithm and Address space
Big O notation
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.
See Two-way string-matching algorithm and Big O notation
Boyer–Moore string-search algorithm
In computer science, the Boyer–Moore string-search algorithm is an efficient string-searching algorithm that is the standard benchmark for practical string-search literature. Two-way string-matching algorithm and Boyer–Moore string-search algorithm are string matching algorithms.
See Two-way string-matching algorithm and Boyer–Moore string-search algorithm
C standard library
The C standard library or libc is the standard library for the C programming language, as specified in the ISO C standard.
See Two-way string-matching algorithm and C standard library
Computer science
Computer science is the study of computation, information, and automation.
See Two-way string-matching algorithm and Computer science
Dominique Perrin
Dominique Pierre Perrin (b. 1946) is a French mathematician and theoretical computer scientist known for his contributions to coding theory and to combinatorics on words.
See Two-way string-matching algorithm and Dominique Perrin
Fibonacci sequence
In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones.
See Two-way string-matching algorithm and Fibonacci sequence
Glibc
The GNU C Library, commonly known as glibc, is the GNU Project implementation of the C standard library.
See Two-way string-matching algorithm and Glibc
Golden ratio
In mathematics, two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities.
See Two-way string-matching algorithm and Golden ratio
Knuth–Morris–Pratt algorithm
In computer science, the Knuth–Morris–Pratt algorithm (or KMP algorithm) is a string-searching algorithm that searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters. Two-way string-matching algorithm and Knuth–Morris–Pratt algorithm are string matching algorithms.
See Two-way string-matching algorithm and Knuth–Morris–Pratt algorithm
Maxime Crochemore
Maxime Crochemore (born 1947) is a French computer scientist known for his numerous contributions to algorithms on strings.
See Two-way string-matching algorithm and Maxime Crochemore
Musl
musl is a C standard library intended for operating systems based on the Linux kernel, released under the MIT License.
See Two-way string-matching algorithm and Musl
Newlib
Newlib is a C standard library implementation intended for use on embedded systems.
See Two-way string-matching algorithm and Newlib
String (computer science)
In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.
See Two-way string-matching algorithm and String (computer science)
String-searching algorithm
In computer science, string-searching algorithms, sometimes called string-matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. Two-way string-matching algorithm and string-searching algorithm are string matching algorithms.
See Two-way string-matching algorithm and String-searching algorithm
See also
String matching algorithms
- Aho–Corasick algorithm
- Apostolico–Giancarlo algorithm
- Approximate string matching
- Bitap algorithm
- Boyer–Moore string-search algorithm
- Boyer–Moore–Horspool algorithm
- Commentz-Walter algorithm
- Knuth–Morris–Pratt algorithm
- Levenshtein automaton
- Rabin–Karp algorithm
- Raita algorithm
- Spaced seed
- String-searching algorithm
- Trigram search
- Two-way string-matching algorithm
- Zhu–Takaoka string matching algorithm