<?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/27113?offset=920</link>
	<atom:link href="https://bioinformaticsonline.com/related/27113?offset=920" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/7214/lapti-lab</guid>
  <pubDate>Thu, 12 Dec 2013 18:19:12 -0600</pubDate>
  <link></link>
  <title><![CDATA[LAPTI Lab]]></title>
  <description><![CDATA[
<p>The main theme of our research is the understanding of how genetic information is decoded from DNA into RNA and proteins. Someone may find this topic a little strange and argue that we already know how this is happening.</p>

<p>Translational recoding. </p>

<p>RNA editing. </p>

<p>Evolution of the genetic code and translation.</p>

<p>More at http://lapti.ucc.ie/research.html</p>

<p>Lab page http://lapti.ucc.ie/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26179/alignment-of-closely-related-whole-genomesscaffolds</guid>
	<pubDate>Fri, 29 Jan 2016 10:37:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26179/alignment-of-closely-related-whole-genomesscaffolds</link>
	<title><![CDATA[Alignment of closely related whole genomes/scaffolds]]></title>
	<description><![CDATA[<p>With the relative ease and low cost of current generation sequencing technologies has led to a dramatic increase in the number of sequenced genomes for species across the tree of life. This increasing volume of data requires tools that can quickly compare multiple whole-genome sequences, millions of base pairs in length, to aid in the study of populations, pan-genomes, and genome evolution.This bookmaks have been created to report new tools for whole genome alignments.</p>
<p>Please report new whole genome alignment tools under comment sections.</p><p>Address of the bookmark: <a href="http://www.cs.utoronto.ca/~brudno/721.full.pdf" rel="nofollow">http://www.cs.utoronto.ca/~brudno/721.full.pdf</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7362/junior-research-fellow-jrf-project-fellow-kalasalingam-university</guid>
  <pubDate>Thu, 19 Dec 2013 13:23:39 -0600</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow (JRF) / Project Fellow @ Kalasalingam University]]></title>
  <description><![CDATA[
<p>Applications are invited from interested candidates for the post of one Junior Research Fellow / Project Fellow on a purely temporary basis in a time bound research project (3 years) sponsored by Science and Engineering Research Board, Government of India, New Delhi.</p>

<p>Name of the fellowship: Junior Research Fellow (JRF) / Project Fellow</p>

<p>Title of the project: Genome-wide Mapping of Murine Specific Dengue T-cell Epitopes: Computational Prediction, Identification and use as Candidate Vaccines</p>

<p>Duration: 3 years</p>

<p>Fellowship: Rs. 18,000 for first 2 years and Rs. 20,000 for 3rdyear (for M.Tech. candidates)</p>

<p>Rs. 16,000 for first 2 years and Rs. 18,000 for 3rdyear (for M.Sc. candidates with NET qualification)</p>

<p>Rs. 8,000 for first 2 years and Rs. 10,000 for 3rdyear (for M.Sc. candidates without NET qualification)</p>

<p>Qualifications: M.Tech. in Biotechnology / M.Sc. in any branch of Life Sciences</p>

<p>Desirable Experience: Minimum of two years research experience in any of the following areas: Immunology / Microbiology / Gene Manipulation / Bioinformatics</p>

<p>Interested and eligible candidates may apply with their resume along with relevant documents and a passport size photograph to the Principal Investigator by post (or e-mail) on or before December 31, 2013. Only short listed candidates will be called for written test and/or interview. Selected candidate may register for PhD in Kalasalingam University. No TA/DA will be paid for attending interview.</p>

<p>Dr. K. Sundar<br />Principal Investigator (SERB Project)<br />Department of Biotechnology<br />Kalasalingam University<br />Krishnankoil – 626126, Tamil Nadu<br />sundarkr@klu.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7567/asst-professor-jaipur-national-university</guid>
  <pubDate>Fri, 27 Dec 2013 19:54:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[Asst. Professor @ JAIPUR NATIONAL UNIVERSITY]]></title>
  <description><![CDATA[
<p>JAIPUR NATIONAL UNIVERSITY</p>

<p>Established by Government of Rajasthan</p>

<p>Approved by UGC under Sec 2(f) of UGC Act 1956</p>

<p>ADVERTISEMENT FOR FACULTY POSITION AT JAIPUR NATIONAL UNIVERSITY,JAIPUR</p>

<p>Jaipur National University, Jaipur is a premier centre of learning, providing various integrated and interdisciplinary programmes of study and research in the country. With the opening of the School of Distance Education &amp; Learning, JNU has taken education to the doorsteps of those aspirants who, for some reason, could not be a part of regular stream of education. In this era of competition &amp; ambition for excellence, it has become imperative to have quality education &amp; an alert mind coupled with the right attitude to carry onself, and for this, JNU happens to be the most sought after destination.</p>

<p>School Of Life Sciences: Bioinformatics, Chemistry</p>

<p>Total no of Post: 04</p>

<p>Education:</p>

<p>PG – M.Sc /M.Tech Bioinformatics</p>

<p>PG – M.Sc /M.Tech Chemistry</p>

<p>Experience:</p>

<p>Candidate with 1-2 years of teaching experience in college/ University will be preffered. Freshers may also apply.</p>

<p>Compensation: Compensation will not be a problem for the right candidate</p>

<p>HOW TO APPLY:</p>

<p>SEND THE UPDATED RESUME THROUGH MAIL OR POST AT</p>

<p>dsbhatia5@yahoo.com</p>

<p>contact no: 7568246839</p>

<p>Website: http://www.jnujaipur.ac.in</p>

<p>Please mail your resume to Prof.D.S.Bhatia</p>

<p>Email Address: dsbhatia5@yahoo.com</p>

<p>Ph:, +917568246839</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7933/senior-programmer-biotech-park</guid>
  <pubDate>Mon, 20 Jan 2014 04:50:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[SENIOR PROGRAMMER @ Biotech Park]]></title>
  <description><![CDATA[
<p>Advt. No. (1)/BP/2014<br />A walk-in-interview will be held in the Biotech Park Office at Sector G, Jankipuram, Kursi Road, Lucknow (U.P.) January 31, 2014 at 11.00 A.M. for the following posts of DBT sponsored project tenable at Biotech Park. Interested candidates fulfilling the requisite qualifications, experience and age as given below, on the date of interview, may appear before the Selection Committee. The candidate will have to join immediately. Appointment will be made initially for six months extendable on satisfactory performance till the duration of the project.<br />INTERVIEW ON January 31, 2014 at 11.00 A.M.<br /> <br />SENIOR PROGRAMMER (ONE POST)<br />Educational Qualification<br />M.Sc./B. Tech Bioinformatics with minimum 60% marks with two years of relevant experience	<br />Job Requirement	<br />Development of databases in multi user environment and application softwares, updating and maintenance of website, Drug designing and QSAR study etc.<br />Desirable<br />Knowledge of Bioinformatics tools, Windows, Linux, C++, JAVA / JAVA Script, Visual Basic, CGI, DBMS/RDBMS and HTML. Experience in various domains of bioinformatics such as structure based drug designing, Newtonian dynamics and QSAR studies.<br />Age<br />Below 35 years (as on the date of interview)<br />Emoluments<br />Rs. 12,000/- per month fixed.<br />Note: All the candidates should report for interview on or before 10.30 A.M<br />General Conditions<br />The aforesaid positions are purely temporary and do not give the incumbent any right whatsoever for appointment on regular basis.<br />The applicant will have to submit typed and duly signed application on plain paper on the day of interview stating:<br />    (a) Advertisement No.<br />    (b) Position applied for<br />    (c) Name of Applicant (in Block letters)<br />    (d) Father’s Name<br />    (e) Date of Birth<br />    (f) Sex<br />    (g) Age as on the date of interview (dd / mm / yy )<br />    (h) Address (Permanent &amp; correspondence)<br />    (i) Educational Qualifications (High School onwards) with examination passed, year, % marks, subjects<br />    (j) Employment experience, if any i.e. Name of employer, nature of employment, date of joining and leaving.<br />Applications must be accompanied by a latest passport size photograph and attested copies of certificates<br />Original certificates/degree and testimonials should be produced by the candidate for verification at the time of interview.</p>

<p>Tenure: Initially upto six months and extendable based on performance.<br />The upper age limit can be relaxed up to 5 years in the case of applicant belonging to SC/ST/Woman/Physically handicapped and 3 years for OBCs.<br />No TA/DA will be paid for attending the interview.<br />More at http://www.biotechpark.org.in/index1.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8384/post-doc-in-genomics-of-fungi</guid>
  <pubDate>Tue, 18 Feb 2014 13:47:08 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post-doc in Genomics of Fungi]]></title>
  <description><![CDATA[
<p>Post-doc in Genomics of Fungi</p>

<p>Fungi are of central importance for the global carbon cycle because of<br />their role in the degredation of complex organic matter such as plant<br />material. Fungi also represent one of the last frontiers of<br />biodiversity, as their taxonomic diversity and metabolic potential<br />remain poorly understood. This is particularly true for those fungi that<br />are abundant in freshwaters.</p>

<p>\"MycoLink\" (Linking aquatic mycodiversity to ecosystem function) is an interdisciplinary project integrating the expertise of 4 Leibniz Institutes: IGB, ZALF, DSMZ, the Leibniz-Institute of Freshwater Ecology and Inland Fisheries (IGB), the Leibniz Centre for Agricultural Landscape Research (ZALF), and the Leibniz-Institute of Zoo- and Wildlife Research in Berlin (IZW). We are seeking to recruit outstanding young scientists to establish an innovative research program, and currently invite applications for:</p>

<p>PostDoc will focus on global biodiversity and evolutionary genomics of freshwater fungi, using second- and third-generation sequencing and bioinformatics to analyse natural populations and experimental cultures. For further information, contact Michael T. Monaghan (monaghan@igb-berlin.de) (http://monaghanlab.org).</p>

<p>PostDoc will focus on the ecological and functional role of aquatic fungi by combining state-of-the-art biochemical analyses with modeling in experimental and natural ecosystems. For further information, contact Hans-Peter Grossart &amp; Katrin Premke (hgrossart@igb-berlin.de; premke@igb-berlin.de)</p>

<p>Applicants must hold a PhD in a relevant field. Positions are available for up to three years. Salary is according to the German TvD. Positions will be based at IGB Berlin, IGB Neuglobsow, and at the Berlin Centre for Genomics in Biodiversity Research. The institutes of the Leibniz Association strive to increase the proportion of female scientists. Therefore, female candidates are specifically encouraged to apply. Disabled applicants with identical technical and personal qualification will be preferentially selected.</p>

<p>Please submit a curriculum vitae (including publication list), a brief statement of motivation and research interests, and the names and contact information of two referees. Please send all documents as a single pdf file to monaghan@igb-berlin.de. </p>

<p>Review of the applications will start on 21 February 2014 and continue until the positions are filled. Interviews for shortlisted applicants will take place in March.</p>

<p>Biodiversity, Ecology, and Genomics of Aquatic Fungi<br />Leibniz-Institute of Freshwater Ecology and Inland Fisheries (IGB), Berlin, Germany</p>

<p>Deadline for applications : unknown.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37257/asar-advanced-metagenomic-sequence-analysis-in-r</guid>
	<pubDate>Mon, 09 Jul 2018 05:20:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37257/asar-advanced-metagenomic-sequence-analysis-in-r</link>
	<title><![CDATA[ASAR: Advanced metagenomic Sequence Analysis in R]]></title>
	<description><![CDATA[<p><span>An interactive data analysis tool for selection, aggregation and visualization of metagenomic data is presented. Functional analysis with a SEED hierarchy and pathway diagram based on KEGG orthology based upon MG-RAST annotation results is available.</span></p>
<p><span><span>To read the manual, please click the link&nbsp;</span><a href="https://askarbek-orakov.github.io/ASAR/">https://askarbek-orakov.github.io/ASAR/</a></span></p><p>Address of the bookmark: <a href="https://github.com/Askarbek-orakov/ASAR" rel="nofollow">https://github.com/Askarbek-orakov/ASAR</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8122/internships-indian-institute-of-science</guid>
  <pubDate>Sun, 02 Feb 2014 03:05:58 -0600</pubDate>
  <link></link>
  <title><![CDATA[Internships @ Indian Institute of Science]]></title>
  <description><![CDATA[
<p>Internships available for Bachelors and Masters students</p>

<p>Each node will host student interns interested in pursuing a research career in mathematical or computational biology at institutions located in its region.</p>

<p>Eligibility: Bachelors (3rd or 4th year) and Masters students</p>

<p>Average duration: 3 months (could be more in certain cases). These internships can be availed at any time during 2014 subject to consent from the faculty mentor.</p>

<p>Fellowship amount: Rs. 10,000 per month. In addition, outstation interns can receive up to Rs. 5000 per month for accommodation and Rs. 3000 for travel from and to their home place.</p>

<p>Application procedure: Apply online at http://nnmcb.appzone.co.in/</p>

<p>Deadline: February 10, 2014</p>

<p>Contact Information:</p>

<p>National Network for Mathematical and Computational Biology</p>

<p>Department of Mathematics</p>

<p>Indian Institute of Science</p>

<p>Bangalore 560 012</p>

<p>Tel: 080-2293 2893</p>

<p>Email: nnmcb@math.iisc.ernet.in</p>
]]></description>
</item>

</channel>
</rss>