Compressed Directed Acyclic Word Graph with Application in Local Alignment

Suffix tree, suffix array, and directed acyclic word graph (DAWG) are data‐structures for indexing a text. Although they enable efficient pattern matching, their data‐structures require O(nlogn) bits, which make them impractical to index long text like human genome. Recently, the development of compressed data‐structures allow us to simulate suffix tree and suffix array using O(n) bits. However, there is still no O(n)‐bit data‐structure for DAWG with full functionality. This work introduces an $n(H_k(\overline{S})+2H_0^{*}({𝒯}_{\overline{S}}))+o(n)$ ‐bit compressed data‐structure for simulating DAWG (where $H_k(\overline{S})$ and $H_0^{*}({𝒯}_{\overline{S}})$ are the empirical entropies of the reversed sequence and the reversed suffix tree topology, respectively.) Besides, we also propose an application of DAWG to improve the time complexity for the local alignment problem. In this application, the previously proposed solutions using BWT (a version of compressed suffix array) run in O(n ² m) worst case time and O(n ^0.628 m) average case time where n and m are the lengths of the database and the query, respectively. Using compressed DAWG proposed in this paper, the problem can be solved in O(nm) worst case time and the same average case time.