<?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: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/27080?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/27080?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</guid>
	<pubDate>Wed, 14 Dec 2016 09:59:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</link>
	<title><![CDATA[Cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite&nbsp;<a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a>&nbsp;.</p>
<p>More at&nbsp;https://github.com/marcelm/cutadapt</p><p>Address of the bookmark: <a href="http://cutadapt.readthedocs.io/en/stable/guide.html" rel="nofollow">http://cutadapt.readthedocs.io/en/stable/guide.html</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30102/prism</guid>
	<pubDate>Sat, 10 Dec 2016 15:19:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30102/prism</link>
	<title><![CDATA[PRISM]]></title>
	<description><![CDATA[<p><span>PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.&nbsp;</span><br><br><span>PRISM and PRISM_CTX were originally designed and written by&nbsp;</span><a href="http://www.cs.toronto.edu/~brudno">Michael Brudno</a><span>&nbsp;and Yue Jiang, The original PRISM publication can be found&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2012/07/31/bioinformatics.bts484.abstract">here</a><span>.&nbsp;</span><br><br><span>The authors may be contacted via e-mail at:&nbsp;</span><em>prism at cs.toronto.edu</em><span>.&nbsp;</span><br><br><span>Additional information is available in the&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_README">PRISM README</a><span>&nbsp;file and&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_CTX_README">PRISM_CTX README</a><span>&nbsp;file.&nbsp;</span></p>
<p>http://compbio.cs.toronto.edu/prism/</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/prism/" rel="nofollow">http://compbio.cs.toronto.edu/prism/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</guid>
	<pubDate>Tue, 13 Dec 2016 10:23:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</link>
	<title><![CDATA[ScaffMatch]]></title>
	<description><![CDATA[<p>caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one needs to first map reads to contigs (instead of providing .sam files).</p>
<p>The arguments accepted by ScaffMatch are:</p>
<p>&nbsp; -w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;</p>
<p>&nbsp; -c) Contig fasta file;</p>
<p>&nbsp; -m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;</p>
<p>&nbsp; -1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;</p>
<p>&nbsp; -2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;</p>
<p>&nbsp; -i) (Comma separated list of) insert size(s) of the library(-ies);</p>
<p>&nbsp; -s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);</p>
<p>&nbsp; -t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;</p>
<p>&nbsp; -g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;</p>
<p>&nbsp; -l) Log file - where to store the logs. Optional argument. By default, stdout is used.</p><p>Address of the bookmark: <a href="http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch" rel="nofollow">http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29992/spines</guid>
	<pubDate>Mon, 28 Nov 2016 05:33:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29992/spines</link>
	<title><![CDATA[Spines]]></title>
	<description><![CDATA[<p><a href="https://www.broadinstitute.org/ftp/distribution/software/spines/"><em>Spines</em></a>&nbsp;is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation etc.), as well as specialized tool sets for various analyses. It also features three sequence alignment packages:&nbsp;<em>Satsuma,</em>&nbsp;a highly parallelized program for high-sensitivity, genome-wide synteny;&nbsp;<em>Papaya,</em>&nbsp;an all-purpose alignment tool for less diverged sequences; and&nbsp;<em>SLAP,</em>&nbsp;a context-sensitive local aligner for diverged sequences with large gaps.</p>
<p>Access&nbsp;<em>Spines</em>&nbsp;<a href="https://www.broadinstitute.org/ftp/distribution/software/spines/">here</a>.</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/genome-sequencing-and-analysis/spines" rel="nofollow">https://www.broadinstitute.org/genome-sequencing-and-analysis/spines</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30701/harvest</guid>
	<pubDate>Tue, 31 Jan 2017 10:57:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30701/harvest</link>
	<title><![CDATA[Harvest]]></title>
	<description><![CDATA[<p>Harvest is a suite of core-genome alignment and visualization tools for quickly analyzing thousands of intraspecific microbial genomes, including variant calls, recombination detection, and phylogenetic trees.</p>
<p><a href="http://harvest.readthedocs.io/en/latest/_images/screen.png"><img src="http://harvest.readthedocs.io/en/latest/_images/screen.png" alt="_images/screen.png" style="border: 0px;"></a><span></span></p>
<p><strong>Tools</strong></p>
<ul>
<li><a href="http://harvest.readthedocs.io/en/latest/content/parsnp.html">Parsnp</a>&nbsp;- Core-genome alignment and analysis</li>
<li><a href="http://harvest.readthedocs.io/en/latest/content/gingr.html">Gingr</a>&nbsp;- Interactive visualization of alignments, trees and variants</li>
<li><a href="http://harvest.readthedocs.io/en/latest/content/harvest-tools.html">HarvestTools</a>&nbsp;- Archiving and postprocessing</li>
</ul>
<p><strong>Citation</strong></p>
<blockquote>
<div>Treangen TJ, Ondov BD, Koren S, Phillippy AM. The Harvest suite for rapid core-genome alignment and visualization of thousands of intraspecific microbial genomes. Genome Biology, 15 (11), 1-15 [<a href="http://www.biomedcentral.com/content/pdf/s13059-014-0524-x.pdf">PDF</a>]</div>
</blockquote><p>Address of the bookmark: <a href="http://harvest.readthedocs.io/en/latest/index.html" rel="nofollow">http://harvest.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32376/diamond</guid>
	<pubDate>Thu, 27 Apr 2017 04:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32376/diamond</link>
	<title><![CDATA[DIAMOND]]></title>
	<description><![CDATA[<p><span>DIAMOND is a sequence aligner for protein and translated DNA searches and functions as a drop-in replacement for the NCBI BLAST software tools. It is suitable for protein-protein search as well as DNA-protein search on short reads and longer sequences including contigs and assemblies, providing a speedup of BLAST ranging up to x20,000.</span></p>
<p><span>More at&nbsp;file:///home/urbe/Downloads/diamond_manual.pdf</span></p>
<p><span>http://www.nature.com/nmeth/journal/v12/n1/full/nmeth.3176.html</span></p><p>Address of the bookmark: <a href="https://github.com/bbuchfink/diamond" rel="nofollow">https://github.com/bbuchfink/diamond</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31209/dial</guid>
	<pubDate>Wed, 01 Mar 2017 08:42:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31209/dial</link>
	<title><![CDATA[DIAL]]></title>
	<description><![CDATA[<p>A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to determine small insertions/deletions. Our main motivation is to use this tool to survey the genetic diversity of endangered species as the identified sequence differences can be used to design genotyping arrays to assist in the species' management.</p>
<p>http://www.bx.psu.edu/~ratan/</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/" rel="nofollow">http://www.bx.psu.edu/miller_lab/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</guid>
	<pubDate>Tue, 28 Feb 2017 09:01:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</link>
	<title><![CDATA[splitbam: splits a BAM by chromosomes]]></title>
	<description><![CDATA[<p><strong>splitbam</strong>&nbsp;splits a BAM by chromosomes.</p>
<p>Using the reference sequence dictionary (<code>*.dict</code>), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to avoid some tools (like samtools) to crash.</p>
<h1>Usage</h1>
<p><code>java -jar splitbam.jar -p OUT/__CHROM__/__CHROM__.bam -R ref.fasta (bam|sam|stdin)</code></p>
<h1>Options</h1>
<ul>
<li>-h help; This screen.</li>
<li>-R (indexed reference file) REQUIRED.</li>
<li>-u (unmapped chromosome name): default:Unmapped</li>
<li>-e | --empty : generate EMPTY bams for chromosome having no read mapped</li>
<li>-m | --mock : if option '-e', add a mock pair of sam records to the empty bam</li>
<li>-p (output file/bam pattern) REQUIRED. MUST contain&nbsp;<strong><code>__CHROM__</code></strong>&nbsp;and end with .bam</li>
<li>-s assume input is sorted.</li>
<li>-x | --index create index.</li>
<li>-t | --tmp (dir) tmp file directory</li>
<li>-G (file) chrom-group file (see below)</li>
</ul><p>Address of the bookmark: <a href="https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki" rel="nofollow">https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</guid>
	<pubDate>Sun, 02 Apr 2017 15:53:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</link>
	<title><![CDATA[TMAP - torrent mapping alignment program General Notes]]></title>
	<description><![CDATA[<p>TMAP - torrent mapping alignment program <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP#general-notes"></a>General Notes</p>
<p>TMAP is a fast and accurate alignment software for short and long nucleotide sequences produced by next-generation sequencing technologies.</p>
<ul>
<li>
<p>The latest TMAP is unsupported. To use a supported version, please see the TMAP version associated with a Torrent Suite release below.</p>
</li>
<li>
<p>Get the latest source code:</p>
<div>
<pre>git clone git://github.com/iontorrent/TMAP.git
 <span>cd</span> TMAP
 git submodule init
 git submodule update</pre>
</div>
</li>
</ul>
<p>https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</p><p>Address of the bookmark: <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP" rel="nofollow">https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32131/wgs-celera-assembler-version-83rc2</guid>
	<pubDate>Mon, 10 Apr 2017 04:45:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32131/wgs-celera-assembler-version-83rc2</link>
	<title><![CDATA[WGS Celera Assembler version 8.3rc2]]></title>
	<description><![CDATA[<p>These are release notes for Celera Assembler version 8.3rc2, which was released on May 24, 2015.<br><br>This distribution package provides a stable, tested, documented version of the software.&nbsp; The distribution is usable on most Unix-like platforms, and some platforms have pre-compiled binary distributions ready for installation.<br><br>The source code package includes full source code (revision 4627), Makefiles, and scripts.&nbsp; A subset of the kmer package (http://kmer.sourceforge.net/, version r1994), used by some modules of Celera Assembler, is included.&nbsp; This distribution includes [http://samtools.sourceforge.net/ SAMtools], [http://www.cbcb.umd.edu/software/jellyfish/ Jellyfish 2.0], [https://github.com/pbjd/pbutgcns PBUTGCNS], [https://github.com/PacificBiosciences/pbdagcon PBDAGCON], [https://github.com/PacificBiosciences/BLASR BLASR], and parts of the [https://github.com/PacificBiosciences/FALCON/tree/v0.1.3 Falcon assembler].<br><br>Full documentation can be found online at http://wgs-assembler.sourceforge.net/.</p>
<p>Interesting scripts within it</p>
<p>urbe@urbo214b[bin] ls&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; []<br>-rwxrwxr-x 1 urbe urbe&nbsp; 11K Apr 10 11:41 addCNSToStore<br>-rwxrwxr-x 1 urbe urbe 575K Apr 10 11:41 addReadsToUnitigs<br>-rwxrwxr-x 1 urbe urbe 128K Apr 10 11:41 analyzeBest<br>-rwxrwxr-x 1 urbe urbe 257K Apr 10 11:41 analyzePosMap<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 analyzeScaffolds<br>-rwxrwxr-x 1 urbe urbe 224K Apr 10 11:41 asmOutputFasta<br>-rwxrwxr-x 1 urbe urbe 448K Apr 10 11:41 asmOutputStatistics<br>-rwxrwxr-x 1 urbe urbe 2,4K Apr 10 11:41 asmToAGP.pl<br>-rwxrwxr-x 1 urbe urbe 7,6M Apr 10 11:41 blasr<br>-rwxrwxr-x 1 urbe urbe 1,6M Apr 10 11:41 bogart<br>-rwxrwxr-x 1 urbe urbe 183K Apr 10 11:41 bogus<br>-rwxrwxr-x 1 urbe urbe 272K Apr 10 11:41 bogusness<br>-rwxrwxr-x 1 urbe urbe 247K Apr 10 11:41 buildPosMap<br>-rwxrwxr-x 1 urbe urbe 213K Apr 10 11:41 buildRefContigs<br>-rwxrwxr-x 1 urbe urbe 990K Apr 10 11:41 buildUnitigs<br>-rwxrwxr-x 1 urbe urbe&nbsp; 18K Apr 10 11:41 ca2ace.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 12K Apr 10 11:41 caqc_help.ini<br>-rwxrwxr-x 1 urbe urbe&nbsp; 61K Apr 10 11:41 caqc.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 23K Apr 10 11:41 cat-corrects<br>-rwxrwxr-x 1 urbe urbe&nbsp; 24K Apr 10 11:41 cat-erates<br>-rwxrwxr-x 1 urbe urbe 1,9M Apr 10 11:41 cgw<br>-rwxrwxr-x 1 urbe urbe 1,4M Apr 10 11:41 cgwDump<br>-rwxrwxr-x 1 urbe urbe 204K Apr 10 11:41 chimChe<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:40 chimera<br>-rwxrwxr-x 1 urbe urbe 220K Apr 10 11:41 classifyMates<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:41 classifyMatesApply<br>-rwxrwxr-x 1 urbe urbe 215K Apr 10 11:41 classifyMatesPairwise<br>-rwxrwxr-x 1 urbe urbe 366K Apr 10 11:41 computeCoverageStat<br>-rwxrwxr-x 1 urbe urbe 9,8K Apr 10 11:41 convert-fasta-to-v2.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 48K Apr 10 11:41 convertOverlap<br>-rwxrwxr-x 1 urbe urbe 119K Apr 10 11:41 convertSamToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 20K Apr 10 11:41 convertToPBCNS<br>-rwxrwxr-x 1 urbe urbe 197K Apr 10 11:41 correct-frags<br>-rwxrwxr-x 1 urbe urbe 259K Apr 10 11:41 correct-olaps<br>-rwxrwxr-x 1 urbe urbe 520K Apr 10 11:41 correctPacBio<br>-rwxrwxr-x 1 urbe urbe 540K Apr 10 11:41 ctgcns<br>-rwxrwxr-x 1 urbe urbe 162K Apr 10 11:40 deduplicate<br>-rwxrwxr-x 1 urbe urbe&nbsp; 37K Apr 10 11:41 demotePosMap<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 dumpCloneMiddles<br>-rwxrwxr-x 1 urbe urbe 124K Apr 10 11:41 dumpPBRLayoutStore<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 dumpSingletons<br>-rwxrwxr-x 1 urbe urbe 171K Apr 10 11:41 erate-estimate<br>-rwxrwxr-x 1 urbe urbe 221K Apr 10 11:40 estimate-mer-threshold<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 extendClearRanges<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 extendClearRangesPartition<br>-rwxrwxr-x 1 urbe urbe 205K Apr 10 11:40 extractmessages<br>-rwxrwxr-x 1 urbe urbe 7,2M Apr 10 11:41 falcon_sense<br>-rwxrwxr-x 1 urbe urbe 9,8K Apr 10 11:41 fastaToCA<br>-rwxrwxr-x 1 urbe urbe 124K Apr 10 11:40 fastqAnalyze<br>-rwxrwxr-x 1 urbe urbe 137K Apr 10 11:40 fastqSample<br>-rwxrwxr-x 1 urbe urbe&nbsp; 62K Apr 10 11:40 fastqSimulate<br>-rwxrwxr-x 1 urbe urbe 121K Apr 10 11:40 fastqSimulate-sort<br>-rwxrwxr-x 1 urbe urbe 246K Apr 10 11:40 fastqToCA<br>-rwxrwxr-x 1 urbe urbe 140K Apr 10 11:41 filterOverlap<br>-rwxrwxr-x 1 urbe urbe 341K Apr 10 11:40 finalTrim<br>-rwxrwxr-x 1 urbe urbe 228K Apr 10 11:41 fixUnitigs<br>-rwxrwxr-x 1 urbe urbe 147K Apr 10 11:40 fragmentDepth<br>-rwxrwxr-x 1 urbe urbe&nbsp; 29K Apr 10 11:41 fragsInVars<br>-rwxrwxr-x 1 urbe urbe 545K Apr 10 11:41 frgs2clones<br>-rwxrwxr-x 1 urbe urbe 398K Apr 10 11:40 gatekeeper<br>-rwxrwxr-x 1 urbe urbe 139K Apr 10 11:40 gatekeeperbench<br>-rwxrwxr-x 1 urbe urbe 167K Apr 10 11:40 gkpStoreCreate<br>-rwxrwxr-x 1 urbe urbe 147K Apr 10 11:40 gkpStoreDumpFASTQ<br>-rwxrwxr-x 1 urbe urbe 184K Apr 10 11:41 greedyFragmentTiling<br>-rwxrwxr-x 1 urbe urbe 1,6K Apr 10 11:41 greedy_layout_to_IUM<br>-rwxrwxr-x 1 urbe urbe 142K Apr 10 11:40 initialTrim<br>-rwxrwxr-x 1 urbe urbe 967K Apr 10 11:41 jellyfish<br>-rwxrwxr-x 1 urbe urbe 219K Apr 10 11:41 markRepeatUnique<br>-rwxrwxr-x 1 urbe urbe 273K Apr 10 11:40 markUniqueUnique<br>-rwxrwxr-x 1 urbe urbe 114K Apr 10 11:40 mercy<br>-rwxrwxr-x 1 urbe urbe 3,8K Apr 10 11:41 mergeqc.pl<br>-rwxrwxr-x 1 urbe urbe 422K Apr 10 11:40 merTrim<br>-rwxrwxr-x 1 urbe urbe 125K Apr 10 11:40 merTrimApply<br>-rwxrwxr-x 1 urbe urbe 376K Apr 10 11:40 meryl<br>-rwxrwxr-x 1 urbe urbe 176K Apr 10 11:41 metagenomics_ovl_analyses<br>-rwxrwxr-x 1 urbe urbe 297K Apr 10 11:41 olap-from-seeds<br>-rwxrwxr-x 1 urbe urbe 275K Apr 10 11:41 outputLayout<br>-rwxrwxr-x 1 urbe urbe 229K Apr 10 11:41 overlapInCore<br>-rwxrwxr-x 1 urbe urbe 144K Apr 10 11:40 overlap_partition<br>-rwxrwxr-x 1 urbe urbe 179K Apr 10 11:41 overlapStats<br>-rwxrwxr-x 1 urbe urbe 179K Apr 10 11:41 overlapStore<br>-rwxrwxr-x 1 urbe urbe 153K Apr 10 11:41 overlapStoreBucketizer<br>-rwxrwxr-x 1 urbe urbe 175K Apr 10 11:41 overlapStoreBuild<br>-rwxrwxr-x 1 urbe urbe&nbsp; 33K Apr 10 11:41 overlapStoreIndexer<br>-rwxrwxr-x 1 urbe urbe&nbsp; 48K Apr 10 11:41 overlapStoreSorter<br>-rwxrwxr-x 1 urbe urbe 604K Apr 10 11:40 overmerry<br>lrwxrwxrwx 1 urbe urbe&nbsp;&nbsp;&nbsp; 4 Apr 10 11:41 pacBioToCA -&gt; PBcR<br>-rwxrwxr-x 1 urbe urbe 131K Apr 10 11:41 PBcR<br>-rwxrwxr-x 1 urbe urbe 2,9M Apr 10 11:41 pbdagcon<br>-rwxrwxr-x 1 urbe urbe 1,9M Apr 10 11:41 pbutgcns<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:40 remove_fragment<br>-rwxrwxr-x 1 urbe urbe 153K Apr 10 11:40 removeMateOverlap<br>-rwxrwxr-x 1 urbe urbe 2,5K Apr 10 11:41 replaceUIDwithName-fastq<br>-rwxrwxr-x 1 urbe urbe 1,2K Apr 10 11:41 replaceUIDwithName-posmap<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 resolveSurrogates<br>-rwxrwxr-x 1 urbe urbe 139K Apr 10 11:41 rewriteCache<br>-rwxrwxr-x 1 urbe urbe 232K Apr 10 11:41 runCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 88K Apr 10 11:41 runCA-dedupe<br>-rwxrwxr-x 1 urbe urbe&nbsp; 14K Apr 10 11:41 runCA-overlapStoreBuild<br>-rwxrwxr-x 1 urbe urbe 3,6K Apr 10 11:41 run_greedy.csh<br>-rwxrwxr-x 1 urbe urbe 297K Apr 10 11:40 sffToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 13K Apr 10 11:40 show-corrects<br>-rwxrwxr-x 1 urbe urbe 557K Apr 10 11:41 splitUnitigs<br>-rwxrwxr-x 1 urbe urbe 1,4M Apr 10 11:41 terminator<br>drwxrwxr-x 2 urbe urbe 4,0K Apr 10 11:41 TIGR<br>-rwxrwxr-x 1 urbe urbe 526K Apr 10 11:41 tigStore<br>-rwxrwxr-x 1 urbe urbe&nbsp; 35K Apr 10 11:41 tracearchiveToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 35K Apr 10 11:41 tracedb-to-frg.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 44K Apr 10 11:41 trimFastqByQVWindow<br>-rwxrwxr-x 1 urbe urbe&nbsp; 18K Apr 10 11:40 uidclient<br>-rwxrwxr-x 1 urbe urbe 589K Apr 10 11:41 unitigger<br>-rwxrwxr-x 1 urbe urbe&nbsp; 42K Apr 10 11:40 upgrade-v8-to-v9<br>-rwxrwxr-x 1 urbe urbe&nbsp; 42K Apr 10 11:40 upgrade-v9-to-v10<br>-rwxrwxr-x 1 urbe urbe&nbsp; 854 Apr 10 11:41 utg2fasta<br>-rwxrwxr-x 1 urbe urbe 731K Apr 10 11:41 utgcns<br>-rwxrwxr-x 1 urbe urbe 561K Apr 10 11:41 utgcnsfix<br><br><br></p><p>Address of the bookmark: <a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Main_Page" rel="nofollow">http://wgs-assembler.sourceforge.net/wiki/index.php/Main_Page</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>