BESST: Difference between revisions

From UFRC
Jump to navigation Jump to search
Maxprok (talk | contribs)
Created page with "Category:SoftwareCategory:BiologyCategory:Bioinformatics {|<!--CONFIGURATION: REQUIRED--> |{{#vardefine:app|besst}} |{{#vardefine:url|https://github.com/ksahlin/BE..."
 
No edit summary
 
(4 intermediate revisions by 3 users not shown)
Line 1: Line 1:
[[Category:Software]][[Category:Biology]][[Category:Bioinformatics]]
[[Category:Software]][[Category:Biology]][[Category:NGS]]
{|<!--CONFIGURATION: REQUIRED-->
{|<!--CONFIGURATION: REQUIRED-->
|{{#vardefine:app|besst}}
|{{#vardefine:app|besst}}
Line 21: Line 21:


<!--Modules-->
<!--Modules-->
==Required Modules==
==Environment Modules==
 
Run <code>module spider {{#var:app}}</code> to find out what environment modules are available for this application.
===Serial===
* gcc/5.2.0
* {{#var:app}}
<!--
===Parallel (OpenMP)===
* intel
* {{#var:app}}
===Parallel (MPI)===
* intel
* openmpi
* {{#var:app}}
-->
==System Variables==
==System Variables==
* HPC_{{#uppercase:{{#var:app}}}}_DIR - installation directory
* HPC_{{uc:{{#var:app}}}}_DIR - installation directory
<!--Configuration-->
<!--Configuration-->
{{#if: {{#var: conf}}|==Configuration==
{{#if: {{#var: conf}}|==Configuration==
Line 71: Line 59:


[http://bioinformatics.oxfordjournals.org/content/28/17/2215.long Sahlin K, Street N, Lundeberg J, Arvestad L (2012) "Improved gap size estimation for scaffolding algorithms." Bioinformatics 28(17), 2215-2222]
[http://bioinformatics.oxfordjournals.org/content/28/17/2215.long Sahlin K, Street N, Lundeberg J, Arvestad L (2012) "Improved gap size estimation for scaffolding algorithms." Bioinformatics 28(17), 2215-2222]
[http://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-15-281 Sahlin K, Vezzi F, Nystedt B, Lundeberg J, Arvestad L (2014) "BESST--efficient scaffolding of large fragmented assemblies." BMC Bioinformatics 15, 281]
[http://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-15-281 Sahlin K, Vezzi F, Nystedt B, Lundeberg J, Arvestad L (2014) "BESST--efficient scaffolding of large fragmented assemblies." BMC Bioinformatics 15, 281]
[https://bioinformatics.oxfordjournals.org/content/early/2016/03/09/bioinformatics.btw064 Sahlin K, Chikhi R, Arvestad L (2016) "Assembly scaffolding with PE-contaminated mate-pair libraries." Bioinformatics]
[https://bioinformatics.oxfordjournals.org/content/early/2016/03/09/bioinformatics.btw064 Sahlin K, Chikhi R, Arvestad L (2016) "Assembly scaffolding with PE-contaminated mate-pair libraries." Bioinformatics]



Latest revision as of 12:51, 15 August 2022

Description

besst website  

BESST is a package for scaffolding genomic assemblies. It contains several modules for e.g. building a "contig graph" from available information, obtaining scaffolds from this graph, and accurate gap size information (based on GapEst [1]).

Environment Modules

Run module spider besst to find out what environment modules are available for this application.

System Variables

  • HPC_BESST_DIR - installation directory




Citation

If you publish research that uses besst you have to cite it as follows:

Sahlin K, Street N, Lundeberg J, Arvestad L (2012) "Improved gap size estimation for scaffolding algorithms." Bioinformatics 28(17), 2215-2222

Sahlin K, Vezzi F, Nystedt B, Lundeberg J, Arvestad L (2014) "BESST--efficient scaffolding of large fragmented assemblies." BMC Bioinformatics 15, 281

Sahlin K, Chikhi R, Arvestad L (2016) "Assembly scaffolding with PE-contaminated mate-pair libraries." Bioinformatics