「substring」の共起表現(1語右で並び替え)

r an explanation of the difference between a substring and a subsequence, see Substring vs. subsequ

e function index, which takes a string and a substring, and returns the integer index of the substr

solution to the original problem: it is the substring for which E(m, j) is minimal (m being the le

s limit certain SQL clauses, such as LIKE or SUBSTRING from being used on CLOBs.

hniques that allows one to find an arbitrary substring in a text is given by Navarro et al..

A substring index is a data structure which gives substr

The FM-index is type of Substring index based on the Burrows-Wheeler transform

a maximal repeat never occurring as a proper substring of another maximal repeat.

efined by s < t if and only if s is a proper substring of t.

sequence forms an ungapped alignment with a substring of length w from the string of length 2w aro

The longest common substring problem is to find the longest string (or st

f the input text while still permitting fast substring queries.

ord for v contains a reduced word for u as a substring, where some letters (in any position) are dr

「substring」の共起表現一覧(1語右で並び替え)