Search results

...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 .../math> and <math>\mathbf{select}_q</math> operations defined on [[Succinct data structure#Succinct dictionaries|bitvectors]] to arbitrary alphabets. ...

{{Short description|Data structure for anagram solving}} ...requency (number of appearances) of each of the letters in the given input string. These problems are classified as [[Constraint satisfaction problem]] in co ...

{{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|Lossless, but memory-consuming, data compression algorithm}} ...raight-line program]], i.e. a [[context-free grammar]] generating a single string: the input text. In order to perform the compression in linear time, it con ...

...he more similar two strings ''a'' and ''b'' are, the higher the value of a string kernel ''K''(''a'', ''b'') will be. ...r]]s.<ref name="Lodhi"/> String kernels are used in domains where sequence data are to be [[Cluster analysis|clustered]] or [[statistical classification|cl ...

...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. ...

{{Short description|Data structure for processing palindromes}} {{Infobox data structure ...

...ts'''. Terms built with unary symbols and constants can be considered as [[string (computer science)|strings]]. Higher arities lead to proper [[Tree (automat [[Category:Trees (data structures)]] ...

...ormation. This set-theoretic information is referred to as the '''skeletal data''' of the fusion category. This process is related to the general technique ...tic]] information and turns it into [[Category theory|category-theoretic]] data. ...

...is most frequently expressed as a function of the number of elements in a data structure, finger search times are a function of the distance between the e ...pport finger search with no additional changes to the actual structure. In structures where searching for an element ''x'' is accomplished by narrowing down an i ...

{{short description|Extended physical object in string theory}} {{String theory}} ...

...ions of Computer Science. p.390.</ref> who describe it as an opportunistic data structure as it allows compression of the input text while still permitting ...b-linear time|sublinear complexity]] with respect to the size of the input data. ...

...component that takes expressions that use [[C (programming language)|C]] [[data structure]]s and transforms them into highly optimized [[assembly code]] === Theoretical implementation of bit-string signatures === ...

...hat are secure against attacks that could reveal their access history|data structures that are I/O efficient for arbitrary cache sizes|cache-oblivious algorithm} In [[computer science]], an '''oblivious data structure''' is a data structure that gives no information about the sequence or pattern of the op ...

...st4=Seiller |first4=Thomas |journal=7th International Conference on Formal Structures for Computation and Deduction, {FSCD} 2022 |series=LIPIcs |volume=228 |page ...ors'' (hence the name '''cons-free'''): the input list is the one and only data structure throughout the program. The lack of constructors limits the compu ...

| label1 = [[List of data structures|Type]] | data1 = [[Array data structure|Array]] ...

{{string theory}} The '''SYZ conjecture''' is an attempt to understand the [[Mirror symmetry (string theory)|mirror symmetry]] conjecture, an issue in theoretical physics and m ...

...t has six dimensions, six degrees of freedom, and that needs six pieces of data, or coordinates, to specify a location in this space. There are an infinite ...sformations are handled separately as they have very different geometrical structures, but there are ways of dealing with them that treat them as a single six-di ...

...better understood by regarding the presentation of a sequence as a [[Tree (data structure)|tree]] of all subsequences of the given sequence. The most compl ...ined as the ratio of the number of substrings of any length present in the string to the maximum possible number of substrings. Maximum vocabulary over word ...

...el of [[BPS state|BPS]] [[D-brane]]s, should be interchanged with the same structures in the Type IIB model, which are given either by stable vector bundles or v ...geometric and especially physical properties of Lagrangian submanifolds in string theory are predicted to only depend on the '''Hamiltonian isotopy class''' ...