<?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/14215?offset=1050</link>
	<atom:link href="https://bioinformaticsonline.com/related/14215?offset=1050" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36635/circlator-automated-circularization-of-genome-assemblies-using-long-sequencing-reads</guid>
	<pubDate>Tue, 15 May 2018 09:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36635/circlator-automated-circularization-of-genome-assemblies-using-long-sequencing-reads</link>
	<title><![CDATA[Circlator: automated circularization of genome assemblies using long sequencing reads]]></title>
	<description><![CDATA[A tool to circularize genome assemblies. The algorithm and benchmarks are described in the Genome Biology manuscript. 

Citation: "Circlator: automated circularization of genome assemblies using long sequencing reads", Hunt et al, Genome Biology 2015 Dec 29;16(1):294. doi: 10.1186/s13059-015-0849-0. PMID: 26714481.<p>Address of the bookmark: <a href="http://sanger-pathogens.github.io/circlator/" rel="nofollow">http://sanger-pathogens.github.io/circlator/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14054/project-fellow-at-institute-of-himalayan-bioresource-technology</guid>
  <pubDate>Fri, 15 Aug 2014 06:50:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow at Institute of Himalayan Bioresource Technology]]></title>
  <description><![CDATA[
<p>Research Associate/ Project FellowDate of posting:14 Aug</p>

<p>Eligibility : MSc, M Phil / Phd, BE/B.Tech<br />Location : Himachal Pradesh-other<br />Job Category : Govt Jobs, Research, Walkin<br />Last Date : 20 Aug 2014</p>

<p>Advertisement No.6/2014</p>

<p>Post : Project Fellow<br />Research Associate/ Project Fellow Jobs opportunity in CSIR-Institute of Himalayan Bioresource Technology<br />M.Sc. in Bioinformatics/Computer Science with 55% marks and (ii) M.Sc. Bioinformatics/ Computational biology/ P.G. Diploma in Bioinformatics/B.Tech. or higher Degree in Bioinformatics with 55% marks</p>

<p>Date of Interview: 29.08.2014.</p>

<p>More at http://www.ihbt.res.in/recruit/AdvtNo6_2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36890/price-paired-read-iterative-contig-extension-a-de-novo-genome-assembler-implemented-in-c</guid>
	<pubDate>Mon, 11 Jun 2018 03:08:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36890/price-paired-read-iterative-contig-extension-a-de-novo-genome-assembler-implemented-in-c</link>
	<title><![CDATA[PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++.]]></title>
	<description><![CDATA[We are pleased to release PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++. Its name describes the strategy that it implements for genome assembly: PRICE uses paired-read information to iteratively increase the size of existing contigs. Initially, those contigs can be individual reads from a subset of the paired-read dataset, non-paired reads from sequencing technologies that provide non-paired data, or contigs that were output from a prior run of PRICE or any other assembler.

http://derisilab.ucsf.edu/software/price/<p>Address of the bookmark: <a href="http://derisilab.ucsf.edu/software/price/" rel="nofollow">http://derisilab.ucsf.edu/software/price/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/14338/biology-computers-collide-in-high-demand-field-of-bioinformatics</guid>
	<pubDate>Mon, 25 Aug 2014 00:56:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/14338/biology-computers-collide-in-high-demand-field-of-bioinformatics</link>
	<title><![CDATA[Biology, Computers Collide in High-Demand Field of Bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/fk0z7KOTyMo" frameborder="0" allowfullscreen></iframe>Dr. Shivas Amin calls bioinformatics a "collision of biology and computers." Students learn how to use computers and skills in math and biology to analyze genome and proteome projects to prepare for high-demand jobs in the life sciences. Learn more about Amin and hear from student Medina Baitemirova and alumnus Lukas Simon about the fast-growing field of bioinformatics.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</guid>
	<pubDate>Fri, 06 Jul 2018 03:36:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</link>
	<title><![CDATA[KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies]]></title>
	<description><![CDATA[<p>KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT:</p>
<ul>
<li><span>hist</span>: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.</li>
<li><span>gcp:</span>&nbsp;K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.</li>
<li><span>comp</span>: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.</li>
<li><span>sect</span>: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.</li>
<li><span>blob</span>: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.</li>
<li><span>filter</span>: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
<ul>
<li><span>kmer</span>: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.</li>
<li><span>seq</span>: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.</li>
</ul>
</li>
<li><span>plot</span>: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
<ul>
<li><span>density</span>: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.</li>
<li><span>profile</span>: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool</li>
<li><span>spectra-cn</span>: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.</li>
<li><span>spectra-hist</span>: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.</li>
<li><span>spectra-mx</span>: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".</li>
</ul>
</li>
</ul>
<p>In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.</p>
<p>This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit:&nbsp;<a href="https://kat.readthedocs.org/en/latest/">https://kat.readthedocs.org/en/latest/</a></p>
<p><a href="https://academic.oup.com/bioinformatics/article/33/4/574/2664339">https://academic.oup.com/bioinformatics/article/33/4/574/2664339&nbsp;</a></p><p>Address of the bookmark: <a href="https://github.com/TGAC/KAT" rel="nofollow">https://github.com/TGAC/KAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/14927/which-of-the-following-programming-language-is-best-for-a-bioinformatics-beginner</guid>
	<pubDate>Thu, 04 Sep 2014 07:51:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/14927/which-of-the-following-programming-language-is-best-for-a-bioinformatics-beginner</link>
	<title><![CDATA[Which of the following programming language is best for a bioinformatics beginner?]]></title>
	<description><![CDATA[<p>I will be doing NGS in the course of my research work and I will like to learn a programming language which is compatible with most bioinformatics tools or software. I basically want to do de-novo assembly, map reads, align reads, and expression analysis. Recommendations welcomed. Which languages would you recommend to a student wishing to enter the world of bioinformatics?</p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37411/my-commonly-used-commands-in-bioinformatics</guid>
	<pubDate>Thu, 26 Jul 2018 04:58:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37411/my-commonly-used-commands-in-bioinformatics</link>
	<title><![CDATA[My commonly used commands in Bioinformatics]]></title>
	<description><![CDATA[<p>FYI, I've found it useful to use MUMmer to extract the specific changes that Racon makes, so I can evaluate them individually:</p><pre><code>minimap -t 24 assembly.fasta long_reads.fastq.gz | racon -t 24 long_reads.fastq.gz - assembly.fasta racon_assembly.fasta
nucmer -p nucmer assembly.fasta racon_assembly.fasta
show-snps -C -T -r nucmer.delta
</code></pre><p>This reports Racon's changes in a table. You can exclude indels with the&nbsp;<code>-I</code>&nbsp;option in&nbsp;<code>show-snps</code>.&nbsp;</p><p>This process (Racon -&gt; MUMmer -&gt; SNP table) solves the problem I originally raised in this issue. So as far as I'm concerned, you can close this issue (or keep it open if you still want to implement some kind of variant table).</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/16160/research-scientist-%E2%80%93-bioinformatics-at-sidra-medical-and-research-center</guid>
  <pubDate>Wed, 10 Sep 2014 14:35:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Scientist – Bioinformatics at Sidra Medical and Research Center]]></title>
  <description><![CDATA[
<p>Sidra Medical and Research Center(Doha, Qatar) is looking for talented Research Scientists (Bioinformatics / NGS Data Analysis).</p>

<p>Research Scientists within the Bioinformatics Program are involved in research related to cutting edge genomics and analysis of omics data. The research will utilize concepts, theories and best practices obtained from bioinformatics discipline and applied to biological and other biomedical data for analysis. The role may also involve designing databases, algorithm and/or computation methods for analyzing genomics and other omics data.  The scientist will be working closely with the Translational Medicine Program within a state-of-the art research setting.</p>

<p>Please check the details of the opening and apply here: http://careers.sidra.org/sidra/Vacan...acancyID=60181</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37785/haplomerger2-rebuilding-both-haploid-sub-assemblies-from-high-heterozygosity-diploid-genome-assembly</guid>
	<pubDate>Thu, 27 Sep 2018 07:08:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37785/haplomerger2-rebuilding-both-haploid-sub-assemblies-from-high-heterozygosity-diploid-genome-assembly</link>
	<title><![CDATA[HaploMerger2: rebuilding both haploid sub-assemblies from high-heterozygosity diploid genome assembly]]></title>
	<description><![CDATA[<p><span><span>HM2 can process any diploid assemblies, but it is especially suitable for diploid assemblies with high heterozygosity (&ge;3%), which can be difficult for other tools. This pipeline also implements flexible and sensitive assembly error detection, a hierarchical scaffolding procedure and a reliable gap-closing method for haploid sub-assemblies.</span></span></p>
<p><span>Source code, executables and the testing dataset are freely available at&nbsp;</span><a href="https://github.com/mapleforest/HaploMerger2/releases/" target="">https://github.com/mapleforest/HaploMerger2/releases/</a><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/mapleforest/HaploMerger2/releases/" rel="nofollow">https://github.com/mapleforest/HaploMerger2/releases/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/16472/internship-nipgr</guid>
  <pubDate>Sat, 13 Sep 2014 16:02:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[INTERNSHIP @ NIPGR]]></title>
  <description><![CDATA[
<p>Applications are invited from suitable candidates for six months ‘Training Fellowship' at National Institute of Plant Genome Research (NIPGR).</p>

<p>About National Institute Of Plant Genome Research (NIPGR) http://www.nipgr.res.in/</p>

<p>The National Institute of Plant Genome Research is an autonomous institution supported by the Department of Biotechnology, Government of India. It is committed to make the institute a premier Institution for plant genomic research in the country. It was established to contribute in the achievement of such hopes as a part of national effort for meeting the challenges in the midst of fast pace of international genomic research and grasping of opportunities on long-term basis.</p>

<p>About the Internship:</p>

<p>The selected intern(s) will work in the area of in Bioinformatics under the BTISNET program of DBT in the Distributed Information Sub center (DISC) facility at NIPGR, New Delhi, under the supervision of Dr. Gitanjali Yadav, Scientist, NIPGR.</p>

<p>Who can apply:</p>

<p>Students currently pursuing the final year of Masters Degree (or equivalent) in Bioinformatics/Biotechnology with strong interest in Computational Biology and First class/division throughout academic career may apply.</p>
]]></description>
</item>

</channel>
</rss>