Search results

{{Short description|Optimization of Boyer–Moore string-search algorithm}} ...rn <math>P</math> in a text <math>T</math>. As with other comparison-based string searches, this is done by aligning <math>P</math> to a certain index of <ma ...

{{Short description|Compressed data structure for pattern matching}} ...tructures enable quick search for an arbitrary [[String (computer science)|string]] with a comparatively small index. ...

{{Short description|String-matching algorithm}} ...hing algorithm]] for determining the [[String metric|similarity]] of two [[String (computer science)|strings]]. It was developed in 1983 by [[John W. Ratclif ...

{{short description|Computer science string term}} ...{ 0, \ldots, n-1 \} </math> then the unknown element at place ''k'' in the string is called a "hole". In [[regular expression]]s (following the [[POSIX]] sta ...

...h string in <math>S</math>. It is primarily used in [[bioinformatics]] and string processing. |title=Suffix arrays for multiple strings: A method for on-line multiple string searches. ...

...he more similar two strings ''a'' and ''b'' are, the higher the value of a string kernel ''K''(''a'', ''b'') will be. ...these to fixed-length, real-valued [[feature vector]]s.<ref name="Lodhi"/> String kernels are used in domains where sequence data are to be [[Cluster analysi ...

...wavelet tree on the string "abracadabra". At each node the symbols of the string are projected onto two partitions of the alphabet, and a bitvector denotes ...structure#Succinct dictionaries|bitvector]] stores whether a symbol of the string belongs to one subset or the other. ...

{{Short description|String-searching algorithm}} |class = [[String-searching algorithm]] ...

...s a subset of the problem of matching [[regular expressions]] and [[string matching]] in general.<ref>{{cite web| last=Goyvaerts| first=Jan| title=Welcome to R A wildcard matcher tests a wildcard pattern ''p'' against an input string ''s''. It performs an ''anchored'' match, returns true only when ''p'' matc ...

{{Evolutionary algorithms}} ...hm]]s that identifies a [[subset]] of strings with similarities at certain string positions. Schemata are a special case of [[cylinder set]]s, forming a [[Ba ...

...xpression to an NFA |pages=64–69}}</ref> This NFA can be used to [[pattern matching|match strings]] against the regular expression. This algorithm is credited ...{{mvar|n}} in time {{math|''O''(''emn'')}}, a Thompson NFA can do pattern matching in linear time, assuming a fixed-size alphabet.<ref>{{cite web |first=Guang ...

...palindromic substring is not guaranteed to be unique; for example, in the string "abracadabra", there is no palindromic substring with length greater than t ...lindromic Substring in Sublinear Time | conference = Combinatorial Pattern Matching | editor1-last=Bannai|editor1-first=Hideo|editor2-last=Holub|editor2-first ...

The BitFunnel paper describes the "matching problem", which occurs when an algorithm must identify documents through th === Theoretical implementation of bit-string signatures === ...

A major application of graph edit distance is in [[inexact graph matching]], such [[Edit distance|string edit distance]] between [[String (computing)|strings]]. ...

...dinas|Patterson|1953}} The algorithm carries out a systematic search for a string which admits two different decompositions into codewords. As [[Donald Knuth ...3</ref> is an example of a code which is not uniquely decodable, since the string ...

[[Regular expression]] ("regex") matching can be done by building a [[finite-state automaton]]. Regex can be easily Of the above algorithms, the first two are problematic. The first is problematic because a determin ...

...racketed literals or/and wild cards to the right of P, or (d) prepending a string of literals, bracketed literals or/and wild cards to the left of P.<ref nam [[Category:Data mining algorithms]] ...

...ra|Arikawa|2001}}{{sfn|Abouelhoda|Kurtz|Ohlebusch|2004}} speeds up pattern matching on the suffix array{{sfn|Manber|Myers|1993}} and is a prerequisite for comp ...] alongside the suffix array in order to improve the running time of their string search algorithm.{{sfn|Manber|Myers|1993}} ...

...lengths of [[longest common subsequence]]s of [[random variable|random]] [[string (computer science)|strings]]. Although the existence of these constants has A common subsequence of two strings ''S'' and ''T'' is a string whose characters appear in the same order (not necessarily consecutively) b ...

...68}}, who gave the following [[linear time]] algorithm (closely related to algorithms for the later [[all nearest smaller values]] problem): ...arenthesis produces a string of balanced parentheses. Moreover, every Dyck string comes from a stack-sortable permutation in this way, and every two differen ...