<?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/30140?offset=470</link>
	<atom:link href="https://bioinformaticsonline.com/related/30140?offset=470" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/2044</guid>
	<pubDate>Mon, 12 Aug 2013 12:19:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/2044</link>
	<title><![CDATA[Does anyone have Nanopore latest updates?]]></title>
	<description><![CDATA[<p>There was a lot of buzz about&nbsp;<span>Oxford Nanopore Technologies&reg; is developing the GridION&trade; system and miniaturised MinION&trade; device. These are a new generation of electronic molecular analysis system for use in scientific research, personalised medicine, crop science, security/defence and more. The platform technology uses nanopores to analyse single molecules including DNA/RNA and proteins. With a broad patent portfolio, the Oxford Nanopore pipeline includes biological nanopores and solid-state nanopores.</span></p><p>Is this available, or still under trial mode?&nbsp;</p><p><a href="https://www.nanoporetech.com/">https://www.nanoporetech.com/</a></p><p><a href="https://www.nanoporetech.com/technology/the-minion-device-a-miniaturised-sensing-system/the-minion-device-a-miniaturised-sensing-system">https://www.nanoporetech.com/technology/the-minion-device-a-miniaturised-sensing-system/the-minion-device-a-miniaturised-sensing-system</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/2931/senior-bioinformatics-programmer-and-srf-at-biotech-park-lucknow</guid>
  <pubDate>Fri, 23 Aug 2013 04:55:51 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Bioinformatics Programmer and SRF at  BIOTECH PARK Lucknow]]></title>
  <description><![CDATA[
<p>BIOTECH PARK</p>

<p>Advt. No. 3 (8)/BP/13</p>

<p>A walk-in-interview will be held in the Biotech Park Office at Sector G, Jankipuram, Kursi Road, Lucknow (U.P.) August 27, 2013 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, may appear on the date of interview, before the Selection Committee. The candidate will have to join immediately.</p>

<p>INTERVIEW ON August 27, 2013 at 11.00 A.M.</p>

<p>2. SENIOR PROGRAMMER (ONE POST)</p>

<p>a)  Educational Qualification M.Sc. Bioinformatics with minimum 60% marks with two years of relevant experience or B.Tech. Bioinformatics or Biotechnology with minimum 60% marks with two years experience in Bioinformatics.</p>

<p>b) Job Requirement Development of databases in multi user environment and application softwares, maintenance of website, Drug designing and QSAR study etc.</p>

<p>c) Desirable 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 OSAR studies.</p>

<p>d)  Age  Below 35 years (as on the date of interview)</p>

<p>e) Emoluments  Rs. 12,000/- per month fixed.</p>

<p>Appointment will be made initially for one year extendable on satisfactory performance till the duration of the project.</p>

<p>3. SENIOR RESEARCH FELLOW: (ONE POST)</p>

<p>a)  Educational Qualification M.Sc. in Biotechnology/Botany with minimum 60% marks and knowledge of handling database &amp; database searching.</p>

<p>b) Essential Qualification Expertise in windows, Microsoft excel.</p>

<p>c) Desirable Good knowledge of statistical software packages like SPSS.</p>

<p>d) Age Below 35 years ( as on the date of interview)</p>

<p>e) Job Requirement: Management of database &amp; website in multi user environment, computation of biological field data and generation of reports.</p>

<p>f) Emoluments</p>

<p>18000+ HRA for Net/GATE qualified<br />14000+ HRA for others</p>

<p>The appointment will be made till the duration of project.</p>

<p>Note: All the candidates should report for interview on or before 10.45 A.M.</p>

<p>General Conditions</p>

