Skip to content

AlgoLab/FastStringGraph

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 

Repository files navigation

SGA - String Graph Assembler

SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads.


For installation and usage instructions see src/README

For running examples see src/examples and the sga wiki

For questions or support contact jared.simpson --at-- sanger.ac.uk
This version of SGA also includes a faster algorithm for the core task of computing the string graph, called FSG, designed by Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Marco Previtali, and Raffaella Rizzi. Please address to them any question related to FSG.

About

FSG, a new Fast String Graph construction algorithm for the String Graph Assembler suite

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages

  • C++ 93.4%
  • C 3.2%
  • Python 1.9%
  • Other 1.5%