#
bruijn
Here are 3 public repositories matching this topic...
This repository have the implementation of a string reconstructor using Bruijn graphs and eulerian path. This problem is very important in bioinformatics, because it is used to reconstruct the DNA sequence from a set of k-mers.
-
Updated
Aug 3, 2024 - Python
-
Updated
Apr 29, 2024 - Python
Improve this page
Add a description, image, and links to the bruijn topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the bruijn topic, visit your repo's landing page and select "manage topics."