Paper Info
Title
Lightweight merging of compressed indices based on BWT variants.
Abstract
In this paper we propose a flexible and lightweight technique for merging compressed indices based on variants of Burrows-Wheeler transform (BWT), thus addressing the need for algorithms that compute compressed indices over large collections using a limited amount of working memory. Merge procedures make it possible to use an incremental strategy for building large indices based on merging indices for progressively larger subcollections.
Year
DOI
Venue
2019
10.1016/j.tcs.2019.11.001
Theoretical Computer Science
Keywords
Field
DocType
Multi-string BWT,Longest Common Prefix array,XBWT,Trie compression,Compressed permuterm index,Circular patterns
LCP array,Data structure,Discrete mathematics,Scratch,Incremental strategy,Theoretical computer science,Merge (version control),Mathematics
Journal
Volume
ISSN
Citations 
812
0304-3975
1
PageRank 
References 
Authors
0.36
9
2
Name
Order
Citations
PageRank
Lavinia Egidi19110.21
Giovanni Manzini21584111.42