翻訳と辞書 Words near each other ・ Substrate (building) ・ Substrate (chemistry) ・ Substrate (electronics) ・ Substrate (marine biology) ・ Substrate (printing) ・ Substrate (vivarium) ・ Substrate adhesion molecules ・ Substrate analog ・ Substrate channeling ・ Substrate coupling ・ Substrate mapping ・ Substrate reduction therapy ・ Substrate-level phosphorylation ・ Substratum in Vedic Sanskrit ・ Substream Magazine ・ Substring ・ Substring index ・ Substructiones Insanae ・ Substructural logic ・ Substructural type system ・ Substructure ・ Subsumption ・ Subsumption architecture ・ Subsumption lattice ・ Subsun ・ Subsunk ・ Subsurface (album) ・ Subsurface (disambiguation) ・ Subsurface (software) ・ Subsurface currents Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Substring ： ウィキペディア英語版 Substring A substring of a string $S$ is another string $S\text{'}$ that occurs "in" $S$. For example, "the best of" is a substring of "It was the best of times". This is not to be confused with subsequence, which is a generalization of substring. For example, "Itwastimes" is a subsequence of "It was the best of times", but not a substring. Prefix and suffix are refinements of substring. A prefix of a string $S$ is a substring of $S$ that occurs at the beginning of $S$. A suffix of a string $S$ is a substring that occurs at the ''end'' of $S$. == Substring == A substring (or factor) of a string $T\; =\; t\_1\; \backslash dots\; t\_n$ is a string $\backslash hat\; T\; =\; t\_\; \backslash dots\; t\_$, where $0\; \backslash leq\; i$ and $m\; +\; i\; \backslash leq\; n$. A substring of a string is a prefix of a suffix of the string, and equivalently a suffix of a prefix. If $\backslash hat\; T$ is a substring of $T$, it is also a subsequence, which is a more general concept. Given a pattern $P$, you can find its occurrences in a string $T$ with a string searching algorithm. Finding the longest string which is equal to a substring of two or more strings is known as the longest common substring problem. Example: The string ana is equal to substrings (and subsequences) of banana at two different offsets: banana ||||| ana|| ||| ana In the mathematical literature, substrings are also called subwords (in America) or factors (in Europe). Not including the empty substring, the number of substrings of a string of length $n$ where symbols only occur once, is the number of ways to choose two distinct places between symbols to start/end the substring. Including the very beginning and very end of the string, there are $n+1$ such places. So there are $\backslash tbinom\; =\; \backslash tfrac$ non-empty substrings. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Substring」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.