Suffix trees for very large genomic sequences
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton · 2009
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. All the existing practical algorithms perform random access to the input string, thus requiring that the input be small enough to be kept in main memory.