Search results

...|first1=Alberto |last2=Giancarlo |first2=Raffaele |journal=[[SIAM Journal on Computing]] |volume=15 |pages=98–105 |url=https://docs.lib.purdue.edu/cgi/v * {{cite journal |doi=10.1016/S0020-0190(97)00107-5 |title=Tight bounds on the complexity of the Apostolico-Giancarlo algorithm |year=1997 |last1=Croc ...

}}</ref> which tries to find the geometrical center of a set of input strings. ...rstand the word "center", it is necessary to define a distance between two strings. Usually, this problem is studied with the [[Hamming distance]] in mind. ...

...fix array]] containing all suffixes for a set of strings. Given the set of strings <math>S = S_1, S_2, S_3, ..., S_k</math> of total length <math>n</math>, it |title=Suffix arrays for multiple strings: A method for on-line multiple string searches. ...

...mining the [[String metric|similarity]] of two [[String (computer science)|strings]]. It was developed in 1983 by [[John W. Ratcliff]] and [[John A. Obershelp ...say.pdf Ilya Ilyankou: ''Comparison of Jaro-Winkler and Ratcliff/Obershelp algorithms in spell check'', May 2014] (PDF)</ref> ...

{{Evolutionary algorithms}} ...ata can be used to generate a [[Topological space|topology]] on a space of strings. ...

...rtition each symbol belongs. Note that only the bitvectors are stored; the strings in the nodes are only for illustratory purposes.]] ...athbf{rank}_q</math> and <math>\mathbf{select}_q</math> operations defined on [[Succinct data structure#Succinct dictionaries|bitvectors]] to arbitrary a ...

...[similarity measure|similarity]] of pairs of strings: the more similar two strings ''a'' and ''b'' are, the higher the value of a string kernel ''K''(''a'', ' ...hms such as [[support vector machine]]s allow such algorithms to work with strings, without having to translate these to fixed-length, real-valued [[feature v ...

{{Short description|Set of strings with few differences}} ...Hamming ball is a subset of the [[Hamming space]] <math>X^{|x|}</math> of strings of the same length as <math>x</math>, and it is a proper subset whenever <m ...

...cation protocol that lets Alice compute the hamming distance between their strings to within <math>\pm\sqrt{n}</math> using less than [[Big O notation#Big Ome ...orithm for Estimating the Entropy of a Stream|journal= ACM Transactions on Algorithms|volume=6|issue=3|pages=1–21|doi=10.1145/1798596.1798604|issn=1549-6325|cite ...

...abet]] having some number of [[wildcard character]]s.{{r|lnka}} The set of strings matching a given parameter word is called a '''parameter set''' or '''combi ...tuting a symbol of <math>A</math> for each wildcard character. This set of strings is called a '''parameter set''' of '''combinatorial cube''', and <math>k</m ...

{{short description|Algorithm to compare text strings using wildcard syntax}} ...lp.sciencedirect.com/Content/st_wildcards.htm}}</ref> Common uses of these algorithms include [[command-line interface]]s, e.g. the [[Bourne shell]]<ref>{{cite b ...

...gorithm for minimum palindromic factorization |journal=Journal of Discrete Algorithms |date=2014 |volume=28 |pages=41–48 |doi=10.1016/j.jda.2014.08.001 |s2cid=14 ...<math>O(n*i)</math> additional space where <math>i</math> is the number of strings being compared. This is accomplished by adding an array of length <math>i< ...

...n subsequence]]s of [[random variable|random]] [[string (computer science)|strings]]. Although the existence of these constants has been proven, their exact v ...re ''k'' is the number of characters in the alphabet from which the random strings are drawn. The sequence of these numbers grows inversely proportionally to ...

...nnett (computer scientist)|Charles H. Bennett]] based on the [[Analysis of algorithms|computational complexity]] of an algorithm that can recreate a given piece ...th>T(p)</math> is the number of computation steps that <math>p</math> made on <math>U</math> to produce <math>x</math> and halt. ...

{{Short description|Function defined on formal languages in computer science}} [[File:Brzozowski derivative.gif|thumb|100px|Brzozowski derivative (on red background) of a dictionary string set with respect to the string "con" ...

...s\circ f_{2^n}(x)</math> where <math>\circ</math> denotes concatenation of strings. ...]]s when interpreted as functions <math>\mathbb F_2^k\to\mathbb F_2</math> on the [[finite field]] with two elements. Since there are only <math>2^k</mat ...

...irst5=Jean-Pierre|last5=Hubaux|first6=Bryan|last6=Ford|journal=Proceedings on Privacy Enhancing Technologies (PoPETS)|volume=2019|issue=4|pages=6–33|doi= ...tacks, such as by identifying data encrypted with weak ciphers or obsolete algorithms, fingerprinting applications to track users or identify software versions w ...

== Efficient algorithms == | title = 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) ...

...ties]] of most of the planted motif search algorithms depend exponentially on the alphabet size and ''l''. The PMS problem was first introduced by Keich ...b>) of length m each from an alphabet Σ and two integers l and d. Find all strings x such that |x| = l and every input string contains at least one variant of ...

In [[computer science]] and the study of [[combinatorics on words]], a '''partial word''' is a [[String (computer science)|string]] tha | title = Algorithmic Combinatorics on Partial Words ...