Searches , social queries for SUBSTRING
Search references for SUBSTRING. Phrases containing SUBSTRING
See searches and references containing SUBSTRING!
Search references for SUBSTRING. Phrases containing SUBSTRING
See searches and references containing SUBSTRING!SUBSTRING
Contiguous part of a sequence of symbols
computer science, a substring is a contiguous sequence of characters within a string. For instance, "the best of" is a substring of "It was the best of
Substring
Computer science problem
common substring In computer science, a longest common substring of two or more strings is a longest string that is a substring of all of them
Longest_common_substring
Computer science problem
longest palindromic substring or longest symmetric factor problem is the problem of finding a maximum-length contiguous substring of a given string that
Longest_palindromic_substring
Data structure
In computer science, a substring index is a data structure which gives substring search in a text or text collection in sublinear time. Once constructed
Substring_index
Finding strings that approximately match a pattern
matching is typically divided into two sub-problems: finding approximate substring matches inside a given string and finding dictionary strings that match
Approximate_string_matching
Computer science problem
In computer science, the longest repeated substring problem is the problem of finding the longest substring of a string that occurs at least twice. This
Longest repeated substring problem
Longest_repeated_substring_problem
Problem caused by profanity filters on the Internet
the substring penis. Residents of Clitheroe (Lancashire, England) have been repeatedly inconvenienced because their town's name includes the substring clit
Scunthorpe_problem
result) // Examples in C# "abc".Substring(1, 1): // returns "b" "abc".Substring(1, 2); // returns "bc" "abc".Substring(1, 6); // error ;; Examples in Common
Comparison of programming languages (string functions)
Comparison_of_programming_languages_(string_functions)
Data mining technique
Needleman–Wunsch algorithm Smith–Waterman algorithm Data structure DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array
Sequential_pattern_mining
String searching algorithm
from 1. S[i..j] denotes the substring of string S starting at index i and ending at j, inclusive. A prefix of S is a substring S[1..i] for some i in range
Boyer–Moore string-search algorithm
Boyer–Moore_string-search_algorithm
Expression language for XML documents
contains s2 substring(string, start, length?) example: substring("ABCDEF",2,3) returns BCD. substring-before(s1, s2) example: substring-before("1999/04/01"
XPath
Algorithmic problem on pairs of sequences
(often just two sequences). It differs from the longest common substring: unlike substrings, elements of subsequences are not required to occupy consecutive
Longest_common_subsequence
Deterministic finite automaton accepting set of all suffixes of particular string
representing the substring index of a given string which allows the storage, processing, and retrieval of compressed information about all its substrings. The suffix
Suffix_automaton
String searching algorithm
It treats every substring as a number in some base, the base being usually the size of the character set. For example, if the substring is "hi", the base
Rabin–Karp_algorithm
Cycle through all length-k sequences
these distinct strings, when taken as a substring of B(k, n), must start at a different position, because substrings starting at the same position are not
De_Bruijn_sequence
String search algorithm
haystack) T := preprocess(needle) skip := 0 // haystack[skip:] means substring starting at index `skip`. Would be &haystack[skip] in C. while length(haystack)
Boyer–Moore–Horspool algorithm
Boyer–Moore–Horspool_algorithm
Tree containing all suffixes of a given text
operations can be performed quickly, such as locating a substring in S {\displaystyle S} , locating a substring if a certain number of mistakes are allowed, and
Suffix_tree
Email service provided by Google
functionality does not support searching for word fragments (also known as 'substring search' or partial word search). Workarounds exist. As of March 2015[update]
Gmail
Mathematical binary relation
, E , F ⟩ , {\displaystyle \langle A,B,C,D,E,F\rangle ,} is a substring. The substring is a refinement of the subsequence. The list of all subsequences
Subsequence
String in combinatorial math
symbols is a string that contains each permutation of n symbols as a substring. While trivial superpermutations can simply be made up of every permutation
Superpermutation
Scripting language created in 1994
syntax: <!--include /text/header.html--> <!--getenv HTTP_USER_AGENT--> <!--if substr $exec_result Mozilla--> Hey, you are using Netscape!<p> <!--endif--> <!--sql
PHP
Algorithm for finding sub-text location(s) inside a given sentence in Big O(n) time
However, just prior to the end of the current partial match, there was that substring "AB" that could be the beginning of a new match, so the algorithm must
Knuth–Morris–Pratt_algorithm
Mapping arbitrary data to fixed-size values
10. In some applications, such as substring search, one can compute a hash function h for every k-character substring of a given n-character string by
Hash_function
Parsing algorithm for context-free grammars
considers every possible substring of the input string and sets P [ l , s , v ] {\displaystyle P[l,s,v]} to be true if the substring of length l {\displaystyle
CYK_algorithm
Index of articles associated with the same name
the fact that all sufficiently long strings in such a language have a substring that can be repeated arbitrarily many times, usually used to prove that
Pumping_lemma
Tree data structure for metric spaces
a pattern string and a text string , we need to find a substring in , which, of all substrings of , has the smallest edit distance to the pattern . An
BK-tree
Functional programming construct
Needleman–Wunsch algorithm Smith–Waterman algorithm Data structure DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array
Pattern_matching
Algorithm for evaluating the quality of machine-translated text
y} , define the substring count C ( s , y ) {\displaystyle C(s,y)} to be the number of appearances of s {\displaystyle s} as a substring of y {\displaystyle
BLEU
String-matching algorithm
longest common substring is WIKIM (light grey) with 5 characters. There is no further substring on the left. The non-matching substrings on the right side
Gestalt_pattern_matching
Partial order on a Coxeter group
if some substring of some (or every) reduced word for v is a reduced word for u. (Here a substring is not necessarily a consecutive substring.) There
Bruhat_order
Integer
when a specified element or substring cannot be found. Similarly, Python's str.find() method returns −1 when a substring is absent. In the C programming
−1
Methods in computational biology
value of k, (ii) all substrings of any length up to an arbitrarily set maximum k value, (iii) all maximal substrings, where a substring is maximal if extending
Alignment-free sequence analysis
Alignment-free_sequence_analysis
Lossless compression algorithm
predefined dictionary contains over 13000 common words, phrases and other substrings derived from a large corpus of text and HTML documents. Using a predefined
Brotli
Searching for patterns in text
approach. Faster search algorithms preprocess the text. After building a substring index, for example a suffix tree or suffix array, the occurrences of a
String-searching_algorithm
Metric in computer science
is a distance between an i {\displaystyle i} -symbol prefix (initial substring) of string a {\displaystyle a} and a j {\displaystyle j} -symbol prefix
Damerau–Levenshtein_distance
Topic in computer science
lexicographically minimal string rotation (LMSR) or lexicographically least circular substring is the problem of finding the rotation of a string possessing the lowest
Lexicographically minimal string rotation
Lexicographically_minimal_string_rotation
Type of code in coding theory
code words, the substring starting at the second symbol and ending at the second-last symbol does not contain any code word as substring. Every self-synchronizing
Self-synchronizing_code
Encryption algorithm
// Take a two-character hex substring (e.g., "AB") const hexa_Byte = hexInput.slice(i, i + 2); // Convert hex substring to an integer (e.g., "AB" ->
XOR_cipher
Universal lossless data compression algorithm
the index for the string without the last character (i.e., the longest substring that is in the dictionary) is retrieved from the dictionary and sent to
Lempel–Ziv–Welch
Compressed full-text substring index
In computer science, an FM-index is a compressed full-text substring index based on the Burrows–Wheeler transform, with some similarities to the suffix
FM-index
Unique number for station equipment
// Not a valid hex MEID. } string hexPart1 = input.Substring(0, 8); string hexPart2 = input.Substring(8, 6); try { string decPart1 = int.Parse(hexPart1
Mobile_equipment_identifier
Means of entering commands to software
positional and keyword parameters; keywords may be truncated to any unique substring. Only documented command abbreviations are valid. Keyword values are inside
Command-line_interface
American online content management system
filtering systems is also encountered due to the domain containing the substring "gspot"; however, this can be alleviated by excluding the "blogspot.com"
Blogger_(service)
Searching for patterns in compressed data
Needleman–Wunsch algorithm Smith–Waterman algorithm Data structure DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array
Compressed_pattern_matching
Concept in databases
sargable. It must examine every row to find the column containing the substring 'Wales' in any position. Sargable version: SELECT * FROM myTable WHERE
Sargable
Family of lossless data compression algorithms
processed. This window serves as the dictionary, effectively storing every substring that has appeared in the past N bytes as dictionary entries. Instead of
Dictionary_coder
determined by looking at the first and last symbol and each two-symbol substring of the word. Equivalently, it is a language recognised by a local automaton
Local language (formal language)
Local_language_(formal_language)
Standard UNIX utility
"reg") finding a set of characters in a string (index) finding a substring (substr) finding the length of a string (length) Each symbol (operator, value
Expr
Sequence of characters, data type
of algorithms include: String searching algorithms for finding a given substring or pattern String manipulation algorithms Sorting algorithms Regular expression
String_(computer_science)
array of numbers Longest common substring problem: find the longest string (or strings) that is a substring (or are substrings) of two or more strings Matching
List_of_algorithms
Version of the XML Path language
Functions General string handling lower-case, upper-case, substring, substring-before, substring-after, translate, starts-with, ends-with, contains, string-length
XPath_2.0
Lemma that defines a property of regular languages
{\displaystyle xy} will be at most p {\displaystyle p} , thus giving a "small" substring x y {\displaystyle xy} that has the desired property. Languages with a
Pumping lemma for regular languages
Pumping_lemma_for_regular_languages
Affix which is placed before the stem of a word
unbound morphemes English prefix List of Greek and Latin roots in English Substring#Prefix Metric prefix Opcode prefix Wilson 2011, p. 152–153. sfn error:
Prefix
Algorithm to transform a regular expression into a finite automaton
Needleman–Wunsch algorithm Smith–Waterman algorithm Data structure DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array
Thompson's_construction
Sequence of characters that forms a search pattern
finite automaton (DFA) is run on the target text string to recognize substrings that match the regular expression. The picture shows the NFA scheme N(s*)
Regular_expression
Data structure for processing palindromes
contained in a string. They can be used to solve the longest palindromic substring, the k-factorization problem (can a given string be divided into exactly
Palindrome_tree
order stems from the prefix order on words, which is a special kind of substring relation and, because of its discrete character, a tree. A prefix order
Prefix_order
systems[which?] limit certain SQL clauses and/or functions, such as LIKE or SUBSTRING from being used on CLOBs. Those that permit such operations may perform
Character_large_object
individually. Match implies that the substring occurs in both sequences to be aligned. Unique means that the substring occurs only once in each sequence
Maximal_unique_match
Overview of and topical guide to algorithms
Levenshtein distance Edit distance Longest common subsequence Longest common substring Suffix tree Suffix array Burrows–Wheeler transform Regular expression
Outline_of_algorithms
Programming language with English-like syntax
looping with PERFORM UNTIL EXIT SUBSTITUTE intrinsic function allowing for substring substitution of different length CONVERT function for base-conversion
COBOL
Counterintuitive result in probability
string of text will contain a particular finite substring is 1. However, this does not mean the substring's absence is "impossible", despite the event having
Infinite_monkey_theorem
Ancient Greek god of medicine
aspirated one: we know that there was no distinction between the three in the substr. language) with a -σ-. I think that the -σ- renders an original affricate
Asclepius
Function that counts distinct factors of a string
alphabet) is the function that counts the number of distinct factors (substrings of consecutive symbols) of that string. More generally, the complexity
Complexity_function
Type of finite-state machine in automata theory
Needleman–Wunsch algorithm Smith–Waterman algorithm Data structure DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array
Nondeterministic finite automaton
Nondeterministic_finite_automaton
Aspect of the Unicode standard
ligature into the constituent letters and so a search for U+0066 (f) as substring would succeed in an NFKC normalization of U+FB03 but not in NFC normalization
Unicode_equivalence
is, if p ( t , A ) {\displaystyle p(t,A)} is the probability of some substring t {\displaystyle t} occurring in A {\displaystyle A} , then a mimic function
Mimic_function
Data structure for a string
{\textstyle n} -string and let S [ i , j ] {\displaystyle S[i,j]} denote the substring of S {\displaystyle S} ranging from i {\displaystyle i} to j {\displaystyle
Suffix_array
Type of database index
DNA contains more than 3 billion base pairs, and we need to store a DNA substring for every index and a 32-bit integer for index itself, the storage requirement
Inverted_index
Decimal representation of a number whose digits are periodic
0 then L = 0; if not z = 0 then s = s . substring(digits, z, 1) end if return (s); end if s = s . substring(digits, z, 1); // append the character of
Repeating_decimal
Open source object-relational mapping framework
EndsWith, IndexOf, Left, Length, LTrim, Replace, Reverse, Right, RTrim, Substring, StartsWith, ToLower, ToUpper, Trim Date and Time functions AddMicroseconds
Entity_Framework
Obsolete multibyte encoding for Unicode
design does not provide self-synchronization, which makes searching for substrings and error recovery difficult. It reuses the ASCII printing characters
UTF-1
Typographic character indicating a question (?)
characters as possible, making it lazy, e.g. /^.*?px/ will match the substring 165px in 165px 17px instead of matching 165px 17px. In certain implementations
Question_mark
On repetitions in infinite strings of symbols
A square-free word is a string that does not contain any square as a substring. In particular, it avoids repeating the same symbol consecutively, repeating
Dejean's_theorem
Defines the inputs and outputs for a function, subroutine or method
Example: The method String String.substring(int, int) is represented in bytecode as Ljava/lang/String.substring(II)Ljava/lang/String;. The signature
Type_signature
Programming algorithm
gives the end-position of matching substrings of the text. To determine the start-position of the matching substrings, the number of insertions and deletions
Wagner–Fischer_algorithm
Type of formal grammar
Needleman–Wunsch algorithm Smith–Waterman algorithm Data structure DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array
Regular_grammar
Key elements of Extensible Stylesheet Language Transformations (XSLT)
after the substring specified in the substring argument. substring-after('In 1814 we took a little trip', 'we') substring-before The substring-before function
XSLT_elements
Cryptographic algorithm created by Adi Shamir
constructed using a smaller binary field may be separately applied to small substrings of bits of the secret (e.g. GF(256) for byte-wise application, where GF
Shamir's_secret_sharing
Programming language
in ABAP is whitespace-sensitive. x = a+b(c). assigns to variable x the substring of the variable a, starting from b with the length defined by the variable
ABAP
Bridge in Hardy County, West Virginia, US
nearly 300 feet (91 m) above the valley below and is supported by a girder-substring system with end spans of 210 feet (64 m) and four interior spans at 275
Clifford_Hollow_Bridge
String-searching algorithm
glibc, newlib, and musl, to implement the memmem and strstr family of substring functions. As with most advanced string-search algorithms, the naïve implementation
Two-way string-matching algorithm
Two-way_string-matching_algorithm
Auxiliary data structure to the suffix array in computer science
any other character. Let S [ i , j ] {\displaystyle S[i,j]} denote the substring of S {\displaystyle S} ranging from i {\displaystyle i} to j {\displaystyle
LCP_array
Process in bioinformatics that identifies equivalent sites within molecular sequences
the acronym. Match implies that the substring occurs in both sequences to be aligned. Unique means that the substring occurs only once in each sequence
Sequence_alignment
string. Closest string is a special case of the more general closest substring problem, which is strictly more difficult. While closest string turns
Closest_string
Hypothetical self-improving program
apply-rule function. Replaces switchprog S pm:n, provided it is a non-empty substring of S p. Verifies whether the goal of the proof search has been reached
Gödel_machine
String rewriting system
{\displaystyle s_{0}\in \Sigma ^{*}} and repeatedly rewriting it by making one substring-replacement at a time: s 0 → R s 1 → R s 2 → R … {\displaystyle
Semi-Thue_system
unique out-of-alphabet marker symbol (or string) to ensure no suffix is a substring of another, guaranteeing each suffix is represented by a unique leaf node
Generalized_suffix_tree
Filename suffix indicating file type
rules of the specific file system used; usually the extension is the substring which follows the last occurrence, if any, of the dot character (example:
Filename_extension
Software build automation tool
is considered a pattern for matching file names: the % can match any substring of zero or more characters, while other characters match only themselves
Make_(software)
Service discovery protocol
sub-fields called labels. Each label represents one of the dot-separated substrings in a fully qualified domain name (FQDN). The list is terminated by either
Multicast_DNS
Computer programming operation
from the original. Common examples of array slicing are extracting a substring from a string of characters, the "ell" in "hello", extracting a row or
Array_slicing
2023 edition of the C++ programming language standard
std::forward_like. Added an rvalue-qualified std::basic_string::substr() && overload, allowing substring extraction from an rvalue string to reuse its storage where
C++23
Rules defining correctly structured Java programs
to implement default String shortenString(String input) { return input.substring(1); } } // This is a valid class despite not implementing all the methods
Java_syntax
Network protocol supporting distributed directory information services
(&(objectClass=person)(|(givenName:caseExactMatch:=John)(mail:caseExactSubstringsMatch:=john*))) derefAliases Whether and how to follow alias entries (entries
Lightweight Directory Access Protocol
Lightweight_Directory_Access_Protocol
Difference between two descriptions of an object by different linguistic representations
appears in the filename. Find any text file where the word "funny" or the substring "humor" appears in the text. Find any mp3 file where "funny", "comic"
Semantic_gap
Topics referred to by the same term
may also refer to: In computing science: Prefix (computer science), a substring starting at the initial position of a reference string Opcode prefix,
Prefix_(disambiguation)
Process of detecting plagiarism and/or copyright infringement
suffix trees or suffix vectors, have been used for this task. Nonetheless, substring matching remains computationally expensive, which makes it a non-viable
Content_similarity_detection
Type of pumping lemma
v w x | ≤ p {\displaystyle |vwx|\leq p} , it is easily seen that the substring vwx can contain no more than two distinct symbols. That is, we have one
Pumping lemma for context-free languages
Pumping_lemma_for_context-free_languages
Type of metric space
words x {\displaystyle x} and y {\displaystyle y} are p-close if any substring of p consecutive letters ( p < n {\displaystyle p<n} ) appears the same
Ultrametric_space
travel, tourism, insurance
SUBSTRING
SUBSTRING
SUBSTRING
SUBSTRING
SUBSTRING
SUBSTRING
SUBSTRING
SUBSTRING
SUBSTRING
travel, tourism, insurance