<?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/26573?offset=1610</link>
	<atom:link href="https://bioinformaticsonline.com/related/26573?offset=1610" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41459/jcvipython-utility-libraries-on-genome-assembly-annotation-and-comparative-genomics</guid>
	<pubDate>Tue, 17 Mar 2020 06:19:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41459/jcvipython-utility-libraries-on-genome-assembly-annotation-and-comparative-genomics</link>
	<title><![CDATA[JCVI:Python utility libraries on genome assembly, annotation and comparative genomics]]></title>
	<description><![CDATA[<p>Collection of Python libraries to parse bioinformatics files, or perform computation related to assembly, annotation, and comparative genomics.</p>
<p>https://github.com/tanghaibao/jcvi</p>
<p>More at https://github.com/tanghaibao/jcvi/wiki</p><p>Address of the bookmark: <a href="https://github.com/tanghaibao/jcvi" rel="nofollow">https://github.com/tanghaibao/jcvi</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/18384/big-genomic-data-on-google-cloud-platform</guid>
	<pubDate>Fri, 17 Oct 2014 02:16:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/18384/big-genomic-data-on-google-cloud-platform</link>
	<title><![CDATA[Big genomic data on Google Cloud Platform]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/ExNxi_X4qug" frameborder="0" allowfullscreen></iframe>As the cost of DNA sequencing has dropped, the volume of data produced has risen into the petabytes. Google is working with the genomics community to define a standard API for working with big genomic data sets in the cloud. Building on Google Cloud Platform, we show how to store, process, explore and share genomic data using technologies like BigQuery, AppEngine MapReduce, R and more.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</guid>
	<pubDate>Mon, 04 May 2020 02:04:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</link>
	<title><![CDATA[HASLR: a hybrid assembler which uses both second and third generation sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on all the samples compared to other tested assemblers. Furthermore, the generated assemblies in terms of contiguity and accuracy are on par with the other tools on most of the samples. Availability. HASLR is an open source tool available at https://github.com/vpc-ccg/haslr.</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18579/cluster-innovation-center-university-of-delhi</guid>
  <pubDate>Wed, 22 Oct 2014 10:39:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[CLUSTER INNOVATION CENTER @ UNIVERSITY OF DELHI]]></title>
  <description><![CDATA[
<p>Applications for Pre-selection of  candidates under ‘Institutions Mode’ for DST-ISPIRE Faculty in  Computational Biology/ Systems Biology/ Bioinformatics</p>

<p>Applications are invited for pre-selection  of candidates for Ministry of Science and Technology, Department of Science and Technology INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE in the area of computational Biology/Systems Biology/Bioinformatics.</p>

<p>Candidates having done their B.Tech/B.E.  and or M.Sc./M.Tech in Computer Science or Biotechnology and Ph.D. in Systems/ Computational Biology or Bioinformatics may apply in the following format prescribed by DST to the Director, Cluster Innovation Center, University Stadium, GC Narang Marg, University of Delhi, Delhi -11107. Detials of other qualification, age limits etc., please visit www.inspire-dst.gov.in.</p>

<p>Application on the prescribed format may be submitted by email to director@cic.du.ac.in before October 25, 2014. Selected candidates shall be called for an interview. The date, time and venue of the interview shall be informed by email/telephone. For more information about Cluster Innovation Center, please visit https://ducic.ac.in.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Mon, 26 Oct 2020 21:23:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding.]]></title>
	<description><![CDATA[<p><span>Despite marked recent improvements in long-read sequencing technology, the assembly of diploid genomes remains a difficult task. A major obstacle is distinguishing between alternative contigs that represent highly heterozygous regions. If primary and secondary contigs are not properly identified, the primary assembly will overrepresent both the size and complexity of the genome, which complicates downstream analysis such as scaffolding.</span></p>
<p><span>More at&nbsp;https://github.com/esolares/HapSolo</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/19059/ipython-interactive-notebooks</guid>
	<pubDate>Fri, 07 Nov 2014 12:07:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19059/ipython-interactive-notebooks</link>
	<title><![CDATA[IPython: Interactive notebooks]]></title>
	<description><![CDATA[<p>The IPython Notebook is a web-based interactive computational environment where you can combine code execution, text, mathematics, plots and rich media into a single document.</p><p>These notebooks are normal files that can be shared with colleagues, converted to other formats such as HTML or PDF, etc. You can share any publicly available notebook by using the IPython Notebook Viewer service which will render it as a static web page. This makes it easy to give your colleagues a document they can read immediately without having to install anything.</p><p><img src="http://ipython.org/_images/9_home_fperez_prof_grants_1207-sloan-ipython_proposal_fig_ipython-notebook-specgram.png" width="985" height="916" alt="image" style="border: 0px;"><br /><br />To learn more about using the IPython Notebook, you can visit our example collection, and you can read the documentation for all the details on how to use and configure the system. The Notebook Gallery showcases many interesting notebooks covering a variety of topics, from basic programming to advanced scientific computing.</p><p>&nbsp;</p><p>More http://www.nature.com/news/interactive-notebooks-sharing-the-code-1.16261</p><p>http://ipython.org/ipython-doc/1/interactive/notebook.html</p><p>Reference http://ipython.org/notebook.html</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Sat, 08 May 2021 21:25:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding]]></title>
	<description><![CDATA[<p><span>HapSolo, that identifies secondary contigs and defines a primary assembly based on multiple pairwise contig alignment metrics. HapSolo evaluates candidate primary assemblies using BUSCO scores and then distinguishes among candidate assemblies using a cost function. The cost function can be defined by the user but by default considers the number of missing, duplicated and single BUSCO genes within the assembly. HapSolo performs hill climbing to minimize cost over thousands of candidate assemblies.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>