<p>    The aforesaid positions are purely temporary and do not give the incumbent any right whatsoever for appointment on regular basis.<br />    More Advertisement: http://www.biotechpark.org.in/html/jobs%20in%20Biotech%20Park/Job_2013_04.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/18741/a-powerful-yet-simple-gene-set-analysis-tool-for-interpreting-rna-seq-and-ngs-results</guid>
	<pubDate>Thu, 30 Oct 2014 09:19:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/18741/a-powerful-yet-simple-gene-set-analysis-tool-for-interpreting-rna-seq-and-ngs-results</link>
	<title><![CDATA[A powerful, yet simple, gene set analysis tool for interpreting RNA-seq and NGS results.]]></title>
	<description><![CDATA[<p>LifeMap Sciences is introducing&nbsp;<a href="http://geneanalytics.genecards.org/">GeneAnalytics</a>, our new gene set analysis tool, which is applicable for NGS results and differentially expressed gene lists from variable sources. GeneAnalytics provides&nbsp;gene associations with tissues &amp; cells, diseases, pathways, GO terms and compounds.</p><p>Our main advantages over other similar tools are:</p><ul>
<li>GeneAnalytics is very simple and intuitive to use.</li>
<li>GeneAnalytics is based on our proprietary databases &ndash;&nbsp;<strong>GeneCards</strong>, MalaCards, PathCards and LifeMap Discovery, each of them integrates information from a very large number of resources.</li>
<li>GeneAnalytics supplies links for extensive background information on each of the matched results.</li>
</ul><p>&nbsp;</p><p>I invite you to try it out for free at&nbsp;geneanalytics.genecards.org, and would be happy to hear your comments and thoughts on how we can improve.</p><p>&nbsp;</p><p>Yours,</p><p>Shani Ben-Ari Fuchs</p><p>LifeMap Sciences Team</p>]]></description>
	<dc:creator>Shani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4042/a-brief-introduction-to-genetics</guid>
	<pubDate>Wed, 28 Aug 2013 06:49:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4042/a-brief-introduction-to-genetics</link>
	<title><![CDATA[A Brief Introduction to Genetics]]></title>
	<description><![CDATA[<iframe src="http://player.vimeo.com/video/20898800?byline=0" width="" height="" frameborder="0" webkitAllowFullScreen allowFullScreen></iframe>A Brief Introduction to Genetics is a short documentary film that explores the history of genetics & genomics and the underlying concepts that provide the foundational knowledge that today's research is built upon. The film describes the history of genetics, from Gregor Mendel, to concepts such as DNA and the genetic code. Having introduced the fundamental ideas of genetics, the film moves on to describe the current techniques used to study genetics. Finally, the film explores the connection of these core concepts to genomics and bioinformatics.]]></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/researchlabs/view/4108/tijana-milenkovic-lab</guid>
  <pubDate>Fri, 30 Aug 2013 06:45:20 -0500</pubDate>
  <link></link>
  <title><![CDATA[Tijana Milenkovic Lab]]></title>
  <description><![CDATA[
<p>Complex networks and network mining: developing graph theoretic, mathematical, and computational algorithms for efficient extraction of function from topology of complex real-world networks, such as biological, social, and technological networks.</p>

<p>Computational and systems biology: studying the interplay between network topology and biological function, disease, and evolution in molecular (e.g., protein-protein interaction) networks.</p>

<p>Computational chemistry: protein folding; computational drug discovery and design.</p>

<p>Synthetic biology.</p>

<p>More at http://www.cse.nd.edu/~tmilenko/index.html</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/videolist/watch/4234/ncbi-psi-blast-tutorial</guid>
	<pubDate>Wed, 04 Sep 2013 11:46:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4234/ncbi-psi-blast-tutorial</link>
	<title><![CDATA[NCBI PSI-BLAST Tutorial]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/T3kHEieyylk" frameborder="0" allowfullscreen></iframe>http:--www.biotechnology.jhu.edu-
Tutorial for PSI-BLAST, an extension of BLAST that uses matrix algebra. BLAST is a cornerstone bioinformatics tool at NCBI. BLAST is the
Basic Local Alignment Search tool and will protein and DNA sequences that
are related to a sequence that the user provides.]]></description>
	
</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4352/jrf-bharathidasan-university</guid>
  <pubDate>Sat, 07 Sep 2013 14:20:03 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF @ BHARATHIDASAN UNIVERSITY]]></title>
  <description><![CDATA[
<p>Department of Bioinformatics<br />School of Life Sciences<br />BHARATHIDASAN UNIVERSITY,<br />TIRUCHIRAPPALLI-620 024</p>

<p>WALK-IN-INTERVIEW FOR JUNIOR RESEARCH FELLOWSHIP</p>

<p>Project title: Structural and Functional Evolution of Bacterial ADP-ribosylation Superfamily–A Special Emphasis for Engineering Immunotoxins from Binary toxin A Funding Agency: Life Science Research Board, Defence Research and Development Organization, New Delhi</p>

<p>Tenure of the project: Three years or till the end of the project period.</p>

<p>Position: Junior Research Fellow (1 no.)</p>

<p>Essential qualification: First class in M.Sc. in Genomics/Biotechnology/ Microbiology/ Biochemistry/Life Sciences</p>

<p>Desirable qualification: Experience in an area relevant (Molecular Microbiology, Protein engineering and Structural Bioinformatics) to the project.</p>

<p>Fellowship: Rs. 16, 000 per month plus HRA as per University rule.</p>

<p>Upper age limit: 28 years</p>

<p>Date of interview: 16-09-2013</p>

<p>Venue of interview: Department of Bioinformatics, Bharathidasan University, Tiruchirappalli -620 024, Tamil Nadu</p>

<p>The above post is purely temporary and will be terminated with three month notice. The Terms and the condition of the appointment shall be governed according to DRDO, Govt. of India. The eligible candidates will bring their original certificates and documents at the time of interview. No TA/DA will be paid for attending the interview.</p>

<p>Dr. P. CHELLAPANDI<br />Principal Investigator,<br />Department of Bioinformatics,<br />Bharathidasan University,<br />Tiruchirappalli -620 024, Tamil Nadu</p>

<p>Advertisement: http://www.bdu.ac.in/tender_list.php</p>
]]></description>
</item>

</channel>
</rss>