enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Comparison of programming languages (string functions)

    en.wikipedia.org/wiki/Comparison_of_programming...

    string.find(string, substring) (string):find(substring) Lua: returns nil string indexOfSubCollection: substring startingAt: startpos ifAbsent: aBlock string findString: substring startingAt: startpos: Smalltalk (Squeak, Pharo) evaluate aBlock which is a block closure (or any object understanding value) returns 0

  3. Approximate string matching - Wikipedia

    en.wikipedia.org/wiki/Approximate_string_matching

    After computing E(i, j) for all i and j, we can easily find a solution to the original problem: it is the substring for which E(m, j) is minimal (m being the length of the pattern P.) Computing E ( m , j ) is very similar to computing the edit distance between two strings.

  4. Longest repeated substring problem - Wikipedia

    en.wikipedia.org/wiki/Longest_repeated_substring...

    The string spelled by the edges from the root to such a node is a longest repeated substring. The problem of finding the longest substring with at least k {\displaystyle k} occurrences can be solved by first preprocessing the tree to count the number of leaf descendants for each internal node, and then finding the deepest node with at least k ...

  5. String-searching algorithm - Wikipedia

    en.wikipedia.org/wiki/String-searching_algorithm

    A string-searching algorithm, sometimes called string-matching algorithm, is an algorithm that searches a body of text for portions that match by pattern. A basic example of string searching is when the pattern and the searched text are arrays of elements of an alphabet ( finite set ) Σ.

  6. Substring - Wikipedia

    en.wikipedia.org/wiki/Substring

    A string is a substring (or factor) [1] of a string if there exists two strings and such that =.In particular, the empty string is a substring of every string. Example: The string = ana is equal to substrings (and subsequences) of = banana at two different offsets:

  7. Longest common substring - Wikipedia

    en.wikipedia.org/wiki/Longest_common_substring

    One can find the lengths and starting positions of the longest common substrings of and in (+) time with the help of a generalized suffix tree.A faster algorithm can be achieved in the word RAM model of computation if the size of the input alphabet is in (⁡ (+)).

  8. Suffix tree - Wikipedia

    en.wikipedia.org/wiki/Suffix_tree

    String search, in O(m) complexity, where m is the length of the sub-string (but with initial O(n) time required to build the suffix tree for the string) Finding the longest repeated substring Finding the longest common substring

  9. Longest palindromic substring - Wikipedia

    en.wikipedia.org/wiki/Longest_palindromic_substring

    Longest Palindromic Substring Part II., 2011-11-20, archived from the original on 2018-12-08. A description of Manacher’s algorithm for finding the longest palindromic substring in linear time. Akalin, Fred (2007-11-28), Finding the longest palindromic substring in linear time. An explanation and Python implementation of Manacher's linear ...