<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: All site pages]]></title>
	<link>https://bioinformaticsonline.com/pages/all?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/pages/all?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</guid>
	<pubDate>Fri, 09 Jun 2017 04:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</link>
	<title><![CDATA[Quick next generation sequencing (NGS) terms definition]]></title>
	<description><![CDATA[<p><strong>fragment size:</strong><span>&nbsp;the Illumina WGS protocol generates paired-end reads from both ends of longer fragments. The lengths of these fragments are assumed to be sampled from a normal distribution. Therefore, in the absence of structural variants, mapping locations of the paired ends span within an interval [&delta;min,&delta;max]. Most (&gt;90%) of paired-end reads are sampled from no-SV regions, therefore the fragment size distribution can be learned empirically for each WGS data set separately.</span><br /><br /><strong>concordant reads:</strong><span>&nbsp;a read pair is called concordant if they can be mapped to the reference genome as &ldquo;expected&rdquo;: (a) mapped to opposing strands where the upstream read is mapped to the forward strand and the downstream read is mapped to the reverse strand2, (b) the distance between ends is between the minimum and maximum expected fragment size.</span><br /><br /><strong>discordant reads:</strong><span>&nbsp;briefly, any non-concordant read pair is considered discordant. Note that, by definition, the discordant read pairs signal potential SVs. The sequence signature produced by these type of reads is known as read-pair signature.</span><br /><br /><strong>split reads:</strong><span>&nbsp;a read that can only be mapped to the reference genome by breaking into two sub-reads is called a split-read. These types of reads also indicate a potential SV or a short insertion or deletion (indel).</span><br /><br /><strong>read depth:</strong><span>&nbsp;number of reads that map within a region of the genome. Overall genome-wide read depth is also referred to as depth of coverage. It is expected that the number of reads that &ldquo;cover&rdquo; each base-pair to follow a Poisson distribution. Therefore, if the read depth over a certain region deviates significantly from this distribution, it signals for a potential copy number variation (CNV).</span></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/30867/perl-special-vars-quick-reference</guid>
	<pubDate>Tue, 07 Feb 2017 05:08:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/30867/perl-special-vars-quick-reference</link>
	<title><![CDATA[Perl Special Vars Quick Reference]]></title>
	<description><![CDATA[<table>
<tbody>
<tr>
<td><tt>$_</tt></td>
<td>The default or implicit variable.</td>
</tr>
<tr>
<td><tt>@_</tt></td>
<td>Subroutine parameters.</td>
</tr>
<tr>
<td><tt>$a</tt><br /><tt>$b</tt></td>
<td><a href="http://perldoc.perl.org/functions/sort.html">sort</a>&nbsp;comparison routine variables.</td>
</tr>
<tr>
<td><tt>@ARGV</tt></td>
<td>The command-line args.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Regular Expressions</span></td>
</tr>
<tr>
<td><tt>$&lt;digit&gt;</tt></td>
<td>Regexp parenthetical capture holders.</td>
</tr>
<tr>
<td><tt>$&amp;</tt></td>
<td>Last successful match (degrades performance).</td>
</tr>
<tr>
<td><tt>${^MATCH}</tt></td>
<td>Similar to&nbsp;<tt>$&amp;</tt>&nbsp;without performance penalty. Requires /p modifier.</td>
</tr>
<tr>
<td><tt>$`</tt></td>
<td>Prematch for last successful match string (degrades performance).</td>
</tr>
<tr>
<td><tt>${^PREMATCH}</tt></td>
<td>Similar to&nbsp;<tt>$`</tt>&nbsp;without performance penalty. Requires&nbsp;<tt>/p</tt>&nbsp;modifier.</td>
</tr>
<tr>
<td><tt>$'</tt></td>
<td>Postmatch for last successful match string (degrades performance).</td>
</tr>
<tr>
<td><tt>${^POSTMATCH}</tt></td>
<td>Similar to&nbsp;<tt>$'</tt>&nbsp;without performance penalty. Requires&nbsp;<tt>/p</tt>&nbsp;modifier.</td>
</tr>
<tr>
<td><tt>$+</tt></td>
<td>Last paren match.</td>
</tr>
<tr>
<td><tt>$^N</tt></td>
<td>Last closed paren match (last submatch).</td>
</tr>
<tr>
<td><tt>@+</tt></td>
<td>Offsets of ends of successful submatches in scope.</td>
</tr>
<tr>
<td><tt>@-</tt></td>
<td>Offsets of starts of successful submatches in scope.</td>
</tr>
<tr>
<td><tt>%+</tt></td>
<td>Like&nbsp;<tt>@+</tt>, but for named submatches.</td>
</tr>
<tr>
<td><tt>%-</tt></td>
<td>Like&nbsp;<tt>@-</tt>, but for named submatches.</td>
</tr>
<tr>
<td><tt>$^R</tt></td>
<td>Last regexp (?{code}) result.</td>
</tr>
<tr>
<td><tt>${^RE_DEBUG_FLAGS}</tt></td>
<td>Current value of regexp debugging flags. See&nbsp;<tt>use re 'debug';</tt></td>
</tr>
<tr>
<td><tt>${^RE_TRIE_MAXBUF}</tt></td>
<td>Control memory allocations for RE optimizations for large alternations.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Encoding</span></td>
</tr>
<tr>
<td><tt>${^ENCODING}</tt></td>
<td>The object reference to the Encode object, used to convert the source code to Unicode.</td>
</tr>
<tr>
<td><tt>${^OPEN}</tt></td>
<td>Internal use: \0 separated Input / Output layer information.</td>
</tr>
<tr>
<td><tt>${^UNICODE}</tt></td>
<td>Read-only Unicode settings.</td>
</tr>
<tr>
<td><tt>${^UTF8CACHE}</tt></td>
<td>State of the internal UTF-8 offset caching code.</td>
</tr>
<tr>
<td><tt>${^UTF8LOCALE}</tt></td>
<td>Indicates whether UTF8 locale was detected at startup.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">IO and Separators</span></td>
</tr>
<tr>
<td><tt>$.</tt></td>
<td>Current line number (or record number) of most recent filehandle.</td>
</tr>
<tr>
<td><tt>$/</tt></td>
<td>Input record separator.</td>
</tr>
<tr>
<td><tt>$|</tt></td>
<td>Output autoflush. 1=autoflush, 0=default. Applies to currently selected handle.</td>
</tr>
<tr>
<td><tt>$,</tt></td>
<td>Output field separator (lists)</td>
</tr>
<tr>
<td><tt>$\</tt></td>
<td>Output record separator.</td>
</tr>
<tr>
<td><tt>$"</tt></td>
<td>Output list separator. (interpolated lists)</td>
</tr>
<tr>
<td><tt>$;</tt></td>
<td>Subscript separator. (Use a real multidimensional array instead.)</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Formats</span></td>
</tr>
<tr>
<td><tt>$%</tt></td>
<td>Page number for currently selected output channel.</td>
</tr>
<tr>
<td><tt>$=</tt></td>
<td>Current page length.</td>
</tr>
<tr>
<td><tt>$-</tt></td>
<td>Number of lines left on page.</td>
</tr>
<tr>
<td><tt>$~</tt></td>
<td>Format name.</td>
</tr>
<tr>
<td><tt>$^</tt></td>
<td>Name of top-of-page format.</td>
</tr>
<tr>
<td><tt>$:</tt></td>
<td>Format line break characters</td>
</tr>
<tr>
<td><tt>$^L</tt></td>
<td>Form feed (default "\f").</td>
</tr>
<tr>
<td><tt>$^A</tt></td>
<td>Format Accumulator</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Status Reporting</span></td>
</tr>
<tr>
<td><tt>$?</tt></td>
<td>Child error. Status code of most recent system call or pipe.</td>
</tr>
<tr>
<td><tt>$!</tt></td>
<td>Operating System Error. (What just went 'bang'?)</td>
</tr>
<tr>
<td><tt>%!</tt></td>
<td>Error number hash</td>
</tr>
<tr>
<td><tt>$^E</tt></td>
<td>Extended Operating System Error (Extra error explanation).</td>
</tr>
<tr>
<td><tt>$@</tt></td>
<td>Eval error.</td>
</tr>
<tr>
<td><tt>${^CHILD_ERROR_NATIVE}</tt></td>
<td>Native status returned by the last pipe close, backtick (`` ) command, successful call to wait() or waitpid(), or from the system() operator.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">ID's and Process Information</span></td>
</tr>
<tr>
<td><tt>$$</tt></td>
<td>Process ID</td>
</tr>
<tr>
<td><tt>$&lt;</tt></td>
<td>Real user id of process.</td>
</tr>
<tr>
<td><tt>$&gt;</tt></td>
<td>Effective user id of process.</td>
</tr>
<tr>
<td><tt>$(</tt></td>
<td>Real group id of process.</td>
</tr>
<tr>
<td><tt>$)</tt></td>
<td>Effective group id of process.</td>
</tr>
<tr>
<td><tt>$0</tt></td>
<td>Program name.</td>
</tr>
<tr>
<td><tt>$^O</tt></td>
<td>Operating System name.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Perl Status Info</span></td>
</tr>
<tr>
<td><tt>$]</tt></td>
<td>Old: Version and patch number of perl interpreter. Deprecated.</td>
</tr>
<tr>
<td><tt>$^C</tt></td>
<td>Current value of flag associated with&nbsp;<strong>-c</strong>&nbsp;switch.</td>
</tr>
<tr>
<td><tt>$^D</tt></td>
<td>Current value of debugging flags</td>
</tr>
<tr>
<td><tt>$^F</tt></td>
<td>Maximum system file descriptor.</td>
</tr>
<tr>
<td><tt>$^I</tt></td>
<td>Value of the&nbsp;<strong>-i</strong>&nbsp;(inplace edit) switch.</td>
</tr>
<tr>
<td><tt>$^M</tt></td>
<td>Emergency Memory pool.</td>
</tr>
<tr>
<td><tt>$^P</tt></td>
<td>Internal variable for debugging support.</td>
</tr>
<tr>
<td><tt>$^R</tt></td>
<td>Last regexp (?{code}) result.</td>
</tr>
<tr>
<td><tt>$^S</tt></td>
<td>Exceptions being caught. (eval)</td>
</tr>
<tr>
<td><tt>$^T</tt></td>
<td>Base time of program start.</td>
</tr>
<tr>
<td><tt>$^V</tt></td>
<td>Perl version.</td>
</tr>
<tr>
<td><tt>$^W</tt></td>
<td>Status of -w switch</td>
</tr>
<tr>
<td><tt>${^WARNING_BITS}</tt></td>
<td>Current set of warning checks enabled by&nbsp;<tt>use warnings;</tt></td>
</tr>
<tr>
<td><tt>$^X</tt></td>
<td>Perl executable name.</td>
</tr>
<tr>
<td><tt>${^GLOBAL_PHASE}</tt></td>
<td>Current phase of the Perl interpreter.</td>
</tr>
<tr>
<td><tt>$^H</tt></td>
<td>Internal use only: Hook into Lexical Scoping.</td>
</tr>
<tr>
<td><tt>%^H</tt></td>
<td>Internaluse only: Useful to implement scoped pragmas.</td>
</tr>
<tr>
<td><tt>${^TAINT}</tt></td>
<td>Taint mode read-only flag.</td>
</tr>
<tr>
<td><tt>${^WIN32_SLOPPY_STAT}</tt></td>
<td>If true on Windows&nbsp;<tt>stat()</tt>&nbsp;won't try to open the file.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Command Line Args</span></td>
</tr>
<tr>
<td><tt>ARGV</tt></td>
<td>Filehandle iterates over files from command line (see also&nbsp;<tt>&lt;&gt;</tt>).</td>
</tr>
<tr>
<td><tt>$ARGV</tt></td>
<td>Name of current file when reading &lt;&gt;</td>
</tr>
<tr>
<td><tt>@ARGV</tt></td>
<td>List of command line args.</td>
</tr>
<tr>
<td><tt>ARGVOUT</tt></td>
<td>Output filehandle for -i switch</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Miscellaneous</span></td>
</tr>
<tr>
<td><tt>@F</tt></td>
<td>Autosplit (-a mode) recipient.</td>
</tr>
<tr>
<td><tt>@INC</tt></td>
<td>List of library paths.</td>
</tr>
<tr>
<td><tt>%INC</tt></td>
<td>Keys are filenames, values are paths to modules included via&nbsp;<tt>use, require,&nbsp;</tt>or&nbsp;<tt>do</tt>.</td>
</tr>
<tr>
<td><tt>%ENV</tt></td>
<td>Hash containing current environment variables</td>
</tr>
<tr>
<td><tt>%SIG</tt></td>
<td>Signal handlers.</td>
</tr>
<tr>
<td><tt>$[</tt></td>
<td>Array and substr first element (Deprecated!).</td>
</tr>
</tbody>
</table><p>&nbsp;</p><p>See&nbsp;<a href="http://perldoc.perl.org/perlvar.html">perlvar</a>&nbsp;for detailed descriptions of each of these (and a few more) special variables.</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/30654/source-code-and-pseudo-code</guid>
	<pubDate>Mon, 23 Jan 2017 10:17:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/30654/source-code-and-pseudo-code</link>
	<title><![CDATA[Source Code and Pseudo Code !!]]></title>
	<description><![CDATA[<p>An <span style="text-decoration: underline;">algorithm</span> is a procedure for solving a problem in terms of the actions to be executed and the order in which those actions are to be executed. An algorithm is merely the sequence of steps taken to solve a problem. The steps are normally "sequence," "selection, " "iteration," and a case-type statement.</p><p>In C, "sequence statements" are imperatives. The "selection" is the "if then else" statement, and the iteration is satisfied by a number of statements, such as the "while," " do," and the "for," while the case-type statement is satisfied by the "switch" statement.</p><hr><p><span style="text-decoration: underline;">Pseudocode</span> is an artificial and informal language that helps programmers develop algorithms. Pseudocode is a "text-based" detail (algorithmic) design tool.</p><p>The rules of Pseudocode are reasonably straightforward. All statements showing "dependency" are to be indented. These include while, do, for, if, switch. Examples below will illustrate this notion.</p><p><strong> GUIDE TO PSEUDOCODE LEVEL OF DETAIL: Given record/file descriptions, pseudocode should be created in sufficient detail so as to directly support the programming effort. It is the purpose of pseudocode to elaborate on the algorithmic detail and not just cite an abstraction. </strong></p><hr><p>Examples:</p><p>1.</p><pre>If student's grade is greater than or equal to 60
    Print "passed"
else
    Print "failed"  
endif
</pre><hr><p>2.</p><pre>  
Set total to zero
Set grade counter to one
While grade counter is less than or equal to ten
    Input the next grade
    Add the grade into the total
endwhile 
Set the class average to the total divided by ten
Print the class average.
</pre><hr><p>3.</p><pre>Initialize total to zero
Initialize counter to zero
Input the first grade
while the user has not as yet entered the sentinel
   add this grade into the running total 
   add one to the grade counter  
   input the next grade (possibly the sentinel)
endwhile

if the counter is not equal to zero
   set the average to the total divided by the counter
   print the average  
else
   print 'no grades were entered' 
endif 
</pre><hr><p>4.</p><pre>initialize passes to zero
initialize failures to zero
initialize student to one
while student counter is less than or equal to ten
    input the next exam result  
    if the student passed</pre><p>add one to passes else add one to failures add one to student counter endif endwhile print the number of passes print the number of failures if eight or more students passed print "raise tuition" endif</p><hr><h3><strong>5.</strong></h3><pre>Larger example:  

NOTE:  NEVER ANY DATA DECLARATIONS IN PSEUDOCODE

Print out appropriate heading and make it pretty
While not EOF do:
     Scan over blanks and white space until a char is found 
	(get first character on the line)
     set can't-be-ascending-flag to 0
     set consec cntr to 1
     set ascending cntr to 1
     putchar first char of string to screen
     set read character to hold character
     While next character read != blanks and white space
          putchar out on screen
          if new char = hold char + 1
               add 1 to consec cntr
               set hold char = new char
               continue
          endif
          if new char &gt;= hold char 
               if consec cntr &lt; 3 
                    set consec cntr to 1
               endif
               set hold char = new char
               continue
          endif
          if new char &lt; hold char
               if consec cntr &lt; 3
                    set consec cntr to 1
               endif
               set hold char = new char
               set can't be ascending flag to 1
               continue
           endif
     end while
     if consec cntr &gt;= 3 
          printf (Appropriate message 1 and skip a line)
          add 1 to consec total
     endif
     if  can't be ascending flag = 0
          printf (Appropriate message 2 and skip a line)
          add 1 to ascending total
     else
          printf (Sorry message and skip a line)
          add 1 to sorry total
     endif
end While
Print out totals:  Number of consecs, ascendings, and sorries.
Stop
</pre><p>Some Keywords That Should be Used And Additional Points</p><p>For looping and selection, The keywords that are to be used include Do While...EndDo; Do Until...Enddo; While .... Endwhile is acceptable. Also, Loop .... endloop is also VERY good and is language independent. Case...EndCase; If...Endif; Call ... with (parameters); Call; Return ....; Return; When;</p><p>Always use scope terminators for loops and iteration.</p><p>As verbs, use the words Generate, Compute, Process, etc. Words such as set, reset, increment, compute, calculate, add, sum, multiply, ... print, display, input, output, edit, test , etc. with careful indentation tend to foster desirable pseudocode. Also, using words such as Set and Initialize, when assigning values to variables is also desirable.</p><p>More on Formatting and Conventions in Pseudocoding</p><ul>
<li>INDENTATION in pseudocode should be identical to its implementation in a programming language. Try to indent at least four spaces.</li>
<li>As noted above, the pseudocode entries are to be cryptic, AND SHOULD NOT BE PROSE. NO SENTENCES.</li>
<li>No flower boxes (discussed ahead) in your pseudocode.</li>
<li>Do not include data declarations in your pseudocode.</li>
<li>But do cite variables that are initialized as part of their declarations. E.g. "initialize count to zero" is a good entry.<hr>Function Calls, Function Documentation, and Pseudocode</li>
<li>Calls to Functions should appear as:
<ul>     </ul>
</li>
<li>Returns in functions should appear as:
<ul> </ul>
</li>
<li>Function headers should appear as:
<ul>     </ul>
</li>
<li>Note that in C, arguments and parameters such as "fieldn" could be written: "pointer to fieldn ...."</li>
<li>Functions called with addresses should be written as:
<ul>         </ul>
</li>
<li>Function headers containing pointers should be indicated as:
<ul>        </ul>
</li>
<li>Returns in functions where a pointer is returned:
<ul>   </ul>
</li>
<li>It would not hurt the appearance of your pseudocode to draw a line or make your function header line "bold" in your pseudocode. Try to set off your functions.</li>
<li>Try to use scope terminators in your pseudocode and source code too. It really hels the readability of the text.<hr>Source Code</li>
<li>EVERY function should have a flowerbox PRECEDING IT. This flower box is to include the functions name, the main purpose of the function, parameters it is expecting (number and type), and the type of the data it returns. All of these listed items are to be on separate lines with spaces in between each explanatory item.</li>
<li>FORMAT of flowerbox should be
<p>&nbsp;</p>
<pre>	 ********************************************************
	 Function:   ( cryptic text describing single function
		     ....... (indented like this) 	
		     .......
	 Calls:      Start listing functions "this" function calls
		     Show these functions:  one per line, indented

	 Called by:  List of functions that calls "this" function
		     Show these functions:  one per line, indented.

	 Input Parameters:  list, if appropriate; else None
	 
	 Returns:    List, if appropriate.
	 ****************************************************************
</pre>
</li>
<li>INDENTATION is critically important in Source Code. Follow standard examples given in class. If in doubt, ASK. Always indent statements within IFs, FOR loops, WILLE loops, SWITCH statements, etc. a consistent number of spaces, such as four. Alternatively, use the tab key. One or two spaces is insufficient.</li>
<li>Use scope terminators at the end of if statements, for statements, while statements, and at the end of functions. It will make your program much more readable.
<p><strong> SPELLING ERRORS ARE NOT ACCEPTABLE </strong></p>
</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/30242/genome-assembly-tools-and-software-part1</guid>
	<pubDate>Mon, 19 Dec 2016 18:09:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/30242/genome-assembly-tools-and-software-part1</link>
	<title><![CDATA[Genome Assembly Tools and Software - PART1 !!]]></title>
	<description><![CDATA[<p>The genome assemblers generally take a file of short sequence reads and a file of quality-value as the input. Since the quality-value file for the high throughput short reads is usually highly memory-intensive, only a few assemblers, best suited for your assembly. For the sake of computational memory saving and convenience of data inquiry, high-throughput short reads data is always initially formatted to specific data structure. Currently, existing data structure for this usage can be predominantly classified into two categories: string-based model and graph-based model.</p><p>We therefore list many genomle assembly tools here. We mainly reported for the assembly of genomes while the others are designed aiming at handling complex genomes.</p><ul>
<li><a href="http://microbiology.se/software/trimetass/" title="TriMetAss 1.2 &ndash; The Trinity-based Iterative Metagenomics Assembler">TriMetAss 1.2 &ndash; The Trinity-based Iterative Metagenomics Assembler</a>
<ul>
<li>TriMetAss is an extension to the Trinity software [1], which can assemble select regions surrounding interesting features in metagenomic data. The software is particularly useful for very common and well-conserved genes (and &ndash; in theory &ndash; non-coding regions) that can occur in multiple contexts in the microbial community under study. It uses Vmatch [2] to extend seed reads (or contigs generated by another assembler) into longer contigs, by iteratively calling Vmatch and Trinity, until some stop criteria are met. Currently, TriMetAss lacks a thorough documentation, but you can direct questions to me if the README.txt file and the &ldquo;-h&rdquo; option is not sufficient to understand the software.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/sharpa/OMWare" title="OMWare 1.0 &ndash; Efficient Assembly of Genome-wide Physical Maps">OMWare 1.0 &ndash; Efficient Assembly of Genome-wide Physical Maps</a>
<ul>
<li>
<p>The purpose of this Python module is help scientists use optical map data.<br />Once complete, it will encapsulate and abstractify optical maps and their most common manipulations as they exist in a variety of formats.</p>
</li>
</ul>
</li>
<li><a href="https://github.com/SaraEl-Metwally/LightAssembler" title="LightAssembler &ndash; Lightweight Resources Assembly Algorithm">LightAssembler &ndash; Lightweight Resources Assembly Algorithm</a>
<ul>
<li>
<p>Lightweight resources assembly algorithm for high-throughput sequencing reads.<br />System requirements<br />64-bit machine with g++ compiler or gcc in general, pthreads,and zlib libraries.</p>
</li>
</ul>
</li>
<li><a href="http://bioinf.spbau.ru/quast" title="QUAST 4.1 &ndash; Quality Assessment Tool for Genome Assemblies">QUAST 4.1 &ndash; Quality Assessment Tool for Genome Assemblies</a>
<ul>
<li>
<p>QUAST evaluates genome assemblies.<br />QUAST works both with and without a reference genome.&nbsp;<br />The tool accepts multiple assemblies, thus is suitable for comparison.</p>
</li>
</ul>
</li>
<li><a href="http://www.dnabaser.com/index.html" title="DNA Baser 4.36 &ndash; DNA Sequence Assembly &amp; Analysis">DNA Baser 4.36 &ndash; DNA Sequence Assembly &amp; Analysis</a>
<ul>
<li>DNA Sequence Assembler is revolutionary bioinformatics software for automatic DNA sequence assembly , DNA sequence analysis, contig editing, file format conversion and mutation detection.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/younglululu/COCACOLA" title="COCACOLA &ndash; Binning Metagenomic Contigs using Sequence COmposition, Read CoverAge, CO-alignment, and Paired-end Read LinkAge">COCACOLA &ndash; Binning Metagenomic Contigs using Sequence COmposition, Read CoverAge, CO-alignment, and Paired-end Read LinkAge<br /></a>
<ul>
<li>COCACOLA: a general framework for binning contigs in metagenomic studies incorporating read COverage, CorrelAtion, sequence COmposition and paired-end read LinkAge<br /><br /></li>
</ul>
</li>
<li><a href="http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html" title="MaxBin 2.2 &ndash; Binning Assembled Metagenomic Sequences">MaxBin 2.2 &ndash; Binning Assembled Metagenomic Sequences</a>
<ul>
<li>MaxBin is software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users can understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads.&nbsp;<br /><br /></li>
</ul>
</li>
<li><a href="http://compbio.fmph.uniba.sk/gaml/" title="GAML 0.1 &ndash; Genome Assembly by Maximum Likelihood">GAML 0.1 &ndash; Genome Assembly by Maximum Likelihood<br /></a>
<ul>
<li>GAML is a prototype genome assembly tool based on maximizing likelihood of the assembly in a model encompaasing error rate, insert length and other features of indvidual sequencing technologies. It can combine datasets produced by different technologies (currently Illumina, 454 and Pacific Biosciences).<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/kkrizanovic/NanoMark" title="NanoMark &ndash; DNA Assembly Benchmark for Nanopore long reads">NanoMark &ndash; DNA Assembly Benchmark for Nanopore long reads</a>
<ul>
<li>
<p>DNA Assembly Benchmark for Nanopore long reads<br />A system for benchmarking DNA assembly tools, based on 3rd generation sequencers.</p>
</li>
</ul>
</li>
<li><a href="http://ibest.github.io/ARC/" title="ARC 1.1.4-beta &ndash; Assembly by Reduced Complexity">ARC 1.1.4-beta &ndash; Assembly by Reduced Complexity</a>
<ul>
<li>
<p>ARC is a pipeline which facilitates iterative, reference guided de novo assemblies with the intent of:&nbsp;<br />1.Reducing time in analysis and increasing accuracy of results by only considering those reads which should assemble together.<br />2.Reducing/removing reference bias as compared to mapping based approaches.</p>
</li>
</ul>
</li>
<li><a href="https://bioinformatics.cs.vt.edu/zhanglab/software/transps/" title="TransPS 1.1.0 &ndash; Transcriptome Post Scaffolding">TransPS 1.1.0 &ndash; Transcriptome Post Scaffolding</a>
<ul>
<li>TransPS is a pipeline for post-processing of pre-assembled transcriptomes using reference based method. It applies an align-layout-consensus structure, consisting of three major stages. First, query sequences are aligned with a reference genome. Second, query sequences are ordered based on the alignment to the reference. Third, non-redundant sequences matched to the same gene of reference genome are scaffolded into one contig.&nbsp;<br /><br /></li>
</ul>
</li>
<li><a href="http://andersonlab.qb3.berkeley.edu/#/software" title="assemblyManager &ndash; Computing the Robotic Commands for 2ab Assembly">assemblyManager &ndash; Computing the Robotic Commands for 2ab Assembly</a>
<ul>
<li>Clotho provides persistence to such objects through relational databases that at least partially correspond the Clotho data model. Beyond database access and data model API support, Clotho Apps provide more specific functionality to Clotho such as viewing and editing data, running simulations, and automating various tasks. When thinking about Clotho Apps, an appropriate analogy would be Apps running on the Android operating system rather than the add-ons that extend the functionality of Firefox<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/transcriptomeassembly/" title="BinPacker 1.1 &ndash; Packing-Based De Novo Transcriptome Assembly from RNA-seq Data">BinPacker 1.1 &ndash; Packing-Based De Novo Transcriptome Assembly from RNA-seq Data</a>
<ul>
<li>BinPacker is a novel de novo assembler by modeling the transcriptome assembly problem as tracking a set of trajectories of items with their sizes representing coverage of their corresponding isoforms by solving a series of bin-packing problems<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/lh3/fermikit" title="FermiKit 0.13 &ndash; De novo Assembly based Variant Calling pipeline for Illumina Short Reads">FermiKit 0.13 &ndash; De novo Assembly based Variant Calling pipeline for Illumina Short Reads</a>
<ul>
<li>FermiKit is a&nbsp;<em>de novo</em>&nbsp;assembly based variant calling pipeline for deep Illumina resequencing data. It assembles reads into unitigs, maps them to the reference genome and then calls variants from the alignment to an accuracy comparable to conventional mapping based pipelines (see evaluation in the&nbsp;<code>tex</code>&nbsp;directory). The assembly does not only encode SNPs and short INDELs, but also retains long deletions, novel sequence insertions, translocations and copy numbers<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/Reedwarbler/REPdenovo" title="REPdenovo &ndash; A tool to Construct Repeats directly from Raw Reads">REPdenovo &ndash; A tool to Construct Repeats directly from Raw Reads</a>
<ul>
<li>
<p>REPdenovo is designed for constructing repeats directly from sequence reads. It based on the idea of frequent k-mer assembly. REPdenovo provides many functionalities, and can generate much longer repeats than existing tools. The overall pipeline is shown in the mannual file. REPdenovo supports the following main functionalities.<br />1.Assembly. This step performs k-mer counting. Then we find frequent k-mers whose frequencies are over certain threshold. We then assemble these frequent k-mers into consensus repeats (in the form of contigs). Then we merge the constructed contigs to more completeness ones.<br />2.Scaffolding. We use paired-end reads to connect repeat contigs into scaffolds, also provide the average coverage (indicates the copy number) for each constructed repeats.</p>
</li>
</ul>
</li>
<li><a href="https://github.com/rdpstaff/Xander_assembler" title="Xander &ndash; Gene-targeted Metagenomic Assembler">Xander &ndash; Gene-targeted Metagenomic Assembler</a>
<ul>
<li>Metagenomics can provide important insight into microbial communities. However, assembling metagenomic datasets has proven to be computationally challenging. We present a novel method for targeting assembly of specific protein-coding genes using a graph structure combining both de Bruijn graphs and protein HMMs. The inclusion of HMM information guides the assembly, with concomitant gene annotation.&nbsp;<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/swapassembler/" title="SWAP-Assembler 2 &ndash; A scalable and fully parallelized Genome Assembler">SWAP-Assembler 2 &ndash; A scalable and fully parallelized Genome Assembler</a>
<ul>
<li>There is a growing gap between the output of new generation massively parallel sequencing machines and the ability to process and analyze the sequencing data. We present SWAP-Assembler, a scalable and fully parallelized genome assembler designed for massive sequencing data. Intend of using traditional de Bruijn Graph, SWAP-Assembler adopts multi-step bi-directed graph (MSG). With MSG, the standard genome assembly (SGA) is equivalent to the edge merging operations in a semi-group. Then a computation model, SWAP, is designed to parallelize semi-group computation. Experimental results showed that SWAP-Assembler is the fastest and most efficient assemblers ever, it can generated contigs with highest accuracy over all five selected assemblers and longest contig N50 in all selected parallel assemblers. Specially, in the scalability test, SWAP-Assembler can scales up to 1024 cores when processing Fish and Yanhuang dataset, and finishes the assembly work in only 15 and 29 minutes respecitively<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/ksanao/TGNet" title="TGNet &ndash; Visualization and Quality Assessment of de novo Genome Assemblies">TGNet &ndash; Visualization and Quality Assessment of de novo Genome Assemblies</a>
<ul>
<li>TGNet is a Cytoscape-based tool for visualization and quality assessment of de novo genome assemblies. Specifically it facilitates rapid detection of inconsistencies between a genome assembly and an independently derived transcriptome assembly.<br /><br /></li>
</ul>
</li>
<li><a href="http://sanger-pathogens.github.io/circlator/" title="Circlator 1.1.3 &ndash; A tool to Circularize Genome Assemblies">Circlator 1.1.3 &ndash; A tool to Circularize Genome Assemblies</a>
<ul>
<li>A tool to circularize genome assemblies. The algorithm and benchmarks are described in the&nbsp;<a href="http://www.genomebiology.com/2015/16/1/294">Genome Biology manuscript</a>.&nbsp;<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/hitbio/misFinder" title="misFinder v0.4.05.05 &ndash; Identify Mis-assemblies in an unbiased manner using Reference and Paired-end Reads">misFinder v0.4.05.05 &ndash; Identify Mis-assemblies in an unbiased manner using Reference and Paired-end Reads</a>
<ul>
<li>misFinder is a tool that aims to identify the assembly errors with high accuracy in an unbiased way and correct these errors at their mis-assembled positions to improve the assembly accuracy for downstream analysis. It combines the information of reference (or close related reference) genome and aligned paired-end reads to the assembled sequence. Structure variation and mis-assembly can be detected by comparing the reference genome and assembled sequence.<br /><br /></li>
</ul>
</li>
<li><a href="http://edwards.sdsu.edu/scaffold_builder/" title="Scaffold_builder v2.2 &ndash; Order Contigs generated by draft sequencing along a Reference Sequence">Scaffold_builder v2.2 &ndash; Order Contigs generated by draft sequencing along a Reference Sequence</a>
<ul>
<li>The abundance of repeat elements in genomes can impede the assembly of a single sequence. The tool Scaffold_builder was designed to generate scaffolds (super contigs of sequences joined by N-bases) using the homology provided by a closely related reference sequence. Scaffold_builder is an advanced wrapper for Nucmer, written in Python that resolves several situations that may arise when mapping contigs to the reference genome.<br /><br /></li>
</ul>
</li>
<li><a href="https://sites.google.com/a/lbl.gov/rnnotator/" title="Rnnotator 3.5.0 &ndash; de novo Transcriptome Assembly pipeline from stranded RNA-Seq reads">Rnnotator 3.5.0 &ndash; de novo Transcriptome Assembly pipeline from stranded RNA-Seq reads</a>
<ul>
<li>Comprehensive annotation and quantification of transcriptomes are outstanding problems in functional genomics. Rnnotator is an automated software pipeline that generates transcript models by de novo assembly of RNA-Seq data without the need for a reference genome. The contigs produced by Rnnotator are highly accurate and reconstruct full-length genes when transcripts are sequenced sufficiently deep, roughly 30X for a given transcript. Rnnotator was designed to assemble Illumina single or paired-end reads. Rnnotator is also able to incorporate strand-specific RNA-Seq reads into the assembly in order to further improve the assembly.<br /><br /></li>
</ul>
</li>
<li><a href="http://satrap.cribi.unipd.it/cgi-bin/satrap.pl" title="SATRAP 0.2 &ndash; SOLiD Assembler TRAnslation Program">SATRAP 0.2 &ndash; SOLiD Assembler TRAnslation Program</a>
<ul>
<li>
<p>A color space assembly must be translated into bases before applying bioinformatics analyses. SATRAP is designed to accomplish this important task adopting a very efficient strategy. The package integrates the Oases pipeline and several optimizations specifically designed for color space management. All steps of the pipeline allow to produce a SOLiD de novo transcriptome assembly and the subsequent color space translation. Alternatively, SATRAP can be used as a stand alone program to perform color space translation for either RNA-seq or DNA-seq SOLiD assemblies.</p>
</li>
</ul>
</li>
<li><a href="http://rrwick.github.io/Bandage/" title="Bandage v0.7.1 &ndash; Navigating De novo Assembly Graphs Easily">Bandage v0.7.1 &ndash; Navigating De novo Assembly Graphs Easily</a>
<ul>
<li>Bandage is a program for visualising de novo assembly graphs. By displaying connections which are not present in the contigs file, Bandage opens up new possibilities for analysing de novo assemblies.<br /><br /></li>
</ul>
</li>
<li><a href="http://hapcol.algolab.eu/" title="HapCol 1.1.1 &ndash; Haplotype Assembly from Long Gapless Reads">HapCol 1.1.1 &ndash; Haplotype Assembly from Long Gapless Reads</a>
<ul>
<li>A fast and memory-efficient method for haplotype assembly from long gapless reads, like those produced by SMRT sequencing technologies (PacBio RS II) and Oxford Nanopore flow cell technologies (MinION).<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/chengyuan/reago-1.1" title="REAGO 1.1 &ndash; REconstruct 16S ribosomal RNA Genes from MetagenOmic data">REAGO 1.1 &ndash; REconstruct 16S ribosomal RNA Genes from MetagenOmic data<br /></a>
<ul>
<li>an assembly tool for 16S ribosomal RNA recovery from metagenomic data<br /><br /></li>
</ul>
</li>
<li><a href="http://www.bioinfo.ufpr.br/" title="FGAP 1.8.1 &ndash; Automated Gap Closing tool">FGAP 1.8.1 &ndash; Automated Gap Closing tool</a>
<ul>
<li>FGAP aims to improve genome sequences by merging alternative assemblies or incorporating alternative data, analyzing the gap region and indicating the best sequence to close the gap.<br /><br /></li>
</ul>
</li>
<li><a href="http://deweylab.biostat.wisc.edu/detonate/" title="DETONATE 1.10 &ndash; DE novo TranscriptOme rNa-seq Assembly with or without the Truth Evaluation">DETONATE 1.10 &ndash; DE novo TranscriptOme rNa-seq Assembly with or without the Truth Evaluation</a>
<ul>
<li>DETONATE consists of two component packages, RSEM-EVAL and REF-EVAL. Both packages are mainly intended to be used to evaluate de novo transcriptome assemblies, although REF-EVAL can be used to compare sets of any kinds of genomic sequences.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/trinityrnaseq/trinityrnaseq/wiki" title="Trinity 2.1.1 &ndash; RNA-Seq De novo Assembly">Trinity 2.1.1 &ndash; RNA-Seq De novo Assembly<br /></a>
<ul>
<li>Trinity represents a novel method for the efficient and robust de novo reconstruction of transcriptomes from RNA-Seq data. Trinity combines three independent software modules: Inchworm, Chrysalis, and Butterfly, applied sequentially to process large volumes of RNA-Seq reads. Trinity partitions the sequence data into many individual de Bruijn graphs, each representing the transcriptional complexity at at a given gene or locus, and then processes each graph independently to extract full-length splicing isoforms and to tease apart transcripts derived from paralogous genes.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/shenkers/isoscm" title="IsoSCM 2.0.11 &ndash; Transcript Assembly tool using Multiple Change-point Inference to improve 3&rsquo;UTR Annotation">IsoSCM 2.0.11 &ndash; Transcript Assembly tool using Multiple Change-point Inference to improve 3&rsquo;UTR Annotation</a>
<ul>
<li>IsoSCM (Isoform Structural Change Model) is a new method for transcript assembly &nbsp;that incorporates change-point analysis to improve the 3&prime; UTR annotation process.<br /><br /></li>
</ul>
</li>
<li><a href="http://sanger-pathogens.github.io/iva/" title="IVA 1.0.3 &ndash; Iterative Virus Assembler">IVA 1.0.3 &ndash; Iterative Virus Assembler</a>
<ul>
<li>IVA is a de novo assembler designed to assemble virus genomes that have no repeat sequences, using Illumina read pairs sequenced from mixed populations at extremely high and variable depth.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/spa-assembler/" title="SFA-SPA 0.2.1 &ndash; A Suffix Array based Short Peptide Assembler for Metagenomic Data">SFA-SPA 0.2.1 &ndash; A Suffix Array based Short Peptide Assembler for Metagenomic Data</a>
<ul>
<li>SFA-SPA is a suffix array based short peptide assembler for metagenomic data<br /><br /></li>
</ul>
</li>
<li><a href="http://www.earlham.ac.uk/rampart/" title="RAMPART 0.12.2 &ndash; A Workflow Management System for de novo Genome Assembly">RAMPART 0.12.2 &ndash; A Workflow Management System for de novo Genome Assembly</a>
<ul>
<li>RAMPART is a de novo assembly pipeline that makes use of third party-tools and High Performance Computing resources. It can be used as a single interface to several popular assemblers, and can perform automated comparison and analysis of any generated assemblies<br /><br /></li>
</ul>
</li>
<li><a href="http://wgs-assembler.sourceforge.net/wiki/index.php?title=Main_Page" title="Celera Assembler 8.3 &ndash; Whole Genome Shotgun Assembler">Celera Assembler 8.3 &ndash; Whole Genome Shotgun Assembler</a>
<ul>
<li>Celera Assembler (wgs-assembler) is scientific software for DNA research. It can reconstruct long sequences of genomic DNA given the fragmentary data produced by whole-genome shotgun sequencing. The Celera Assembler has enabled discovery in microbial genomes, large eukaryotic genomes, diploid genomes, and genomes from environmental samples. Celera Assembler contributed the first diploid sequence of an individual human, and metagenomics assemblies of the Global Ocean Sampling<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/ngopt/" title="A5-miseq 20150522 &ndash; de novo Assembly &amp; Analysis of Illumina Sequence data">A5-miseq 20150522 &ndash; de novo Assembly &amp; Analysis of Illumina Sequence data</a>
<ul>
<li>de novo assembly &amp; analysis of Illumina sequence data, including the A5 pipeline, A5-miseq, tools to evaluate assembly quality, and scripts to facilitate data submission to NCBI and the RAST annotation system<br /><br /></li>
</ul>
</li>
<li><a href="http://www.bcgsc.ca/platform/bioinfo/software/trans-abyss" title="Trans-ABySS 1.5.3 &ndash; Analyze ABySS multi-k-assembled Shotgun Transcriptome Data.">Trans-ABySS 1.5.3 &ndash; Analyze ABySS multi-k-assembled Shotgun Transcriptome Data.</a>
<ul>
<li>Trans-ABySS is a software pipeline for analyzing ABySS-assembled contigs from shotgun transcriptome data. The pipeline accepts assemblies that were generated across a wide range of k values in order to address variable transcript expression levels. It first filters and merges the multi-k assemblies, generating a much smaller set of nonredundant contigs. It contains scripts that map assembled contigs to known transcripts, currently supporting Blat and Exonerate contig-to-genome aligners. It identifies novel splicing events like exon-skipping, novel exons, retained introns, novel introns, and alternative splicing. Its scripts can also estimate gene expression levels, identify candidate polyadenylation sites, and identify candidate gene-fusion events.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/sat-assembler/" title="SAT-Assembler 20160120 &ndash; Scalable and Accurate Targeted Gene Assembly Tool">SAT-Assembler 20160120 &ndash; Scalable and Accurate Targeted Gene Assembly Tool</a>
<ul>
<li>SAT-Assembler can perform targeted gene assembly for both RNA-Seq and metagenomic data. It addresses the above challenges of de novo assembly of large scale NGS data by conducting family-specic gene assembly, homology-guided overlap graph construction, and careful graph traversal.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/operasf/" title="Opera 2.0.2 &ndash; Sequence Assembly Program">Opera 2.0.2 &ndash; Sequence Assembly Program</a>
<ul>
<li>Opera (Optimal Paired-End Read Assembler) is a sequence assembly program . It uses information from paired-end reads to optimally order and orient contigs assembled from shotgun-sequencing reads.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.genecodes.com/" title="Sequencher 5.4.1 &ndash; DNA Sequence Assembly and Analysis">Sequencher 5.4.1 &ndash; DNA Sequence Assembly and Analysis</a>
<ul>
<li>Sequencher is the industry standard software for DNA sequence analysis. It works with all automated sequencers and is widely known for its lightning-fast contig assembly, short learning curve, user-friendly editing tools, and superb technical support. First released almost 15 years ago, Sequencher is currently used for sequence analysis tasks in every major genomic and pharmaceutical company as well as numerous academic and government labs in over 40 countries around the world. Life Science researchers use Sequencher for many diverse DNA sequence analysis applications including de novo gene sequencing, mutation detection, forensic human identification, systematics, and more.<br /><br /></li>
</ul>
</li>
<li><a href="http://minia.genouest.org/" title="Minia 2.0.3 &ndash; Short-read Assembler based on a de Bruijn graph">Minia 2.0.3 &ndash; Short-read Assembler based on a de Bruijn graph</a>
<ul>
<li>Minia is a short-read assembler based on a de Bruijn graph, capable of assembling a human genome on a desktop computer in a day<br /><br /></li>
</ul>
</li>
<li><a href="http://www.genome.umd.edu/masurca.html" title="MaSuRCA 3.1.3 &ndash; Whole Genome Short Read Assembler">MaSuRCA 3.1.3 &ndash; Whole Genome Short Read Assembler</a>
<ul>
<li>MaSuRCA is whole genome assembly software. It combines the efficiency of the de Bruijn graph and Overlap-Layout-Consensus (OLC) approaches. MaSuRCA can assemble data sets containing only short reads from Illumina sequencing or a mixture of short reads and long reads (Sanger, 454).<br /><br /></li>
</ul>
</li>
<li><a href="http://kmergenie.bx.psu.edu/" title="KmerGenie 1.6982 &ndash; K-mer size Selection for Genome Assembly">KmerGenie 1.6982 &ndash; K-mer size Selection for Genome Assembly</a>
<ul>
<li>KmerGenie estimates the best k-mer length for genome de novo assembly. Given a set of reads, KmerGenie first computes the k-mer abundance histogram for many values of k. Then, for each value of k, it predicts the number of distinct genomic k-mers in the dataset, and returns the k-mer length which maximizes this number. Experiments show that KmerGenie&rsquo;s choices lead to assemblies that are close to the best possible over all k-mer lengths.<br /><br /></li>
</ul>
</li>
<li><a href="http://software.broadinstitute.org/software/pilon/" title="pilon v1.16 &ndash; Automated Assembly Improvement">pilon v1.16 &ndash; Automated Assembly Improvement</a>
<ul>
<li>pilon uses read alignment analysis to diagnose, report, and automatically improve de novo genome assemblies.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.phrap.org/phredphrapconsed.html#block_phrap" title="Phred/Phrap/Consed 29.0 &ndash; DNA Sequence Assembler &amp; Finishing Tools">Phred/Phrap/Consed 29.0 &ndash; DNA Sequence Assembler &amp; Finishing Tools<br /></a>
<ul>
<li>phrap is a program for assembling shotgun DNA sequence data. Among other features, it allows use of the entire read and not just the trimmed high quality part, it uses a combination of user-supplied and internally computed data quality information to improve assembly accuracy in the presence of repeats, it constructs the contig sequence as a mosaic of the highest quality read segments rather than a consensus, it provides extensive assembly information to assist in trouble-shooting assembly problems, and it handles large datasets.<br /><br /></li>
</ul>
</li>
<li><a href="https://www.qiagenbioinformatics.com/products/clc-genomics-workbench/" title="CLC Genomics Workbench 8.5.1 &ndash; Assembly &amp; Analysis of Sequencing Data">CLC Genomics Workbench 8.5.1 &ndash; Assembly &amp; Analysis of Sequencing Data</a>
<ul>
<li>CLC Genomics Workbench, for analyzing and visualizing Next Generation Sequencing data, incorporates cutting-edge technology and algorithms, while also supporting and integrating with the rest of your typical NGS workflow.<br /><br /></li>
</ul>
</li>
<li><a href="http://schatzlab.cshl.edu/research/metassembler/" title="Metassembler 1.5 &ndash; Combines multiple Whole Genome de novo Assemblies into a combined Consensus Assembly">Metassembler 1.5 &ndash; Combines multiple Whole Genome de novo Assemblies into a combined Consensus Assembly</a>
<ul>
<li>Metassembler is a software package for reconciling assemblies produced by de novo short-read assemblers such as SOAPdenovo and ALLPATHS-LG. The goal of assembly reconciliation, or &ldquo;metassembly,&rdquo; is to combine multiple assemblies into a single genome that is superior to all of its constituents<br /><br /></li>
</ul>
</li>
<li><a href="https://ics.hutton.ac.uk/tablet/" title="Tablet 1.15.09.01 &ndash; Next Generation Sequence Assembly Visualization">Tablet 1.15.09.01 &ndash; Next Generation Sequence Assembly Visualization</a>
<ul>
<li>Tablet is a lightweight, high-performance graphical viewer for next generation sequence assemblies and alignments.Supporting a range of input assembly formats, Tablet provides high-quality visualizations showing data in packed or stacked views, allowing instant access and navigation to any region of interest, and whole contig overviews and data summaries. Tablet is both multi-core aware and memory efficient, allowing it to handle assemblies containing millions of reads, even on a 32-bit desktop machine.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.bcgsc.ca/platform/bioinfo/software/abyss" title="ABySS 1.9.0 &ndash; de novo, parallel, paired-end Sequence Assembler">ABySS 1.9.0 &ndash; de novo, parallel, paired-end Sequence Assembler</a>
<ul>
<li>ABySS (Assembly By Short Sequences) is a de novo, parallel, paired-end sequence assembler that is designed for short reads. The single-processor version is useful for assembling genomes up to 100 Mbases in size. The parallel version is implemented using MPI and is capable of assembling larger genomes.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.bcgsc.ca/platform/bioinfo/software/cleat" title="CLEAT 2.0 &ndash; Identifies 3&prime; UTR Ends of Transcripts in de novo RNA-Seq Assemblies">CLEAT 2.0 &ndash; Identifies 3&prime; UTR Ends of Transcripts in de novo RNA-Seq Assemblies</a>
<ul>
<li>CLEAT is a post-processing tool for CLEavage site Analysis of Transcriptomes. CLEAT is designed to work on trans-ABySS output.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/ythuang0522/StriDe" title="StriDe &ndash; novel Assembler">StriDe &ndash; novel Assembler</a>
<ul>
<li>The StriDe Assembler integrates string and de Bruijn graph by decomposing reads within error-prone regions, while extending paire-end read into long reads for assembly through repetitive regions.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.sanger.ac.uk/science/tools/reapr" title="REAPR 1.0.18 &ndash; Genome Assembly Evaluation">REAPR 1.0.18 &ndash; Genome Assembly Evaluation</a>
<ul>
<li>REAPR (Recognising Errors in Assemblies using Paired Reads) is a tool that evaluates the accuracy of a genome assembly using mapped paired end reads, without the use of a reference genome for comparison. It can be used in any stage of an assembly pipeline to automatically break incorrect scaffolds and flag other errors in an assembly for manual inspection. It reports mis-assemblies and other warnings, and produces a new broken assembly based on the error calls.<br /><br /></li>
</ul>
</li>
<li><a href="https://www.baseclear.com/genomics/bioinformatics/basetools/gapfiller" title="GapFiller 1.10 &ndash; Close Gaps within Pre-assembled Scaffolds">GapFiller 1.10 &ndash; Close Gaps within Pre-assembled Scaffolds</a>
<ul>
<li>GapFiller is a stand-alone program for closing gaps within pre-assembled scaffolds. It is unique in offering the possibility to manually control the gapclosure process. By using the distance information of paired-read data, GapFiller seeks to close the gap from each edge in an iterative manner. From a good number of tests we see the program yields excellent results both on bacterial en eukaryotic &nbsp;datasets. The command-line Perl script and additional files van be downloaded below. The input data is given by pre-assembled scaffold sequences (FASTA) and NGS paired-read data (FASTA or FASTQ).<br /><br /></li>
</ul>
</li>
<li><a href="http://www.bcgsc.ca/platform/bioinfo/software/ssake" title="SSAKE 3.8.4 &ndash; Assembling Millions of short DNA Sequences">SSAKE 3.8.4 &ndash; Assembling Millions of short DNA Sequences</a>
<ul>
<li>SSAKE is a genomics application for assembling millions of very short DNA sequences.SSAKE is designed to help leverage the information from short sequence reads by stringently assembling them into contiguous sequences that can be used to characterize novel sequencing targets.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/jts/sga" title="SGA 0.10.14 &ndash; String Graph Assembler">SGA 0.10.14 &ndash; String Graph Assembler</a>
<ul>
<li>SGA is a de novo assembler designed to assemble large genomes from high coverage short read data. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads.<br /><br /></li>
</ul>
</li>
<li><a href="https://bibiserv.cebitec.uni-bielefeld.de/cgcat" title="r2cat &ndash; Synteny Plots &amp; Comparative Assembly">r2cat &ndash; Synteny Plots &amp; Comparative Assembly<br /></a>
<ul>
<li>r2cat (related reference based contig arrangement tool) can be used to order a set of contigs with respect to a single reference genome. This is done by mapping the contigs onto the reference using a q-gram filter. The mapping is visualized in a synteny plot.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.bcgsc.ca/platform/bioinfo/software/tasr" title="TASR 1.6 &ndash; Targeted Assembly of Sequence Reads">TASR 1.6 &ndash; Targeted Assembly of Sequence Reads</a>
<ul>
<li>TASR (Targeted Assembly of Sequence Reads) &nbsp;is a genomics application that allows hypothesis-based interrogation of genomic regions (sequence targets) of interest.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/bio-rainbow/" title="Rainbow v2.0.4 &ndash; Clustering and Assembling Short Reads, especially for RAD">Rainbow v2.0.4 &ndash; Clustering and Assembling Short Reads, especially for RAD</a>
<ul>
<li>Rainbow package consists of several programs used for RAD-seq related clustering and de novo assembly.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.sanger.ac.uk/science/tools/caf" title="CAFTOOLS 2.0.2 &ndash; Tools for the Common Assembly Format (CAF)">CAFTOOLS 2.0.2 &ndash; Tools for the Common Assembly Format (CAF)</a>
<ul>
<li>CAFTOOLS comprises a set of libraries and programs for manipulating DNA sequence assemblies using CAF files, a comprehensive representation of a sequence assembly as a text file.</li>
</ul>
</li>
<li>Gap Resolution &ndash; Improving Newbler Genome Assemblies. Gap Resolution was developed by DOE Joint Genome Institute to improve Newbler genome assemblies by automating the closure of sequence gaps caused by repetitive regions in the DNA.<br /><br /></li>
<li><a href="http://jgi.doe.gov/data-and-tools/meraculous/" title="Meraculous 2.0.5 &ndash; De novo Genome Assembler from Short Reads">Meraculous 2.0.5 &ndash; De novo Genome Assembler from Short Reads</a>
<ul>
<li>Meraculous is a new algorithm for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast Pichia stipitis.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/coperead/" title="COPE 1.2.5 &ndash; Pair-end Reads Connection tool to facilitate Genome Assembly">COPE 1.2.5 &ndash; Pair-end Reads Connection tool to facilitate Genome Assembly</a>
<ul>
<li>COPE (Connecting Overlapped Pair-End reads) is a method to align and connect the illumina sequenced Pair-End reads of which the insert size is smaller than the sum of the two read length.The connected reads can be used in genome assembly, resequencing and transcriptome research.<br /><br /></li>
</ul>
</li>
<li><a href="http://sco.h-its.org/exelixis/web/software/pear/index.html" title="PEAR 0.9.6 &ndash; Pair-End reads AssembleR">PEAR 0.9.6 &ndash; Pair-End reads AssembleR</a>
<ul>
<li>PEAR is an ultrafast, memory-efficient and highly accurate pair-end reads assembler. It is fully parallelized and can run with as low as just a few kilobytes of memory.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/ebardenovo/" title="EBARDenovo 2.0.1 &ndash; Highly-accurate de novo Assembler of Paired-end RNA-Seq">EBARDenovo 2.0.1 &ndash; Highly-accurate de novo Assembler of Paired-end RNA-Seq</a>
<ul>
<li>EBARDenovo is a highly-accurate search-based de novo assembler of paired-end RNA-Seq for advance transcriptomic study.<br /><br /></li>
</ul>
</li>
<li><a href="http://marthlab.org/" title="EagleView 2.2 &ndash; Genome Assembler Viewer">EagleView 2.2 &ndash; Genome Assembler Viewer</a>
<ul>
<li>EagleView is an information-rich genome assembler viewer with data integration capability. EagleView can display a dozen different types of information including base qualities, machine specific trace signals, and genome feature annotations. It provides an easy way for inspecting visually the quality of a genome assembly and validating polymorphism candidate sites (e.g., SNPs) reported by polymorphism discovery tools. It can also facilitate data interpretation and hypothesis generation.<br /><br /></li>
</ul>
</li>
<li><a href="http://bioinformatics.tudelft.nl/" title="MAIA 0.5 &ndash; Integrating Genome Assemblies">MAIA 0.5 &ndash; Integrating Genome Assemblies</a>
<ul>
<li>
<p>MAIA (Multiple Assembly IntegrAtion) is an algorithm to integrate multiple genome assemblies. For example, assemblies originating from:<br />&ndash; Different runs of a de novo assembler<br />&ndash; Assemblies of different data types<br />&ndash; Comparative assemblies</p>
</li>
</ul>
</li>
<li><a href="http://cqb.pku.edu.cn/ZhuLab/InteMAP/index.html" title="InteMAP 1.0 &ndash; Integrated Metagenomic Assembly pipeline for NGS Short Reads">InteMAP 1.0 &ndash; Integrated Metagenomic Assembly pipeline for NGS Short Reads<br /></a>
<ul>
<li>InteMAP is a pipeline which integrates individual assemblers for assembling metagenomic short sequencing reads.<br /><br /></li>
</ul>
</li>
<li><a href="http://cqb.pku.edu.cn/ZhuLab/MAP/index.php" title="MAP 20121108 &ndash; A de novo Metagenomic Assembly program for Shotgun DNA reads">MAP 20121108 &ndash; A de novo Metagenomic Assembly program for Shotgun DNA reads</a>
<ul>
<li>MAP (Metagenomic Assembly program) is a de novo assembly approach and its implementation based on an improved Overlap/Layout/Consensus (OLC) strategy incorporated with several special algorithms.MAP uses the mate pair information, resulting in being more applicable to shotgun DNA reads (recommended as &gt; 200 bp) currently widely-used in metagenome projects. Results of extensive tests on simulated data show that MAP can be superior to both Celera and Phrap for typical longer reads by Sanger sequencing, as well as has an evident advantage over Celera, Newbler, and the newest Genovo, for typical shorter reads by 454 sequencing.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.sanger.ac.uk/science/tools/phusion" title="Phusion 2.1c &ndash; Assembly Genome Sequences from Whole Genome Shotgun(WGS) Reads">Phusion 2.1c &ndash; Assembly Genome Sequences from Whole Genome Shotgun(WGS) Reads</a>
<ul>
<li>Phusion is a software package for assembling genome sequences from whole genome shotgun(WGS) reads.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.codoncode.com/aligner/index.htm" title="CodonCode Aligner 6.0.2 &ndash; DNA Sequence Assembly &amp; Alignment">CodonCode Aligner 6.0.2 &ndash; DNA Sequence Assembly &amp; Alignment</a>
<ul>
<li>CodonCode Aligner is a program for sequence assembly, contig editing, and mutation detection, available for Windows and Mac OS X. Aligner is compatible with Phred-Phrap and fully supports sequence quality scores, while offering a familiar, easy-to-learn user interface.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/ceruleanassembler/" title="Cerulean 0.1.1 &ndash; Hybrid Genome Assembler">Cerulean 0.1.1 &ndash; Hybrid Genome Assembler</a>
<ul>
<li>Cerulean is a hybrid assembly using high throughput short and long reads<br /><br /></li>
</ul>
</li>
<li><a href="http://fenderglass.github.io/Ragout/" title="Ragout 1.2 &ndash; Tool for Reference-assisted Assembly">Ragout 1.2 &ndash; Tool for Reference-assisted Assembly</a>
<ul>
<li>Ragout (Reference-Assisted Genome Ordering UTility) is a tool for assisted assembly using multiple references. It takes a short read assembly (a set of contigs), a set of related references and a corresponding phylogenetic tree and then assembles the contigs into scaffolds.<br /><br /></li>
</ul>
</li>
<li><a href="https://zlab.umassmed.edu/~zhuangj/laSV/" title="laSV 1.0.2 &ndash; Local Assembly based Structural Variation Discovery tool">laSV 1.0.2 &ndash; Local Assembly based Structural Variation Discovery tool</a>
<ul>
<li>laSV is a software that employs a local de novo assembly based approach to detect genomic structural variations from whole-genome high-throughput sequencing datasets.<br /><br /></li>
</ul>
</li>
<li><a href="http://bioinf.spbau.ru/en/spades" title="SPAdes 3.6.2 &ndash; Single-cell Genome Assembler">SPAdes 3.6.2 &ndash; Single-cell Genome Assembler</a>
<ul>
<li>SPAdes (St. Petersburg genome assembler) is intended for both standard isolates and single-cell MDA bacteria assemblies.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/hitbio/PERGA" title="PERGA 0.5.03.02 &ndash; Paired End Reads Guided Assembler">PERGA 0.5.03.02 &ndash; Paired End Reads Guided Assembler</a>
<ul>
<li>PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/p/telescoper/wiki/Home/" title="Telescoper 0.2 &ndash; De novo Assembly Algorithm">Telescoper 0.2 &ndash; De novo Assembly Algorithm</a>
<ul>
<li>Telescoper is a local assembly algorithm designed for short-reads from NGS platforms such as Illumina. The reads must come from two libraries: one short insert, and one long insert.<br /><br /></li>
</ul>
</li>
<li><a href="http://metacompass.cbcb.umd.edu/" title="MetaCompass 1.0 &ndash; Comparative Assembly of Metagenomic Sequences">MetaCompass 1.0 &ndash; Comparative Assembly of Metagenomic Sequences</a>
<ul>
<li>MetaCompass is a software package for comparative assembly of metagenomic reads. MetaCompass achieves comparable assembly performance to the state of the art de novo assemblers, but these two different approaches complement each other a lot. So combining contigs between MetaCompass and other independent de novo assemblers give us the best overall metagenomic assembly.<br /><br /></li>
</ul>
</li>
<li><a href="http://evopipes.net/docs.html#scarf_section" title="SCARF &ndash; Scaffolded and Corrected Assembly of Roche 454">SCARF &ndash; Scaffolded and Corrected Assembly of Roche 454</a>
<ul>
<li>SCARF is a next-gen sequence assembly tool for evolutionary genomics. Designed especially for assembling 454 EST sequences against high quality reference sequences from related species.<br /><br /></li>
</ul>
</li>
<li><a href="http://metagenomics.atc.tcs.com/MetaCAA/" title="MetaCAA &ndash; Assembly of Metagenomic Datasets">MetaCAA &ndash; Assembly of Metagenomic Datasets</a>
<ul>
<li>MetaCAA is a sequence-assembly tool specifically intended for metagenomes.<br /><br /></li>
</ul>
</li>
<li><a href="http://mjsull.github.io/Contiguity/" title="Contiguity 1.0.4 &ndash; Contig Adjacency Graph Construction and Visualisation">Contiguity 1.0.4 &ndash; Contig Adjacency Graph Construction and Visualisation</a>
<ul>
<li>Contiguity is interactive software for the visualization and manipulation of de novo genome assemblies.<br /><br /></li>
</ul>
</li>
<li><a href="http://bioresearch.byu.edu/scaffoldscaffolder/" title="ScaffoldScaffolder 0.1 &ndash; Solving Contig Orientation via Bidirected to Directed Graph Reduction">ScaffoldScaffolder 0.1 &ndash; Solving Contig Orientation via Bidirected to Directed Graph Reduction</a>
<ul>
<li>ScaffoldScaffolder is a stand-alone scaffolding algorithm which was designed specifically for scaffolding diploid genomes.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/cbg-ethz/haploclique" title="HaploClique 0.1 &ndash; Viral Quasispecies Assembly from Paired-end data">HaploClique 0.1 &ndash; Viral Quasispecies Assembly from Paired-end data</a>
<ul>
<li>HaploClique is a computational approach to reconstruct the structure of a viral quasispecies from next-generation sequencing data as obtained from bulk sequencing of mixed virus samples.<br /><br /></li>
</ul>
</li>
<li><a href="http://omics.informatics.indiana.edu/TAG/" title="TAG 0.91 &ndash; Transcript Assembly by Mapping Reads to Graphs">TAG 0.91 &ndash; Transcript Assembly by Mapping Reads to Graphs</a>
<ul>
<li>TAG is a tool for metatranscriptome assembly using de Bruijn graph of matched metagenome as the reference<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/bioinfomaticsCSU/EPGA2" title="EPGA2 &ndash; De Novo Assembler">EPGA2 &ndash; De Novo Assembler</a>
<ul>
<li>EPGA2 updates some modules in EPGA which can improve memory efficiency in genome asssembly.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/gmcloser/" title="GMcloser 1.5.1 / GMvalue 1.3 &ndash; Closing the Gaps in Scaffolds with Preassembled Contigs">GMcloser 1.5.1 / GMvalue 1.3 &ndash; Closing the Gaps in Scaffolds with Preassembled Contigs</a>
<ul>
<li>GMcloser fills and closes the gaps present in scaffold assemblies, especially those generated by the de novo assembly of whole genomes with next-generation sequencing (NGS) reads.<br /><br /></li>
</ul>
</li>
<li><a href="https://sites.google.com/a/ucr.edu/slicembler/" title="SLICEMBLER &ndash; Meta-assembler Designed for Ultra-deep Sequencing data">SLICEMBLER &ndash; Meta-assembler Designed for Ultra-deep Sequencing data</a>
<ul>
<li>SLICEMBLER is a meta-assembler designed for ultra-deep sequencing data<br /><br /></li>
</ul>
</li>
<li><a href="http://www.cs.colostate.edu/seq/seqlandscape/" title="SEQLandscape v1 &ndash; Generation and Visualization of Sequence Landscape">SEQLandscape v1 &ndash; Generation and Visualization of Sequence Landscape</a>
<ul>
<li>
<p>SEQLandscape is an application allowing the generation and visualization of a sequence landscape.&nbsp;HyDA-Vista: Towards Optimal Guided Selection of k-mer Size for Sequence Assembly.</p>
</li>
</ul>
</li>
<li><a href="http://www.cs.colostate.edu/seq/missequel/" title="misSEQuel v1.0beta &ndash; Misassembly Detection in Draft Genomes">misSEQuel v1.0beta &ndash; Misassembly Detection in Draft Genomes</a>
<ul>
<li>misSEQuel is a software that enhances the quality of draft genomes by identifying misassembly errors and their breakpoints using paired-end sequence reads and optical mapping data.<br /><br /></li>
</ul>
</li>
<li><a href="http://scit.us/projects/dawg/" title="Dawg 1.2 &ndash; Simulating Sequence Evolution">Dawg 1.2 &ndash; Simulating Sequence Evolution</a>
<ul>
<li>Dawg (DNA Assembly with Gaps) is an application designed to simulate the evolution of recombinant DNA sequences in continuous time based on the robust general time reversible model with gamma and invariant rate heterogeneity and a novel length-dependent model of gap formation.<br /><br /></li>
</ul>
</li>
<li><a href="http://busco.ezlab.org/" title="BUSCO v1.1b1 &ndash; Assessing Genome Assembly and Annotation Completeness with Single-copy Orthologs">BUSCO v1.1b1 &ndash; Assessing Genome Assembly and Annotation Completeness with Single-copy Orthologs</a>
<ul>
<li>BUSCO completeness assessment employs sets of Benchmarking Universal Single-Copy Orthologs from OrthoDB to provide quantitative measures of the completeness of genome assemblies, annotated gene sets, and transcriptomes in terms of expected gene content.<br /><br /></li>
</ul>
</li>
<li><a href="http://kakitone.github.io/finishingTool/" title="FinisherSC 2.0 &ndash; A Repeat-aware tool for upgrading de-novo Assembly using Long Reads">FinisherSC 2.0 &ndash; A Repeat-aware tool for upgrading de-novo Assembly using Long Reads</a>
<ul>
<li>FinisherSC is a repeat-aware and scalable tool for upgrading de-novo assembly using long reads.<br /><br /></li>
</ul>
</li>
<li><a href="https://whatshap.readthedocs.io/en/latest/" title="WhatsHap &ndash; Haplotype Assembly for Future-Generation Sequencing Reads">WhatsHap &ndash; Haplotype Assembly for Future-Generation Sequencing Reads</a>
<ul>
<li>WhatsHap is a software for phasing genomic variants using DNA sequencing reads, also called haplotype assembly. It is especially suitable for long reads, but works also well with short reads.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.mscs.mu.edu/~bozdag/compartmentalized_assembler.html" title="Compartmentalized Assembler &ndash; Assembly of Physical Maps">Compartmentalized Assembler &ndash; Assembly of Physical Maps</a>
<ul>
<li>Compartmentalized assembler is a novel method for the assemlby of high quality physical maps from fingerprinted clones.<br /><br /></li>
</ul>
</li>
<li><a href="http://genome.jgi.doe.gov/viz/" title="Elviz &ndash; Exploration of Metagenomic Assemblies">Elviz &ndash; Exploration of Metagenomic Assemblies</a>
<ul>
<li>Elviz (Environmental Laboratory Visualization) is an interactive web-based tool for the visual exploration of assembled metagenome data and their complex metadata.<br /><br /></li>
</ul>
</li>
<li><a href="http://bs.ipm.ir/softwares/ssp/" title="SSP &ndash; de novo Transcriptome Assembler">SSP &ndash; de novo Transcriptome Assembler</a>
<ul>
<li>SSP is a de novo transcriptome assembler that assembles RNA-seq reads into transcripts. SSP aims to reconstructs all the alternatively spliced isoforms and estimates the expression level of them.<br /><br /></li>
</ul>
</li>
<li><a href="http://viramp.com/" title="VirAmp &ndash; Galaxy-based Viral Genome Assembly pipeline">VirAmp &ndash; Galaxy-based Viral Genome Assembly pipeline</a>
<ul>
<li>VirAmp is a web-based semi-de novo fast virus genome assembly pipeline designed for extremely high coverage NGS data. VirAmp is a collection of existing tools, combined into a single Galaxy interface. Users without further computational knowledge can easily operate the pipeline.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/juliema/aTRAM" title="aTRAM&nbsp;1.04 &ndash; automated Target Restricted Assembly Method">aTRAM&nbsp;1.04 &ndash; automated Target Restricted Assembly Method</a>
<ul>
<li>aTRAM performs targeted de novo assembly of loci from paired-end Illumina runs.<br /><br /></li>
</ul>
</li>
<li><a href="http://denovoassembler.sourceforge.net/" title="Ray 2.3.1 &ndash; Parallel Genome Assemblies for Parallel DNA sequencing">Ray 2.3.1 &ndash; Parallel Genome Assemblies for Parallel DNA sequencing</a>
<ul>
<li>Ray is a parallel software that computes de novo genome assemblies with next-generation sequencing data.<br /><br /></li>
</ul>
</li>
<li><a href="http://genome.cs.nthu.edu.tw/CAR/" title="CAR &ndash; Contig Assembly of Prokaryotic Draft Genomes Using Rearrangements">CAR &ndash; Contig Assembly of Prokaryotic Draft Genomes Using Rearrangements</a>
<ul>
<li>CAR is an efficient and more accurate tool for assembling contigs of a prokaryotic draft genome based on a reference genome.<br /><br /></li>
</ul>
</li>
<li><a href="http://www.lstmed.ac.uk/vtbuilder" title="VTBuilder &ndash; Assembly of Multi Isoform Transcriptomes">VTBuilder &ndash; Assembly of Multi Isoform Transcriptomes</a>
<ul>
<li>VTBuilder is a tool for the inference of non-chimeric contigs from read data that has been sequenced from complex multi-isoformic transcriptomes, such as snake venom glands, or rapidly evolving viral populations, such as HIV-1.<br /><br /></li>
</ul>
</li>
<li><a href="http://bioinfolab.uncc.edu/TruHmm_package/" title="TruHmm &ndash; TRanscription Unit Assembly by a Hidden Markov model">TruHmm &ndash; TRanscription Unit Assembly by a Hidden Markov model</a>
<ul>
<li>TruHmm is a reference based transcriptome assembler for prokaryotes, and is suitable for assembling transcripts for directional RNA-seq library.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/rnaseqassembly/?source=navbar" title="Bridger 20141201 &ndash; RNA-Seq Assembly">Bridger 20141201 &ndash; RNA-Seq Assembly</a>
<ul>
<li>Bridger is a new de novo transcriptome assembler which takes advantage of techniques employed in Cufflinks to overcome limitations of the existing de novo assemblers.<br /><br /></li>
</ul>
</li>
<li><a href="https://sourceforge.net/projects/grasp-release/" title="GRASP 0.0.4 &ndash; Guided Reference-based Assembly of Short Peptides">GRASP 0.0.4 &ndash; Guided Reference-based Assembly of Short Peptides</a>
<ul>
<li>GRASP is a gene annotation tool for metagenomic studies. GRASP assembles the fragmented short-peptides, which are called from the NGS reads, and aligns the assembled contigs to the query reference protein. GRASP achieves much higher sensitivity than BLASTP for gene annotation purpose.<br /><br /></li>
</ul>
</li>
<li><a href="http://cortexassembler.sourceforge.net/index.html" title="Cortex 1.05.21 &ndash; Genome Assembly and Variation Analysis">Cortex 1.05.21 &ndash; Genome Assembly and Variation Analysis</a>
<ul>
<li>Cortex is an efficient and low-memory software framework for analysis of genomes using sequence data. There are two main executables, being developed in parallel streams: cortex_con (primary contact Mario Caccamo) is for consensus genome assembly, and cortex_var (primary contact Zamin Iqbal) is for variation and population assembly.<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/voutcn/megahit" title="MEGAHIT v0.1.4 &ndash; Large and Complex Metagenomics Assembly via Succinct de Bruijn graph">MEGAHIT v0.1.4 &ndash; Large and Complex Metagenomics Assembly via Succinct de Bruijn graph</a>
<ul>
<li>MEGAHIT is a single node assembler for large and complex metagenomics NGS reads, such as soil. It makes use of succinct de Bruijn graph to achieve low memory usage, whereas its goal is not to make memory usage as low as possible.<br /><br /></li>
</ul>
</li>
<li><a href="http://sb.nhri.org.tw/CISA/en/CISA" title="CISA 20140304 &ndash; Contig Integrator for Sequence Assembly">CISA 20140304 &ndash; Contig Integrator for Sequence Assembly</a>
<ul>
<li>CISA has been developed to integrate the assemblies into a hybrid set of contigs, resulting in assemblies of superior contiguity and accuracy, compared with the assemblies generated by the state-of-the-art assemblers and the hybrid assemblies merged by existing tools<br /><br /></li>
</ul>
</li>
<li><a href="http://cole-trapnell-lab.github.io/cufflinks/" title="Cufflinks 2.2.1 &ndash; Transcript Assembler &amp; Abundance Estimator for RNA-Seq">Cufflinks 2.2.1 &ndash; Transcript Assembler &amp; Abundance Estimator for RNA-Seq</a>
<ul>
<li>Cufflinks assembles transcripts, estimates their abundances, and tests for differential expression and regulation in RNA-Seq samples. It accepts aligned RNA-Seq reads and assembles the alignments into a parsimonious set of transcripts. Cufflinks then estimates the relative abundances of these transcripts based on how many reads support each one.<br /><br /></li>
</ul>
</li>
<li><a href="http://colibread.inria.fr/software/mapsembler2/" title="mapsembler 2.2.4 &ndash; Targetted Assembly of Short Sequence Reads">mapsembler 2.2.4 &ndash; Targetted Assembly of Short Sequence Reads</a>
<ul>
<li>Mapsembler is a targeted assembly software. It takes as input a set of NGS raw reads and a set of input sequences (starters). It first determines if each starter is read-coherent, e.g. whether reads confirm the presence of each starter in the original sequence. Then for each read-coherent starter, Mapsembler outputs its sequence neighborhood as a linear sequence or as a graph, depending on the user choice.<br /><br /></li>
</ul>
</li>
<li><a href="https://urgi.versailles.inra.fr/Tools/Tedna" title="Tedna 1.2.2 &ndash; Transposable Element De Novo Assembler">Tedna 1.2.2 &ndash; Transposable Element De Novo Assembler</a>
<ul>
<li>Tedna is a lightweight de novo transposable element assembler. It assembles the transposable elements directly from the raw reads.<br /><br /></li>
</ul>
</li>
<li><a href="http://chitsazlab.org/software.html" title="HyDA 1.3.1 / Squeezambler 2.0.3 &ndash; Hybrid De Novo Assembler">HyDA 1.3.1 / Squeezambler 2.0.3 &ndash; Hybrid De Novo Assembler</a>
<ul>
<li>HyDA is a multipurpose assembler, particularly tested for single cell and normal multicell genome co-assembly<br /><br /></li>
</ul>
</li>
<li><a href="https://github.com/neufeld/pandaseq" title="PANDASEQ 2.8 / Pandaseq-sam 1.3 &ndash; PAired-eND Assembler for DNA sequences">PANDASEQ 2.8 / Pandaseq-sam 1.3 &ndash; PAired-eND Assembler for DNA sequences</a>
<ul>
<li>PANDASEQ is a program to align Illumina reads, optionally with PCR primers embedded in the sequence, and reconstruct an overlapping sequence.<br /><br /></li>
</ul>
</li>
<li><a href="http://lge.ibi.unicamp.br/zorro/" title="ZORRO 2.2 &ndash; Hybrid Sequencing Technology Assembler">ZORRO 2.2 &ndash; Hybrid Sequencing Technology Assembler</a>
<ul>
<li>ZORRO is a hybrid sequencing technology assembler. It merges two sets of pre-assembled contigs into a more contiguous and consistent assembly.<br /><br /></li>
</ul>
</li>
<li><a href="http://ccb.jhu.edu/software/FLASH/" title="FLASH 1.2.11 &ndash; Fast Length Adjustment of SHort reads">FLASH 1.2.11 &ndash; Fast Length Adjustment of SHort reads</a>
<ul>
<li>FLASH (Fast Length Adjustment of SHort reads) is a very accurate fast tool to merge paired-end reads from fragments that are shorter than twice the length of reads. The extended length of reads has a significant positive impact on improvement of genome assemblies.<br /><br /></li>
</ul>
</li>
<li><a href="http://software.broadinstitute.org/allpaths-lg/blog/" title="ALLPATHS-LG 51750 &ndash; Whole Genome Shotgun Assembler">ALLPATHS-LG 51750 &ndash; Whole Genome Shotgun Assembler</a>
<ul>
<li>ALLPATHS-LG (Large Genome) is a whole genome shotgun assembler that can generate high quality assemblies from short reads. It works on both small and large (mammalian size) genomes. To use it, you should first generate ~100 base Illumina reads from two libraries: one from ~180 bp fragments, and one from ~3000 bp fragments, both at about 45x coverage. Sequence from longer fragments will enable longer-range continuity.<br /><br /></li>
</ul>
</li>
<li><a href="http://bioinformaticsonline.com/pages/view/30440/genome-assembly-tools-and-software-part2">More Tools</a> at&nbsp;http://bioinformaticsonline.com/pages/view/30440/genome-assembly-tools-and-software-part2</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/28112/ngs-glossary</guid>
	<pubDate>Mon, 27 Jun 2016 08:56:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/28112/ngs-glossary</link>
	<title><![CDATA[NGS Glossary !!]]></title>
	<description><![CDATA[<p><strong>alignment</strong>: the mapping of a raw sequence read to a location within a reference genome. The mapping occurs because the sequences within the raw read match or align to sequences within the reference genome. Alignment information is stored in the <strong>SAM</strong> or <strong>BAM</strong> file formats.</p><p><strong>bcftools</strong>: a set of companion tools, currently bundled with SAMtools, for identifying and filtering genomics variants.</p><p><strong>bowtie</strong>: widely used, open source alignment software for aligning raw sequence reads to a reference genome.</p><p><strong>BAM Format</strong>: binary, compressed format for storing <strong>SAM</strong> data.</p><p><strong>BCF Format</strong>: Binary call format. Binary, compressed format for storing <strong>VCF</strong> data.</p><p><strong>CIGAR String</strong>: Compact Idiosyncratic Gapped Alignment Report. A compact string that (partially) summarizes the alignment of a raw sequence read to the reference genome. Three core abbreviations are used: M for alignment match; I for insertion; and D for Deletion. For example, a CIGAR string of 5M2I63M indicates that the first 5 base pairs of the read align to the reference, followed by 2 base pairs, which are unique to the read, and not in the reference genome, followed by an additional 63 base pairs of alignment.</p><p><strong>FASTA Format</strong>: text format for storing raw sequence data. For example, the FASTA file at: <a href="http://www.ncbi.nlm.nih.gov/nuccore/NC_008253">http://www.ncbi.nlm.nih.gov/nuccore/NC_008253</a> contains entire genome for Escherichia coli 536.</p><p><strong>FASTQ Format</strong>: text format for storing raw sequence data along with quality scores for each base; usually generated by sequencing machines.</p><p><strong>genotype likelihood</strong>: the probability that a specific genotype is present in the sample of interest. Genotype likelihoods are usually expressed as a <strong>Phred-scaled probability</strong>, where P = 10 ^ (-Q/10). For example, if the genotype TT (both alleles are T) at position 1,299,132 in human chromosome 12 (reference G) is 37, this translates to a probability of 10<sup>-37/10</sup> = 0.0001995, meaning that there is very low probability that the reads in your sample support a TT genotype. On the other hand, a genotype of AA at the same position with a score of 0 translates into a probability of 10<sup>-0</sup> = 1, indicating extremely high probability that your sample contains a homozygous mutation of G to A.</p><p><strong>mate-pair</strong>: in paired-end sequencing, both ends of a single DNA or RNA fragment are sequenced, but the intermediate region is not. The two ends which are sequenced form a pair, and are frequently referred to as mate-pairs.</p><p><strong>QNAME</strong>: unique identifier of a raw sequence read (also known as the Query Name). Used in <strong>FASTQ</strong> and <strong>SAM</strong> files.</p><p><strong>paired-end sequencing</strong>: sequencing process where both ends of a single DNA or RNA fragment are sequenced, but the intermediate region is not. Particularly useful for identifying structural rearrangements, including gene fusions.</p><p><strong>Phred-scaled probability</strong>: a scaled value (Q) used to compactly summarize a probability, where P = 10<sup>-Q/10</sup>. For example, a Phred Q score of 10 translates to probability (P) = 10<sup>-10/10</sup> = 0.1. Phred-scaled probabilities are common in next-generation sequencing, and are used to represent multiple types of quality metrics, including quality of base calls, quality of mappings, and probabilities associated with specific genotypes. The name Phred refers to the original Phred base-calling software, which first used and developed the scale.</p><p><strong>Phred quality score</strong>: a score assigned to each base within a sequence, quantifying the probability that the base was called incorrectly. Scores use a <strong>Phred-scaled probability</strong> metric. For example, a Phred Q score of 10 translates to P=10<sup>-10/10</sup> = 0.1, indicating that the base has a 0.1 probability of being incorrect. Higher Phred score correspond to higher accuracy. In the <strong>FASTQ format</strong>, Phred scores are represented as single ASCII letters. For details on translating between Phred scores and ASCII values, refer to <a href="http://www.somewhereville.com/?p=1508">Table 1 of this useful blog post from Damian Gregory Allis</a>.</p><p><strong>read-length</strong>: the number of base pairs that are sequenced in an individual sequence read.</p><p><strong>read-depth</strong>: the number of sequence reads that pile up at the same genomic location. For example, 30X read-depth coverage indicates that the genomic location is covered by 30 independent sequencing reads. Increased read-depth translates into higher confidence for calling genomic variants.</p><p><strong>RNAME</strong>: reference genome identifier (also known as the Reference Name). Within a SAM formatted file, the RNAME identifies the reference genome where the raw read aligns.</p><p><strong>SAM Flag</strong>: a single integer value (e.g. 16), which encodes multiple elements of meta-data regarding a read and its alignment. Elements include: whether the read is one part of a paired-end read, whether the read aligns to the genome, and whether the read aligns to the forward or reverse strand of the genome. A <a href="http://picard.sourceforge.net/explain-flags.html">useful online utility</a> decodes a single SAM flag value into plain English.</p><p><strong>SAM Format</strong>: Text file format for storing sequence alignments against a reference genome. See also <strong>BAM</strong> Format.</p><p><strong>SAMtools</strong>: widely used, open source command line tool for manipulating SAM/BAM files. Includes options for converting, sorting, indexing and viewing SAM/BAM files. The SAMtools distribution also includes bcftools, a set of command line tools for identifying and filtering genomics variants. Created by <a href="http://lh3lh3.users.sourceforge.net/">Heng Li</a>, currently of the Broad Institute.</p><p><strong>single-read sequencing</strong>: sequencing process where only one end of a DNA or RNA fragment is sequenced. Contrast with <strong>paired-end</strong> sequencing.</p><p><strong>VCF Format</strong>: Variant call format. Text file format for storing genomic variants, including single nucleotide polymorphisms, insertions, deletions and structural rearrangements. See also <strong>BCF</strong> format.</p><p><strong>Next</strong><strong>Generation</strong><strong>Sequencing</strong><br /> A high-throughput sequencing method which parallelizes the sequencing process, producing thousands or millions of sequences at once.</p><p><strong>Deep</strong><strong>Sequencing</strong><br /> Techniques of nucleotide sequence analysis that increase the range, complexity, sensitivity, and accuracy of results by greatly increasing the scale of operations and thus the number of nucleotides, and the number of copies of each nucleotide sequenced.</p><p><strong>Paired-End</strong><strong>Sequencing</strong><br /> Sequence both ends of the same fragment and keep track of the paired data.</p><p><strong>Adapter</strong><br /> Short oligonucleotides which are attached to the DNA to be sequenced. An adapter can provide a priming site for both amplification and sequencing of the adjoining, unknown nucleic acid.</p><p><strong>Library</strong><br /> A collection of DNA fragments with adapters ligated to each end.</p><p><strong>Bridge</strong><strong>Amplification</strong><br /> Generation of in situ copies of a specific DNA molecule on an oligo-decorated solid support.</p><p><strong>Emulsion</strong><strong>PCR</strong><br /> A method for bead-based amplification of a library. A single adapter-bound fragment is attached to the surface of a bead, and an oil emulsion containing necessary amplification reagents is formed around the bead/fragment component. Parallel amplification of millions of beads with millions of single strand fragments produces a sequencer-ready library.</p><p><strong>Alignment</strong><br /> Mapping of sequence reads to a known reference sequence</p><p><strong>Reference</strong><strong>sequence</strong><strong>/</strong><strong>genome</strong><strong>&nbsp; </strong><br /> A fully assembled version of a genome that can be used for mapping short DNA sequence reads for comparisons of genomes from various individuals</p><p><strong>Coverage</strong><strong>Depth</strong><br /> The number of nucleotides from reads that are mapped to a given position of reference genome.</p><p><strong>Specificity</strong><strong>&nbsp; </strong><br /> The percentage of sequences that map to the intended targets out of total bases per run.</p><p><strong>Uniformity</strong><strong>&nbsp; </strong><br /> The variability in sequence coverage across target regions.</p><p><strong>Homopolymer</strong><br /> Uninterrupted stretch of a single nucleotide type (e.g., TTT or GGGGGG)</p><p><strong>InDel</strong><br /> InDel stands for Insertion or deletion. A form of structural variation in which a DNA segment is either deleted or inserted.</p><p><strong>SNP</strong><strong>&nbsp; </strong></p><p>SNP stands for Single Nucleotide Polymorphism. A single base difference found when comparing the same DNA sequence from two different individuals.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/28051/convert-ensembl-gtf-to-annotation-table-geneid-genesymbol-genewisechrlocation-geneclass-strand-raw</guid>
	<pubDate>Fri, 24 Jun 2016 18:08:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/28051/convert-ensembl-gtf-to-annotation-table-geneid-genesymbol-genewisechrlocation-geneclass-strand-raw</link>
	<title><![CDATA[Convert EnsEMBL GTF to Annotation table (Geneid, GeneSymbol, GeneWiseChrLocation, GeneClass, Strand) Raw]]></title>
	<description><![CDATA[<p><strong>Bash Script source:</strong></p><p>https://gist.github.com/santhilalsubhash/367befcf5216be4b1fd9</p><p>&nbsp;</p><p><strong>Information</strong>:</p><p>This script converts EnsEMBL GTF (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/1e7cca357e52a181dc25/raw/cfb803e07900a2baefbb6534f1299fd30cb57a29/sample.GTF">https://gist.githubusercontent.com/santhilalsubhash/1e7cca357e52a181dc25/raw/cfb803e07900a2baefbb6534f1299fd30cb57a29/sample.GTF</a>) file to annotation table format. It generated two files<br />1) Transcript wise chromosome location with information about transcripts (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/c7dec516e0338503a4b6/raw/de0af1a39f0005c4ce7321c5ae57fc8b4a14c7f4/sample.GTF_enst_annotation.txt">https://gist.githubusercontent.com/santhilalsubhash/c7dec516e0338503a4b6/raw/de0af1a39f0005c4ce7321c5ae57fc8b4a14c7f4/sample.GTF_enst_annotation.txt</a>)<br />2) Gene wise chromosome location with information about genes (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/c92006c5080f0333bec2/raw/d16e0b2440d73b09b486d3c9751cdb248a73fa0b/sample.GTF_ensg_annotation.txt">https://gist.githubusercontent.com/santhilalsubhash/c92006c5080f0333bec2/raw/d16e0b2440d73b09b486d3c9751cdb248a73fa0b/sample.GTF_ensg_annotation.txt</a>)</p><p>Note: You can download GTF files from&nbsp;<a href="http://www.ensembl.org/info/data/ftp/index.html">http://www.ensembl.org/info/data/ftp/index.html</a></p>]]></description>
	<dc:creator>EagleEye</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/28040/tool-gene-set-clustering-based-on-functional-annotation-genescf</guid>
	<pubDate>Fri, 24 Jun 2016 17:30:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/28040/tool-gene-set-clustering-based-on-functional-annotation-genescf</link>
	<title><![CDATA[Tool: Gene Set Clustering based on Functional annotation (GeneSCF)]]></title>
	<description><![CDATA[<p><img src="http://genescf.kandurilab.org/pics/genescf_logo.png" alt="image" width="500" height="90," style="border: 0px; border: 0px;"></p><p>&nbsp;</p><p>-----------</p><p>&nbsp;</p><h1><strong>Gene Set Clustering based on Functional annotation</strong></h1><p>&nbsp;</p><p>GeneSCF serves as command line tool for clustering the list of genes given by the users based on functional annotation (Gene Ontology, KEGG, REACTOME and <a href="http://ncg.kcl.ac.uk/ncg4/" target="new">NCG 4.0</a>). It requires gene list in the form of Entrez Gene ID (UIDs) or Official gene symbols as a input. GeneSCF supports more organisms from V1.1. Examples to download database as simple text file using GeneSCF "prepare_database" module, 1) https://www.biostars.org/p/197414/#197416 , 2) https://www.biostars.org/p/191532/#191540</p><p>&nbsp;</p><p>The advantage of using GeneSCF over other enrichment tools is that, it performs enrichment analysis in real-time (v1.1 and above) by accessing source databases. With command-line versions of tools, as you know you can run multiple gene list simultaneously.</p><p>&nbsp;</p><p>------------</p><p>&nbsp;</p><table>
<tbody>
<tr>
<td><br /><strong><em>Home page:</em></strong><br /><br />http://genescf.kandurilab.org/<br /><br /></td>
</tr>
</tbody>
</table><p>&nbsp;</p><p><strong><em>Requirement:</em></strong></p><p>&nbsp;</p><p><br />GeneSCF only works on Linux system, it has been successfully tested on Ubuntu, Mint and Cent OS. Other distributions of Linux might work as well.<br /><br /></p><p>&nbsp;</p><p><br /><em><strong>Documentation:</strong></em><br /><br />http://genescf.kandurilab.org/documentation.php<br /><br /></p><p>&nbsp;</p><p><br /><em><strong>Report issues </strong></em>on <a href="https://www.biostars.org/p/108669/" target="new"> Biostars</a> or <a href="https://github.com/santhilalsubhash/geneSCF" target="new">GitHub Project page</a></p><p>&nbsp;</p><p><img src="http://genescf.kandurilab.org/pics/workflow.png" alt="image" width="280" height="250," style="border: 0px; border: 0px;"><br /><br />----------</p>]]></description>
	<dc:creator>EagleEye</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27965/cheatsheet-for-linux</guid>
	<pubDate>Wed, 22 Jun 2016 07:55:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27965/cheatsheet-for-linux</link>
	<title><![CDATA[Cheatsheet for Linux !!]]></title>
	<description><![CDATA[<p>Linux Commands Cheat Sheet<br /><br />&nbsp;&nbsp;&nbsp; File System<br /><br />&nbsp;&nbsp;&nbsp; ls &mdash; list items in current directory<br /><br />&nbsp;&nbsp;&nbsp; ls -l &mdash; list items in current directory and show in long format to see perimissions, size, an modification date<br /><br />&nbsp;&nbsp;&nbsp; ls -a &mdash; list all items in current directory, including hidden files<br /><br />&nbsp;&nbsp;&nbsp; ls -F &mdash; list all items in current directory and show directories with a slash and executables with a star<br /><br />&nbsp;&nbsp;&nbsp; ls dir &mdash; list all items in directory dir<br /><br />&nbsp;&nbsp;&nbsp; cd dir &mdash; change directory to dir<br /><br />&nbsp;&nbsp;&nbsp; cd .. &mdash; go up one directory<br /><br />&nbsp;&nbsp;&nbsp; cd / &mdash; go to the root directory<br /><br />&nbsp;&nbsp;&nbsp; cd ~ &mdash; go to to your home directory<br /><br />&nbsp;&nbsp;&nbsp; cd - &mdash; go to the last directory you were just in<br /><br />&nbsp;&nbsp;&nbsp; pwd &mdash; show present working directory<br /><br />&nbsp;&nbsp;&nbsp; mkdir dir &mdash; make directory dir<br /><br />&nbsp;&nbsp;&nbsp; rm file &mdash; remove file<br /><br />&nbsp;&nbsp;&nbsp; rm -r dir &mdash; remove directory dir recursively<br /><br />&nbsp;&nbsp;&nbsp; cp file1 file2 &mdash; copy file1 to file2<br /><br />&nbsp;&nbsp;&nbsp; cp -r dir1 dir2 &mdash; copy directory dir1 to dir2 recursively<br /><br />&nbsp;&nbsp;&nbsp; mv file1 file2 &mdash; move (rename) file1 to file2<br /><br />&nbsp;&nbsp;&nbsp; ln -s file link &mdash; create symbolic link to file<br /><br />&nbsp;&nbsp;&nbsp; touch file &mdash; create or update file<br /><br />&nbsp;&nbsp;&nbsp; cat file &mdash; output the contents of file<br /><br />&nbsp;&nbsp;&nbsp; less file &mdash; view file with page navigation<br /><br />&nbsp;&nbsp;&nbsp; head file &mdash; output the first 10 lines of file<br /><br />&nbsp;&nbsp;&nbsp; tail file &mdash; output the last 10 lines of file<br /><br />&nbsp;&nbsp;&nbsp; tail -f file &mdash; output the contents of file as it grows, starting with the last 10 lines<br /><br />&nbsp;&nbsp;&nbsp; vim file &mdash; edit file<br /><br />&nbsp;&nbsp;&nbsp; alias name 'command' &mdash; create an alias for a command<br />&nbsp;&nbsp;&nbsp; System<br /><br />&nbsp;&nbsp;&nbsp; shutdown &mdash; shut down machine<br /><br />&nbsp;&nbsp;&nbsp; reboot &mdash; restart machine<br /><br />&nbsp;&nbsp;&nbsp; date &mdash; show the current date and time<br /><br />&nbsp;&nbsp;&nbsp; whoami &mdash; who you are logged in as<br /><br />&nbsp;&nbsp;&nbsp; finger user &mdash; display information about user<br /><br />&nbsp;&nbsp;&nbsp; man command &mdash; show the manual for command<br /><br />&nbsp;&nbsp;&nbsp; df &mdash; show disk usage<br /><br />&nbsp;&nbsp;&nbsp; du &mdash; show directory space usage<br /><br />&nbsp;&nbsp;&nbsp; free &mdash; show memory and swap usage<br /><br />&nbsp;&nbsp;&nbsp; whereis app &mdash; show possible locations of app<br /><br />&nbsp;&nbsp;&nbsp; which app &mdash; show which app will be run by default<br />&nbsp;&nbsp;&nbsp; Process Management<br /><br />&nbsp;&nbsp;&nbsp; ps &mdash; display your currently active processes<br /><br />&nbsp;&nbsp;&nbsp; top &mdash; display all running processes<br /><br />&nbsp;&nbsp;&nbsp; kill pid &mdash; kill process id pid<br /><br />&nbsp;&nbsp;&nbsp; kill -9 pid &mdash; force kill process id pid<br />&nbsp;&nbsp;&nbsp; Permissions<br /><br />&nbsp;&nbsp;&nbsp; ls -l &mdash; list items in current directory and show permissions<br /><br />&nbsp;&nbsp;&nbsp; chmod ugo file &mdash; change permissions of file to ugo - u is the user's permissions, g is the group's permissions, and o is everyone else's permissions. The values of u, g, and o can be any number between 0 and 7.<br /><br />&nbsp;&nbsp;&nbsp; 7 &mdash; full permissions<br /><br />&nbsp;&nbsp;&nbsp; 6 &mdash; read and write only<br /><br />&nbsp;&nbsp;&nbsp; 5 &mdash; read and execute only<br /><br />&nbsp;&nbsp;&nbsp; 4 &mdash; read only<br /><br />&nbsp;&nbsp;&nbsp; 3 &mdash; write and execute only<br /><br />&nbsp;&nbsp;&nbsp; 2 &mdash; write only<br /><br />&nbsp;&nbsp;&nbsp; 1 &mdash; execute only<br /><br />&nbsp;&nbsp;&nbsp; 0 &mdash; no permissions<br /><br />&nbsp;&nbsp;&nbsp; chmod 600 file &mdash; you can read and write - good for files<br /><br />&nbsp;&nbsp;&nbsp; chmod 700 file &mdash; you can read, write, and execute - good for scripts<br /><br />&nbsp;&nbsp;&nbsp; chmod 644 file &mdash; you can read and write, and everyone else can only read - good for web pages<br /><br />&nbsp;&nbsp;&nbsp; chmod 755 file &mdash; you can read, write, and execute, and everyone else can read and execute - good for programs that you want to share<br />&nbsp;&nbsp;&nbsp; Networking<br /><br />&nbsp;&nbsp;&nbsp; wget file &mdash; download a file<br /><br />&nbsp;&nbsp;&nbsp; curl file &mdash; download a file<br /><br />&nbsp;&nbsp;&nbsp; scp user@host:file dir &mdash; secure copy a file from remote server to the dir directory on your machine<br /><br />&nbsp;&nbsp;&nbsp; scp file user@host:dir &mdash; secure copy a file from your machine to the dir directory on a remote server<br /><br />&nbsp;&nbsp;&nbsp; scp -r user@host:dir dir &mdash; secure copy the directory dir from remote server to the directory dir on your machine<br /><br />&nbsp;&nbsp;&nbsp; ssh user@host &mdash; connect to host as user<br /><br />&nbsp;&nbsp;&nbsp; ssh -p port user@host &mdash; connect to host on port as user<br /><br />&nbsp;&nbsp;&nbsp; ssh-copy-id user@host &mdash; add your key to host for user to enable a keyed or passwordless login<br /><br />&nbsp;&nbsp;&nbsp; ping host &mdash; ping host and output results<br /><br />&nbsp;&nbsp;&nbsp; whois domain &mdash; get information for domain<br /><br />&nbsp;&nbsp;&nbsp; dig domain &mdash; get DNS information for domain<br /><br />&nbsp;&nbsp;&nbsp; dig -x host &mdash; reverse lookup host<br /><br />&nbsp;&nbsp;&nbsp; lsof -i tcp:1337 &mdash; list all processes running on port 1337<br />&nbsp;&nbsp;&nbsp; Searching<br /><br />&nbsp;&nbsp;&nbsp; grep pattern files &mdash; search for pattern in files<br /><br />&nbsp;&nbsp;&nbsp; grep -r pattern dir &mdash; search recursively for pattern in dir<br /><br />&nbsp;&nbsp;&nbsp; grep -rn pattern dir &mdash; search recursively for pattern in dir and show the line number found<br /><br />&nbsp;&nbsp;&nbsp; grep -r pattern dir --include='*.ext &mdash; search recursively for pattern in dir and only search in files with .ext extension<br /><br />&nbsp;&nbsp;&nbsp; command | grep pattern &mdash; search for pattern in the output of command<br /><br />&nbsp;&nbsp;&nbsp; find file &mdash; find all instances of file in real system<br /><br />&nbsp;&nbsp;&nbsp; locate file &mdash; find all instances of file using indexed database built from the updatedb command. Much faster than find<br /><br />&nbsp;&nbsp;&nbsp; sed -i 's/day/night/g' file &mdash; find all occurrences of day in a file and replace them with night - s means substitude and g means global - sed also supports regular expressions<br />&nbsp;&nbsp;&nbsp; Compression<br /><br />&nbsp;&nbsp;&nbsp; tar cf file.tar files &mdash; create a tar named file.tar containing files<br /><br />&nbsp;&nbsp;&nbsp; tar xf file.tar &mdash; extract the files from file.tar<br /><br />&nbsp;&nbsp;&nbsp; tar czf file.tar.gz files &mdash; create a tar with Gzip compression<br /><br />&nbsp;&nbsp;&nbsp; tar xzf file.tar.gz &mdash; extract a tar using Gzip<br /><br />&nbsp;&nbsp;&nbsp; gzip file &mdash; compresses file and renames it to file.gz<br /><br />&nbsp;&nbsp;&nbsp; gzip -d file.gz &mdash; decompresses file.gz back to file<br />&nbsp;&nbsp;&nbsp; Shortcuts<br /><br />&nbsp;&nbsp;&nbsp; ctrl+a &mdash; move cursor to beginning of line<br /><br />&nbsp;&nbsp;&nbsp; ctrl+f &mdash; move cursor to end of line<br /><br />&nbsp;&nbsp;&nbsp; alt+f &mdash; move cursor forward 1 word<br /><br />&nbsp;&nbsp;&nbsp; alt+b &mdash; move cursor backward 1 word</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</guid>
	<pubDate>Mon, 13 Jun 2016 05:47:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</link>
	<title><![CDATA[BBMap/BBTools package: Multipurpose tool designed for converting reads or other nucleotide data between different formats.]]></title>
	<description><![CDATA[<div id="post_message_148585"><a href="https://sourceforge.net/projects/bbmap/" target="_blank">Reformat</a>is a member of the <a href="https://sourceforge.net/projects/bbmap/" target="_blank">BBMap/BBTools package</a>. It is a multipurpose tool designed for converting reads or other nucleotide data between different formats. It supports, and can inter-convert:<br /> <br /> fastq<br /> fasta<br /> fasta+qual<br /> sam<br /> scarf (an old Illumina format)<br /> bam (if samtools is installed)<br /> gzip<br /> zip<br /> ascii-33 (sanger)<br /> ascii-64 (old Illumina)<br /> paired files<br /> interleaved files<br /> <br /> It is multithreaded and can process data at over 500 megabytes per second, and can accept streams from standard in and write to standard out, allowing it to be easily dropped into the middle of a pipeline for format conversion. Reformat autodetects formats based on file extensions and content, making it very easy to use; and the autodetection can be overridden, allowing flexibility for people who don't like to follow naming conventions, or out-of-spec fastq files with qualities values like -17 or 120.<br /> <br /> The program has been gradually expanded, and can now perform various other functions. None of these will break pairing, if the input is paired.<br /> <br /> Quality trimming (either or both ends)<br /> Quality filtering<br /> Fixed-length trimming<br /> Generation of histograms (base composition, quality, etc)<br /> Subsampling (to a fraction of input reads, or an exact number of reads or bases)<br /> Changing fasta line-wrapping length<br /> Reverse-complementing (all reads or only read 2)<br /> Adding /1 and /2 suffix to read names<br /> GC-content filtering<br /> Length-filtering<br /> Testing for corrupted interleaved files<br /> <br /> Reformat is compatible with any platform that supports Java 1.7 or higher. It also has a bash shellscript for simpler invocation. Typical usage examples:<br /> <br /> Reformat fastq into fasta:<br /> <strong>reformat.sh in=x.fq out=y.fa</strong><br /> <br /> Interleave paired reads:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out=y.fq</strong><br /> <br /> Note - you can actually use a shortcut if paired read files have the same name with a 1 and a 2. This is equivalent to the above command:<br /> <strong>reformat.sh in=x#.fq out=y.fq</strong><br /> <br /> De-interleave reads:<br /> <strong>reformat.sh in=x.fq out1=y1.fq out2=y2.fq</strong><br /> <br /> Verify that interleaving appears correct, assuming Illumina namimg conventions:<br /> <strong>reformat.sh in=x.fq vint</strong><br /> <br /> Convert ASCII-33 to ASCII-64:<br /> <strong>reformat.sh in=x.fq out=y.fq qin=33 qout=64</strong><br /> <br /> Quality-trim paired reads to Q10 on the left and right ends and discard reads shorter than 50bp after trimming:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out1=y1.fq out2=y2.fq outsingle=singletons.fq qtrim=rl trimq=10 minlength=50</strong><br /> <br /> Subsample 10% of the first 20000 pairs in an interleaved file:<br /> <strong>reformat.sh in=x.fq out=y.fq reads=20000 samplerate=0.1 int=t</strong><br /> (in this case "int=t" overrides interleaving autodetection, to ensure reads are treated as pairs)<br /> <br /> Pipe in a gzipped sam file and pipe out fasta:<br /> <strong>reformat.sh in=stdin.sam.gz out=stdout.fa</strong><br /> <br /> Reverse-complement reads:<br /> <strong>reformat.sh in=x.fq out=y.fq rcomp</strong><br /> <br /> For reformatting a file with very long sequences, Reformat will need more memory; just add the additional flag "-Xmx2g". For example, to change the line-wrapping length on the human genome (which has individual sequences over 200Mbp long) to 70 characters:<br /> <strong>reformat.sh -Xmx2g in=HG19.fa.gz out=HG19_wrapped.fa.gz fastawrap=70</strong><br /> <br /> For additional functions, please run the shellscript with no arguments, or just read it with a text editor. If you have any questions, please post them in this thread.<br /> <br /> For people using a non-bash terminal, you may need to type "bash reformat.sh" instead of just "reformat.sh".<br /> For users of Windows or other platforms that do not support bash shellscripts, replace "reformat.sh" with "java -ea -Xmx200m /path/to/bbmap/current/ jgi.ReformatReads"<br /> for example,<br /> <strong>java -ea -Xmx200m C:\bbmap\current\ jgi.ReformatReads in=x.fq out=y.fa</strong><br /> <br /> Reformat can be downloaded with BBTools here:<br /> <a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</guid>
	<pubDate>Sat, 21 May 2016 22:32:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</link>
	<title><![CDATA[Tools for Searching Repeats And Palindromic Sequences]]></title>
	<description><![CDATA[<p>What are genomic interspersed repeats?</p><p>In the mid 1960's scientists discovered that many genomes contain stretches of highly repetitive DNA sequences ( see Reassociation Kinetics Experiments, and C-Value Paradox ). These sequences were later characterized and placed into five categories:</p><p><strong>Simple Repeats</strong> - Duplications of simple sets of DNA bases (typically 1-5bp) such as A, CA, CGG etc.<br /><strong>Tandem Repeats</strong> - Typically found at the centromeres and telomeres of chromosomes these are duplications of more complex 100-200 base sequences.<br /><strong>Segmental Duplications</strong> - Large blocks of 10-300 kilobases which are that have been copied to another region of the genome.<br /><strong>Interspersed Repeats</strong><br />Processed Pseudogenes, Retrotranscripts, SINES - Non-functional copies of RNA genes which have been reintegrated into the genome with the assitance of a reverse transcriptase.<br />DNA Transposons<br />Retrovirus Retrotransposons<br />Non-Retrovirus Retrotransposons ( LINES )</p><p>Currently up to 50% of the human genome is repetitive in nature and as improvements are made in detection methods this number is expected to increase.</p><p>On the other hand; In genetics, the term palindrome refers to a sequence of nucleotides along a DNA (deoxyribonucleic acid) or RNA (ribonucleic acid) strand that contains the same series of nitrogenous bases regardless from which direction the strand is analyzed. Akin to a language palindrome&mdash;wherein a word or phrase is spelled the same left-to-right as right-to-left (e.g., the word RADAR or the phrase "able was I ere I saw elba")&mdash;with genetic palindromes it does not matter whether the nucleic acid strand is read starting from the 3' (three prime) end or the 5' (five prime) end of the strand.</p><p>Recent research on palindromes centers on understanding palindrome formation during gene amplification. Other studies have attempted to relate palindrome formation to molecular mechanisms involved in double stranded breaks and in the formation of inverted repeats. Assisted by high speed computers, other groups of scientists link palindrome formation to the conservation of genetic information.</p><p>Related to the direction of transcription by RNA polymerase, DNA strands have upstream and downstream terminus defined by differing chemical groups at each end. The ends of each strand of DNA or RNA are termed the 5' (phosphate bound to the 5' position carbon) and 3' (phosphate bound to the 3' carbon) ends to indicate a polarity within the molecule. Using the letters A, T, C, G, to represent the nitrogenous bases adenine, thymine, cytosine, and guanine found in DNA, and the letters A, U, C, G to represent the nitrogenous bases adenine, uracil, cytosine, guanine found in RNA (Note that uracil in RNA replaces the thymine found in DNA), geneticists usually represent DNA by a series of base codes (e.g., 5' AATCGGATTGCA 3'). The base codes are usually arranged from the 5' end to the 3' end.</p><p>Because of specific base pairing in DNA (i.e., adenine (A) always bonds with (thymine (T) and cytosine (C) always bonds with guanine (G)) the complimentary stand to the sequence 5' AATCGGATTGCA 3' would be 3' TTAGCCTAACGT 5'.</p><p>With palindromes the sequences on the complimentary strands read the same in either direction. For example, a sequence of 5' GAATTC3' on one strand would be complimented by a 3' CTTAAG 5' strand. In either case, when either strand is read from the 5' prime end the sequence is GAATTC. Another example of a palindrome would be the sequence 5' CGAAGC 3' that, when reversed, still reads CGAAGC.</p><p>Palindromes are important sequences within nucleic acids. Often they are the site of binding for specific enzymes (e.g., restriction endobucleases) designed to cut the DNA strands at specific locations (i.e., at palindromes).</p><p>Palindromes may arise from brakeage and chromosomal inversions that form inverted repeats that compliment each other. When a palindrome results from an inversion, it is often referred to as an inverted repeat. For example, the sequence 5' CGAAGC 3', if inverted (reversed 180&deg;), still reads CGAAGC.</p><p>The <a href="http://emboss.open-bio.org/">European Molecular Biology Open Software Suite (EMBOSS)</a> includes some basic tools for finding tandem repeats and inverted repeats (see <a href="http://emboss.open-bio.org/html/use/apbs06.html#GroupsAppsTableNucleicrepeatsR6">B.6.22. Applications in group Nucleic:repeats</a>). There are many on-line services providing the EMBOSS tools, for example:</p><ul>
<li>Wageningen Bioinformatics Webportal <a href="http://emboss.bioinformatics.nl/">EMBOSS explorer</a></li>
<li><a href="http://mobyle.pasteur.fr/">Mobyle@Pasteur</a></li>
<li><a href="http://wsembnet.vital-it.ch/">Soaplab2 Web Services at Vital-IT</a></li>
</ul><p>For more sophisticated repeat finding you will want to look at tools using <a href="http://www.girinst.org/repbase/">Repbase</a> for example:</p><ul>
<li>CENSOR
<ul>
<li><a href="http://www.girinst.org/censor/">CENSOR@GIRI</a></li>
<li><a href="http://www.ebi.ac.uk/Tools/so/censor/">CENSOR@EMBL-EBI</a></li>
</ul>
</li>
<li><a href="http://www.repeatmasker.org/">RepeatMasker</a></li>
<li><a href="http://mummer.sourceforge.net/">MUMmer</a>&nbsp;(scan_for_match)</li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">Emboss Palindrome</a></li>
</ul><p>Other nucleotide repeat finding methods found by a couple of web searches:</p><ul>
<li><a href="http://tandem.bu.edu/trf/trf.html">Tandem Repeats Finder</a></li>
<li><a href="http://selab.janelia.org/recon.html">RECON</a></li>
<li><a href="http://www.yandell-lab.org/software/repeatrunner.html">RepeatRunner</a></li>
<li><a href="http://bibiserv.techfak.uni-bielefeld.de/reputer/">REPuter</a></li>
<li><a href="http://210.212.215.200/IMEX/index.html">Imperfect Microsatellite Extractor (IMEx)</a></li>
<li><a href="http://www.imtech.res.in/raghava/srf/">Spectral Repeat Finder (SRF)</a></li>
<li><a href="http://zlab.bu.edu/repfind/form.html">REPFIND</a></li>
<li><a href="http://crispr.u-psud.fr/Server/CRISPRfinder.php">CRISPRfinder</a></li>
<li><a href="http://grail.lsd.ornl.gov/grailexp/">GrailEXP</a></li>
<li><a href="http://alggen.lsi.upc.edu/recerca/search/frame-search.html">CONREPP</a></li>
<li><a href="http://www.biophp.org/minitools/find_palindromes/demo.php%20"><span>find_palindromes</span></a></li>
<li><a href="http://insilico.ehu.eus/palindromes/"><span>Palindrome</span></a></li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">EMBOSS Palindrome</a></li>
<li><a href="http://bioinfo.cs.technion.ac.il/projects/Engel-Freund/new.html">Palindrome Search</a></li>
</ul>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

</channel>
</rss>