<?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/32154?offset=400</link>
	<atom:link href="https://bioinformaticsonline.com/related/32154?offset=400" 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/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</guid>
	<pubDate>Tue, 07 Nov 2017 04:36:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</link>
	<title><![CDATA[Meraculous: De Novo Genome Assembly with Short Paired-End Reads]]></title>
	<description><![CDATA[<p><span>We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast&nbsp;</span><em>Pichia stipitis</em><span>. More than 95% of the genome is recovered, with no errors; half the assembled sequence is in contigs longer than 101 kilobases and in scaffolds longer than 269 kilobases. Incorporating fosmid ends recovers entire chromosomes. Meraculous relies on an efficient and conservative traversal of the subgraph of the&nbsp;</span><em>k</em><span>-mer (deBruijn) graph of oligonucleotides with unique high quality extensions in the dataset, avoiding an explicit error correction step as used in other short-read assemblers. A novel memory-efficient hashing scheme is introduced. The resulting contigs are ordered and oriented using paired reads separated by &sim;280 bp or &sim;3.2 kbp, and many gaps between contigs can be closed using paired-end placements. Practical issues with the dataset are described, and prospects for assembling larger genomes are discussed.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/</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/37746/funannotate-eukaryotic-genome-annotation-pipeline</guid>
	<pubDate>Wed, 19 Sep 2018 07:47:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37746/funannotate-eukaryotic-genome-annotation-pipeline</link>
	<title><![CDATA[funannotate: Eukaryotic Genome Annotation Pipeline]]></title>
	<description><![CDATA[<p><span>Funannotate is a genome prediction, annotation, and comparison software package. It was originally written to annotate fungal genomes (small eukaryotes ~ 30 Mb genomes), but has evolved over time to accomodate larger genomes. The impetus for this software package was to be able to accurately and easily annotate a genome for submission to NCBI GenBank. Existing tools (such as Maker) require significant manually editing to comply with GenBank submission rules, thus funannotate is aimed at simplifying the genome submission process.</span></p><p>Address of the bookmark: <a href="https://github.com/nextgenusfs/funannotate" rel="nofollow">https://github.com/nextgenusfs/funannotate</a></p>]]></description>
	<dc:creator>Jit</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/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/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/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/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/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>

</channel>
</rss>