<?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/36533?offset=350</link>
	<atom:link href="https://bioinformaticsonline.com/related/36533?offset=350" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/42275/frequent-parameters-for-bioinformatics-tools</guid>
	<pubDate>Tue, 27 Oct 2020 19:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/42275/frequent-parameters-for-bioinformatics-tools</link>
	<title><![CDATA[Frequent parameters for bioinformatics tools !]]></title>
	<description><![CDATA[<div><div>Third party executable parameters and options.</div><div>&nbsp;</div><div>Trimmomatic</div><div>&nbsp;</div><div>&ldquo;ILLUMINACLIP:...:2:30:10&rdquo;</div><div>&ldquo;LEADING:15&rdquo;</div><div>&ldquo;TRAILING:15&rdquo;</div><div>&ldquo;SLIDINGWINDOW:4:20&rdquo;</div><div>&ldquo;MINLEN:20&rdquo;</div><div>&ldquo;TOPHRED33&rdquo;</div><div>&nbsp;</div><div>Filtlong</div><div>--min_length 500</div><div>--min_mean_q 85</div><div>--min_window_q 65</div><div>&nbsp;</div><div>FastQ Screen</div><div>--aligner bowtie2' (bwa for PacBio)</div><div>--subset 1000 (for PacBio)</div><div>&nbsp;</div><div>SPAdes</div><div>--careful</div><div>--disable-gzip-output</div><div>--cov-cutoff auto</div><div>--phred-offset 33</div><div>&nbsp;</div><div>HGAP</div><div>Pbalign.task_options.min_accuracy: 70</div><div>Pbalign.task_options.no_split_subreads: false</div><div>Genomic_consensus.task_options.min_confidence: 40</div><div>falcon_ns.task_options.HGAP_GenomeLength_str:</div><div>6000000</div><div>Pbcoretools.task_options.read_length: 0</div><div>Genomic_consensus.task_options.use_score: 0</div><div>Pbalign.task_options.min_length: 50</div><div>Pbalign.task_options.algorithm_options: --minMatch 12</div><div>--bestn 10 --minPctSimilarity 70.0</div><div>Pbalign.task_options.hit_policy: randombest</div><div>Pbcoretools.task_options.other_filters: rq &gt;= 0.7</div><div>Pbalign.task_options.concordant: false</div><div>Genomic_consensus.task_options.min_coverage: 5</div><div>falcon_ns.task_options.HGAP_SeedCoverage_str: 30</div><div>falcon_ns.task_options.HGAP_AggressiveAsm_bool: false</div><div>Genomic_consensus.task_options.algorithm: best</div><div>falcon_ns.task_options.HGAP_SeedLengthCutoff_str: -1</div><div>Genomic_consensus.task_options.diploid: false</div><div>&nbsp;</div><div>MeDuSa</div><div>-random 100</div><div>&nbsp;</div><div>Prokka</div><div>--usegenus</div><div>--force</div><div>--addgenes</div><div>--rfam</div><div>--rawproduct</div><div>&nbsp;</div><div>cmsearch (taxonomy, 16S)</div><div>--rfam</div><div>--noali</div><div>&nbsp;</div><div>blastn (taxonomy, 16S)</div><div>-evalue 1E-10</div><div>&nbsp;</div><div>blastn (MLST)</div><div>-ungapped</div></div><div><div>-dust no</div><div>-evalue 1E-20</div><div>-word_size 32</div><div>-culling_limit 2</div><div>-perc_identity 95</div><div>&nbsp;</div><div>blastp (VF)</div><div>-culling_limit 2</div><div>&nbsp;</div><div>RGI (ABR)</div><div>--input_type contig</div><div>&nbsp;</div><div>bowtie2 (mapping)</div><div>--sensitive</div><div>&nbsp;</div><div>minimap2 (mapping)</div><div>-a</div><div>-x map-ont</div><div>&nbsp;</div><div>samtools mpileup (SNP&nbsp;detection)</div><div>-uRI</div><div>&nbsp;</div><div>bcftools call (SNP detection)</div><div>--variants-only</div><div>--skip-variants indels</div><div>--output-type v</div><div>--ploidy 1</div><div>-c</div><div>&nbsp;</div><div>SNPsift filter (SNP detection)</div><div>"( QUAL &gt;= 30 ) &amp; (( na FILTER ) | (FILTER = 'PASS')) &amp;</div><div>( DP &gt;= 20 ) &amp; ( MQ &gt;= 20 )"</div><div>&nbsp;</div><div>SNPeff ann (SNP detection)</div><div>-nodownload</div><div>-no-intron</div><div>-no-downstream</div><div>-no SPLICE_SITE_REGION</div><div>-upDownStreamLen 250</div><div>&nbsp;</div><div>bcftools consensus</div><div>(phylogenetic tree)</div><div>--haplotype 1</div><div>&nbsp;</div><div>fasttreemp</div><div>-nt</div><div>-boot 100</div><div>&nbsp;</div><div>roary</div><div>-e</div><div>-n</div><div>-cd 100</div><div>-g 100000</div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44288/upset-plots</guid>
	<pubDate>Fri, 24 Mar 2023 22:30:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44288/upset-plots</link>
	<title><![CDATA[Upset plots !]]></title>
	<description><![CDATA[<p>Upset plots are a type of visualization used to analyze the intersection of sets or categories. They are particularly useful for displaying data with multiple categories and analyzing their overlaps.</p>
<p>In an upset plot, each row represents a category or set, and each column represents a data point. The length of the bar for each category indicates the number of data points that belong to that category. The plot also shows the intersections between categories, represented by overlapping bars.</p>
<p>Upset plots are useful for visualizing complex data with multiple categories and intersections, and can help identify patterns and relationships between categories. They are often used in fields such as bioinformatics, where they can be used to analyze gene expression data or to compare the results of different experimental conditions.</p>
<p>https://jokergoo.github.io/ComplexHeatmap-reference/book/upset-plot.html#example-with-the-genomic-regions</p><p>Address of the bookmark: <a href="https://jokergoo.github.io/ComplexHeatmap-reference/book/upset-plot.html#example-with-the-genomic-regions" rel="nofollow">https://jokergoo.github.io/ComplexHeatmap-reference/book/upset-plot.html#example-with-the-genomic-regions</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</guid>
	<pubDate>Tue, 09 Jun 2020 05:21:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</link>
	<title><![CDATA[StringTie Transcript assembly and quantification for RNA-Seq]]></title>
	<description><![CDATA[<p><strong>StringTie</strong><span>&nbsp;is a fast and highly efficient assembler of RNA-Seq alignments into potential transcripts. It uses a novel network flow algorithm as well as an optional&nbsp;</span><em>de novo</em><span>&nbsp;assembly step to assemble and quantitate full-length transcripts representing multiple splice variants for each gene locus. Its input can include not only alignments of short reads that can also be used by other transcript assemblers, but also alignments of longer sequences that have been assembled from those reads. In order to identify differentially expressed genes between experiments, StringTie's output can be processed by specialized software like&nbsp;</span><a href="https://github.com/alyssafrazee/ballgown">Ballgown</a><span>,&nbsp;</span><a href="http://cole-trapnell-lab.github.io/cufflinks/cuffdiff/index.html">Cuffdiff</a><span>&nbsp;or other programs (DESeq2, edgeR, etc.).</span></p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/" rel="nofollow">https://ccb.jhu.edu/software/stringtie/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43926/aun-a-new-metric-to-measure-assembly-contiguity</guid>
	<pubDate>Tue, 02 Aug 2022 01:18:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43926/aun-a-new-metric-to-measure-assembly-contiguity</link>
	<title><![CDATA[auN: a new metric to measure assembly contiguity]]></title>
	<description><![CDATA[<p><span>Given a de novo assembly, we often measure the &ldquo;average&rdquo; contig length by N50.&nbsp;</span><a href="https://en.wikipedia.org/wiki/N50,_L50,_and_related_statistics">N50</a><span>&nbsp;is neither the real average nor median. It is the length of the contig such that this and longer contigs cover at least 50% of the assembly. A longer N50 indicates better contiguity. We can similarly define N</span><em>x</em><span>&nbsp;such that contigs no shorter than N</span><em>x</em><span>&nbsp;covers&nbsp;</span><em>x</em><span>% of the assembly. The N</span><em>x</em><span>&nbsp;curve plots N</span><em>x</em><span>&nbsp;as a function of&nbsp;</span><em>x</em><span>, where&nbsp;</span><em>x</em><span>&nbsp;is ranged from 0 to 100.</span></p>
<p><span><img src="http://lh3.github.io/images/NGx_plot.png" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://lh3.github.io/2020/04/08/a-new-metric-on-assembly-contiguity" rel="nofollow">https://lh3.github.io/2020/04/08/a-new-metric-on-assembly-contiguity</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27113/picard</guid>
	<pubDate>Fri, 29 Apr 2016 08:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27113/picard</link>
	<title><![CDATA[Picard]]></title>
	<description><![CDATA[<p>Picard is a set of command line tools for manipulating high-throughput sequencing (HTS) data and formats such as SAM/BAM/CRAM and VCF. These file formats are defined in the <a href="http://samtools.github.io/hts-specs/">Hts-specs</a> repository. See especially the <a href="http://samtools.github.io/hts-specs/SAMv1.pdf">SAM specification</a> and the <a href="http://samtools.github.io/hts-specs/VCFv4.3.pdf">VCF specification</a>.</p>
<p>Note that the information on this page is targeted at end-users. For developers, the source code, building instructions and implementation/development resources are available on <a href="https://github.com/broadinstitute/picard">GitHub</a>.</p>
<p>The Picard toolkit is open-source under the <a href="https://tldrlegal.com/license/mit-license">MIT license</a> and free for all uses.</p>
<p>Enjoy!</p><p>Address of the bookmark: <a href="http://broadinstitute.github.io/picard/" rel="nofollow">http://broadinstitute.github.io/picard/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26909/sequence-assembly-with-mira-4</guid>
	<pubDate>Wed, 06 Apr 2016 08:21:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26909/sequence-assembly-with-mira-4</link>
	<title><![CDATA[Sequence assembly with MIRA 4]]></title>
	<description><![CDATA[<p>MIRA is a multi-pass DNA sequence data assembler/mapper for whole genome and EST/RNASeq projects. MIRA assembles/maps reads gained by</p>
<div>
<ul>
<li>
<p>electrophoresis sequencing (aka Sanger sequencing)</p>
</li>
<li>
<p>454 pyro-sequencing (GS20, FLX or Titanium)</p>
</li>
<li>
<p>Ion Torrent</p>
</li>
<li>
<p>Solexa (Illumina) sequencing</p>
</li>
<li>
<p>(in development) Pacific Biosciences sequencing</p>
</li>
</ul>
</div>
<p>into contiguous sequences (called <span><em>contigs</em></span>). One can use the sequences of different sequencing technologies either in a single assembly run (a <span><em>true hybrid assembly</em></span>) or by mapping one type of data to an assembly of other sequencing type (a <span><em>semi-hybrid assembly (or mapping)</em></span>) or by mapping a data against consensus sequences of other assemblies (a <span><em>simple mapping</em></span>).</p>
<p>The MIRA acronym stands for <span><strong>M</strong></span>imicking <span><strong>I</strong></span>ntelligent <span><strong>R</strong></span>ead <span><strong>A</strong></span>ssembly and the program pretty well does what its acronym says (well, most of the time anyway). It is the Swiss army knife of sequence assembly that I've used and developed during the past 14 years to get assembly jobs I work on done efficiently - and especially accurately. That is, without me actually putting too much manual work into it.</p>
<p>More at http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html</p><p>Address of the bookmark: <a href="http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html" rel="nofollow">http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html</a></p>]]></description>
	<dc:creator>Priya Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26972/understanding-fastqc-output</guid>
	<pubDate>Fri, 15 Apr 2016 05:47:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26972/understanding-fastqc-output</link>
	<title><![CDATA[Understanding Fastqc Output]]></title>
	<description><![CDATA[<p>Understanding Following table and graphs</p>
<ol>
<li>Duplication level</li>
<li>kmer profile</li>
<li>per base GC content</li>
<li>per base N content</li>
<li>per base quality</li>
<li>per base sequence content</li>
<li>per sequence GC content</li>
<li>per sequence quality</li>
<li>sequence length distribution</li>
</ol>
<p>More at http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/</p><p>Address of the bookmark: <a href="http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/" rel="nofollow">http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28805/bambus</guid>
	<pubDate>Tue, 16 Aug 2016 08:09:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28805/bambus</link>
	<title><![CDATA[Bambus]]></title>
	<description><![CDATA[<div>
<div>
<div>
<p>Bambus 2.0, the second generation Bambus scaffolder available as an open source package. While most other scaffolders are closely tied to a specific assembly program, Bambus accepts the output from most current assemblers and provides the user with great flexibility in choosing the scaffolding parameters. In particular, Bambus is able to accept contig linking data other than specified by mate-pairs. Such sources of information include alignment to a reference genome (Bambus can directly use the output of MUMmer), physical mapping data, or information about gene synteny.</p>
</div>
</div>
</div>
<div>
<div>Home Page:&nbsp;</div>
<div>
<div><a href="http://sourceforge.net/apps/mediawiki/amos/index.php?title=Bambus2">http://sourceforge.net/apps/mediawiki/amos/index.php?title=Bambus2</a></div>
</div>
</div><p>Address of the bookmark: <a href="https://www.cbcb.umd.edu/software/bambus2" rel="nofollow">https://www.cbcb.umd.edu/software/bambus2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</guid>
	<pubDate>Wed, 20 Dec 2017 18:59:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</link>
	<title><![CDATA[Meraculous: Haplotype-sensitive Assembly of Highly Heterozygous genomes.]]></title>
	<description><![CDATA[<p><span>Meraculous is a whole genome assembler for Next Generation Sequencing data geared for large genomes. It is a hybrid k-mer/read-based assembler that capitalizes on the high accuracy of Illumina sequence by eschewing an explicit error correction step which we argue to be redundant with the assembly process. Meraculous achieves high performance with large datasets by utilizing lightweight data structures and multi-threaded parallelization, allowing to assemble human-sized genomes on commodity clusters in under a day. The process pipeline implements a highly transparent and portable model of job control and monitoring where different assembly stages can be executed and re-executed separately or in unison on a wide variety of architectures.</span></p>
<p><span>https://jgi.doe.gov/data-and-tools/meraculous/</span></p>
<p><span>https://arxiv.org/ftp/arxiv/papers/1703/1703.09852.pdf</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/meraculous20/" rel="nofollow">https://sourceforge.net/projects/meraculous20/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</guid>
	<pubDate>Fri, 01 Jun 2018 07:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</link>
	<title><![CDATA[Ranbow: a haplotype assembler for polyploid genomes]]></title>
	<description><![CDATA[Ranbow is a haplotype assembler for polyploid genomes. It has been developed for the haplotype assembly of the hexaploid sweet potato genome, which is highly heterozygous. Ranbow can also be applied to other polyploid genomes. After a first phasing, Ranbow utilizes the assembled haplotypes to improve the accuracy of variant calling results and to infer the evolutionary history of the organism´s genome. Ranbow has three main modes of function:

ranbow hap: for haplotyping
ranbow eval: for evaluating of the assemble haplotypes by gold standard (long) reads 
ranbow phylo: for the phylogenetic analysis<p>Address of the bookmark: <a href="https://www.molgen.mpg.de/ranbow" rel="nofollow">https://www.molgen.mpg.de/ranbow</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>