• the Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter. Like the Aho–Corasick string matching algorithm, it can...
    7 KB (788 words) - 05:19, 11 March 2025
  • computer science, Thompson's construction algorithm, also called the McNaughton–Yamada–Thompson algorithm, is a method of transforming a regular expression...
    14 KB (1,221 words) - 06:31, 14 April 2025
  • Thumbnail for Aho–Corasick algorithm
    search, retaining the algorithmic complexity of the original. Commentz-Walter algorithm Aho, Alfred V.; Corasick, Margaret J. (June 1975). "Efficient...
    10 KB (1,255 words) - 01:59, 19 April 2025
  • 1221–1248. doi:10.1002/spe.4380211105. S2CID 5902579. Commentz-Walter, Beate (1979). A String Matching Algorithm Fast on the Average (PDF). International Colloquium...
    18 KB (1,970 words) - 20:41, 23 April 2025
  • Thumbnail for Rope (data structure)
    complexity of source code; greater risk of bugs This table compares the algorithmic traits of string and rope implementations, not their raw speed. Array-based...
    16 KB (1,787 words) - 10:55, 12 May 2025
  • Thumbnail for Longest common subsequence
    linear in the lengths of the remaining sequences, so the time for this algorithm would be O ( 2 n 1 ∑ i > 1 n i ) . {\displaystyle O\left(2^{n_{1}}\sum...
    35 KB (4,355 words) - 22:13, 6 April 2025
  • PrefixSpan algorithm and place the products on shelves based on the order of mined purchasing patterns. Commonly used algorithms include: GSP algorithm Sequential...
    9 KB (1,125 words) - 19:42, 10 June 2025
  • Wikibooks has a book on the topic of: Algorithm Implementation/Strings/Longest common substring In computer science, a longest common substring of two...
    8 KB (1,072 words) - 16:32, 25 May 2025
  • name, it matches any value, but does not bind the value to any name. Algorithms for matching wildcards in simple string-matching situations have been...
    22 KB (2,581 words) - 19:44, 12 May 2025
  • an algorithm for compiling a regular expression to an NFA that can efficiently perform pattern matching on strings. Conversely, Kleene's algorithm can...
    29 KB (4,499 words) - 06:31, 14 April 2025
  • string matching algorithm Multiple string searching Aho–Corasick Commentz-Walter algorithm Regular expression Comparison of regular-expression engines Regular...
    8 KB (988 words) - 21:36, 23 September 2024
  • Substring index (category Algorithms on strings)
    related to the suffix tree and constructable by variants of the same algorithms. The suffix array, a sorted array of the starting positions of suffixes...
    5 KB (611 words) - 08:19, 10 January 2025
  • always decode the entire text and then apply a classic string matching algorithm, but this usually requires more space and time and often is not possible...
    4 KB (510 words) - 23:18, 19 December 2023
  • Ternary search tree (category Search algorithms)
    (by Jon Bentley and Robert Sedgewick) about ternary search trees and algorithms for "sorting and searching strings" Ternary Search Tries – a video by...
    14 KB (1,784 words) - 21:43, 13 November 2024
  • Thumbnail for Suffix automaton
    the University of Colorado Boulder. They suggested a linear time online algorithm for its construction and showed that the suffix automaton of a string...
    55 KB (8,334 words) - 06:31, 14 April 2025