wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

longest_common_substring (308B)

      1 # Longest common substring
      2 
      3 Given two [words] u and v, find a [word] w of maximal [length] such that w is a [factor] of u and of v
      4 
      5 Can be solved in [linear_time] with a [suffix_tree]
      6 
      7 Up: [stringology], [subword]
      8 
      9 See also: [longest_common_subsequence]
     10 
     11 Aliases: longest common factor, longest common infix