Sparse n-grams for substring search

Sparse n-grams index every run of characters whose border pairs outweigh the pairs inside, so a substring query needs a short chain, not every trigram.