<?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/31345?offset=1140</link>
	<atom:link href="https://bioinformaticsonline.com/related/31345?offset=1140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41734/supernova-generates-phased-whole-genome-de-novo-assemblies-from-a-chromium-prepared-library</guid>
	<pubDate>Sun, 31 May 2020 01:59:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41734/supernova-generates-phased-whole-genome-de-novo-assemblies-from-a-chromium-prepared-library</link>
	<title><![CDATA[Supernova: generates phased, whole-genome de novo assemblies from a Chromium-prepared library.]]></title>
	<description><![CDATA[<p>Supernova generates phased, whole-genome&nbsp;<em>de novo</em>&nbsp;assemblies from a Chromium-prepared library.</p>
<p>Please see&nbsp;<a href="https://support.10xgenomics.com/de-novo-assembly/guidance/doc/achieving-success-with-de-novo-assembly">Achieving Success with De Novo Assembly</a>&nbsp;and&nbsp;<a href="https://support.10xgenomics.com/de-novo-assembly/software/overview/system-requirements">System Requirements</a>&nbsp;<em>before</em>&nbsp;creating your Chromium libraries for assembly.</p>
<p>Supernova should be run using 38-56x coverage of the genome.<br>&bull; Somewhat higher coverage is&nbsp;<em>sometimes</em>&nbsp;advantageous.<br>&bull; Supernova will exit if it finds that coverage is far from the recommended range.<br>&bull; Note that at most 2.14 billion reads are allowed.<br>&bull; Please note that we have not extensively tested genomes larger than human, and any genome above approximately 4 GB should be considered experimental and is not supported.</p><p>Address of the bookmark: <a href="https://support.10xgenomics.com/de-novo-assembly/software/pipelines/latest/using/running" rel="nofollow">https://support.10xgenomics.com/de-novo-assembly/software/pipelines/latest/using/running</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/36281/binc-bioinformatics-national-certification-examination-2018</guid>
	<pubDate>Mon, 23 Apr 2018 03:34:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/36281/binc-bioinformatics-national-certification-examination-2018</link>
	<title><![CDATA[BINC (Bioinformatics National Certification) Examination 2018]]></title>
	<description><![CDATA[<p>Bioinformatics National Certification (BINC) was instituted by Department of Biotechnology, Government of India in 2005 at Savitribai Phule Pune University, formerly University of Pune, Pune to certify bioinformatics professionals and recognizing candidate's theoretical and practical ability and fostering interdisciplinary research. Later on, it was transferred to Jawaharlal Nehru University, New Delhi and then to Pondicherry University, Puducherry. Pondicherry University conducted the BINC examination in 2015, 2016 and 2017.</p><div><p>Biotech Consortium India Limited (BCIL), New Delhi is conducting the BINC 2018 examination on behalf Department of Biotechnology, Government of India.</p></div><div><p>BINC is a certification programme for graduate and post-graduate students for recognizing their exceptional bioinformatics knowledge and skills and to improve their employment opportunities. There is a growing need for trained manpower in the area of Bioinformatics. Currently, various universities and institutions, both government and private, impart Bioinformatics education in India. The qualifying candidates will be awarded a lifetime certificate. This certification would facilitate industries and potential employers in recruitment of Bioinformatics professionals having exceptionally good bioinformatics skills.</p></div><div><p>The certification under Bioinformatics National Certification (BINC) scheme is given to the candidates after three tier selection process. The successful candidates are also eligible for availing Junior Research Fellowship (JRF) for pursuing Ph.D. in Bioinformatics at recognized Indian universities/institutes. The research fellowships of all BINC qualified Indian nationals are funded by DBT. BINC qualified candidates are called DBT certified Bioinformaticians while the individuals availing the fellowships are called as DBT-BINC Junior Research Fellows (DBT-BINC-JRF). Cash prize of 10,000/- each is awarded to the top 10 BINC qualifiers.</p></div><div><p><strong>Eligibility</strong></p></div><div><p>i) Bachelor's/Master's degree in Life Sciences, Physical Sciences, Chemical Sciences, Mathematical Sciences, Agriculture, Veterinary, Medicine, Pharmacy, Engineering and Technology.&nbsp;</p></div><div><p>ii) No formal training, diploma or certificate in bioinformatics is required.</p></div><div><p>iii) Candidates in final year of Bachelor's/ Master's degree are also eligible to apply.</p></div><div><p><strong><a href="http://bcil.nic.in/PatternofExamination.html" target="_blank">Pattern of Examination&nbsp;</a></strong></p></div><div><p><strong>Syllabus</strong>&nbsp;</p></div><div><p>The syllabus consists of six sections - Bioinformatics, Biology, Physical Science, Chemical Science, Mathematics &amp; Statistics, and Information Technology.</p></div><div><ul>
<li><a href="http://bcil.nic.in/files/BINC/BINC_SYLLABUS_for_Paper_I_2018.pdf" target="_blank">Syllabus for Paper-I (Objective)</a></li>
<li><a href="http://bcil.nic.in/files/BINC/BINC_SYLLABUS_for_Paper_II_2018.pdf" target="_blank">Syllabus for Paper-II (Short answers)</a></li>
<li><a href="http://bcil.nic.in/files/BINC/BINC_SYLLABUS_for_Paper_III_2018.pdf" target="_blank">Syllabus for Paper-III (Practical)</a></li>
</ul></div><div><p><strong>Note: Paper-III will be computer based practical and will include programming on Bioinformatics</strong></p></div><div><p><strong><a href="http://bcil.nic.in/files/BINC/Important_Dates.pdf" target="_blank">Important Dates</a></strong></p></div><div><p><strong><a href="http://bcil.nic.in/files/BINC/Examination_Centers.pdf" target="_blank">Examination Centers&nbsp;</a></strong></p></div><div><p><strong><a href="http://bcil.nic.in/files/BINC/BINC_Fellowship.pdf" target="_blank">BINC Fellowship&nbsp;</a></strong></p></div><div><p><strong><a href="http://bcil.nic.in/formanddownload.html" target="_blank">Forms &amp; Downloads&nbsp;</a></strong></p></div><div><p><strong><a href="http://bcil.nic.in/files/BINC/FAQs.pdf" target="_blank">FAQs&nbsp;</a></strong>&nbsp;</p></div><div><h3>Contact Us</h3></div><div><ul>
<li>Nisha Singh</li>
<li>Biotech Consortium India Limited</li>
<li>(CIN: U73100DL1990PLC041486)</li>
<li>5th Floor, Anuvrat Bhawan 210, Deen Dayal Upadhyaya Marg New Delhi - 110 002</li>
<li>Tel.: 011-2321 9064-67 Ext. 231, 236</li>
<li>Email - For general BINC queries:<a href="mailto:binc.dbt@biotech.co.in" target="_blank">binc.dbt@biotech.co.in</a></li>
<li>Helpline for Application submission related queries:<a href="mailto:binc.binchelpdesk@biotech.co.in" target="_blank">binchelpdesk@biotech.co.in</a></li>
<li>Website:&nbsp;<a href="http://bcil.nic.in/BINC.html" target="_blank">www.bcil.nic.in/BINC.html</a></li>
</ul></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37317/interview-puzzles-for-bioinformatician</guid>
	<pubDate>Tue, 17 Jul 2018 05:26:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37317/interview-puzzles-for-bioinformatician</link>
	<title><![CDATA[Interview Puzzles for Bioinformatician !]]></title>
	<description><![CDATA[<p>These are some of the most famous Interview Puzzles being asked in top tech companies.<br /><br />Here is a list of Top 25 puzzles which have been asked in top Tech Interview.</p><ol>
<li><span><a href="http://puzzlefry.com/puzzles/2-eggs-and-100-floor-google-classic-question/" target="_blank">2 Eggs and 100 Floor Classic Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/gold-coins-puzzle/" target="_blank">Five pirates and gold coin Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/gold-puzzle/" target="_blank">Six pirates and Gold Coin puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/probability-of-having-boy/" target="_blank">Probability of having boy</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/random-airplane-seats/" target="_blank">Random Airplane Seats</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/inverted-cards-puzzle/" target="_blank">Inverted playing card puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/flipping-coins/" target="_blank">Flipping Coins Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/three-hat-colors/" target="_blank">Three hat colors Microsoft Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/25-horses-5-tracks-puzzle/" target="_blank">25 horses 5 tracks Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/gold-bar-puzzle-2/" target="_blank">Gold Bar Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/crossing-the-bridge-puzzle/" target="_blank">Crossing the Bridge Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/interview-questions/" target="_blank">Will you accept the bet?</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/the-line-of-persons-with-hats/" target="_blank">The Puzzle of 100 Hats</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/how-many-days/" target="_blank">Man fell in Well Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/minimum-number-of-weigths/" target="_blank">Minimum Number of Weigths</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/one-bulb-with-3-switches/" target="_blank">One Bulb with 3 Switches</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/find-the-minimum-number-of-aircraft/" target="_blank">Find the minimum number of aircraft</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/burning-ropes-to-measure-time/" target="_blank">Burning ropes to measure time</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/connect-3-houses-with-3-wells/" target="_blank">Connect 3 houses with 3 wells</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/measure-9-minutes-from-2-hourglasses-puzzle/" target="_blank">Measure 9 minutes from 2 hourglasses puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/ant-and-triangle-problem/" target="_blank">Ant and Triangle Problem</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/the-man-in-the-elevator/" target="_blank">The Man in the Elevator</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/find-the-survivor/" target="_blank">Find the survivor</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/free-the-prisoners-puzzle/" target="_blank">Free the prisoners puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/great-strategy-can-only-save-life/" target="_blank">GREAT STRATEGY CAN ONLY SAVE LIFE</a></span></li>
</ol><p><br /><span>Specially for Microsoft Interview Puzzles, you may refer,</span><br /><span><a href="http://puzzlefry.com/2015/08/top-15-famous-microsoft-interview-puzzles/" target="_blank">Top 15 Microsoft Interview Puzzles</a></span><br /><span><a href="http://puzzlefry.com/qa-tag/microsoft-interview-puzzles/" target="_blank">Microsoft Interview Puzzles</a></span><br /><br /><span>Other MOST COMMON Interview Puzzles-</span><br /><span><a href="http://puzzlefry.com/2015/08/top-25-tech-interview-puzzles-with-answers/" target="_blank">Top 25 Tech Interview&nbsp;</a></span><span><a href="http://puzzlefry.com/2015/08/top-25-tech-interview-puzzles-with-answers/" target="_blank">Logical Puzzles</a></span><br /><br /><span>Each of the puzzles got repeated a number of times in interviews&nbsp;</span><span>even for top tech companies&nbsp;</span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/38257/bioinformatics-programme-officer-international-centre-for-genetic-icgeb-engineering-and-biotechnology</guid>
  <pubDate>Fri, 23 Nov 2018 03:50:16 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Programme Officer @ International Centre for Genetic ICGEB Engineering and Biotechnology]]></title>
  <description><![CDATA[
<p>The following vacancies are available in the DBT Apex Biotechnology Information project at ICGEB, New Delhi, India. These positions are available for a period of approx. two years, however, initial appointment offer will be for 6 months, which will be extended based on performance of work. Salaries will be offered as per DBT, educational qualification and experience. Depending on requirements, selected candidates may be required to work on location from the Department of Biotechnology, New Delhi. Shortlisted candidates will be invited for an interview at ICGEB. Only the selected candidates will be informed individually. No TA/DA or accommodation will be offered to the candidates attending the interview. </p>

<p>4 Programme Officer 1 <br />5 Technical Research Assistant 1 </p>

<p>Minimum Educational Qualification, desirable experience and expected duties: </p>

<p>4: The applicants should be Postgraduates with experience in Data collection and Statistics, especially in Biotechnology-related data. </p>

<p>Expected duties: Collection of Biotechnology related information from India, to facilitate the Apex BTIC experts committee review of programmes at centres and R&amp;D programs funded by DBT. </p>

<p>5: The applicants should be Postgraduates in Science with experience in Bioinformatics-related projects. <br />Expected duties: The candidates will assist the senior staff of the centre in daily activities and help in the preparation of the Annual Training Calendar, seminar and training podcasts/videos, repository of training material and Apex BTIC Newsletter. </p>

<p>Interested candidates should submit their full, updated Curriculum Vitae with a detailed description of relevant experience, along with two references by December 14th, 2018, addressed to, The Chairperson, DBT- Apex BTIC, ICGEB, Aruna Asaf Ali Marg, New Delhi 110067, Email: abtic@icgeb.res.in, kindly write “Application for DBT Apex BTIC vacancy” in the subject of the email or envelope, if sending by post.</p>

<p>Advertisement: http://www.icgeb.org/tl_files/Vacancies/dbt-abtic-vac-annmntrevsk.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf</guid>
	<pubDate>Tue, 01 Feb 2022 04:56:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf</link>
	<title><![CDATA[Spades tutorial PDF]]></title>
	<description><![CDATA[<p>SPAdes&mdash;St. Petersburg genome Assembler&mdash;was originally developed for de novo assembly of genome sequencing data produced for cultivated microbial isolates and for single-cell genomic DNA sequencing. With time, the functionality of SPAdes was extended to enable assembly of IonTorrent data, as well as hybrid assembly from short and long reads (PacBio and Oxford Nanopore). In this article we present protocols for five different assembly pipelines that comprise the SPAdes package and that are used for assembly of metagenomes and transcriptomes as well as assembly of putative plasmids and biosynthetic gene clusters from whole-genome sequencing and metagenomic datasets.&nbsp;</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/43732" length="268093" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/38642/thank-you-email-after-bioinformatics-interview</guid>
	<pubDate>Tue, 08 Jan 2019 15:37:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/38642/thank-you-email-after-bioinformatics-interview</link>
	<title><![CDATA[Thank You Email After Bioinformatics Interview !]]></title>
	<description><![CDATA[<p>A good interview thank you email or note should contain three essential pieces:</p><p>a) Show appreciation for their time and thank them</p><p>b) Mention something specific you talked about in the interview, so they know it&rsquo;s not a cut &amp; paste email</p><p>c) Express interest in the position and tell them you&rsquo;re excited to learn more</p><p>d)&nbsp;Invite them to contact you if they have any questions/concerns, or need clarification on anything discussed</p><p>First sample:</p><blockquote><p>Dear Dr XYZ<br />I enjoyed speaking with you today about the XXX position&nbsp;at the X Lab, Uni. The job seems to be an excellent match for my&nbsp;skills and interests.<br /><br />The lab loaded with new updated technology and international experts,&nbsp;that you informed while interviewing confirmed my desire to work with&nbsp;X lab.<br /><br />In addition to my enthusiasm, I will bring to the position strong&nbsp;writing skills, assertiveness, and the ability to encourage others to&nbsp;work cooperatively with the group<br /><br />I appreciate the time you took to interview me. I am very interested&nbsp;in working with you and look forward to hearing from you regarding&nbsp;this position.<br /><br />Sincerely,<br />XXX</p></blockquote><p>Second sample:</p><p>&nbsp;</p><blockquote><p>Dear Dr XXX,</p><p>I wanted to take a second to thank you for your time . I enjoyed our conversation about and enjoyed learning about the position overall.</p><p>It sounds like an exciting opportunity, and an opportunity I could succeed and excel in! I&rsquo;m looking forward to hearing any updates you can share, and don&rsquo;t hesitate to contact me if you have any questions or concerns in the meantime.</p><p>Thanks again for the great conversation .</p><p>Best Regards,<br />XXX</p></blockquote>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</guid>
	<pubDate>Wed, 08 May 2024 07:32:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</link>
	<title><![CDATA[ContigExtender: a new approach to improving de novo sequence assembly for viral metagenomics data]]></title>
	<description><![CDATA[<p dir="auto">ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate contigs. ContigExtender is effective for extending contigs significantly in in silico synthesized and real metagenomics datasets.</p>
<p dir="auto">More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7953547/</p>
<p dir="auto"><a href="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" target="_blank"><img src="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" alt="extension process" title="extension process" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/dengzac/contig-extender" rel="nofollow">https://github.com/dengzac/contig-extender</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/40228/bioinformatics-services-cro-services</guid>
	<pubDate>Wed, 06 Nov 2019 00:33:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/40228/bioinformatics-services-cro-services</link>
	<title><![CDATA[Bioinformatics Services / CRO Services]]></title>
	<description><![CDATA[<p>RASA is set to provide premium technical and scientific services in a form of solutions, product development and training. .We are also very proficient in providing the high quality Research &amp; Development services in life science informatics field like Next Generation Sequencing (NGS) Data Analysis,Computational Drug Discovery, Bioinformatics, Chemo-informatics and BIO-IT.</p><p>RASA offers faster, better and cost effective cutting edge technology solutions to chemical and life science research and industry. We provide our customers with A seamless model of wide expertise and comprehensive platforms. Our Value is to take our customers</p>]]></description>
	<dc:creator>RASA Life Sciences</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</guid>
	<pubDate>Mon, 08 Apr 2024 06:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</link>
	<title><![CDATA[MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction]]></title>
	<description><![CDATA[<p><span>MIKE (MinHash-based&nbsp;</span><em>k</em><span>-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303&nbsp;</span><em>Zea</em><span>, 141&nbsp;</span><em>Ficus</em><span>, 67&nbsp;</span><em>Oryza</em><span>, and 43&nbsp;</span><em>Saccharum spontaneum</em><span>&nbsp;samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.</span></p><p>Address of the bookmark: <a href="https://github.com/Argonum-Clever2/mike" rel="nofollow">https://github.com/Argonum-Clever2/mike</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/40503/3-phd-positions-available-in-the-area-of-bioinformaticscomputational-biology-at-ulsteracuk</guid>
  <pubDate>Thu, 02 Jan 2020 12:41:10 -0600</pubDate>
  <link></link>
  <title><![CDATA[3 PhD positions available in the area of Bioinformatics/Computational Biology at ulster.ac.uk]]></title>
  <description><![CDATA[
<p>3 PhD positions available in the area of Bioinformatics/Computational Biology, Machine Learning (ML)/Artificial Intelligence (AI), Biomarker Discovery, Stratified/Personalized Medicine in Mental Health, Diabetes and Multimorbidity. Please see details (weblinks) below:</p>

<p>1. https://www.ulster.ac.uk/doctoralcollege/find-a-phd/510894<br />2. https://www.ulster.ac.uk/doctoralcollege/find-a-phd/511458<br />3. https://www.ulster.ac.uk/doctoralcollege/find-a-phd/512618</p>

<p>Looking for students with good computational/programming skills (preferable in Linux/Shell, Python and/or R) and knowledge in computational biology and statistics. However, students from more biology oriented background but strong interest to learn bioinformatics and programming are also encouraged to apply.</p>

<p>Informal inquiries are welcomed at: p.shukla@ulster.ac.uk</p>

<p>Dr Priyank Shukla PhD FHEA FCHERP<br />Lecturer (Asst Prof) in Stratified Medicine (Bioinformatics)</p>

<p>Northern Ireland Centre for Stratified Medicine<br />Biomedical Sciences Research Institute<br />University of Ulster (Magee Campus)<br />C-TRIC Building, Altnagelvin Area Hospital<br />Glenshane Road, Derry/Londonderry<br />BT47 6SB, Northern Ireland, United Kingdom</p>

<p>T: +44 28 7167 5690<br />E: p.shukla@ulster.ac.uk<br />W: https://www.ulster.ac.uk/staff/p-shukla</p>
]]></description>
</item>

</channel>
</rss>