<?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/28915?offset=440</link>
	<atom:link href="https://bioinformaticsonline.com/related/28915?offset=440" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42974/list-of-bioinformatics-packages-for-ngs-analysis</guid>
	<pubDate>Sat, 20 Mar 2021 00:28:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42974/list-of-bioinformatics-packages-for-ngs-analysis</link>
	<title><![CDATA[List of bioinformatics packages for NGS analysis !]]></title>
	<description><![CDATA[<p>Package suites gather software packages and installation tools for specific languages or platforms. We have some for bioinformatics software.</p><ul>
<li><a href="https://github.com/Bioconductor">Bioconductor</a>&nbsp;&ndash; A plethora of tools for analysis and comprehension of high-throughput genomic data, including 1500+ software packages. [&nbsp;<a href="https://link.springer.com/article/10.1186/gb-2004-5-10-r80">paper-2004</a>&nbsp;|&nbsp;<a href="https://www.bioconductor.org/">web</a>&nbsp;]</li>
<li><a href="https://github.com/biopython/biopython">Biopython</a>&nbsp;&ndash; Freely available tools for biological computing in Python, with included cookbook, packaging and thorough documentation. Part of the&nbsp;<a href="http://open-bio.org/">Open Bioinformatics Foundation</a>. Contains the very useful&nbsp;<a href="https://biopython.org/DIST/docs/api/Bio.Entrez-module.html">Entrez</a>&nbsp;package for API access to the NCBI databases. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/19304878">paper-2009</a>&nbsp;|&nbsp;<a href="https://biopython.org/">web</a>&nbsp;]</li>
<li><a href="https://github.com/bioconda">Bioconda</a>&nbsp;&ndash; A channel for the&nbsp;<a href="http://conda.pydata.org/docs/intro.html">conda package manager</a>&nbsp;specializing in bioinformatics software. Includes a repository with 3000+ ready-to-install (with&nbsp;<code>conda install</code>) bioinformatics packages. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/29967506">paper-2018</a>&nbsp;|&nbsp;<a href="https://bioconda.github.io/">web</a>&nbsp;]</li>
<li><a href="https://github.com/BioJulia">BioJulia</a>&nbsp;&ndash; Bioinformatics and computational biology infastructure for the Julia programming language. [&nbsp;<a href="https://biojulia.net/">web</a>&nbsp;]</li>
<li><a href="https://github.com/rust-bio/rust-bio">Rust-Bio</a>&nbsp;&ndash; Rust implementations of algorithms and data structures useful for bioinformatics. [&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/early/2015/10/06/bioinformatics.btv573.short?rss=1">paper-2016</a>&nbsp;]</li>
<li><a href="https://github.com/seqan/seqan3">SeqAn</a>&nbsp;&ndash; The modern C++ library for sequence analysis.</li>
</ul>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40204/iitm-tokyo-tech-joint-symposium</guid>
	<pubDate>Thu, 24 Oct 2019 10:30:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40204/iitm-tokyo-tech-joint-symposium</link>
	<title><![CDATA[IITM-Tokyo Tech Joint Symposium]]></title>
	<description><![CDATA[<p>The IITM-Tokyo Tech Joint Symposium is a biannual international symposium held in Indian Institute of Technology Madras (IITM), India in collaboration with Tokyo Institute of Technology (Tokyo-Tech), Japan. During the symposium, experts in various domains of Bioinformatics gather from India and Japan under one roof to discuss and present their works. This provides an unique opportunity to the researchers and students to learn the frontiers and interact with eminent scientists in Bioinformatics. The 5th IITM - Tokyo Tech Joint Symposium titled "Current trends in Bioinformatics: Big data analysis, machine learning and drug design", will be held on 6th - 7th March 2020 in IITM, Chennai, India.</p><p>The symposium will focus on topics in the below mentioned areas.</p><p>Topics: Algorithms for biomolecular sequences / structures Bioinformatics databases and tools Protein function Structure based drug design Machine learning Deep learning Large scale data analysis Big Data NGS Analysis Protein interactions/network Molecular modelling/docking/screening Biomolecular structure and function More</p><p>Info: https://web.iitm.ac.in/bioinfo2/symposium2020/home</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43084/frequently-used-bioinformatics-tools-for-viral-genome-analysis</guid>
	<pubDate>Wed, 23 Jun 2021 07:40:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43084/frequently-used-bioinformatics-tools-for-viral-genome-analysis</link>
	<title><![CDATA[Frequently used bioinformatics tools for viral genome analysis !]]></title>
	<description><![CDATA[<p><strong>IVA: accurate de novo assembly of RNA virus genomes.</strong><br /> Hunt M, Gall A, Ong SH, Brener J, Ferns B, Goulder P, Nastouli E, Keane JA, Kellam P, Otto TD.<br /> Bioinformatics. 2015 Jul 15;31(14):2374-6. doi: <a href="http://bioinformatics.oxfordjournals.org/content/31/14/2374.long">10.1093/bioinformatics/btv120</a>. Epub 2015 Feb 28.</p><p><a href="http://www.nature.com/nmeth/journal/v9/n1/full/nmeth.1814.html"><strong>Adapter sequences</strong></a>:<br /> <strong>Optimal enzymes for amplifying sequencing libraries.</strong><br /> Quail, M. a et al. Nat. Methods 9, 10-1 (2012).</p><p><a href="http://genome.cshlp.org/content/early/2012/01/12/gr.131383.111"><strong>GAGE</strong></a>:<br /> <strong>GAGE: A critical evaluation of genome assemblies and assembly algorithms.</strong><br /> Salzberg, S. L. et al. Genome Res. 22, 557-67 (2012).</p><p><a href="http://www.biomedcentral.com/1471-2105/14/160"><strong>KMC</strong></a>:<br /> <strong>Disk-based k-mer counting on a PC.</strong><br /> Deorowicz, S., Debudaj-Grabysz, A. &amp; Grabowski, S. BMC Bioinformatics 14, 160 (2013).</p><p><a href="http://genomebiology.com/2014/15/3/R46"><strong>Kraken</strong></a>:<br /> <strong>Kraken: ultrafast metagenomic sequence classification using exact alignments.</strong><br /> Wood, D. E. &amp; Salzberg, S. L. Genome Biol. 15, R46 (2014).</p><p><a href="http://genomebiology.com/2004/5/2/r12"><strong>MUMmer</strong></a>:<br /> <strong>Versatile and open software for comparing large genomes.</strong><br /> Kurtz, S. et al. Genome Biol. 5, R12 (2004).</p><p><strong>R</strong>:<br /> <strong>R: A language and environment for statistical computing.</strong><br /> R Core Team (2013). R Foundation for Statistical Computing, Vienna, Austria. URL <a href="http://www.R-project.org/">http://www.R-project.org/</a>.</p><p><a href="http://nar.oxfordjournals.org/content/39/9/e57"><strong>RATT</strong></a>:<br /> <strong>RATT: Rapid Annotation Transfer Tool.</strong><br /> Otto, T. D., Dillon, G. P., Degrave, W. S. &amp; Berriman, M. Nucleic Acids Res. 39, e57 (2011).</p><p><a href="http://bioinformatics.oxfordjournals.org/content/25/16/2078.abstract"><strong>SAMtools</strong></a>:<br /> <strong>The Sequence Alignment/Map format and SAMtools.</strong><br /> Li, H. et al. Bioinformatics 25, 2078-9 (2009).</p><p><a href="http://bioinformatics.oxfordjournals.org/content/early/2014/04/12/bioinformatics.btu170"><strong>Trimmomatic</strong></a>:<br /> <strong>Trimmomatic: A flexible trimmer for Illumina Sequence Data.</strong><br /> Bolger, A. M., Lohse, M. &amp; Usadel, B. Bioinformatics 1-7 (2014).</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43661/maftools</guid>
	<pubDate>Fri, 17 Dec 2021 03:18:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43661/maftools</link>
	<title><![CDATA[maftools]]></title>
	<description><![CDATA[<p>With advances in Cancer Genomics, <a href="https://docs.gdc.cancer.gov/Data/File_Formats/MAF_Format/">Mutation Annotation Format</a> (MAF) is being widely accepted and used to store somatic variants detected. <a href="http://cancergenome.nih.gov">The Cancer Genome Atlas</a> Project has sequenced over 30 different cancers with sample size of each cancer type being over 200. <a href="https://wiki.nci.nih.gov/display/TCGA/TCGA+MAF+Files">Resulting data</a> consisting of somatic variants are stored in the form of <a href="https://docs.gdc.cancer.gov/Data/File_Formats/MAF_Format/">Mutation Annotation Format</a>. This package attempts to summarize, analyze, annotate and visualize MAF files in an efficient manner from either TCGA sources or any in-house studies as long as the data is in MAF format.</p>
<p>https://www.bioconductor.org/packages/devel/bioc/vignettes/maftools/inst/doc/maftools.html</p><p>Address of the bookmark: <a href="https://github.com/PoisonAlien/maftools" rel="nofollow">https://github.com/PoisonAlien/maftools</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41571/wego-simple-but-useful-tool-for-visualizing-comparing-and-plotting-go-gene-ontology-annotation-results</guid>
	<pubDate>Sun, 12 Apr 2020 10:02:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41571/wego-simple-but-useful-tool-for-visualizing-comparing-and-plotting-go-gene-ontology-annotation-results</link>
	<title><![CDATA[WEGO : simple but useful tool for visualizing, comparing and plotting GO (Gene Ontology) annotation results]]></title>
	<description><![CDATA[<p><span>WEGO (Web Gene Ontology Annotation Plot) is a simple but useful tool for visualizing, comparing and plotting GO (Gene Ontology) annotation results. As the GO vocabulary became more and more popular, WEGO was widely adopted and used in many researches. Therefore we have updated WEGO 2.0 in 2018. Here are some changes we&rsquo;ve made:</span><br><span>1. The limit of input file numbers was cancelled. Now the users could upload as many files as they want with one operation.</span><br><span>2. We have added the reference data of 9 species for users selection.</span><br><span>3. Besides the traditional WEGO histogram, WEGO 2.0 outputs an additional type of bar graph showing GO terms with significant gene number differences.</span></p><p>Address of the bookmark: <a href="http://wego.genomics.org.cn/" rel="nofollow">http://wego.genomics.org.cn/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</guid>
	<pubDate>Fri, 11 Sep 2026 13:00:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</link>
	<title><![CDATA[The Genes That Travel Together: A Genomic Detective Story]]></title>
	<description><![CDATA[<p>Imagine looking through thousands of microbial genomes and discovering two genes that repeatedly appear together. The obvious conclusion is that they must somehow be connected&mdash;that perhaps they work together, participate in the same pathway, or depend on each other. But evolution has a way of leaving misleading clues. What if these two genes are found together simply because they were inherited from the same ancient ancestor? In that case, their apparent association may have little to do with their biological function; it may simply be a reflection of shared evolutionary history. This is the intriguing problem addressed by CORGIAS (https://github.com/ynishimuraLv/corgias), a computational framework developed to distinguish genuine gene associations from correlations created by common ancestry.</p><p>Instead of asking only whether two genes occur together across genomes, CORGIAS asks a deeper question: did these genes actually evolve together, repeatedly gaining or losing their presence in concert, or are they merely travelling together because of their inherited history? The framework introduces two complementary approaches, Ancestral State Adjustment (ASA) and the Simultaneous EVolution test (SEV), which incorporate evolutionary information into the search for gene associations. This distinction becomes increasingly important as genome sequencing continues to uncover enormous numbers of microbial genomes, many from organisms that have never been cultured and whose genes remain functionally mysterious. In this growing genomic landscape, simply finding a gene is no longer enough&mdash;we need clues about what that gene might be doing. CORGIAS approaches this problem almost like a genomic detective: rather than treating every association as evidence, it reconstructs the evolutionary story behind the association and asks whether the evidence survives that history. By doing so, it offers a way to separate coincidence from biological connection and potentially uncover functional relationships hidden within the vast microbial genomic landscape. The broader message is beautifully simple: genes do not evolve in isolation, and understanding what they do may require us to look beyond where they are today and reconstruct how they arrived there. Sometimes, the most important clue in a genome is not the gene itself, but the evolutionary journey it has taken.</p><p>More at&nbsp;https://academic.oup.com/nargab/article/7/4/lqaf182/8377910?</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35802/bioinformatics-tools-to-detect-horizontal-gene-transfer-hgt-in-genomes</guid>
	<pubDate>Fri, 02 Mar 2018 04:56:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35802/bioinformatics-tools-to-detect-horizontal-gene-transfer-hgt-in-genomes</link>
	<title><![CDATA[Bioinformatics tools to detect horizontal gene transfer (HGT) in genomes]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the &ldquo;non-sexual movement of genetic material between two organisms&rdquo; , is relatively common in prokaryotes&nbsp;and single-celled eukaryotes, but a number of factors combine to make it far rarer in multicellular eukaryotes. In order for a eukaryotic species to gain a gene by HGT, foreign DNA must enter the host nucleus, integrate into the genome, and in more complex organisms it must enter the sequestered germline in order to be transmitted to offspring. Once there, it must not experience strong negative selection, despite potential for genetic incompatibility with the host genome and mismatch between the niche of the donor and the host. Over the longer term, foreign DNA may become &ldquo;domesticated&rdquo; in the recipient genome and provide novel function.</p><p>Following are the popular tool to detect HGT in genomes:</p><p><a href="http://www.trex.uqam.ca/index.php?action=hgt&amp;project=trex">T-REX</a>&nbsp;/&nbsp;<a href="http://www.trex.uqam.ca/download/hgt-detection_3.22.zip">3.22</a></p><p>HGT detection /&nbsp;download &amp; compile</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/20525630">20525630</a></p><p>&nbsp;</p><p><a href="http://compbio.engr.uconn.edu/software/RANGER-DTL/">RANGER-DTL</a>&nbsp;/&nbsp;<a href="http://compbio.engr.uconn.edu/software/RANGER-DTL/Linux.zip">2.0</a></p><p>HGT detection /&nbsp;download binary</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/22689773">22689773</a></p><p>&nbsp;</p><p><a href="https://bioinfocs.rice.edu/phylonet">PhyloNet</a>&nbsp;/&nbsp;<a href="https://bioinfocs.rice.edu/sites/g/files/bxs266/f/kcfinder/files/PhyloNet_3.6.1.jar">3.6.1</a></p><p>HGT detection /&nbsp;download binary</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/18662388">18662388</a></p><p>&nbsp;</p><p><a href="https://www.cs.hmc.edu/~hadas/jane/index.html">Jane</a>&nbsp;/&nbsp;<a href="https://www.cs.hmc.edu/~hadas/jane/form.html">4.01</a></p><p>HGT detection /&nbsp;download binary (!license!)</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/20181081">20181081</a></p><p>&nbsp;</p><p><a href="http://www.tree-puzzle.de/">TREE-PUZZLE</a>&nbsp;/&nbsp;<a href="http://www.tree-puzzle.de/tree-puzzle-5.3.rc16-linux.tar.gz">5.3.rc16</a></p><p>HGT detection /&nbsp;download &amp; compile</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/11934758">11934758</a></p><p>&nbsp;</p><p><a href="http://www.sigmath.es.osaka-u.ac.jp/shimo-lab/prog/consel/">CONSEL</a>&nbsp;/&nbsp;<a href="http://www.sigmath.es.osaka-u.ac.jp/shimo-lab/prog/consel/pub/cnsls020.tgz">0.20</a></p><p>HGT detection /&nbsp;download</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/11751242">11751242</a></p><p>&nbsp;</p><p><a href="http://darkhorse.ucsd.edu/">DarkHorse</a>&nbsp;/&nbsp;<a href="http://darkhorse.ucsd.edu/DarkHorse-1.5_rev170.tar.gz">1.5 rev170</a></p><p>HGT detection /&nbsp;download &amp; install</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/17274820">17274820</a></p><p>&nbsp;</p><p><a href="https://github.com/DittmarLab/HGTector">HGTector</a>&nbsp;/&nbsp;<a href="https://github.com/DittmarLab/HGTector/archive/wgshgt.zip">0.2.1</a></p><p>HGT detection /&nbsp;git clone</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/25159222">25159222</a></p><p>&nbsp;</p><p><a href="http://www5.esu.edu/cpsc/bioinfo/software/EGID/">EGID</a>&nbsp;/&nbsp;<a href="http://www5.esu.edu/cpsc/bioinfo/software/EGID/EGID_1.0.tar.gz">1.0</a></p><p>HGT detection /&nbsp;download</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/22355228">22355228</a></p><p>&nbsp;</p><p><a href="http://exon.gatech.edu/GeneMark/">GeneMarkS</a>&nbsp;/&nbsp;<a href="http://exon.gatech.edu/GeneMark/license_download.cgi">4.30</a></p><p>HGT detection / download binary (!license!)</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/9461475">9461475</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38443/genoplotr-plot-gene-and-genome-maps-project</guid>
	<pubDate>Wed, 12 Dec 2018 08:33:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38443/genoplotr-plot-gene-and-genome-maps-project</link>
	<title><![CDATA[genoPlotR - plot gene and genome maps project!]]></title>
	<description><![CDATA[<p>genoPlotR is a R package to produce reproducible, publication-grade graphics of gene and genome maps. It allows the user to read from usual format such as protein table files and blast results, as well as home-made tabular files.</p>
<h3>Features</h3>
<ul>
<li>Linear representation of several segments of DNA</li>
<li>Comparisons represented by areas between the segments (like Artemis, for example)</li>
<li>Reads from common formats: Genbank, EMBL, blast, Mauve, and from user-generated tab files</li>
<li>Plot several subsegments of the same segment on the same line, separated by a //</li>
<li>Automatic or manual placement of the segments on the plot</li>
<li>Add annotations to all the lines</li>
<li>Create smart, automatic annotations for genomes, based on gene names</li>
<li>Add a user-generated tree</li>
<li>Add a global scale or a scale to each line</li>
<li>Use user-defined graphical functions to represent genes</li>
<li></li>
</ul><p>Address of the bookmark: <a href="http://genoplotr.r-forge.r-project.org/" rel="nofollow">http://genoplotr.r-forge.r-project.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/7913/the-genome-factory</guid>
	<pubDate>Thu, 16 Jan 2014 02:09:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/7913/the-genome-factory</link>
	<title><![CDATA[The genome factory !!!]]></title>
	<description><![CDATA[<p>Illumina, Inc. announced Tuesday that its new HiSeq X Ten Sequencing System has broken the &ldquo;sound barrier&rdquo; of human genomics by enabling the $1,000 genome. &ldquo;This platform includes dramatic technology breakthroughs that enable researchers to undertake studies of unprecedented scale by providing the throughput to sequence tens of thousands of human whole genomes in a single year in a single lab,&rdquo; Illumina stated.</p><p>Initial customers for the HiSeq X Ten System, which will ship in Q1 2014, include Macrogen, based in Seoul, South Korea and its CLIA laboratory in Rockville, Maryland, the Broad Institute in Cambridge, Massachusetts, and the Garvan Institute of Medical Research in Sydney, Australia.</p><p>&ldquo;For the first time, it looks like it will be possible to deliver the $1,000 genome, which is tremendously exciting,&rdquo; said Eric Lander, founding director of the Broad Institute and a professor of biology at MIT. &ldquo;The HiSeq X Ten should give us the ability to analyze complete genomic information from huge sample populations. Over the next few years, we have an opportunity to learn as much about the genetics of human disease as we have learned in the history of medicine.&rdquo;</p><p>&ldquo;The HiSeq X Ten is an ideal platform for scientists and institutions focused on the discovery of genotypic variation to enable a deeper understanding of human biology and genetic disease,&rdquo; Illumina stated. &ldquo;It can sequence tens of thousands of samples annually with high-quality, high-coverage sequencing, delivering a comprehensive catalog of human variation within and outside coding regions.&rdquo;</p><p>HiSeq X Ten utilizes a number of advanced design features to generate massive throughput. Patterned flow cells, which contain billions of nanowells at fixed locations, combined with a new clustering chemistry deliver a significant increase in data density (6 billion clusters per run). Using state-of-the art optics and faster chemistry, HiSeq X Ten can process sequencing flow cells more quickly than ever before &mdash; generating a 10x increase in daily throughput when compared to current HiSeq 2500 performance.</p><p>The HiSeq X Ten is sold as a set of 10 or more ultra-high throughput sequencing systems, each generating up to 1.8 terabases (Tb) of sequencing data in less than three days or up to 600 gigabases (Gb) per day, per system, providing the throughput to sequence tens of thousands of high-quality, high-coverage genomes per year. Illumina says the $1,000 includes typical instrument depreciation, DNA extraction, library preparation, and estimated labor.</p>]]></description>
	<dc:creator>Madhvan Reddy</dc:creator>
</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>

</channel>
</rss>