<?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/43728?offset=550</link>
	<atom:link href="https://bioinformaticsonline.com/related/43728?offset=550" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37915/dna-nucleotide-counter</guid>
	<pubDate>Fri, 12 Oct 2018 04:37:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37915/dna-nucleotide-counter</link>
	<title><![CDATA[DNA Nucleotide Counter]]></title>
	<description><![CDATA[<p style="margin: 2px 5px 4px 6px; color: #000011; font-size: 12px; font-style: normal; font-weight: 400; text-align: justify;">DNA Nucleotide Counter is delivered in a DNA Baser package together with other free molecular biology tools.<span>&nbsp;</span><a href="http://www.dnabaser.com/download/biology-tools-package-download-count.html">Download</a><span>&nbsp;</span>the package and double click it. The programs inside the package will be extracted to the destination folder (specified by you). Go to the destination folder&nbsp;and double click the program you want to use.</p>
<p style="margin: 2px 5px 4px 6px; color: #000011; font-size: 12px; font-style: normal; font-weight: 400; text-align: justify;">It<span>&nbsp;</span><a href="http://www.dnabaser.com/download/install-anywhere.html">installs in any computer</a><span>&nbsp;</span>even if you don't have administrator rights!</p><p>Address of the bookmark: <a href="http://www.dnabaser.com/download/DNA-Counter/index.html" rel="nofollow">http://www.dnabaser.com/download/DNA-Counter/index.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/40882/troyanskaya-lab</guid>
  <pubDate>Tue, 04 Feb 2020 06:40:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[Troyanskaya Lab]]></title>
  <description><![CDATA[
<p>The goal of our research is to interpret and distill this complexity through accurate analysis and modeling of molecular pathways, particularly those in which malfunctions lead to the manifestation of disease. We are inventing integrative methods for systems-level pathway modeling through integrative analysis of genome-scale datasets. We apply these approaches in studying challenging biological problems, such as how pathways function in diverse cell types and how they change dynamically.</p>

<p>https://function.princeton.edu/</p>
]]></description>
</item>
<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/34398/ont-assembly-and-illumina-polishing-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 10:13:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</link>
	<title><![CDATA[ONT assembly and Illumina polishing pipeline]]></title>
	<description><![CDATA[<p>This pipeline performs the following steps:</p>
<ul>
<li>Assembly of nanopore reads using&nbsp;<a href="http://canu.readthedocs.io/">Canu</a>.</li>
<li>Polish canu contigs using&nbsp;<a href="https://github.com/isovic/racon">racon</a>&nbsp;(<em>optional</em>).</li>
<li>Map a paired-end Illumina dataset onto the contigs obtained in the previous steps using&nbsp;<a href="http://bio-bwa.sourceforge.net/">BWA</a>&nbsp;mem.</li>
<li>Perform correction of contigs using&nbsp;<a href="https://github.com/broadinstitute/pilon/wiki">pilon</a>&nbsp;and the Illumina dataset.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/nanoporetech/ont-assembly-polish" rel="nofollow">https://github.com/nanoporetech/ont-assembly-polish</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</guid>
	<pubDate>Sat, 02 Dec 2017 18:25:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: de-novo assembly &amp; annotation Pipeline for Transposable Elements]]></title>
	<description><![CDATA[<p>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</p>
<ul>
<li>
<p>dnaPipeTE is developped by Cl&eacute;ment Goubert, Laurent Modolo and the TREEP team of the LBBE:&nbsp;<a href="http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en">http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en</a></p>
</li>
<li>
<p>You can find the original publication in GBE here:&nbsp;<a href="https://academic.oup.com/gbe/article/7/4/1192/533768">https://academic.oup.com/gbe/article/7/4/1192/533768</a></p>
</li>
</ul>
<p><a href="https://github.com/clemgoub/dnaPipeTE/blob/dev/dnaPipefront.png" target="_blank"><img src="https://github.com/clemgoub/dnaPipeTE/raw/dev/dnaPipefront.png" alt="Front" style="border: 0px;"></a><em>output examples of quantification and TE landscape (relative age) produced by dnaPipeTE</em></p>
<p><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</guid>
	<pubDate>Wed, 27 Dec 2017 20:36:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</link>
	<title><![CDATA[Ra assembler - a de novo DNA assembler for third generation sequencing data]]></title>
	<description><![CDATA[<p>Integration of the Ra assembler - a de novo DNA assembler for third generation sequencing data developed on Faculty of Electrical Engineering and Computing (FER), Ruder Boskovic Institute (RBI) and Genome Institute of Singapore (GIS).</p>
<p>Ra is in development since 2014 in the form of several separate components that used to be run individually.<br>This project aims to ease the usage of Ra by integrating it into a complete de novo assembly tool.</p>
<p>Unlike other state-of-the-art assemblers,&nbsp;<span>Ra does not have an error correction step.</span>&nbsp;Instead, it relies on detecting overlaps using a very sensitive and specific overlapper ("graphmap -w owler",&nbsp;<a href="https://github.com/isovic/graphmap">https://github.com/isovic/graphmap</a>) and constructing and reducing an overlap graph (Ra layout,&nbsp;<a href="https://github.com/mariokostelac/ra">https://github.com/mariokostelac/ra</a>).</p><p>Address of the bookmark: <a href="https://github.com/mariokostelac/ra-integrate/" rel="nofollow">https://github.com/mariokostelac/ra-integrate/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</guid>
	<pubDate>Wed, 20 Jun 2018 02:45:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</link>
	<title><![CDATA[SWALO: Scaffolding with assembly likelihood optimization]]></title>
	<description><![CDATA[SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing.

Please email your questions, comments, suggestions, and bug reports to atif.bd@gmail.com.<p>Address of the bookmark: <a href="https://atifrahman.github.io/SWALO/" rel="nofollow">https://atifrahman.github.io/SWALO/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</guid>
	<pubDate>Tue, 20 Aug 2019 09:47:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</link>
	<title><![CDATA[TRITEX sequence assembly pipeline for Triticeae genomes]]></title>
	<description><![CDATA[<div>
<p>The pipeline is open-source and hosted in a public Bitbucket&nbsp;<a href="https://bitbucket.org/tritexassembly/tritexassembly.bitbucket.io/src/master/">repository</a>.</p>
</div>
<div>
<p>TRITEX has been run on highly inbred genotypes of barley (<em>Hordeum vulgare</em>), tetraploid wheat (<em>Triticum turgidum</em>) and hexaploid wheat (<em>T. aestivum</em>) with reasonable results: super-scaffold N50 values in the range of dozens of Mb and pseudomolecules with better gene space representation than a BAC-by-BAC assembly. It has never been tested and is not expected to work on heterozygous or autopolyploid genomes.</p>
</div>
<div>
<p>A protocol for generating chromosome-conformation capture sequencing (Hi-C) data suitable for use with the pipeline is described in&nbsp;<a href="https://bio-protocol.org/e2955">Himmelbach et al. 2018</a>. Refer to the&nbsp;<a href="https://www.10xgenomics.com/resources/technical-notes/">technical notes</a>&nbsp;of 10X Genomics on how to generate Chromium data.</p>
</div><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</guid>
	<pubDate>Wed, 10 Mar 2021 06:13:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</link>
	<title><![CDATA[CSA: A high-throughput chromosome-scale assembly pipeline for vertebrate genomes]]></title>
	<description><![CDATA[<p>The pipeline can use information from scaffolded assemblies (for example from HiC or 10X Genomics), or even from diverged (~65-100 Mya) reference genomes for ordering the contigs and thus support the assembly process. This typically results in improved contig N50 when compared to current state of the art methods.</p>
<p><img src="https://github.com/HMPNK/CSA2.6/raw/master/Fig1.png" alt="image" style="border: 0px;"></p>
<p>For smaller vertebrate genomes (~1 Gbp) chromosome scale assemblies can be achieved within 12h on high-end Desktop computers (Intel i7, 12 CPU threads, 128 GB RAM). Larger mammalian genomes (~3Gbp) can be processed within 15-18 h on server equipment (Xeon, 96 CPU threads, 1TB RAM).</p><p>Address of the bookmark: <a href="https://github.com/HMPNK/CSA2.6" rel="nofollow">https://github.com/HMPNK/CSA2.6</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>