<?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/27438?offset=750</link>
	<atom:link href="https://bioinformaticsonline.com/related/27438?offset=750" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36867/cerulean-a-hybrid-assembly-using-high-throughput-short-and-long-reads</guid>
	<pubDate>Tue, 05 Jun 2018 10:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36867/cerulean-a-hybrid-assembly-using-high-throughput-short-and-long-reads</link>
	<title><![CDATA[Cerulean: A hybrid assembly using high throughput short and long reads]]></title>
	<description><![CDATA[Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads.

Cerulean v0.1 has been implemented with bacterial genomes in mind.

The method is fully described in Deshpande, V., Fung, E. D., Pham, S., &amp; Bafna, V. (2013). Cerulean: A hybrid assembly using high throughput short and long reads. arXiv preprint arXiv:1307.7933.
http://arxiv.org/abs/1307.7933<p>Address of the bookmark: <a href="https://sourceforge.net/projects/ceruleanassembler/" rel="nofollow">https://sourceforge.net/projects/ceruleanassembler/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 04:08:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><br>Here is the command to run the tool:</p>
<pre><code>python finisherSC.py destinedFolder mummerPath
</code></pre>
<p>If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.</p>
<pre><code>python finisherSC.py -par 20 destinedFolder mummerPath
</code></pre>
<p>Sometimes, if the names of raw reads and contigs consists of special characters/formats, FinisherSC/MUMmer may not parse them correctly. In that case, you want to have a quick renaming of the names of contigs/reads in contigs.fasta or raw_reads.fasta using the following command.</p>
<pre><code>    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' raw_reads.fasta &gt; newRaw_reads.fasta
    cp newRaw_reads.fasta raw_reads.fasta
    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' contigs.fasta &gt; newContigs.fasta
    cp newContigs.fasta contigs.fasta</code></pre><p>Address of the bookmark: <a href="https://github.com/kakitone/finishingTool" rel="nofollow">https://github.com/kakitone/finishingTool</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29262/bioinformatics-jobs-at-chittaranjan-national-cancer-institute</guid>
  <pubDate>Thu, 29 Sep 2016 09:36:33 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics jobs at Chittaranjan National Cancer Institute]]></title>
  <description><![CDATA[
<p>Chittaranjan National Cancer Institute Advertisement No.497/2016 Invites Applications For Senior Scientific Officer, Gr. II </p>

<p>Note: Experience in the following field required: Molecular cancer cytogenetic and genetic toxicology Molecular drug Designing and targeted therapy Cancer genomics, proteomics, bioinformatics and next generation sequencing Therapeutic stem cell research and gene therapy Molecular cancer immunology and immunotherapy Molecular epidemiology Tumor endocrinology Translation research Ultra structural/tissue engg/development biology research Virus and cancer Molecular pathology No. of Posts: 11 (Eleven), (SC-1, OBC-3, UR-7) </p>

<p>Location: Kolkata (Calcutta) Salary: Rs.15600-39100 + Grade, Pay Rs.5400/- </p>

<p>For details kindly refer to the Employment News dated 24-30 September, 2016 and in the Institute’s Website: http://www.cnci.org.in </p>

<p>Last date for receipt of applications is 30 days from the date of notification in the Employment News. Director Chittaranjan National Cancer Institute 378, S.P. </p>

<p>Institute’s Website: http://www.cnci.org.in</p>
]]></description>
</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/40856/3d-de-novo-assembly-3d-dna-pipeline</guid>
	<pubDate>Sun, 02 Feb 2020 13:41:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</link>
	<title><![CDATA[3D de novo assembly (3D DNA) pipeline]]></title>
	<description><![CDATA[<p>For a detailed description of the pipeline and how it integrates with other tools designed by the Aiden Lab see&nbsp;<a href="http://aidenlab.org/assembly/manual_180322.pdf">Genome Assembly Cookbook</a>&nbsp;on&nbsp;<a href="http://aidenlab.org/assembly">http://aidenlab.org/assembly</a>.</p>
<p>For the original version of the pipeline and to reproduce the Hs2-HiC and the AaegL4 genomes reported in&nbsp;<a href="http://science.sciencemag.org/content/356/6333/92">(Dudchenko et al.,&nbsp;<em>Science</em>, 2017)</a>&nbsp;see the&nbsp;<a href="https://github.com/theaidenlab/3d-dna/tree/745779bdf64db6e55bddb70c24e9b58825938c33">original commit</a>.</p>
<p>For the detailed description of the merge section see&nbsp;<a href="https://github.com/theaidenlab/AGWG-merge">https://github.com/theaidenlab/AGWG-merge</a>.</p><p>Address of the bookmark: <a href="https://github.com/theaidenlab/3d-dna" rel="nofollow">https://github.com/theaidenlab/3d-dna</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29576/impute2</guid>
	<pubDate>Thu, 27 Oct 2016 11:21:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29576/impute2</link>
	<title><![CDATA[IMPUTE2]]></title>
	<description><![CDATA[<p><strong>IMPUTE2</strong>&nbsp;is a computer program for phasing observed genotypes and imputing missing genotypes. Most people use just a couple of the program's basic functions, but we have also built up a collection of specialized and powerful options. If you are new to&nbsp;<strong>IMPUTE2</strong>, or indeed to phasing and imputation in general, we suggest that you start by learning the basics.</p>
<p>You should begin by downloading the program from&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#download">here</a>. You will need to choose the link that matches your computing platform and then follow the instructions for opening the download package.</p>
<p>Once you have done this, you will be ready to try some example analyses on the test data that are provided with the download. The section on&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#examples">Examples</a>&nbsp;shows how to use the most common&nbsp;<strong>IMPUTE2</strong>&nbsp;functions. We suggest that you work through these examples and try to understand what the elements of each command are doing. If you don't understand something or would like to know if the program can perform a function that isn't listed, you can read our&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#faq">FAQ</a>&nbsp;or submit a question to our&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#mail_list">mail list</a>.</p>
<p>When you have learned the basic functionality of the program, you can use several features of this website to prepare your own analysis:</p>
<ul>
<li>Learn about&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#best_practices">best practices</a>&nbsp;for imputation.</li>
<li>Download&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#reference">reference data</a>&nbsp;that you can use to impute genotypes in your study.</li>
<li>Look through a complete list of&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#options">program options</a>.</li>
</ul><p>Address of the bookmark: <a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html" rel="nofollow">https://mathgen.stats.ox.ac.uk/impute/impute_v2.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29588/research-associate-and-junior-research-fellow-at-north-eastern-hill-university-tura-meghalaya</guid>
  <pubDate>Fri, 28 Oct 2016 09:54:43 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate and Junior Research Fellow at North-Eastern Hill University - Tura, Meghalaya]]></title>
  <description><![CDATA[
<p>Research Associate and Junior Research Fellow <br />North-Eastern Hill University - Tura, Meghalaya <br />₹18,000 a month<br />Applications are invited for the post of Research Associate and JRF in the DBT sponsored Bioinformatics Infrastructure Facility (BIF), posts are purely temporary and terminable at anytime without prior notice or assigning any reason thereof. </p>

<p>Research Associate : <br />Essential Qualification: Ph.D in Bioinformatics/Biotechnology/Life Science from a reocngised univeristy/institute <br />Pay: Rs.36000-/- + Admissible 10% HRA per month <br />Age: Below 35 years </p>

<p>Junior Research Fellow <br />Essential Qualification: M.Sc in Bioinformatics/Biotechnology/Life Science from a reocngised univeristy/institute <br />Pay: Rs.18000-/- + per month <br />Age: Below 35 years </p>

<p>Last date for receving application by mail or post is 08.11.2016 </p>

<p>Company Info. <br />North-Eastern Hill University </p>

<p>Bioinformatics Infrastructure Facility (BIF) Department of RDAP North-Eastern Hill University, Tura Campus Tura-794002, Meghalaya</p>

<p>More at http://www.nehu.ac.in/Advertisements/BIFTuraManpowerAdvt_25102016.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</guid>
	<pubDate>Fri, 27 Mar 2020 22:49:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</link>
	<title><![CDATA[HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads]]></title>
	<description><![CDATA[<p><span>HiCanu, a significant modification of the Canu assembler designed to leverage the full potential of HiFi reads via homopolymer compression, overlap-based error correction, and aggressive false overlap filtering.&nbsp;</span></p>
<p>More at&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3?fbclid=IwAR2PaN4GLjvAZpWmCE2q0EWk2dtwY7wiKxVlXn9PPG7OBSP06PP2gcCrv3A">https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3</a></p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41734/supernova-generates-phased-whole-genome-de-novo-assemblies-from-a-chromium-prepared-library</guid>
	<pubDate>Sun, 31 May 2020 01:59:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41734/supernova-generates-phased-whole-genome-de-novo-assemblies-from-a-chromium-prepared-library</link>
	<title><![CDATA[Supernova: generates phased, whole-genome de novo assemblies from a Chromium-prepared library.]]></title>
	<description><![CDATA[<p>Supernova generates phased, whole-genome&nbsp;<em>de novo</em>&nbsp;assemblies from a Chromium-prepared library.</p>
<p>Please see&nbsp;<a href="https://support.10xgenomics.com/de-novo-assembly/guidance/doc/achieving-success-with-de-novo-assembly">Achieving Success with De Novo Assembly</a>&nbsp;and&nbsp;<a href="https://support.10xgenomics.com/de-novo-assembly/software/overview/system-requirements">System Requirements</a>&nbsp;<em>before</em>&nbsp;creating your Chromium libraries for assembly.</p>
<p>Supernova should be run using 38-56x coverage of the genome.<br>&bull; Somewhat higher coverage is&nbsp;<em>sometimes</em>&nbsp;advantageous.<br>&bull; Supernova will exit if it finds that coverage is far from the recommended range.<br>&bull; Note that at most 2.14 billion reads are allowed.<br>&bull; Please note that we have not extensively tested genomes larger than human, and any genome above approximately 4 GB should be considered experimental and is not supported.</p><p>Address of the bookmark: <a href="https://support.10xgenomics.com/de-novo-assembly/software/pipelines/latest/using/running" rel="nofollow">https://support.10xgenomics.com/de-novo-assembly/software/pipelines/latest/using/running</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>