Our experiments reveal that our algorithm can build the graph with a constant amount of memory, which clearly outperforms VELVET. We also provide efficient algorithms for the bi-directed chain compaction problem.CONCLUSIONS: The bi-directed de Bruijn graph is a fundamental data structure for any sequence assembly program based on E