<?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/27090?offset=1490</link>
	<atom:link href="https://bioinformaticsonline.com/related/27090?offset=1490" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21894/bioinformatics-engineer-algorithm-development</guid>
  <pubDate>Wed, 01 Apr 2015 21:39:05 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Engineer -- Algorithm Development]]></title>
  <description><![CDATA[
<p>Centrillion Biosciences is a venture backed life sciences company located in Palo Alto, California. The company provides high quality genomic services to academic and industrial customers including top universities and research institutes. Centrillion Biosciences has an immediate opening for a full-time Bioinformatics Engineer. We're looking for an energetic, innovative, and motivated person who works well independently and on teams. The ideal candidate will have experience designing and implementing efficient algorithms to process large datasets. The role will involve collaborating with research scientists and other engineers, so strong communication skills are a must.</p>

<p>Job Description</p>

<p>• Work within a fast-paced, collaborative environment with small project teams working on a variety of tasks ranging from new product development to DNA data processing<br />• Collaborate with Centrillion research scientists in order to bridge the gap between the laboratory and the digital world<br />• Develop tools to enable research projects to cope with the enormous amounts of data produced by modern DNA sequencing experiments<br />• Build simulation algorithms to help guide and analyze research done in the lab<br />• Solve challenging engineering problems that require the development of innovative algorithms</p>

<p>Requirements</p>

<p>• Strong background in mathematics/statistics with a degree in a related field<br />• Strong analytical, coding, communication, and organizational skills<br />• Experience with algorithm development, simulations, and data analysis<br />• Proficiency in at least one modern programming language (like Python or Perl)<br />• Experience analyzing genetic and biological data sets (e.g., DNA data analysis and image analysis)<br />• Experience with machine learning and pattern recognition is preferred</p>

<p>Please submit your resume at https://www.centrillionbio.com/career/ to apply for this position.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:39:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</link>
	<title><![CDATA[SeqMonk:A tool to visualise and analyse high throughput mapped sequence data]]></title>
	<description><![CDATA[<p>SeqMonk is a program to enable the visualisation and analysis of mapped sequence data. It was written for use with mapped next generation sequence data but can in theory be used for any dataset which can be expressed as a series of genomic positions. It's main features are:</p>
<ul>
<li>Import of mapped data from mapped data (BAM/SAM/bowtie etc)</li>
<li>Creation of data groups for visualisation and analysis</li>
<li>Visualisation of mapped regions against an annotated genome.</li>
<li>Flexible quantitation of the mapped data to allow comparisons between data sets</li>
<li>Statistical analysis of data to find regions of interest</li>
<li>Creation of reports containing data and genome annotation</li>
</ul><p>Address of the bookmark: <a href="http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/" rel="nofollow">http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22283/iihr-recruitment-2015-%E2%80%93-srf-project-asst-research-associate-posts</guid>
  <pubDate>Wed, 06 May 2015 06:13:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[IIHR Recruitment 2015 – SRF, Project Asst &amp; Research Associate Posts]]></title>
  <description><![CDATA[
<p>IIHR Recruitment 2015 – SRF, Project Asst &amp; Research Associate Posts: ICAR-Indian Institute of Horticultural Research (IIHR) has published a notification for the recruitment of Senior Research Fellow, Project Assistant and Research Associate vacancies on temporary basis. Eligible candidates may apply in prescribed application format on or before 15-05-2015. Other details like age, educational qualification, selection process, how to apply are given below…</p>

<p>IIHR Vacancy Details:<br />Total No. of Posts: 14<br />Name of the Post:<br />1. Senior Research Fellow: 12 Posts<br />2. Project Assistant: 01 Post<br />3. Research Associate: 01 Post</p>

<p>Age Limit: Candidates age limit is 40 years for men &amp; 45 years for women for RA post, 35 years for men &amp; 40 years for women for SRF post, 30 years for men &amp; 35 years for women for JRF post and 21 to 40 years for Other as on closing date of receipt of applications. Age relaxation is applicable as per rules.</p>

<p>Educational Qualification: Candidates should possess M.Sc (Ag) Plant Pathology or Microbiology or Biotechnology or Biochemistry or M.Tech (Ag) or Bioinformatics for SRF Posts, 10th class with experience in workshop (welding fitting) for Project Asst Post and M.Sc (Ag) Plant Pathology or M.Sc (Ag) Biotechnology or Ph.D in Plant Pathology or Agricultural Biotechnology for RA Post.</p>

<p>Selection Process: Candidates will be selected based on their performance in interview.</p>

<p>How to Apply: Eligible candidates may send their application in the prescribed format along with attested copies of relevant certificates and should mention name of PI/ Co-PI, Item No. of the Post &amp; name of the post clearly on the application as well as on the cover to the Concerned PI/ Co-PI, Indian Institute of Horticultural Research, Hessaraghatta Lake Post, Bengaluru-560089 on or before 15-05-2015 and attend the interview along with originals, two passport size photographs on 26 &amp; 27-05-2015 from 10:00 AM Onwards.</p>

<p>Important Dates:<br />Last Date for Receipt of Applications: 15-05-2015.<br />Date &amp; Time of Interview: 26 &amp; 27-05-2015 from 10:00 AM Onwards.<br />Venue: IIHR Campus.</p>

<p>More at http://www.iihr.ernet.in/content/srf-jrf-application-format</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38449/koala-keggs-internal-annotation-tool-for-k-number-assignment-of-kegg-genes-using-ssearch-computation</guid>
	<pubDate>Wed, 12 Dec 2018 09:16:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38449/koala-keggs-internal-annotation-tool-for-k-number-assignment-of-kegg-genes-using-ssearch-computation</link>
	<title><![CDATA[KOALA: KEGG&#039;s internal annotation tool for K number assignment of KEGG GENES using SSEARCH computation]]></title>
	<description><![CDATA[<p>KOALA (KEGG Orthology And Links Annotation) is KEGG's internal annotation tool for&nbsp;<a href="https://www.kegg.jp/kegg/ko.html">K number</a>&nbsp;assignment of KEGG GENES using SSEARCH computation. BlastKOALA and GhostKOALA assign K numbers to the user's sequence data by&nbsp;<a href="http://www.ncbi.nlm.nih.gov/blast/">BLAST</a>&nbsp;and&nbsp;<a href="http://www.bi.cs.titech.ac.jp/ghostx/">GHOSTX</a>&nbsp;searches, respectively, against a nonredundant set of KEGG GENES. Annotate Sequence in KEGG Mapper and Pathogen Checker in KEGG Pathogen are special interfaces to the BlastKOALA server and can be executed in an interactive mode. &nbsp;&nbsp; See&nbsp;<a href="https://www.kegg.jp/blastkoala/help_blastkoala.html" target="_blastkoala">Step-by-step Instructions</a>.</p>
<div>Reference: Kanehisa, M., Sato, Y., and Morishima, K. (2016) BlastKOALA and GhostKOALA: KEGG tools for functional characterization of genome and metagenome sequences. J. Mol. Biol. 428, 726-731. [<a href="http://www.ncbi.nlm.nih.gov/pubmed/26585406">pubmed</a>] [<a href="https://doi.org/10.1016/j.jmb.2015.11.006">pdf</a>]</div><p>Address of the bookmark: <a href="https://www.kegg.jp/blastkoala/" rel="nofollow">https://www.kegg.jp/blastkoala/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22017/binc-2015</guid>
	<pubDate>Sat, 11 Apr 2015 20:35:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22017/binc-2015</link>
	<title><![CDATA[BINC 2015 !!!]]></title>
	<description><![CDATA[<p>Pondicherry University,Puducherry,on behalf of Department of Biotechnology, Government of India, will conduct the BINC examination in2015. The objective of this examination is to certify bioinformatics professionals, trained formally as well as self-trained.Registration will open from March 9,2015 to April 30,2015. Pondicherry University, Puducherry has been identified as a nodal agency by the Department of Biotechnology, Govt. of India to coordinate this examination along with nine centres namely, Pune University, Pune; Anna University, Chennai; Calcutta University, Kolkata; Institute of Bioinformatics &amp; Applied Biotechnology, Bangalore; North-Eastern Hill University, Shillong, University of Hyderabad, Hyderabad; University of Kerala, Thiruvananthapuram; Jawaharlal Nehru University, New Delhi and Assam Agricultural University, Guwahati. In the BINC 2013 examination,17 candidates were certified. DBT has agreed to fund Research fellowships for all the BINC qualified Indian nationals to pursue Ph.D. in Indian Institutes/Universities. Note that the candidate must possess a postgraduate degree(or equivalent) &amp; meet the criteria of the institutes/universities in order to avail research fellowship. In addition, cash prize of Rs. 10,000/- will be awarded to the top 10 BINC qualifiers.</p><p>More at http://www.binc.co.in/College/Index_New.aspx</p><p>BINC notification http://www.binc.co.in/PdfDocuments/Notification.pdf</p><p>Few dates to remember:</p><p>Starting of online submission of application: March 9, 2015<br />Last date for submission of application: April 30,2015<br />Examination consists of two parts:<br />Part I (Paper I) : June 7, 2015 (10 AM-12 PM)<br />Part II ( Paper II &amp; III) :June 28, 2015 (9 AM-12 PM &amp; 2 PM-4 PM)</p>]]></description>
	<dc:creator>Rahul Nayak</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22040/karpagam-university-coimbatore-of-sr-prof-prof-associate-and-assistant-professors-karpagam-university-coimbatore-coimbatore-tamil-nadu</guid>
  <pubDate>Thu, 16 Apr 2015 00:30:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[Karpagam University, Coimbatore, of Sr. Prof, Prof, Associate and Assistant Professors Karpagam University, Coimbatore - Coimbatore, Tamil Nadu]]></title>
  <description><![CDATA[
<p>Karpagam University, Coimbatore, Recruitment of Sr. Prof, Prof, Associate and Assistant Professors</p>

<p>Name of the College: Karpagam University, Coimbatore</p>

<p>Date of official publication: 15th April 2015</p>

<p>The newspaper wherein this job advertised: The Hindu Newspaper</p>

<p>Name of the posts: Senior Professors, Professors, Associate Professors and Assistant Professors</p>

<p>Departments:<br />Bioinformatics<br />Biotechnology<br />Qualifications/Eligibility: The candidates should have qualifications as M.E/M.Tech/M.A/M.Com/MBA/M.Sc/M.Phil/NET/SLET/Ph.D</p>

<p>Job Location: Coimbatore, TN</p>

<p>Salary: As per college norms</p>

<p>How to apply: Interested and eligible candidates are requested to apply online at http://www.karpagamuniversity.edu.in/career</p>

<p>Last date: As soon as possible from 15th April 2015</p>

<p>Reference: The Hindu Newspaper dated 15-04-2015, Coimbatore edition on 14th page</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</guid>
	<pubDate>Mon, 17 Feb 2020 05:38:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</link>
	<title><![CDATA[Chromonomer: a tool set for repairing and enhancing assembled genomes through integration of genetic maps and conserved synteny]]></title>
	<description><![CDATA[<p>Chromonomer is a program designed to integrate a genome assembly with a genetic map. Chromonomer tries very hard to identify and remove markers that are out of order in the genetic map, when considered against their local assembly order; and to identify scaffolds that have been incorrectly assembled according to the genetic map, and split those scaffolds.</p><p>Address of the bookmark: <a href="http://catchenlab.life.illinois.edu/chromonomer/" rel="nofollow">http://catchenlab.life.illinois.edu/chromonomer/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22053/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:16:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22053/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper. Wish you all the best for BINC examination.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22053" length="4041" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41686/catbat-tool-for-taxonomic-classification-of-contigs-and-metagenome-assembled-genomes-mags</guid>
	<pubDate>Mon, 18 May 2020 10:53:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41686/catbat-tool-for-taxonomic-classification-of-contigs-and-metagenome-assembled-genomes-mags</link>
	<title><![CDATA[CAT/BAT: tool for taxonomic classification of contigs and metagenome-assembled genomes (MAGs)]]></title>
	<description><![CDATA[<p>Contig Annotation Tool (CAT) and Bin Annotation Tool (BAT) are pipelines for the taxonomic classification of long DNA sequences and metagenome assembled genomes (MAGs/bins) of both known and (highly) unknown microorganisms, as generated by contemporary metagenomics studies. The core algorithm of both programs involves gene calling, mapping of predicted ORFs against the nr protein database, and voting-based classification of the entire contig / MAG based on classification of the individual ORFs. CAT and BAT can be run from intermediate steps if files are formated appropriately (see <a href="https://github.com/dutilh/CAT#usage">Usage</a>).</p><p>Address of the bookmark: <a href="https://github.com/dutilh/CAT" rel="nofollow">https://github.com/dutilh/CAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>