substring
41Mir (social) — The Russian word mir (мир), besides its direct meanings of peace and world Until the 1918 reforms of the Russian alphabet, the letter decimal I, identical in pronunciation to was used in the word міръ IPA| [mʲir] ( world ) and its derivatives, to …
42Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… …
43Iriy — or Irij, according to neo paganist manuals, was the paradise in old Slavic religion and part of Svarga. This term is probably derived from [http://staring.rinet.ru/cgi bin/response.cgi?root=%2Fusr%2Flocal%2Fshare%2Fstarling%2Fmorpho morpho=1… …
44Vladimir (name) — Vladimir (Владимир) is a Slavic given name of Church Slavonic and Old East Slavic origin, now widespread throughout all Slavic nations. The first part of the name is derived from the Slavic root vlad for rule , and the second part from the root… …
45Lendians — The Lendians ( pl. Lędzianie) were a Lechitic tribe recorded to have inhabited the ill defined area in East Lesser Poland and Red Ruthenia between the 7th and 11th centuries. Since they were documented primarily by foreign authors whose knowledge …
46Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) 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… …
47Longest common subsequence problem — Not to be confused with longest common substring problem. The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a… …
48Suffix array — In computer science, a suffix array is an array giving the suffixes of a string in lexicographical order.DetailsConsider the string abracadabra , of length 11. It has eleven suffixes: abracadabra , bracadabra , racadabra , and so on down to a .… …
49Damerau–Levenshtein distance — In information theory and computer science, the Damerau–Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a distance (string metric) between two strings, i.e., finite sequence of symbols, given by counting the …
50Text Executive Programming Language — In 1979, Honeywell Information Systems announced a new programming language for their time sharing service named TEX, an acronym for the Text Executive processor. TEX was a first generation scripting language, developed around the time of AWK and …
