<?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/31012?offset=540</link>
	<atom:link href="https://bioinformaticsonline.com/related/31012?offset=540" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</guid>
	<pubDate>Thu, 15 Nov 2018 12:48:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</link>
	<title><![CDATA[NovoGraph: building whole genome graphs from long-read-based de novo assemblies]]></title>
	<description><![CDATA[<p><span>NovoGraph: building whole genome graphs from long-read-based de novo assemblies</span></p>
<p><span><span>An algorithmically novel approach to construct a genome graph representation of long-read-based&nbsp;</span><em>de novo</em><span>&nbsp;sequence assemblies. We then provide a proof of principle by creating a genome graph of seven ethnically-diverse human genomes.</span></span></p>
<p>&nbsp;</p>
<p>https://f1000research.com/articles/7-1391/v1</p><p>Address of the bookmark: <a href="https://github.com/NCBI-Hackathons/NovoGraph" rel="nofollow">https://github.com/NCBI-Hackathons/NovoGraph</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/13523/megadock-40</guid>
	<pubDate>Thu, 07 Aug 2014 18:08:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/13523/megadock-40</link>
	<title><![CDATA[MEGADOCK 4.0]]></title>
	<description><![CDATA[<p>An ultra&ndash;high-performance protein&ndash;protein docking software for heterogeneous supercomputers</p>
<p id="p-4"><strong>Summary:</strong> The application of protein&ndash;protein docking in large-scale interactome analysis is a major challenge in structural bioinformatics and requires huge computing resources. In this work, we present MEGADOCK 4.0, an FFT-based docking software that makes extensive use of recent heterogeneous supercomputers and shows powerful, scalable performance of over 97% strong scaling.</p>
<p id="p-5"><strong>Availability and Implementation:</strong> MEGADOCK 4.0 is written in C++ with OpenMPI and NVIDIA CUDA 5.0 (or later) and is freely available to all academic and non-profit users at: <a href="http://www.bi.cs.titech.ac.jp/megadock">http://www.bi.cs.titech.ac.jp/megadock</a>.</p>
<p id="p-6"><strong>Contact:</strong> <a href="mailto:akiyama@cs.titech.ac.jp">akiyama@cs.titech.ac.jp</a></p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short</a></p>]]></description>
	<dc:creator>Suleman Khan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38475/purge-haplotigs-pipeline-to-help-with-curating-heterozygous-diploid-genome-assemblies</guid>
	<pubDate>Mon, 17 Dec 2018 03:17:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38475/purge-haplotigs-pipeline-to-help-with-curating-heterozygous-diploid-genome-assemblies</link>
	<title><![CDATA[Purge Haplotigs: Pipeline to help with curating heterozygous diploid genome assemblies]]></title>
	<description><![CDATA[<p>Some parts of a genome may have a very high degree of heterozygosity. This causes contigs for both haplotypes of that part of the genome to be assembled as separate primary contigs, rather than as a contig and an associated haplotig. This can be an issue for downstream analysis whether you're working on the haploid or phased-diploid assembly.</p>
<p><span>Identify pairs of contigs that are syntenic and move one of them to the haplotig 'pool'. The pipeline uses mapped read coverage and Minimap2 alignments to determine which contigs to keep for the haploid assembly. Dotplots are optionally produced for all flagged contig matches, juxtaposed with read-coverage, to help the user determine the proper assignment of any remaining ambiguous contigs. The pipeline will run on either a haploid assembly (i.e. Canu, FALCON or FALCON-Unzip primary contigs) or on a phased-diploid assembly (i.e. FALCON-Unzip primary contigs + haplotigs). Here are&nbsp;</span><a href="https://bitbucket.org/mroachawri/purge_haplotigs/wiki/Examples">two examples</a><span>&nbsp;of how Purge Haplotigs can improve a haploid and diploid assembly.</span></p><p>Address of the bookmark: <a href="https://bitbucket.org/mroachawri/purge_haplotigs" rel="nofollow">https://bitbucket.org/mroachawri/purge_haplotigs</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14024/grapher</guid>
	<pubDate>Thu, 14 Aug 2014 14:02:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14024/grapher</link>
	<title><![CDATA[GrapheR !!!]]></title>
	<description><![CDATA[<p>What a wonderful gem <em>GrapheR</em> is.... Oh yes it is. <em>GrapheR</em> is a GUI for base graphics in R by http://www.maximeherve.com/. The package provides a graphical user interface for creating base charts in R. It is ideal for beginners in R, as the user interface is very clear and the code is written along side into a text file, allowing users to recreate the charts directly in the console. <br /><br />Adding and changing legends? Messing around with the plotting window settings? It is much easier/quicker with this GUI than reading the help file and trying to understand the various parameters.<br />Here is a little example using the iris data set.<br /><br />library(GrapheR)<br />data(iris)<br />run.GrapheR()<br /><br />This will bring up a window that helps me to create the chart and tweak the various parameters.</p><p><img src="http://4.bp.blogspot.com/-NbnCM1dPh3E/U9aW9YxJ9oI/AAAAAAAABgo/gEPzPhOpf2Y/s1600/GrapheR.png" alt="image" width="878" height="868" style="border: 0px; border: 0px;"><br /><br />Finally, I find the underlying R code in a file created by <em>GrapheR</em>. For more details read also the <a href="http://cran.r-project.org/web/packages/GrapheR/index.html" target="_blank">package vignette</a>, which is available in <a href="http://cran.r-project.org/web/packages/GrapheR/vignettes/manual_en.pdf" target="_blank">English</a>, <a href="http://cran.r-project.org/web/packages/GrapheR/vignettes/manual_fr.pdf" target="_blank">French</a> and <a href="http://cran.r-project.org/web/packages/GrapheR/vignettes/manual_de.pdf" target="_blank">German</a>!</p>]]></description>
	<dc:creator>John Parker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38579/genomeview-genome-browser-and-annotation-editor</guid>
	<pubDate>Wed, 02 Jan 2019 04:09:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38579/genomeview-genome-browser-and-annotation-editor</link>
	<title><![CDATA[GenomeView: genome browser and annotation editor]]></title>
	<description><![CDATA[<p><span>GenomeView is a genome browser and annotation editor that displays reference sequence, annotation, multiple alignments, short read alignments and graphs. Most major data formats are supported. Local and internet files can be loaded.</span><br><span>This project has moved to GitHub:&nbsp;</span><a href="https://github.com/GenomeView/genomeview" target="_blank">https://github.com/GenomeView/genomeview</a></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/genomeview/" rel="nofollow">https://sourceforge.net/projects/genomeview/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14186/pybedtools</guid>
	<pubDate>Wed, 20 Aug 2014 01:03:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14186/pybedtools</link>
	<title><![CDATA[pybedtools]]></title>
	<description><![CDATA[<p>pybedtools is a Python wrapper for Aaron Quinlan's BEDtools programs (https://github.com/arq5x/bedtools), which are widely used for genomic interval manipulation or "genome algebra". pybedtools extends BEDTools by offering feature-level manipulations from with Python. See full online documentation, including installation instructions, at http://pythonhosted.org/pybedtools/.</p><p>More at http://pythonhosted.org/pybedtools/</p><p>A powerful toolset for genome arithmetic.http://code.google.com/p/bedtools/</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/38765/list-of-tools-frequently-used-while-genome-assembly</guid>
	<pubDate>Tue, 22 Jan 2019 09:39:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/38765/list-of-tools-frequently-used-while-genome-assembly</link>
	<title><![CDATA[List of tools frequently used while genome assembly]]></title>
	<description><![CDATA[<h4>List of tools frequently used while genome assembly:</h4><p>I have used the following assemblers</p><ul>
<li><a href="http://bioinf.spbau.ru/spades">Spades</a>&nbsp;(v. 3.10.1)</li>
<li><a href="http://canu.readthedocs.io/en/stable/index.html">CANU</a>&nbsp;(v. 1.6)</li>
<li><a href="https://github.com/rrwick/Unicycler">Unicycler&nbsp;</a>(v. v0.4.1)</li>
<li><a href="https://github.com/lh3/miniasm">Miniasm</a>&nbsp;(v. 0.2-r137-dirty)</li>
</ul><p>I have used the following mappers</p><ul>
<li><a href="https://github.com/lh3/minimap2">minimap2</a>&nbsp;(v.&nbsp;2.0rc1-r232)</li>
<li><a href="https://github.com/lh3/minimap">minimap&nbsp;</a>(v. 0.2-r124-dirty)</li>
<li><a href="https://github.com/lh3/bwa">bwa</a>&nbsp;(v.&nbsp;0.7.12-r1039)</li>
</ul><p>I have used the following polishing tools</p><ul>
<li><a href="https://github.com/isovic/racon">Racon</a>&nbsp;(v. not available)</li>
<li><a href="https://github.com/broadinstitute/pilon">Pilon</a>&nbsp;(v. 1.18)</li>
<li><a href="https://github.com/jts/nanopolish">Nanopolish</a>&nbsp;(v. 0.8.3)</li>
</ul><p>I have used the following tools to assess genome assembly characteristics</p><ul>
<li><a href="https://github.com/chjp/ANI">ANI.pl</a>&nbsp;(https://github.com/chjp/ANI)</li>
<li><a href="http://ecogenomics.github.io/CheckM/">CheckM</a>&nbsp;(v. 1.0.7)</li>
<li><a href="https://github.com/tseemann/prokka">Prokka</a>&nbsp;(v. 1.12)</li>
<li><a href="http://bioinf.spbau.ru/en/quast">QUAST</a>&nbsp;(v. 2.3)</li>
<li><a href="http://mummer.sourceforge.net/">mummer&nbsp;</a>(v. not available)</li>
</ul><p>If you have any ideas or superior tools we have missed please let us know in the comments.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/39704/the-rogers-lab</guid>
  <pubDate>Mon, 15 Jul 2019 08:07:44 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Rogers Lab]]></title>
  <description><![CDATA[
<p>The Rogers lab studies evolution of genome structure. We explore the ways that complex mutations like duplications, deletions, rearrangements, and retrogenes can create new genetic material. We study how these new mutations are important for adaptation. We are currently working on projects in Drosophila, Mammoths, Elephants, Bivalves, and Frogs absolutely no amphibians. This multi-organism approach can help us understand when and why complex mutations are important for organism fitness.</p>

<p>More at http://evolscientist.com/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14904/bioinformatics-jrfsrf-position-at-iari</guid>
  <pubDate>Thu, 04 Sep 2014 04:14:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/SRF position at IARI]]></title>
  <description><![CDATA[
<p>DIVISION OF NEMATOLOGY<br />INDIAN AGRICULTURAL RESEARCH INSTITUTE<br />NEW DELHI 110012<br />Applications are invited for the posts of one Junior<br />Research Fellow and one RA in the DBT funded project entitled “ Plant parasitic nematode genome informatics - insilico resource development”. The project is for a period of three years. </p>

<p>Essential qualifications for JRF<br />: M. Sc. in Bioinformatics with experience in Proteomics, genomics and structural biology. Knowledge of programming language, pearl and database – HTML, CSS,php and Java script.<br />Essential qualifications for Research Associate:<br />MSc/MTech in Bioinformatics with three years experience or Ph.D in Bioinformatics with experience in proteomics, genomics and structural biology. Knowledge of programming language, perl and database<br />– HTML, CSS, Java script. NGS sequence assembly and analysis and algorithm designing.<br />Age limit : 35 years maximum (5 year relaxation for SC/ST and women candidates)<br />Emoluments:<br />JRF: 16,000 + 30% HRA<br />.<br />Res Assoc: Rs22,000 + 30% HRA<br />The post is purely temporary in nature and is co-terminus with the project. The appointment would be initially for one year and may be extended further upon satisfactory performance.<br />Interested candidates<br />should send the duly filled application forms (format in the following page ) so as to reach on or before 20.9.2014 along with all the relevant documents.</p>

<p>More at http://www.iari.res.in/files/JRF_RA-03092014-20140903-135319.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40140/alf-a-simulation-framework-for-genome-evolution</guid>
	<pubDate>Tue, 22 Oct 2019 22:05:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40140/alf-a-simulation-framework-for-genome-evolution</link>
	<title><![CDATA[ALF--a simulation framework for genome evolution.]]></title>
	<description><![CDATA[<p style="color: #000000; font-size: small; font-style: normal; font-weight: 400; text-align: -webkit-left;"><span style="color: #4d4d4d; font-size: small; font-style: normal; font-weight: 400; text-align: left; background-color: #ffffff; float: none;">Artificial Life Framework (ALF)</span> simulates a root genome into a number of related genomes. Result files include the resulting gene sequences, true tree and true MSAs. A description of ALF can be found in the following article:</p>
<p style="color: #000000; font-size: small; font-style: normal; font-weight: 400; text-align: -webkit-left;">Daniel A Dalquen, Maria Anisimova, Gaston H Gonnet, Christophe Dessimoz: ALF - A Simulation Framework for Genome Evolution.<span>&nbsp;</span><em>Mol Biol Evol</em>, 29(4):1115-1123, April 2012.<br><a href="http://mbe.oxfordjournals.org/content/29/4/1115" target="_blank">http://mbe.oxfordjournals.org/content/29/4/1115</a></p><p>Address of the bookmark: <a href="http://alfsim.org/#index" rel="nofollow">http://alfsim.org/#index</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>