相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Travis Gagie et al.
JOURNAL OF THE ACM (2020)
External memory BWT and LCP computation for sequence collections with applications
Lavinia Egidi et al.
ALGORITHMS FOR MOLECULAR BIOLOGY (2019)
Using reference-free compressed data structures to analyze sequencing reads from thousands of human genomes
Dirk D. Dolle et al.
GENOME RESEARCH (2017)
RANDOM ACCESS TO GRAMMAR-COMPRESSED STRINGS AND TREES
Philip Bille et al.
SIAM JOURNAL ON COMPUTING (2015)
On compressing and indexing repetitive sequences
Sebastian Kreft et al.
THEORETICAL COMPUTER SCIENCE (2013)
Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform
Anthony J. Cox et al.
BIOINFORMATICS (2012)
Efficient de novo assembly of large genomes using compressed data structures
Jared T. Simpson et al.
GENOME RESEARCH (2012)
Self-Indexed Grammar-Based Compression
Francisco Claude et al.
FUNDAMENTA INFORMATICAE (2011)
Storage and Retrieval of Highly Repetitive Sequence Collections
Veli Makinen et al.
JOURNAL OF COMPUTATIONAL BIOLOGY (2010)
Indexing compressed text
P Ferragina et al.
JOURNAL OF THE ACM (2005)
Off-line dictionary-based compression
NJ Larsson et al.
PROCEEDINGS OF THE IEEE (2000)
Grammar-based codes: A new class of universal lossless source codes
JC Kieffer et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2000)
分享论文
