<?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/30144?offset=1020</link>
	<atom:link href="https://bioinformaticsonline.com/related/30144?offset=1020" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 04:08:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><br>Here is the command to run the tool:</p>
<pre><code>python finisherSC.py destinedFolder mummerPath
</code></pre>
<p>If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.</p>
<pre><code>python finisherSC.py -par 20 destinedFolder mummerPath
</code></pre>
<p>Sometimes, if the names of raw reads and contigs consists of special characters/formats, FinisherSC/MUMmer may not parse them correctly. In that case, you want to have a quick renaming of the names of contigs/reads in contigs.fasta or raw_reads.fasta using the following command.</p>
<pre><code>    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' raw_reads.fasta &gt; newRaw_reads.fasta
    cp newRaw_reads.fasta raw_reads.fasta
    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' contigs.fasta &gt; newContigs.fasta
    cp newContigs.fasta contigs.fasta</code></pre><p>Address of the bookmark: <a href="https://github.com/kakitone/finishingTool" rel="nofollow">https://github.com/kakitone/finishingTool</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/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</guid>
	<pubDate>Thu, 06 Sep 2018 16:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</link>
	<title><![CDATA[LoRMA: A tool for correcting sequencing errors in long reads]]></title>
	<description><![CDATA[<p><span>An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of&nbsp;</span><em>k</em><span>-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75&times;, the throughput of the new method is at least 20% higher.</span></p>
<blockquote>
<p><span>conda install -c atgc-montpellier lorma</span></p>
</blockquote><p>Address of the bookmark: <a href="https://gite.lirmm.fr/lorma/lorma-releases/wikis/home" rel="nofollow">https://gite.lirmm.fr/lorma/lorma-releases/wikis/home</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</guid>
	<pubDate>Fri, 19 Oct 2018 08:48:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</link>
	<title><![CDATA[Wtdbg2: a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore]]></title>
	<description><![CDATA[<p><span>Wtdbg2 is a&nbsp;</span><em>de novo</em><span>&nbsp;sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output. Wtdbg2 is able to assemble the human and even the 32Gb&nbsp;</span><a href="https://www.nature.com/articles/nature25458">Axolotl</a><span>&nbsp;genome at a speed tens of times faster than&nbsp;</span><a href="https://github.com/marbl/canu">CANU</a><span>&nbsp;and&nbsp;</span><a href="https://github.com/PacificBiosciences/FALCON">FALCON</a><span>while producing contigs of comparable base accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/ruanjue/wtdbg2" rel="nofollow">https://github.com/ruanjue/wtdbg2</a></p>]]></description>
	<dc:creator>Neel</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/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</guid>
	<pubDate>Sun, 22 Dec 2019 03:48:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</link>
	<title><![CDATA[SViper: Swipe your Structural Variants called on long (ONT/PacBio) reads with short exact (Illumina) reads.]]></title>
	<description><![CDATA[<p>Call sviper</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants
</code></pre>
<p>This will output a&nbsp;<code>polished_variants.vcf</code>&nbsp;file, that contains all the refined variants.</p>
<p>Sometimes it is helpful to look at the polished sequence, e.g. with the IGV browser. In that case you want SViper to output the polished and aligned sequences in a bam file via the option&nbsp;<code>--output-polished-bam</code>:</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants --output-</code>polished-bam</pre><p>Address of the bookmark: <a href="https://github.com/smehringer/SViper" rel="nofollow">https://github.com/smehringer/SViper</a></p>]]></description>
	<dc:creator>Neel</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/40946/free-genomics-data</guid>
	<pubDate>Fri, 07 Feb 2020 14:08:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40946/free-genomics-data</link>
	<title><![CDATA[Free Genomics data !]]></title>
	<description><![CDATA[<p><span>The specimens were collected by the Oxford Wytham Woods and Edinburgh Lohse lab teams. DNA extraction and sequencing was carried out by the Sanger Institute Scientific Operations teams. Assemblies were carried out by the Tree of Life team (Shane McCarthy) and colleagues in Pacific Biosciences (Jonas Korlach).</span></p>
<p><a href="https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/">https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/</a></p><p>Address of the bookmark: <a href="https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/" rel="nofollow">https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</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>

</channel>
</rss>