Advanced Algorithms and Data Structures FER labs
-
Updated
Jan 29, 2023 - Python
Advanced Algorithms and Data Structures FER labs
C++ Algorithms
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.
Compute a Eulerian trail (Eulerian path) through a graph iff one exists
Chinese Postman Problem (CPP) or Route Inspection Problem Solution in Rust
Add a description, image, and links to the hierholzers-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the hierholzers-algorithm topic, visit your repo's landing page and select "manage topics."