BlastGraph 2.0 – Intensive approximate Pattern Matching in a de-Bruijn graph or a Sequence Graph

BlastGraph 2.0

:: DESCRIPTION

BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented graph and a set of  query sequences, it detects paths in the graph on which query sequences align at most at the given edit distance.

Advertisement

::DEVELOPER

Guillaume Holley, Pierre Peterlongo

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux
  • GCC

:: DOWNLOAD

 BlastGraph

:: MORE INFORMATION

Citation

Guillaume Holley, Pierre Peterlongo.
BlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs.
PSC 2012, Aug 2012, Prague, Czech Republic

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Exit mobile version