Difference between revisions of "Bridger"
Moskalenko (talk | contribs) m (Text replacement - "#uppercase" to "uc") |
|||
| Line 21: | Line 21: | ||
<!--Modules--> | <!--Modules--> | ||
| − | == | + | ==Environment Modules== |
| − | + | Run <code>module spider {{#var:app}}</code> to find out what environment modules are available for this application. | |
| − | |||
| − | < | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
==System Variables== | ==System Variables== | ||
* HPC_{{uc:{{#var:app}}}}_DIR - installation directory | * HPC_{{uc:{{#var:app}}}}_DIR - installation directory | ||
| Line 76: | Line 66: | ||
<!--Turn the Table of Contents and Edit paragraph links ON/OFF--> | <!--Turn the Table of Contents and Edit paragraph links ON/OFF--> | ||
__NOTOC____NOEDITSECTION__ | __NOTOC____NOEDITSECTION__ | ||
| − | |||
| − | |||
Revision as of 13:32, 13 June 2022
Description
Bridger is an efficient de novo transcriptome assembler for RNA-Seq data. It expects as input RNA-Seq reads (single or paired) in fasta or fastq format, outputs all transcripts in fasta format, without using a reference genome. Briefly, it works in two steps: First, Bridger partitions the sequence data into many individual splicing graphs, each capturing the full transcriptional complexity at a given gene or no more than a few genes. Then, for each splicing graph, Bridger uses a rigorous mathematical model called minimum path cover to search an optimal set of paths (transcripts) that can be supported by sequence data and could explain all observed splicing events of each locus.
Environment Modules
Run module spider bridger to find out what environment modules are available for this application.
System Variables
- HPC_BRIDGER_DIR - installation directory