Implementation of the "Compact acyclical Word Directed Graphs (CDAWG)" for quick search for DNA subsequences.
This library implements the "Compact Directed acyclical Word Graph" hereinafter CDAWG, which is a compact data structure built on the principle of finite automata. The aim of the library implementation is the possibility of further use e.g. in the analysis of DNA, within sequencing process and alignment of DNA sequences.
The library is available in the form of source codes. It can be compiled on any up-to-date C++ compilers conformant to ISO/IEC 9899:2011. MS Visual Studio 2013 and its VC++ compiler was used a developing and testing environment .