<?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/19980?offset=250</link>
	<atom:link href="https://bioinformaticsonline.com/related/19980?offset=250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22072/bioinformatics-jrfrasrf-position-at-indian-institute-of-science-education-and-research-iiser-kolkata-kolkata-west-bengal</guid>
  <pubDate>Fri, 17 Apr 2015 04:11:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/RA/SRF position at Indian Institute of Science Education and Research (IISER Kolkata) - Kolkata, West Bengal]]></title>
  <description><![CDATA[
<p>Research Position in Computational Biology in the group of Shree P. Pandey Positions available in the area of NGS data analysis, bioinformatics, plant genomics</p>

<p>Project Description: Projects involves high throughput analysis of data mostly generated by massively parallel sequencing (RNA-Seq and small-RNA-Seq), microarrays and related platforms. We are looking for highly motivated and bright individuals interested in high-throughput cutting-edge data analyses methods in genomics (computational positions). Available positions: Applications are invited from suitable candidates in both, the Max Planck India Partner Program and the CRP Wheat Program for openings at the levels:</p>

<p>Post Name-Qualification-Salary:<br />Project assistant – Master’s – Rs. 14000<br />Project fellow (junior data analyst) – Masters + research experience – Rs. 16000<br />Research fellow (senior data analyst) – Masters + adequate research experience/desirable skill sets – Rs. 22000<br />Research Associated – PhD (&lt; 1yr) /&gt; 1 yr experience – Rs. 28000 / Rs. 32000<br />Essential qualification: MSc/MTech/PhD (or other suitable qualification) in discipline related to bioinformatics, computational biology, computer application (or equivalent)/ ‘Advance Post-Graduate Diploma in Bioinformatics’. Proficiency in one of the programming languages or statistics (proficient in R for example) is compulsory.<br />Desirable qualification: 1. Programming experiences in at least one low level language such as C/C++ and one scripting language such as Perl/Python/PHP and knowledge of SQL/MySQL. 2. Substantial experience in the linux or other unix environments. 3. Experience of working in projects on Bioinformatics, Genetics or Biological application areas/Computational and Statistical analysis (e.g. using R or Matlab). Experience in the field of genomics (NGS, microarrays, genome annotation), database development and management, software development, systems and network biology (or related fields) will be preferred.<br />SELECTION PROCEDURE FOR INDIAN INSTITUTE OF SCIENCE EDUCATION AND RESEARCH (IISER KOLKATA) – RESEARCH ASSOCIATE &amp; MORE VACANCIES POST:</p>

<p>Candidates can apply on or before 30/04/2015<br />No Detailed information about the selection process is mentioned in the recruitment notification<br />HOW TO APPLY FOR RESEARCH ASSOCIATE &amp; MORE VACANCIES IN INDIAN INSTITUTE OF SCIENCE EDUCATION AND RESEARCH (IISER KOLKATA):</p>

<p>Applications should contain CV along with brief description (maximum 1 page) of research conducted (highlighting skills and experience) till now. Applications should be sent by email to Shree P. Pandey, Department of Biological Sciences, IISER-Kolkata, Mohanpur Campus, West Bengal within 2 weeks. Interviews will be scheduled within 10 days of closing of applications. E-mail: sppiiserkol@gmail.com, sppandey@iiserkol.ac.in<br />For more details visit: http://www.iiserkol.ac.in/~sppandey</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22235/project-fellow-bioinformatics-at-central-drug-research-institute</guid>
  <pubDate>Mon, 27 Apr 2015 20:15:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow Bioinformatics at Central Drug Research Institute]]></title>
  <description><![CDATA[
<p>Project Fellow (Bioinformatics)<br />Central Drug Research Institute<br />Address: Chattar Manzil, M.G.Road, Kaisarbagh<br />Postal Code: 226001<br />City: Lucknow<br />State: Uttar Pradesh<br />Pay Scale: Rs.16,000/- (fixed) p.m.<br />Educational Requirements: M.Sc. in Bioinformatics with 55% marks for Gen. &amp; OBC and 50% marks for SC/ST candidates, Physically and Visually handicapped candidates<br />Experience Requirements: Experience in computer-assisted scientific research in the area of Drug Design including Bio- molecular modeling and simulation studies, Virtual screening, pharmacophore perception, QSAR etc. Familiarity with Linux/Unixbased computer systems and required to participate and contribute to the development and application of computational models for the design and discovery of novel molecules as inhibitors or chemical probes<br />Details will be available at: http://cdriindia.org/uploaded/advt_no01-2015.pdf</p>

<p>How To Apply: Eligible candidates required to report for the Interview at 9:00 A.M. sharp on 11-05-2015 (For Position Code No. 001 to 009) and 12-05-2015 (For Position Code No. 010 to 016). Candidates reporting after 10:00 A.M will not be allowed to attend the interview. Eligible candidates may appear before the Selection Committee for interview on the date and time mentioned above at CDRI, B.S. 10/1, Sector 10, Jankipuram Extension, Sitapur Road, Lucknow-226031. Eligible candidates must bring with them duly filled up application form (which can be downloaded from our website www.cdriindia.org), along with Original certificates as well as attested copies of certificates of examinations starting from matriculation, date of birth, caste certificate (in case of SC/ST/OBC) experience certificate, publication, if any and recent passport size photograph etc. Original documents are essential for verification of the particulars quoted by the candidate in the application form and candidate failed to produce original documents at the time of verification, shall not be allowed to attend the interview. Any request for relaxation in this regard shall not be entertained.<br />Detail of Interview: 11-05-2015<br />Age Limit: 28 Years</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22269/school-of-life-sciences-jawaharlal-nehru-university-vacancy-of-jrf-srf-ra-in-csir-funded-project</guid>
  <pubDate>Wed, 29 Apr 2015 21:26:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[School of Life Sciences, Jawaharlal Nehru University vacancy of JRF / SRF / RA in CSIR funded Project]]></title>
  <description><![CDATA[
<p>School of Life Sciences, Jawaharlal Nehru University has issued notification dated 27.04.2015 to fill the vacancy of JRF / SRF / RA in CSIR funded Projec entitled "Structural and functional characterization of serine biosynthetic pathway enzymes from entamoeba histolytica". It is good chance to get job with IITKGP and brighten your future. Learn eligibility criteria and apply on or before 08.05.2015.</p>

<p>Employer:	Jawaharlal Nehru University<br />Address:	Dr. S. Gourinath, Principal Investigator, School Of Life Sciences, Jawaharlal Nehru University, New Delhi-110067<br />Email:	not mentioned / provided for this job post<br />URL:	http://www.jnu.ac.in/Career/currentjobs.htm<br />Phone:	011 2674 2575<br />Skills:	not mentioned / required for this job post<br />Experience:	Experience in molecular biology, structural biology and bioinformatics is desired<br />Education:	M.Sc. in any field of life sciences.<br />Job Location:	New Delhi, Delhi, India   (View Jobs in New Delhi,   Jobs in Delhi,   Jobs in India)</p>

<p>Job Description: School of Life Sciences, Jawaharlal Nehru University vacancy of JRF / SRF / RA in CSIR funded Projec</p>

<p>Name of the Post: JRF / SRF / RA</p>

<p>Salary: As per rules</p>

<p>Required Job Profile:</p>

<p>Candidate must possess M.Sc. in any field of life sciences.</p>

<p>Desired Job Profile:</p>

<p>Candidate having NET - CSIR or UGC and experience in molecular biology, structural biology and bioinformatics is desired and experience with publication is preferred.</p>

<p>How to apply:</p>

<p>Eligible and interested candidates should need to apply with complete details to the above mentioned address on or before 08.05.2015.</p>

<p>Refer to http://www.jnu.ac.in/Career/currentjobs.htm</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22287/research-fellows-at-aimscs-hyderabad</guid>
  <pubDate>Wed, 06 May 2015 06:23:33 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Fellows at AIMSCS, Hyderabad]]></title>
  <description><![CDATA[
<p>C.R.Rao Advanced Institute of Mathematics, Statistics and Computer Science (AIMSCS) - Hyderabad, Andhra Pradesh<br />Advertisement No.: 5/2015</p>

<p>Research Fellows Systems Biology job vacancy in C.R.Rao Advanced Institute of Mathematics, Statistics and Computer Science (AIMSCS)</p>

<p>JRF : Qualification - M. Sc in Bioinformatics, Systems Biology, M. Sc statistics, or M. Tech in Bioinformatics,</p>

<p>Pay Scale : Rs. 25,000</p>

<p>SRF : Qualification- Qualification prescribed for JRF with 2 years of research experience.</p>

<p>Pay Scale : Rs. 28,000*</p>

<p>No.of Post: 2</p>

<p>Desirable: Candidates should have strong background in Computational biology, bioinformatics, statistics and algorithmic development. In addition to that previous experience of working on Linux, bio-informatics, NGS data analysis and Basic knowledge of biology is desirable. Programming on any one of the programming languages (C, C++, perl, python) and statistical framework (e.g. R, matlab, etc.) is highly desirable.</p>

<p>More at http://www.crraoaimscs.org/jrf_application_form_2015.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/22403/ryan-e-mills-lab</guid>
  <pubDate>Tue, 26 May 2015 09:29:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Ryan E. Mills Lab]]></title>
  <description><![CDATA[
<p>Our research group is primarily focused on the analysis of whole genome sequence data to identify genetic variation (primarily structural variation) and examine their potential functional impact in disease phenotypes. We are particularly interested in analyzing complex regions of the genome that are not easily resolved through modern sequencing approaches and which may exhibit interesting mechanistic origins.</p>

<p>We are also interested in the large-scale integration of genomic, expression, methylation and proteomic data sets, as well as the application of whole genome sequence analysis in clinical diagnostics. </p>

<p>More at http://millslab.ccmb.med.umich.edu/index.html</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22437/jrf-bioinformatics-icar-national-research-centre-for-orchids-pakyong</guid>
  <pubDate>Thu, 28 May 2015 19:33:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics @ ICAR - National Research Centre for Orchids  Pakyong]]></title>
  <description><![CDATA[
<p>ICAR - National Research Centre for Orchids</p>

<p>Pakyong</p>

<p>F.No:NRCO/Admn/DBT /136 /</p>

<p>Walk-in-Interviews will be held at 737106, Sikkim for the post of 01 (One Project ‘DBT’s Twinning programme for the NE’ titled “Assessment of some fragrant orchids of north-east India for sustainable improvement of community livelihood”, indicated below. The appointment will be on contractual basis and the incumbents shall not have any regular appointment in ICAR.</p>

<p>‘DBT’s Twinning programme for the NE’ titled “Assessment of chemical and genetic divergence of some fragrant orchids of north-east India for sustainable improvement of community livelihood”</p>

<p>Junior Research Fellow (One post)</p>

<p>Essential Qualification : a. MSc (with NET qualification) / M.Tech degree (with or without NET) with minimum 55% marks in Biotechnology/ Bioinformatics/ Molecular Biology or any other related field.</p>

<p>Desirable Qualification: Computer Skills (Linux, Perl, Java, MySQL) with experience in advanced molecular Biology techniques</p>

<p>2nd June 2015</p>

<p>Advertisement: www.nrcorchids.nic.in/Employments/Vacancy%20-%20JRF.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/33306/ancestral-sequence-reconstruction-asr-or-ancestral-genesequence-reconstructionresurrection-tools-to-study-molecular-evolution</guid>
	<pubDate>Tue, 30 May 2017 04:20:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/33306/ancestral-sequence-reconstruction-asr-or-ancestral-genesequence-reconstructionresurrection-tools-to-study-molecular-evolution</link>
	<title><![CDATA[Ancestral sequence reconstruction (ASR) or ancestral gene/sequence reconstruction/resurrection tools to study molecular evolution]]></title>
	<description><![CDATA[<p><span><strong>Ancestral sequence reconstruction</strong><span>&nbsp;(</span><strong>ASR</strong><span>) &ndash; also known as&nbsp;</span><strong>ancestral gene</strong><span>/</span><strong>sequence reconstruction</strong><span>/</span><strong>resurrection</strong><span>&nbsp;&ndash; is a technique used in the study of&nbsp;</span>molecular evolution<span>. The method consists of the synthesis of an ancestral&nbsp;</span>gene<span>&nbsp;and expression of the corresponding ancestral&nbsp;</span>protein<span>.&nbsp;</span><sup id="cite_ref-thornton_1-0"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-thornton-1"></a></sup><span>The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl.</span><sup id="cite_ref-2"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-2"></a></sup><span>&nbsp;Some early efforts were made in the eighties-nineties, led by the laboratory of&nbsp;</span>Steven A. Benner<span>, showing the potential of this technique &ndash; one that only started to be fulfilled in the post-genomic era.</span><sup id="cite_ref-3"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-3"></a></sup><span>&nbsp;Thanks to the improvement of algorithms and of better sequencing and synthesis techniques, the method was developed further in the early 2000s to allow the resurrection of a greater variety of and much more ancient genes.</span><sup id="cite_ref-4"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-4"></a></sup><span>&nbsp;Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.&nbsp;</span></span></p><p><img src="https://upload.wikimedia.org/wikipedia/commons/thumb/e/e4/ASR_phylogeny.png/510px-ASR_phylogeny.png" alt="image" width="610" height="435" style="border: 0px; border: 0px;"></p><p><span>Following are the list of&nbsp;</span><strong style="font-size: 12.8px;">Ancestral /sequence/ reconstruction</strong><span>&nbsp;(</span><strong style="font-size: 12.8px;">ASR</strong><span>) tools:&nbsp;</span></p><p><a href="http://www.bx.psu.edu/miller_lab/car/" target="_blank" title="To inferCars official website"><span>inferCars</span></a></p><p><span><span><span><span><span>Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.</span></span></span></span></span></p><p><span><span><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" target="_blank" title="To ANGES official website">ANGES</a>:</span><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" target="_blank" title="To ANGES official website">reconstructing ANcestral GEnomeS maps</a></span></p><p><span><span><span><span><span><span>A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.</span></span></span></span></span></span></p><p><a href="http://virulence.molgen.mpg.de/cocos/" target="_blank" title="To Cocos official website"><span>Cocos</span></a></p><p><span><span><span><span><span><span><span>Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.</span></span></span></span></span></span></span></p><p><a href="https://github.com/msrosenberg/MySSP" target="_blank" title="To MySSP official website"><span>MySSP</span></a></p><p><span><span><span><span><span><span><span><span>Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.</span></span></span></span></span></span></span></span></p><p><span><span><a href="http://www.cs.cmu.edu/~ckingsf/software/parana/" target="_blank" title="To PARANA official website">PARANA</a>:&nbsp;</span><a href="http://www.cs.cmu.edu/~ckingsf/software/parana/" target="_blank" title="To PARANA official website">Parsimonious Ancestral Reconstruction And Network Analysis</a></span></p><p><span><span><span><span><span><span><span><span><span>Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.</span></span></span></span></span></span></span></span></span></p><p><span><span><a href="http://www-labs.iro.umontreal.ca/~mabrouk/" target="_blank" title="To GapAdj official website">GapAdj</a>:&nbsp;</span><a href="http://www-labs.iro.umontreal.ca/~mabrouk/" target="_blank" title="To GapAdj official website">Gapped Adjacencies</a></span></p><p><span><span><span><span><span><span><span><span><span><span>A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).</span></span></span></span></span></span></span></span></span></span></p><p><a href="http://ancestors.bioinfo.uqam.ca/"><span><span><span><span><span><span><span><span><span><span>ANCESTOR</span></span></span></span></span></span></span></span></span></span></a></p><p><span><span><span><span><span><span><span><span><span><span><span>A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.</span></span></span></span></span></span></span></span></span></span></span></p><p><a href="http://bioinfo.lifl.fr/procars/" target="_blank" title="To ProCARs official website"><span>ProCARs</span></a></p><p>Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.</p><p><a href="http://fastml.tau.ac.il/" target="_blank" title="To FastML official website"><span>FastML</span></a></p><p>A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.</p><p><a href="http://rth.dk/resources/maxAlike/" target="_blank" title="To maxAlike official website"><span>maxAlike</span></a></p><p>Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.</p><p><span><span><a href="http://www.geneorder.org/server.php" target="_blank" title="To MLGO official website">MLGO</a>:&nbsp;</span><a href="http://www.geneorder.org/server.php" target="_blank" title="To MLGO official website">Maximum Likelihood for Gene Order Analysis</a></span></p><p>A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.</p><p>Image Reference : Wiki</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22786/ra-at-university-of-delhi</guid>
  <pubDate>Wed, 17 Jun 2015 20:35:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at University of Delhi]]></title>
  <description><![CDATA[
<p>Research Scientist Jobs opportunity in University of Delhi on temporary basis</p>

<p>Qualifications : Ph. D.</p>

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

<p>No. of Post : 03</p>

<p>Department : Genetics</p>

<p>Salary : Rs. 60,000/-<br />How to apply</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. Applicants are requested to bring all related documents, in original and a set of photocopy, for verification. Date and time of the interview : 25.06.2015 at 10:30 AM.</p>

<p>Click Here for Job Details http://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/37759/pandaseq-is-a-program-to-align-illumina-reads-optionally-with-pcr-primers-embedded-in-the-sequence-and-reconstruct-an-overlapping-sequence</guid>
	<pubDate>Fri, 21 Sep 2018 10:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37759/pandaseq-is-a-program-to-align-illumina-reads-optionally-with-pcr-primers-embedded-in-the-sequence-and-reconstruct-an-overlapping-sequence</link>
	<title><![CDATA[PANDASEQ is a program to align Illumina reads, optionally with PCR primers embedded in the sequence, and reconstruct an overlapping sequence.]]></title>
	<description><![CDATA[<p>Development packages for zlib and libbz2 are needed, as well as a standard compiler environment. On Ubuntu, this can be installed via:</p>
<pre><code>sudo apt-get install build-essential libtool automake zlib1g-dev libbz2-dev pkg-config
</code></pre>
<p>On MacOS, the Apple Developer tools and Fink (or MacPorts or Brew) must be installed, then:</p>
<pre><code>sudo fink install bzip2-dev pkgconfig</code></pre><p>Address of the bookmark: <a href="https://github.com/neufeld/pandaseq" rel="nofollow">https://github.com/neufeld/pandaseq</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22965/ra-bioinformatics-at-bharathidasan-university</guid>
  <pubDate>Sun, 28 Jun 2015 12:21:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Bharathidasan University]]></title>
  <description><![CDATA[
<p>National Facility for Marine Cyanobacteria <br />Department of Marine Biotechnology <br />Bharathidasan University <br />Tiruchirappalli -620024, Tamil Nadu </p>

<p>Applications are invited from individuals who have high motivation to do research for the below mentioned position, </p>

<p>1. Research Associate - 1 No. <br />in the DBT sponsored project under the supervision of Dr. D. Prabaharan, Principal Investigator, National Facility for Marine Cyanobacteria, Dept. of Marine Biotechnology, Bharathidasan University, Tiruchirappalli-24. </p>

<p>Title of the Project: “Establishment of National Repository for Micro algae &amp; Cyanobacteria” funded by Department of Biotechnology, Govt. of India </p>

<p>Qualification </p>

<p>1. Research Associate – 1 No. Rs. 36,000/38,000/40,000 per month for I, II and III year + 20% HRA </p>

<p>Essential : Doctoral degree in relevant subject from recognized University/ Institutes <br />Desirable: Research experience in molecular biology and bioinformatics </p>

<p>Interested candidates can send their complete CV in plain paper with a passport size photograph, with details of Marks secured in all subjects from plus two stage (with proof, full postal address, sex, date of birth, community etc., along with additional qualification or experiences and two address of references whom could be contacted (One of whom should be PG teacher/guide). Application should reach the Principal Investigator on or before 30.06.2015 by Email (nfmcbic@yahoo.com)/Registered post/ Speed post, with subject subscribed as “Application for Research Associate /Technical Assistant /Lab attendant”. Qualifying candidates will be short listed and communicated with date of interview. No TA and DA will be given for attending the interview. Addressfor Communication Dr. D. Prabaharan Principal Investigator National Facility for Marine Cyanobacteria Bharathidasan University Tiruchirappalli-620024, Tamil Nadu.</p>

<p>Advertisement: http://www.bdu.ac.in/adv/NFMC_Project_Positions.pdf</p>
]]></description>
</item>

</channel>
</rss>