<?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/28922?offset=550</link>
	<atom:link href="https://bioinformaticsonline.com/related/28922?offset=550" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34475/oxford-nanopore-sequencing-hybrid-error-correction-and-de-novo-assembly-of-a-eukaryotic-genome</guid>
	<pubDate>Wed, 29 Nov 2017 05:08:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34475/oxford-nanopore-sequencing-hybrid-error-correction-and-de-novo-assembly-of-a-eukaryotic-genome</link>
	<title><![CDATA[Oxford Nanopore Sequencing, Hybrid Error Correction, and de novo Assembly of a Eukaryotic Genome]]></title>
	<description><![CDATA[<p><span>Monitoring the progress of DNA molecules through a membrane pore has been postulated as a method for sequencing DNA for several decades. Recently, a nanopore-based sequencing instrument, the Oxford Nanopore MinION, has become available that we used for sequencing the S. cerevisiae genome. To make use of these data, we developed a novel open-source hybrid error correction algorithm Nanocorr (</span><a href="https://github.com/jgurtowski/nanocorr">https://github.com/jgurtowski/nanocorr</a><span>) specifically for Oxford Nanopore reads, as existing packages were incapable of assembling the long read lengths (5-50kbp) at such high error rate (between ~5 and 40% error). With this new method we were able to perform a hybrid error correction of the nanopore reads using complementary MiSeq data and produce a de novo assembly that is highly contiguous and accurate: the contig N50 length is more than ten-times greater than an Illumina-only assembly (678kb versus 59.9kbp), and has greater than 99.88% consensus identity when compared to the reference. Furthermore, the assembly with the long nanopore reads presents a much more complete representation of the features of the genome and correctly assembles gene cassettes, rRNAs, transposable elements, and other genomic features that were almost entirely absent in the Illumina-only assembly.</span></p><p>Address of the bookmark: <a href="http://schatzlab.cshl.edu/data/nanocorr/" rel="nofollow">http://schatzlab.cshl.edu/data/nanocorr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12582/postdoc-position-at-centre-mediterraneen-de-medecine-moleculaire</guid>
  <pubDate>Sun, 06 Jul 2014 11:23:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc position at Centre Méditerranéen de Médecine Moléculaire]]></title>
  <description><![CDATA[
<p>The research group of Dr. Michele Trabucchi at the Centre Méditerranéen de Médecine Moléculaire (C3M) at INSERM U1065 (University of Nice Sophia-Antipolis, France) is seeking candidates for a Postdoctoral fellow position to start on October 2014 for 3 years funded by FRM (Fondation pour la Recherche Médicale).<br />The broad interest of the lab is in understanding the expression control and function of small RNAs in activated myeloid cells (visit our webpage to check research interests and publications of the group : http://www.unice.fr/c3m/EN/Equipe10.html ). </p>

<p>The work will focus on the functional studies of small RNAs by using next-generation sequencing approaches.<br /> <br />Candidates should hold a Ph.D. degree and have strong background in bioinformatics.<br />The University of Nice Sophia-Antipolis provides a wide range of facilities and training essential for biomedical research.<br />Interested applicants should send a PDF with a cover letter stating research interests and qualifications, an updated CV, a summary of previous research experience and contact information for two references to Michele Trabucchi ( mtrabucchi@unice.fr )</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</guid>
	<pubDate>Wed, 28 Feb 2018 03:45:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</link>
	<title><![CDATA[Genome assembly stats plotting]]></title>
	<description><![CDATA[<p>A&nbsp;<em>de novo</em>&nbsp;genome assembly can be summarised b</p>
<p>y a number of metrics, including:</p>
<ul>
<li>Overall assembly length</li>
<li>Number of scaffolds/contigs</li>
<li>Length of longest scaffold/contig</li>
<li>Scaffold/contig N50 and N90Assembly base composition, in particular percentage GC and percentage Ns</li>
<li>CEGMA completeness</li>
<li>Scaffold/contig length/count distribution</li>
</ul>
<p>assembly-stats supports two widely used presentations of these values, tabular and cumulative length plots, and introduces an additional circular plot that summarises most commonly used assembly metrics in a single visualisation. Each of these presentations is generated using javascript from a common (JSON) data structure, allowing toggling between alternative views, and each can be applied to a single or multiple assemblies to allow direct comparison of alternate assemblies.</p>
<p>Tabular presentation allows direct comparison of exact values between assemblies, the limitations of this approach lie in the necessary omission of distributions and the challenge of interpreting ratios of values that may vary by several orders of magnitude.</p><p>Address of the bookmark: <a href="https://github.com/rjchallis/assembly-stats" rel="nofollow">https://github.com/rjchallis/assembly-stats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36478/the-marvel-assembler</guid>
	<pubDate>Fri, 04 May 2018 19:18:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36478/the-marvel-assembler</link>
	<title><![CDATA[The MARVEL assembler]]></title>
	<description><![CDATA[<p><span>MARVEL consists of a set of tools that facilitate the overlapping, patching, correction and assembly of noisy (not so noisy ones as well) long reads.</span></p>
<p>The assembly process can be summarized as follows:</p>
<ol>
<li>overlap</li>
<li>patch reads</li>
<li>overlap (again)</li>
<li>scrubbing</li>
<li>assembly graph construction and touring</li>
<li>optional read correction</li>
<li>fasta file creation</li>
</ol><p>Address of the bookmark: <a href="https://github.com/schloi/MARVEL" rel="nofollow">https://github.com/schloi/MARVEL</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/14218/pimp-your-brain-bioinformatics</guid>
	<pubDate>Wed, 20 Aug 2014 22:09:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/14218/pimp-your-brain-bioinformatics</link>
	<title><![CDATA[Pimp your brain: Bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/KqelGy6Q8nE" frameborder="0" allowfullscreen></iframe>Jan Lisec from the Max Planck Institute of Molecular Plant Physiology explains, in this "pimp your brain" episode, what bioinformatics is and why bioinformatics is so important and indispensable for biological research.

In the video serial "Pimp your brain" scientists from the Max Planck Institute of Molecular Plant Physiology describe their research. More videos from the 'Pimp your brain' serial are available on www.youtube.com/playlist?list=PL-l9VItC9Gn2Ur2Xj6PTOAkjLUlVPbIOO

More videos are available on www.mpimp-golm.mpg.de]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</guid>
	<pubDate>Mon, 14 May 2018 05:25:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</link>
	<title><![CDATA[GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads]]></title>
	<description><![CDATA[<p><span>This software is provided ``as is&rdquo; without warranty of any kind. In no event shall the author be held responsible for any damage resulting from the use of this software. The program package, including source codes, executables, and this documentation, is distributed free of charge. If you use this program in a publication, please cite the following reference:</span><br><span>Chong Chu, Xin Li, and Yufeng Wu. "GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads." bioRxiv (2017): 125534.</span></p><p>Address of the bookmark: <a href="https://github.com/Reedwarbler/GAPPadder" rel="nofollow">https://github.com/Reedwarbler/GAPPadder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/12989/center-for-molecular-dynamics-nepal-cmdn-nepal</guid>
  <pubDate>Wed, 23 Jul 2014 13:54:51 -0500</pubDate>
  <link></link>
  <title><![CDATA[Center for Molecular Dynamics Nepal (CMDN), Nepal]]></title>
  <description><![CDATA[
<p>Center for Molecular Dynamics Nepal (CMDN), established 2007 prides itself as a research driven nongovernmental organization. Unlike other civil society organizations, CMDN is dedicated entirely to promoting research in the country. With its team of energetic and highly motivated experts, CMDN is now recognized as the leading public health and wildlife research organization of the country.</p>

<p>More at http://www.cmdn.org.np/main/index.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36997/cgview-circular-genome-viewer</guid>
	<pubDate>Wed, 20 Jun 2018 10:15:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36997/cgview-circular-genome-viewer</link>
	<title><![CDATA[CGView - Circular Genome Viewer]]></title>
	<description><![CDATA[CGView is a Java package for generating high quality, zoomable maps of circular genomes. Its primary purpose is to serve as a component of sequence annotation pipelines, as a means of generating visual output suitable for the web. Feature information and rendering options are supplied to the program using an XML file, a tab delimited file, or an NCBI ptt file. CGView converts the input into a graphical map (PNG, JPG, or Scalable Vector Graphics format), complete with labels, a title, legends, and footnotes. In addition to the default full view map, the program can generate a series of hyperlinked maps showing expanded views. The linked maps can be explored using any web browser, allowing rapid genome browsing, and facilitating data sharing. The feature labels in maps can be hyperlinked to external resources, allowing CGView maps to be integrated with existing web site content or databases. For examples of the various output types, see the CGView gallery.

http://wishart.biology.ualberta.ca/cgview/gallery.html

http://stothard.afns.ualberta.ca/downloads/CCT/index.html

https://www.gview.ca/wiki/GView/WebHome

https://server.gview.ca/

http://stothard.afns.ualberta.ca/cgview_server/

Paper https://academic.oup.com/bib/advance-article/doi/10.1093/bib/bbx081/4037458<p>Address of the bookmark: <a href="http://wishart.biology.ualberta.ca/cgview/" rel="nofollow">http://wishart.biology.ualberta.ca/cgview/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13276/senior-research-fellow-at-nit-rourkela</guid>
  <pubDate>Wed, 30 Jul 2014 00:53:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow at NIT, Rourkela]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF TECHNOLOGY, ROURKELA – 769 008(ORISSA)<br />SPONSORED RESEARCH, INDUSTRIAL CONSULTANCY &amp; CONTINUING EDUCATION</p>

<p>ADVERTISEMENT NO: NITR/SR/CH-BIF/2014/30</p>

<p>Applications are invited on prescribed format for the following assignment in a purely time bound research project undertaken in the Department of Biotechnology &amp; Medical Engineering of the Institute.</p>

<p>1. Name of the Temporary Post : Senior Research Fellow-01<br />2. Name of the Research Project: “ Bioinformatics Infrastructure Facility (BIF)”<br />3. Name of the Sponsoring Agency: DBT, Government of India, 4 Tenure of the Project : 12th Five year Plan<br />5 Tenure of the Assignment : 01 year [Likely to be extended for 04 more years]<br />6 Job Description : BIF Maintenance and Active Research in Bioinformatics<br />7. Consolidated monthly compensation / Fellowship: Rs.18,000/- P.M.</p>

<p>8. Essential Qualifications and experience: B.Tech with valid GATE Score or M.Tech degree in Biotechnology/Bioinformatics/Computer Science/Computational Biology<br />9. Desirable Qualifications/ Experiences: Experience of Programming in PERL,R, Python, Unix and Visual Studio + Knowledge in NGS data analysis work flows ,WGS and statistical packages such as CRAN-R,MATLAB etc.</p>

<p>10. Accommodation : Bachelor accommodation in the Institute may be provided subject to availability.<br />11. For technical information on the project, the candidate may contact the Principal Investigator at the following address:</p>

<p>Name : Prof. Mukesh K Gupta<br />Address : Dept. of Biotechnology &amp; Medical Engineering,<br />N.I.T.Rourkela-769 008<br />Telephone No : 0661-2462294<br />E-mail : guptam@nitrkl.ac.in</p>

<p>Eligible persons may apply in the prescribed format (available in the Institute Website)affixed with coloured photographs to be submitted in duplicate along with photo copies of relevant certificates, grade/ mark sheets, publications etc., to Asst. Registrar, SRICCE,<br />National Institute of Technology, Rourkela–769 008 before 22.08.2014. The cover should be super- scribed clearly the post applied for &amp; Name of the Project.</p>

<p>Mere possession of minimum qualification does not guarantee invitation to the interview.<br />Candidates will be short listed based on merit and need of the project.</p>

<p>Advertisement:</p>

<p>http://www.nitrkl.ac.in/IntraWeb/Jobs_Tenders/Jobs/ProjectFellowship/2014/141707192838_1.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37984/baum-%E2%80%93-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus</guid>
	<pubDate>Wed, 24 Oct 2018 23:35:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37984/baum-%E2%80%93-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus</link>
	<title><![CDATA[BAUM – Improving Genome Assembly by Adaptive Unique Mapping and Local Overlap-Layout-Consensus]]></title>
	<description><![CDATA[<p><span>BAUM, breaks the whole genome into regions by adaptive unique mapping; then the local OLC is used to assemble each region in parallel. BAUM can: (1) perform reference-assisted assembly based on the genome of a close species; (2) or improve the results of existing assemblies that are obtained based on short or long sequencing reads.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.zhanyuwang.xin/wordpress/index.php/2017/07/21/baum-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus/" rel="nofollow">http://www.zhanyuwang.xin/wordpress/index.php/2017/07/21/baum-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>