Difference between revisions of "SEQuel"
(Created page with " Category:Software {|<!--CONFIGURATION: REQUIRED--> |{{#vardefine:app|sequel}} |{{#vardefine:url|http://bix.ucsd.edu/SEQuel/index.html}} <!--CONFIGURATION: OPTIONAL (1=ON)...") |
Moskalenko (talk | contribs) m (Text replace - "{{App_Description|app={{#var:app}}|url={{#var:url}}}}|}}" to "{{App_Description|app={{#var:app}}|url={{#var:url}}|name={{#var:app}}}}|}} ") |
||
Line 20: | Line 20: | ||
<!--Description--> | <!--Description--> | ||
{{#if: {{#var: url}}| | {{#if: {{#var: url}}| | ||
− | {{App_Description|app={{#var:app}}|url={{#var:url}}}}|}} | + | {{App_Description|app={{#var:app}}|url={{#var:url}}|name={{#var:app}}}}|}} |
+ | |||
SEQuel is a tool for correcting errors (i.e., insertions, deletions, and substitutions) in contigs output from assembly. While assemblies of next generation sequencing (NGS) data are accurate, they still contain a substantial number of errors that need to be corrected after the assembly process. The algorithm behind SEQuel makes use of a graph structure called the ''positional de Bruijn graph'', which models k-mers within reads while incorporating their approximate positions into the model. | SEQuel is a tool for correcting errors (i.e., insertions, deletions, and substitutions) in contigs output from assembly. While assemblies of next generation sequencing (NGS) data are accurate, they still contain a substantial number of errors that need to be corrected after the assembly process. The algorithm behind SEQuel makes use of a graph structure called the ''positional de Bruijn graph'', which models k-mers within reads while incorporating their approximate positions into the model. |
Revision as of 01:54, 10 August 2012
Description
SEQuel is a tool for correcting errors (i.e., insertions, deletions, and substitutions) in contigs output from assembly. While assemblies of next generation sequencing (NGS) data are accurate, they still contain a substantial number of errors that need to be corrected after the assembly process. The algorithm behind SEQuel makes use of a graph structure called the positional de Bruijn graph, which models k-mers within reads while incorporating their approximate positions into the model.
Template:App Location
Available versions
- 1.0.1
Running the application using modules
To use sequel with the environment modules system at HPC the following commands are available:
Get module information for sequel:
$module spider sequel
Load the default application module:
$module load sequel
The modulefile for this software adds the directory with executable files to the shell execution PATH and sets the following environment variables:
- HPC_SEQUEL_DIR - directory where sequel is located.