Skip to content

ANekhai/AdequateSolver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

132 Commits
 
 
 
 
 
 
 
 

Repository files navigation

AdequateSolver

This project contains code to solve the GGHP and GAP with adequate subgraphs (still a WIP). Includes a class to handle breakpoint graphs in Java which can read GRIMM formatted genome files and can store them as genome graphs and Multiple Breakpoint Graphs (using google guava). Also contains a fork of DCJStream reimplemented with the modified breakpoint graphs to solve the GMP exactly (complete functionality with linear genomes is a WIP).

About

A project to extend adequate subgraph approach to genomes with whole genome duplication.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages