Template:Strings: Difference between revisions

Latest revision as of 18:28, 2 January 2022

v t e Strings
String metric	Approximate string matching Bitap algorithm Damerau–Levenshtein distance Edit distance Gestalt Pattern Matching Hamming distance Jaro–Winkler distance Lee distance Levenshtein automaton Levenshtein distance Wagner–Fischer algorithm
String-searching algorithm	Apostolico–Giancarlo algorithm Boyer–Moore string-search algorithm Boyer–Moore–Horspool algorithm Knuth–Morris–Pratt algorithm Rabin–Karp algorithm
Multiple string searching	Aho–Corasick Commentz-Walter algorithm
Regular expression	Comparison of regular-expression engines Regular grammar Thompson's construction Nondeterministic finite automaton
Sequence alignment	Hirschberg's algorithm Needleman–Wunsch algorithm Smith–Waterman algorithm
Data structure	DAFSA Suffix array Suffix automaton Suffix tree Generalized suffix tree Rope Ternary search tree Trie
Other	Parsing Pattern matching Compressed pattern matching Longest common subsequence Longest common substring Sequential pattern mining Sorting

Revision as of 18:12, 4 February 2020 (view source) Wikipedia>Jochen Burghardt (a regular grammar describes a set of strings; regular tree grammars are a generalization that describe sets of trees; what about Deterministic finite automaton, regular language. alternating finite automaton, prefix grammar?)	Latest revision as of 18:28, 2 January 2022 (view source) Richardpruen (talk \| contribs) m (1 revision imported)
(No difference)