Relative Suffix Trees

August 11, 2015 · Entered Twilight · 🏛 Computer/law journal

"Last commit was 7.0 years ago (≥5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: .gitignore, LICENSE, Makefile, README.md, align_bwts.cpp, build_bwt.cpp, build_rlcp.cpp, cst_compare.cpp, cst_traverse.cpp, logs_old_rcst, logs_rst, logs_spire2014, logs_spire2015, mutate.cpp, new_relative_lcp.cpp, new_relative_lcp.h, query_test.cpp, rcst, relative_cst.h, relative_fm.cpp, relative_fm.h, rlcp_size.cpp, scripts, simple_fm.h, spire2014, support.cpp, support.h, utils.cpp, utils.h, verify.cpp

Authors Andrea Farruggia, Travis Gagie, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén arXiv ID 1508.02550 Category cs.DS: Data Structures & Algorithms Citations 17 Venue Computer/law journal Repository https://github.com/jltsiren/relative-fm ⭐ 12 Last Checked 1 month ago

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.