480

# Suffix Trees and Suffix Arrays

Authored by: Srinivas Aluru

# Handbook of Data Structures and Applications

Print publication date:  March  2018
Online publication date:  February  2018

Print ISBN: 9781498701853
eBook ISBN: 9781315119335

10.1201/9781315119335-30

#### Abstract

Suffix trees and suffix arrays are versatile data structures fundamental to string processing applications. Let s denote a string over the alphabet Σ. Let $∉ Σ be a unique termination character, and s = s$ be the string resulting from appending \$ to s . We use the following notation: |s| denotes the size of s, s[i] denotes the ith character of s, and s[i..j] denotes the substring s[i]s[i + 1]…s[j]. Let suf f i = s[i]s[i + 1]…s[|s|] be the suffix of s starting at ith position.