Relative Suffix Trees
Related Experiment Video
Updated: Feb 10, 2026

A Venturi Effect Can Help Cure Our Trees
Published on: October 1, 2013
Andrea Farruggia1, Travis Gagie2,3, Gonzalo Navarro2,4
1Department of Computer Science, University of Pisa, Largo Bruno Pontecorvo 3, 56127 Pisa PI, Italy.
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.
Related Concept Videos
The Tree of Life - Bacteria, Archaea, Eukaryotes
Survival Tree
Building a Survival Tree
Constructing a...
Phylogenetic Trees
The Bronchial Tree
The trachea, commonly known as the windpipe, is a tube that connects the larynx (voice box) to the bronchi. At a point called the carina, it bifurcates into two primary bronchi. The right primary bronchus is wider, shorter, and more vertical than the left primary...
Relative Risk
Relative Velocity in One Dimension

