Paper Info
Title
Relative Suffix Trees.
Abstract
Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main drawback is their size, which can be tens of times larger than the input sequence. Much effort has been put into reducing the space usage, leading ultimately to compressed suffix trees. These compressed data structures can efficiently simulate the suffix tree, while using space proportional to a compressed representation of the sequence. In this work, we take a new approach to compressed suffix trees for repetitive sequence collections, such as collections of individual genomes. We compress the suffix trees of individual sequences relative to the suffix tree of a reference sequence. These relative data structures provide competitive time/space trade-offs, being almost as small as the smallest compressed suffix trees for repetitive collections, and competitive in time with the largest and fastest compressed suffix trees.
Year
DOI
Venue
2018
10.1093/comjnl/bxx108
COMPUTER JOURNAL
Keywords
DocType
Volume
suffix trees,compressed text indexing,repetitive collections
Journal
61
Issue
ISSN
Citations 
5
0010-4620
0
PageRank 
References 
Authors
0.34
17
5
Name
Order
Citations
PageRank
Andrea Farruggia171.85
Travis Gagie264363.61
Gonzalo Navarro310911.07
Simon J. Puglisi4113275.14
Jouni Sirén522214.85