<?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/30002?offset=1480</link>
	<atom:link href="https://bioinformaticsonline.com/related/30002?offset=1480" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</guid>
	<pubDate>Mon, 09 Jul 2018 05:27:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</link>
	<title><![CDATA[Epiviz: an interactive visualization tool for functional genomics data.]]></title>
	<description><![CDATA[<p><span>Epiviz is an interactive visualization tool for functional genomics data. It supports genome navigation like other genome browsers, but allows multiple visualizations of data within genomic regions using scatterplots, heatmaps and other user-supplied visualizations. It also includes data from the&nbsp;</span><a href="http://barcode.luhs.org/" target="_blank">Gene Expression Barcode project</a><span>&nbsp;for transcriptome visualization. It has a flexible plugin framework so users can add</span><a href="http://d3js.org/" target="_blank">d3</a><span>&nbsp;visualizations. You can see a video tour&nbsp;</span><a href="http://youtu.be/099c4wUxozA" target="_blank">here</a><span>.</span></p>
<p><span>https://bioconductor.org/packages/release/bioc/html/epivizr.html</span></p>
<p><span>https://github.com/epiviz</span></p>
<p><span>https://github.com/epiviz/epiviz</span></p><p>Address of the bookmark: <a href="https://epiviz.github.io/" rel="nofollow">https://epiviz.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10925/a-brief-bioinformatics-tutorial</guid>
	<pubDate>Wed, 21 May 2014 12:50:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10925/a-brief-bioinformatics-tutorial</link>
	<title><![CDATA[A Brief Bioinformatics Tutorial]]></title>
	<description><![CDATA[<p>This is about how to use a computer to find what is known about a gene of interest and also how to get new insights about it.</p>
<p>The tutorial is divided in three main parts:</p>
<ul>
<li>In the <strong>Sequence </strong>part, you will see how to look efficiently for a particular protein sequence, how to blast it against the database of your choice to find homologues, how to perform a multiple alignment of the homologues you've selected and how to edit this alignment.</li>
<li>The <strong>Structure </strong>part is about molecular visualization, homology modeling and structural domain prediction.</li>
<li>In the <strong>Function </strong>part, you will be introduced to you 3 useful servers to investigate the function of a protein. i.e. finding interactors, co-expressed genes, see a phylogenetic profile, easily access papers citing your gene etc ...</li>
</ul>
<p>During all the three parts, we will use the <em>S. cerevisiae </em>VPS36 protein as an example.</p><p>Address of the bookmark: <a href="http://www.mrc-lmb.cam.ac.uk/rlw/text/bioinfo_tuto/introduction.html" rel="nofollow">http://www.mrc-lmb.cam.ac.uk/rlw/text/bioinfo_tuto/introduction.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/opportunity/view/11035/bioinformatics-jrfsrf-position-at-nii</guid>
  <pubDate>Sun, 25 May 2014 16:54:04 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/SRF position at NII]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF IMMUNOLOGY, NEW DELHI-110067</p>

<p>Applications are invited for the position of Senior Research Fellow for the following time-bound sponsored project as per the details given below:</p>

<p>1. BTIS project on, “Bioinformatics Center-National Infrastructural Facility in the Area of Immunology” funded by DBT</p>

<p>Senior Research Fellow (P) (One Position only)</p>

<p>Dr. Debasisa Mohanty<br />Staff Scientist-VI<br />deb@nii.res.in</p>

<p>Qualifications: M.Sc in Biological Sciences or Biotechnology with at least 04 years of Research experience in Bioinformatics or computational Biology after the master’s degree is essential.</p>

<p>Emoluments: The selected candidates will draw consolidated emoluments as per Institute Rules, depending upon qualifications &amp; experience</p>

<p>Rs. 18,000/- per month consolidated plus 30% HRA if Leading to Ph.D/NET/GATE Qualified otherwise Rs. 14,000/- per month + 30% HRA.</p>

<p>Job description: The candidate should be well versed in programming in PERL/C++/HTML/CGI, web server and portal development, computational analysis of<br />protein structure &amp; function, molecular dynamics simulations and use of high performance computing systems.</p>

<p>GENERAL TERMS AND CONDITIONS:-</p>

<p>1. The candidates selected for the above posts will be on contract for one year or duration of the project whichever is shorter, at a time.<br />2. No hostel/ housing facility will be provided.<br />3. Number of posts may vary and shall be need based. Advertisement is no commitment.<br />4. Applicants may clearly mention the category they belong to i.e. SC/ST/OBC/PH and attach documentary proof of the same.<br />5. No TA/DA will be paid for attending the interview, if called for.<br />6. Apart from sending application in the prescribed format given below, candidates should send complete Curriculum Vitae along with the names of three referees. Curriculum Vitae should contain details of the experimental expertise.</p>

<p>HOW TO APPLY Interested candidates may apply directly, STRICTLY IN THE PRESCRIBED FORMAT GIVEN BELOW, through e-mail, to the Investigator of the project, clearly indicating the name of the project along with their complete C.V., e-mail id, fax numbers, telephone numbers. Only Short listed candidates will be called for interview and they required to submit attested copies of all their certificates and a Demand Draft of Rs 100/- drawn on Canara Bank or Indian Bank payable at Delhi/New Delhi in favour of the Director, NII (SC / ST and PH candidates are exempted subject to submission of documentary proof), at the time of interview.</p>

<p>LAST DATE OF RECEIPT OF APPLICATIONS: 06th June, 2014</p>

<p>Advertisement</p>

<p>www1.nii.res.in/sites/default/files/projectappointment-Dr.Mohanty-6June2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</guid>
	<pubDate>Sun, 23 Sep 2018 05:12:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</link>
	<title><![CDATA[rHAT: a seed-and-extension-based noisy long read alignment tool]]></title>
	<description><![CDATA[<p><span>rHAT is a seed-and-extension-based noisy long read alignment tool. It is suitable for aligning 3rd generation sequencing reads which are in large read length with relatively high error rate, especially Pacbio's Single Molecule Read-time (SMRT) sequencing reads.</span></p><p>Address of the bookmark: <a href="https://github.com/dfguan/rHAT" rel="nofollow">https://github.com/dfguan/rHAT</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13014/bioinformatics-jrf-vacancy-at-icgeb-new-delhi</guid>
  <pubDate>Wed, 23 Jul 2014 16:07:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF vacancy at ICGEB, New Delhi]]></title>
  <description><![CDATA[
<p>Junior Research Fellow for a DBT sponsored project entitled "Computational and experimental characterization of stage specific arginine methylation in P. falciparum proteome". </p>

<p>Candidates should have a 1st class MSc/MTech/BTech degree in Bioinformatics. Please send complete CV, quoting Application for RMETH-JRF-2014, by email to Dr. Dinesh Gupta: dinesh@icgeb.res.in</p>

<p>Closing date for applications: 6 August 2014</p>

<p>More at http://www.icgeb.org/tl_files/Vacancies/JRF.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38041/synima-a-synteny-imaging-tool-for-annotated-genome-assemblies</guid>
	<pubDate>Tue, 30 Oct 2018 10:49:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38041/synima-a-synteny-imaging-tool-for-annotated-genome-assemblies</link>
	<title><![CDATA[Synima: a Synteny imaging tool for annotated genome assemblies]]></title>
	<description><![CDATA[<p><span>Synima written in Perl, which uses the graphical features of R. Synima takes orthologues computed from reciprocal best BLAST hits or OrthoMCL, and DAGchainer, and outputs an overview of genome-wide synteny in PDF. Each of these programs are included with the Synima package, and a pipeline for their use. Synima has a range of graphical parameters including size, colours, order, and labels, which are specified in a config file generated by the first run of Synima &ndash; and can be subsequently edited. Synima runs quickly on a command line to generate informative and publication quality figures. Synima is open source and freely available from&nbsp;</span><a href="https://github.com/rhysf/Synima" target="_blank">https://github.com/rhysf/Synima</a><span>&nbsp;under the MIT License.</span></p><p>Address of the bookmark: <a href="https://github.com/rhysf/Synima" rel="nofollow">https://github.com/rhysf/Synima</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11313/linux-sort-commands-for-bioinformatics</guid>
	<pubDate>Sat, 31 May 2014 15:41:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11313/linux-sort-commands-for-bioinformatics</link>
	<title><![CDATA[Linux Sort Commands for Bioinformatics]]></title>
	<description><![CDATA[<p>Almost all the scripting languages such as Perl, Python etc have built-in sort, but unfortunately none of them are as flexible as sort command. But one when it come to space efficiency GNU sort stands at the top. It can sort a 20Gb file with less than 2Gb memory. It is not trivial to implement so powerful a sort by yourself.</p><p>sort a space-delimited file based on its first column, then the second if the first is the same, and so on:<br />sort input.txt</p><p>sort a huge file (GNU sort ONLY):<br />sort -S 1500M -t $HOME/tmp input.txt &gt; sorted.txt</p><p>sort starting from the third column, skipping the first two columns:<br />sort +2 input.txt</p><p>sort the second column as numbers, descending order; if identical, sort the 3rd as strings, ascending order:<br />sort -k2,2nr -k3,3 input.txt</p><p>sort starting from the 4th character at column 2, as numbers:<br />sort -k2.4n input.txt</p><p>More Linxu sort command information<br /><br />If you have any sort commands you'd like to share, please add them to our comments section below. For more help, you can also type:<br /><br />man sort<br /><br />or<br /><br />sort --help<br /><br />on your Unix/Linux system.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38749/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</guid>
	<pubDate>Sun, 20 Jan 2019 06:34:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38749/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</link>
	<title><![CDATA[ClipCrop: a tool for detecting structural variations with single-base resolution using soft-clipping information]]></title>
	<description><![CDATA[<p><span>ClipCrop for detecting SVs with single-base resolution using soft-clipping information. A soft-clipped sequence is an unmatched fragment in a partially mapped read. To assess the performance of ClipCrop with other SV-detecting tools, we generated various patterns of simulation data &ndash; SV lengths, read lengths, and the depth of coverage of short reads &ndash; with insertions, deletions, tandem duplications, inversions and single nucleotide alterations in a human chromosome.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/shinout/clipcrop" rel="nofollow">https://github.com/shinout/clipcrop</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40359/minipolish-a-tool-for-racon-polishing-of-miniasm-assemblies</guid>
	<pubDate>Tue, 03 Dec 2019 02:40:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40359/minipolish-a-tool-for-racon-polishing-of-miniasm-assemblies</link>
	<title><![CDATA[Minipolish: A tool for Racon polishing of miniasm assemblies]]></title>
	<description><![CDATA[<p><a href="https://github.com/lh3/miniasm">Miniasm</a>&nbsp;is a great long-read assembly tool: straight-forward, effective and very fast. However, it does not include a polishing step, so its assemblies have a high error rate &ndash; they are essentially made of stitched-together pieces of long reads.</p>
<p><a href="https://github.com/isovic/racon">Racon</a>&nbsp;is a great polishing tool that can be used to clean up assembly errors. It's also very fast and well suited for long-read data. However, it operates on FASTA files, not the&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA graphs</a>&nbsp;that miniasm makes.</p>
<p>That's where Minipolish comes in. With a single command, it will use Racon to polish up a miniasm assembly, while keeping the assembly in graph form.</p>
<p>It also takes care of some of the other nuances of polishing a miniasm assembly:</p>
<ul>
<li>Adding read depth information to contigs</li>
<li>Fixing sequence truncation that can occur in Racon</li>
<li>Adding circularising links to circular contigs if not already present (so they display better in&nbsp;<a href="https://github.com/rrwick/Bandage">Bandage</a>)</li>
<li>'Rotating' circular contigs between polishing rounds to ensure clean circularisation</li>
</ul><p>Address of the bookmark: <a href="https://github.com/rrwick/Minipolish" rel="nofollow">https://github.com/rrwick/Minipolish</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>