<?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/29284?offset=1200</link>
	<atom:link href="https://bioinformaticsonline.com/related/29284?offset=1200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/news/view/21312/r-for-microsoft-excel</guid>
	<pubDate>Wed, 18 Feb 2015 00:43:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/21312/r-for-microsoft-excel</link>
	<title><![CDATA[R for Microsoft Excel]]></title>
	<description><![CDATA[<div><p>If you currently use a spreadsheet like Microsoft Excel for data analysis, you might be interested in taking a look at this <a href="https://districtdatalabs.silvrback.com/intro-to-r-for-microsoft-excel-users" target="_blank">tutorial on how to transition from Excel to R</a>&nbsp;by Tony Ojeda. The tutorial explains how to use R functions in place of Excel formulas, including tools like =AVERAGE and =VLOOKUP. For the most part, it uses modern R packages to keep the R code clear and concise.</p><p>You'll likely still be using Excel as a data source, though, so you'll also want to check out this <a href="http://www.milanor.net/blog/?p=779" target="_blank">guide to importing data from Excel to R</a> from MilanoR.</p></div><p>Reference http://www.r-bloggers.com/an-r-tutorial-for-microsoft-excel-users/</p>]]></description>
	<dc:creator>Jitendra Narayan</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/pages/view/21367/a-guide-for-complete-r-beginners-r-syntax</guid>
	<pubDate>Fri, 20 Feb 2015 23:41:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/21367/a-guide-for-complete-r-beginners-r-syntax</link>
	<title><![CDATA[A guide for complete R beginners :- R Syntax]]></title>
	<description><![CDATA[<p>R is a functional based language, the inputs to a function, including options, are in brackets. Note that all dat and options are separated by a comma</p><ul>
<li>Function(data, options)</li>
</ul><p>Even quit is a function</p><ul>
<li>q()</li>
</ul><p>So is help</p><blockquote><p><strong>help(read.table)</strong></p></blockquote><p>Provides the help page for the FUNCTION &lsquo;read.table&rsquo;</p><blockquote><p><strong>help.search(&ldquo;t test&rdquo;)</strong></p></blockquote><p>Searches for help pages that might relate to the phrase &lsquo;t test&rsquo;</p><p><strong>NOTE</strong>: quotes are needed for search strings, they are not needed when referring to data objects or function names.</p><p>There is a short cut for help,</p><p>? shows the help page on a function name, same as <em>help(function)</em></p><blockquote><p><strong>?read.table</strong></p></blockquote><p>?? searches for help pages on functions, same as <em>help.search(&lsquo;phrase&rsquo;)</em></p><blockquote><p><strong>??&ldquo;t test&rdquo;</strong></p></blockquote><p>Information is usually returned from a function, by default this is printed to screen</p><blockquote><p><strong>read.table(&lsquo;data.tsv&rsquo;)</strong></p></blockquote><p>This can always be stored, we call what it is stored in an &lsquo;object&rsquo;</p><p><strong>mydata </strong></p><p>here <strong>mydata</strong> is an object of type <span style="text-decoration: underline;">dataframe</span></p><p><strong>Reminder:</strong></p><ul>
<li>Vector: a list of numbers, equivalent to a column in a table</li>
<li>Data Frame = a collection of vectors. Equivalent to a table</li>
</ul><p><strong>Hint</strong>:</p><ul>
<li>Up/Down arrow keys can be use to cycle through previous commands</li>
</ul>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</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/opportunity/view/21472/asst-professor-at-central-university-of-jharkhand-cuj</guid>
  <pubDate>Sun, 01 Mar 2015 01:17:52 -0600</pubDate>
  <link></link>
  <title><![CDATA[Asst. Professor at Central University of Jharkhand (CUJ)]]></title>
  <description><![CDATA[
<p>Central University of Jharkhand (CUJ) has issued a recruitment notification for the recruitment of Assistant Professor through recruitment notification – Central University of Jharkhand (CUJ) Recruitment 2015 –  Advt. No.: CUJ/Advt./14-15/15 Date: 26th Feb. 2015. Candidates who have completed M.Sc, Ph.D can apply for the new recruitment notification from Central University of Jharkhand (CUJ)</p>

<p>Central University of Jharkhand has been granted funds by the Department of Biotechnology (DBT), Govt. of India to establish “DBT-Boost to CUJ Interdisciplinary Life Sciences Departments for Education and Research” Applications are invited for the Assistant Professor on purely temporary basis. The appointments shall be initially for a period of one year, renewable every year depending on the satisfactory performance, till the end of project.</p>

<p>Position: ASSISTANT PROFESSOR (Total 03)<br />Salary: 45,000/- (fixed) per month<br />Essential Qualifications: i. Good academic record with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the master’s degree level with specialization in Biodiversity and Systematic/ Systems Biology/ Biophysics/ Bioinformatics from an Indian  University, or an equivalent degree from an accredited foreign university. ii. Besides fulfilling the above qualifications, the candidates must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/SET. iii. Notwithstanding anything contained in i. and ii. candidates, who are or have been awarded Ph.D Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulation, 2009, shall be exempted from therequirement of the minimum eligibility condition of NET/SLET/SET for recruitment and appointment of Assistant Professor. iv. NET/SLET/SET shall also not be required for such disciplines for which NET/SLET/SET in not conducted.<br />Desirable: Preference will be given to candidates having Ph.D in any of the above mentioned areas with NET</p>

<p>IMPORTANT DATES TO REMEMBER  :</p>

<p>Last Date to Apply for this job 24/3/2015</p>

<p>REFERENCE:</p>

<p>Central University of Jharkhand (CUJ) Recruitment 2015 –  Advt. No.: CUJ/Advt./14-15/15 Date: 26th Feb. 2015.</p>

<p>More at http://cuj.ac.in/careers.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/21624/ra-bioinformatics-at-ch-charan-singh-university-meerut</guid>
  <pubDate>Wed, 11 Mar 2015 09:07:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Ch. Charan Singh University, Meerut]]></title>
  <description><![CDATA[
<p>Ch. Charan Singh University, Meerut</p>

<p>http://molbiolabccsumrt.webs.com/</p>

<p>Applications are invited for one post of RA in a DBT funded research project “Creation of Bioinformatics Infrastructure Facility (BIF) for the promotion of Biology Teaching through Bioinformatics (BTBI) Scheme of BTISet”.</p>

<p>Candidate should have a Ph.D. degree in Bioinformatics/Biotechnology/Genetics and Plant Breeding with adequate experience in the area of Bioinformatics. If a suitable candidate for the post of RA is not available, a JRF/SRF may be appointed.</p>

<p>Candidate for the post of JRF/SRF should have Master’s degree in relevant subject with adequate experience in the area of Bioinformatics and should be NET/DBT-BINC qualified</p>

<p>Interested candidates may send their bio-data to Prof. H. S. Balyan (hsbalyan@gmail.com) (in exceptional case, bio-data may also be submitted at the time of interview) and attend the interview on Monday, March 30, 2015 at 11:00 AM in the Department of Genetics &amp; Plant Breeding, Ch. Charan Singh University, Meerut. Candidates shall bring their original documents at the time of interview for verification. No interview letters will be issued and no TA/DA will be paid.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/21703/coding-ground</guid>
	<pubDate>Tue, 17 Mar 2015 00:47:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/21703/coding-ground</link>
	<title><![CDATA[Coding Ground]]></title>
	<description><![CDATA[<p>Online coding group for most of the programming languages.</p>
<p>Code in almost all popular languages using Coding Ground.&nbsp;Edit, compile, execute and share your projects, 100% cloud.</p>
<p>http://www.tutorialspoint.com/codingground.htm</p><p>Address of the bookmark: <a href="http://www.tutorialspoint.com/codingground.htm" rel="nofollow">http://www.tutorialspoint.com/codingground.htm</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38215/pwhatshap-a-parallel-high-performance-version-of-whatshap</guid>
	<pubDate>Wed, 14 Nov 2018 08:20:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38215/pwhatshap-a-parallel-high-performance-version-of-whatshap</link>
	<title><![CDATA[pWhatsHap: a parallel, high-performance version of WhatsHap]]></title>
	<description><![CDATA[<div id="ASec4">
<p>Given the potential relevance of efficient haplotyping in several analysis pipelines, we have designed and engineered&nbsp;pWhatsHap, a parallel, high-performance version of&nbsp;WhatsHap.&nbsp;pWhatsHap&nbsp;is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building on&nbsp;WhatsHap,&nbsp;pWhatsHap&nbsp;exhibits the same complexity exploring a number of possible solutions which is exponential in the coverage of the dataset. The parallel implementation on multi-core architectures allows for a relevant reduction of the execution time for haplotyping, while the provided results enjoy the same high accuracy as that provided by&nbsp;WhatsHap, which increases with coverage.</p>
</div>
<p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1170-y</p><p>Address of the bookmark: <a href="https://bitbucket.org/whatshap/whatshap" rel="nofollow">https://bitbucket.org/whatshap/whatshap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>