Dynamic programming algorithm to find maximum-scoring disjoint paths in n-layered bubble graphs.
mkdir build
cd build
cmake ..
make main
The program accepts Elastic-degenerate strings, EDS for short, which represents pan-genomes. To generate a EDS input, you can use EDSO.
./main generated_eds_string
The tests use GoogleTests, make sure you have the module installed and add the path to CMakeLists.txt file.
make test
./test