Also found in: Dictionary, Encyclopedia, Wikipedia.
Graphic Thesaurus  🔍
Display ON
Animation ON
  • noun

Words related to substring

a string that is part of a longer string

Related Words

References in periodicals archive ?
Xm discovery by mining and combining (MDMC) offers another point of view by mining every single rising substring of various lengths to completely utilize the data contained in successions.
Similar to the first experiment, the comparison was performed using a substring algorithm to see if the APWG phishing domain was a substring of the defacement string.
2](0010010110) is the second one; they all have two substrings (two decision variables), and the distance is defined as the Hamming distance between two binary strings; namely,
h] by removing all vertices that contain f as a substring Ilic et al.
Finally, we insert in P2` the substring s(P1) resulting in the new schedule:
This crossing consists of randomly selecting a substring of a parent A.
Then, the substring between these positions is exchanged with the second chromosome in the same range.
That is, their corresponding strings share a (necessarily nonempty) maximal substring
de acceso ([<pos>]), y de construccion de substring ([Li .
Thus, after the siRNA sequence is divided into x mutually disjointed and equal substrings (as equal as possible), at least one substring must have a perfect match with the off-target region.
Diarrhea and nausea/vomiting visits were not necessarily mutually exclusive, because a given chief complaint text substring can be assigned to >1 subsyndrome by the BioSense system (13).
String utility functions; We replace a substring with another substring resulting in a new string.
In MeSH, if a CER term or any of its variants directly mapped to a main heading or entry term, the match was exact; if part of the term mapped to a broader or related term or to a substring in a scope note, the match was partial; otherwise, "no match" was recorded.
Step 2: Produce a proto-child by copying the substring of operation sequence into the corresponding positions.
d} avoiding words with "12" as substring is equal to a(n), a recursive sequence with initial terms a(0) = 1, a(1) = d and recurrence relation