<?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/29912?offset=1410</link>
	<atom:link href="https://bioinformaticsonline.com/related/29912?offset=1410" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22297/appointment-of-two-traineeships-and-two-studentships-in-bioinformatics</guid>
  <pubDate>Fri, 08 May 2015 00:24:20 -0500</pubDate>
  <link></link>
  <title><![CDATA[Appointment of two traineeships and two studentships in Bioinformatics]]></title>
  <description><![CDATA[
<p>Applications are invited for the appointment of two traineeships and two studentships in Bioinformatics for a period of six months sponsored by Department of Biotechnology, Government of India in the Bioinformatics Sub-DIC, Saraswathy Thangavelu Centre, JNTBGRI, Puthenthope, Thiruvananthapuram 695 586. The required qualifications and other details are given below.</p>

<p>Position 1: Traineeship<br />Monthly fellowship (in rupee): 5,000/-<br />No. of vacancies: Two<br />Required Qualification: First Class M.Sc Bioinformatics/ Biotechnology/ Botany</p>

<p>Position 2: Studentship<br />Monthly fellowship (in rupee): 5,000/-<br />No. of vacancies: Two<br />Required Qualification: M.Phil/M.Tech Bioinformatics/ Biotechnology/ any branch of Life Science students for doing their thesis work in the area of Bioinformatics.</p>

<p>Age limit as on 1.1.2015, 28 years. Age relaxation will be provided for SC, ST, OBC candidates as per Govt. norms.</p>

<p>Interested candidates may appear for walk-in-interview on 15th May 2015 at 10.30 am at JNTBGRI, Palode, Thiruvananthapuram. The candidate should report to the Office at Palode before 10.00 am.</p>

<p>More at http://jntbgri.res.in/news/appointment-of-two-traineeships-and-two-studentships-in-bioinformatics/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/22393/narcis-fernandez-fuentes-lab</guid>
  <pubDate>Mon, 25 May 2015 07:30:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Narcis Fernandez-Fuentes Lab]]></title>
  <description><![CDATA[
<p>Welcome to our web-site compiling all the research-related activities of the group. Our research interests relate to a number of areas within Bioinformatics. We have a long-standing interest in protein structure prediction and structure-to-function relationships. We work in the study of biomolecular interactions, modeling of protein complexes, the study and characterization of protein-protein interactions, peptide design, modeling of genetic variation, structure-based protein design and different aspects of Plant Bioinformatics. Take a look at the our databases and servers and the list of publications for more information.</p>

<p>More at http://www.bioinsilico.org/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22431/genomic-scientist-at-udsc</guid>
  <pubDate>Thu, 28 May 2015 19:14:23 -0500</pubDate>
  <link></link>
  <title><![CDATA[Genomic Scientist at UDSC]]></title>
  <description><![CDATA[
<p>Centre for Genetic Manipulation of Crop Plants</p>

<p>Department of Genetics</p>

<p>University of Delhi South Campus</p>

<p>NEW DELHI – 110 021</p>

<p>WALK-IN-INTERVIEW FOR THE TEMPORARY POSITIONS OF RESEACH SCIENTIT &amp; LAB / FIELD ATTENDANT</p>

<p>1 Research Scientist (RS) – 3</p>

<p>    DBT, Ph. D.</p>

<p>    Experience on DNA Markers, plant genome mapping and bioinformatics</p>

<p>    Salary: 60,000 (Consolidated) + 5% annual increment</p>

<p>    Date and time: 25.06.2015 at 10:30 AM</p>

<p>These temporary positions have been sanctioned in a DBT funded project for the Phase II on ‘Centre of Excellence on genome mapping and molecular breeding of Brassicas.’</p>

<p>The applicants are requested to register their names on the day of interview in the First Floor, Biotech Centre, Centre for Genetic Manipulation of Crop Plants, Department of Genetics before the stipulated time for the interview. Only the registered eligible candidates will be interviewed on the day in the Committee Room.</p>

<p>Applicants are requested to bring all related documents, in original and a set of photocopy, for verification.</p>

<p>No TA/DA will be paid for attending the interview.</p>

<p>Advertisement:</p>

<p>www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&amp;cntnt01articleid=5492&amp;cntnt01returnid=83</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</guid>
	<pubDate>Fri, 30 May 2014 04:48:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</link>
	<title><![CDATA[Next generation sequencing(NGS) books]]></title>
	<description><![CDATA[<p>Employing different technologies, the purpose of NGS platform is to decode the identity or modification on the nucleotides. NGS platforms evolve quickly and capture the main stream.</p>
<p>This bookmark is created to provide NGS online books links.</p><p>Address of the bookmark: <a href="http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version" rel="nofollow">http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22432/walk-ins-for-jrf-ans-srf-post-in-assam-agricultural-university</guid>
  <pubDate>Thu, 28 May 2015 19:16:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk-ins for JRF ans SRF post in Assam Agricultural University]]></title>
  <description><![CDATA[
<p>Distributed Information Centre<br />Department of Agricultural Biotechnology<br />Assam Agricultural University<br />Jorhat – 785 013<br />Walk-in interview</p>

<p>(ABT/DIC/01/2014 (No. AAU/ABT/DIT/Advt. 01/2015/111 Dtd. 19-05-2015)</p>

<p>Walk in interview for the following position will be held on 6th June, 2015 at 10.00AM in the Office Chamber of the undersigned. Candidates may appear for the interview with bio-data, reprints / publication / thesis etc and passport size photographs, original and attested copies of all testimonials etc, which must be presented at the time of interview. The applicants may submit their resume in advance tomkmodi@aau.ac.in.</p>

<p>Research Associate</p>

<p>    Ph.D. in Biotechnology/ Bioinformatics. Or</p>

<p>    Masters degree in Biotechnology/Bioinformatics with minimum 3(three) years research experience</p>

<p>    Desirable : Experience in Bioinformatics as evidenced from published research</p>

<p>    Rs 36,000+HRA for the 1st two years and 38,000+HRA for the 3rd year.</p>

<p>Senior Research Fellow</p>

<p>    Master Degree in Biotechnology/ Bioinformatics. With 2 (two) years  Experience in Bioinformatics as evidenced from Course work/ Diploma/Published research</p>

<p>    Rs 28,000+HRA for NET qualified candidate/Professional degree holder</p>

<p>    Rs 18,000+HRA for non-NET qualified general degree holder</p>

<p>Junior Research Fellow</p>

<p>    Master Degree in Biotechnology/ Bioinformatics/Computer Science/Computer Application</p>

<p>    Desirable: Experience in Bioinformatics as evident from Course work/ Diploma/Published research</p>

<p>    Rs 25,000+HRA for NET qualified candidate/Professional degree holder</p>

<p>    Rs 16,000+HRA for non-NET qualified general degree holder</p>

<p>Note: Term and conditions will be as per the DBT, Govt of India guidelines.</p>

<p>Advertisement: http://14.139.222.145/classified/biotech46.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</guid>
	<pubDate>Tue, 04 Aug 2015 05:14:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</link>
	<title><![CDATA[Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?]]></title>
	<description><![CDATA[<p>Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?</p>]]></description>
	<dc:creator>Strand</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22512/srf-post-in-nehu-shillong</guid>
  <pubDate>Wed, 03 Jun 2015 13:15:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF post in NEHU, Shillong]]></title>
  <description><![CDATA[
<p>Dept of Biochemistry <br />North-Eastern Hill University<br />(A University with Potential for Excellence) <br />Umshing, Shillong- 793 022</p>

<p>Applications are invited for the post of Senior Research Fellow- SRF (1) and Junior Research Fellow- JRF (1) to be appointed in a SERB-funded major research project entitled “Biochemical and functional properties of Synechocystis Glutathione S-transferase(s)” sanctioned to Dr. Timir Tripathi, Molecular and Structural Biophysics Laboratory, Department of Biochemistry, NEHU, Shillong. </p>

<p>Essential Qualifications: For both positions M.Sc. or equivalent with a good academic record is a prerequisite. </p>

<p>For Project-SRF, experience in bioinformatics/computational biology is required, which should be evident by atleast one good publication. </p>

<p>For JRF position, freshers can also apply. </p>

<p>Stipend: As per SERB norms. </p>

<p>Interested students can email their detailed bio-data including mobile number and recent photograph to msb.biochem@gmail.com, latest by 20.06.15. The hard copy is not required. The date of interview will be informed after primary scrutiny of the applications. No TA/DA will be paid if called for interview. For details of the research work of the PI’s group kindly visit www.ttripathi.webs.com</p>

<p>Advertisement: http://www.nehu.ac.in/Advertisements/BiochemSERB_Advt_020615.pdf</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/pages/view/22569/reverse-complement-problem-solved-with-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:37:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22569/reverse-complement-problem-solved-with-perl</link>
	<title><![CDATA[Reverse Complement Problem Solved with Perl]]></title>
	<description><![CDATA[<p>Question at http://rosalind.info/problems/1b/</p><p>#Find the reverse complement of a DNA string.<br />#Given: A DNA string Pattern.<br />#Return: Pattern, the reverse complement of Pattern.<br /><br />use strict;<br />use warnings;<br /><br />my $string="AAAACCCGGT";<br />my $finalString="";<br />my %hash = (<br />&nbsp;&nbsp; &nbsp;"C" =&gt; "G", <br />&nbsp;&nbsp; &nbsp;"A" =&gt; "T", <br />&nbsp;&nbsp; &nbsp;"T" =&gt; "A", <br />&nbsp;&nbsp; &nbsp;"G" =&gt; "C",<br />);<br /><br />for (my $aa=0; $aa&lt;=(length($string)-1); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $char=substr $string, $aa, 1;<br />&nbsp;&nbsp; &nbsp;#print $hash{$char};<br />&nbsp;&nbsp; &nbsp;$finalString="$hash{$char}"."$finalString";<br />}<br /><br />print $finalString;<br />print "\n";</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>