A SIMPLE ALPHABET-INDEPENDENT FM-INDEX

Citations Over TimeTop 10% of 2006 papers

Abstract

We design a succinct full-text index based on the idea of Huffman-compressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can be searched as an FM-index, with the benefit of removing the sharp dependence on the alphabet size, σ, present in that structure. On a text of length n with zero-order entropy H 0 , our index needs O(n(H 0 + 1)) bits of space, without any significant dependence on σ. The average search time for a pattern of length m is O(m(H 0 + 1)), under reasonable assumptions. Each position of a text occurrence can be located in worst case time O((H 0 + 1) log n), while any text substring of length L can be retrieved in O((H 0 + 1)L) average time in addition to the previous worst case time. Our index provides a relevant space/time tradeoff between existing succinct data structures, with the additional interest of being easy to implement. We also explore other coding variants alternative to Huffman and exploit their synchronization properties. Our experimental results on various types of texts show that our indexes are highly competitive in the space/time tradeoff map.

Related Papers

• → The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees(2007)10 cited
• → Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String(2020)2 cited
• → On Harrison's substring testing technique(1973)4 cited
• → An Efficient Algorithm for Identifying the Most Contributory Substring(2007)
• Better Huffman Coding via Genetic Algorithm(2008)