The project 'Dynamic De Bruijn Graph: Adding Dynamic Edges' deals with the implementation of the De Bruijn graph. The motivation for this project is to figure out a space and time efficient approach to implement De Bruijn graph. We have used IN- OUT matrices to store the nodes of the graph. Furthermore, a forest has been created which takes care of the dynamic removal of edges and keeps on updating the forest. This project uses the E.coli datasets for experimentation purpose. The projects includes the source code and a readme file in the download section.
The evaluation has been done on the following parameters with different lengths of k-tuple against different sequences:
​
* Construction time
* Space Utilization
* Membership query time
* Deletion Time