<?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/39370?offset=960</link>
	<atom:link href="https://bioinformaticsonline.com/related/39370?offset=960" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/1469/prime-minister%E2%80%99s-100k-genome-project</guid>
	<pubDate>Thu, 08 Aug 2013 09:40:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/1469/prime-minister%E2%80%99s-100k-genome-project</link>
	<title><![CDATA[Prime Minister’s 100k Genome Project]]></title>
	<description><![CDATA[<p>Genomics Ebgland is destined to sequence 100,000 patients over the next five year in England.&nbsp; A landmark project by british government.</p><p>Genomics England will play a key role in building on the UK&rsquo;s long track record as leader in medical science advances to push the boundaries by unlocking the power of DNA data. The UK will become the first ever country to introduce this technology in its mainstream health system &ndash; leading the global race for better tests, better drugs and above all better, more personalised care.</p><p>http://www.genomicsengland.co.uk/100k-genome-project/</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35983/some-useful-bioinformatics-links</guid>
	<pubDate>Fri, 16 Mar 2018 20:50:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35983/some-useful-bioinformatics-links</link>
	<title><![CDATA[Some useful Bioinformatics links]]></title>
	<description><![CDATA[<p><br /> Reference-free prediction of rearrangement breakpoint reads | Bioinformatics | Oxford Academic</p><p>https://academic.oup.com/bioinformatics/article/30/18/2559/2475628<br /> Reference-free SNP detection: dealing with the data deluge</p><p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4083407/<br /> GATB/DiscoSnp: DiscoSnp is designed for discovering all kinds of SNPs (not only isolated ones), as well as insertions and deletions, from raw set(s) of reads.</p><p>https://github.com/GATB/DiscoSnp<br /> De novo assembly | Oxford Nanopore Technologies</p><p>https://nanoporetech.com/taxonomy/term/131<br /> De novo long-read assembly of a complex animal genome | bioRxiv</p><p>https://www.biorxiv.org/content/early/2017/09/10/187054<br /> Rapid de novo assembly of the European eel genome from nanopore sequencing reads | Scientific Reports</p><p>https://www.nature.com/articles/s41598-017-07650-6.epdf?author_access_token=dktG7e98wyRJnaEEMTcPqtRgN0jAjWel9jnR3ZoTv0P7E7t-wVGo30iojNO7dICajNY_7PE5xVPv6OoLe7hn9TeUjcZ5umREOzNoPMWkfYH58RS6uxm3vm4e4BG2AA_WKW84i6egKK271NwMq-NfzA%3D%3D<br /> nanoporetech/ont-assembly-polish: ONT assembly and Illumina polishing pipeline</p><p>https://github.com/nanoporetech/ont-assembly-polish<br /> Generade-nl/TULIP: TULIP - The Uncorrected Long read Itegration Pipeline</p><p>https://github.com/Generade-nl/TULIP<br /> www.nature.com</p><p>https://www.nature.com/articles/s41598-017-03996-z<br /> Example gallery of NanoPlot &ndash; Gigabase or gigabyte</p><p>https://gigabaseorgigabyte.wordpress.com/2017/06/01/example-gallery-of-nanoplot/<br /> Tool documentation</p><p>https://broadinstitute.github.io/picard/command-line-overview.html<br /> Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions. - PubMed - NCBI</p><p>https://www.ncbi.nlm.nih.gov/pubmed/24185095<br /> MAFFT ver.7 - a multiple sequence alignment program</p><p>https://mafft.cbrc.jp/alignment/software/algorithms/algorithms.html<br /> Measuring the distance between multiple sequence alignments | Bioinformatics | Oxford Academic</p><p>https://academic.oup.com/bioinformatics/article/28/4/495/212883<br /> The MUMmer 3 examples</p><p>http://mummer.sourceforge.net/examples/<br /> MAFFT ver.7 - a multiple sequence alignment program</p><p>https://mafft.cbrc.jp/alignment/software/tips.html<br /> Omega | Overlap-graph de novo Assembler for Metagenomics</p><p>https://omega.omicsbio.org/<br /> abiswas-odu/Disco: Multi-threaded Distributed Memory Overlap-Layout-Consensus (OLC) Metagenome Assembler</p><p>https://github.com/abiswas-odu/Disco<br /> SAGE: String-overlap Assembly of GEnomes | BMC Bioinformatics | Full Text</p><p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-15-302</p><p>Fast and sensitive mapping of nanopore sequencing reads with GraphMap | Nature Communications</p><p>https://www.nature.com/articles/ncomms11307<br /> lumpy-sv/extractSplitReads_BwaMem at master &middot; arq5x/lumpy-sv</p><p>https://github.com/arq5x/lumpy-sv/blob/master/scripts/extractSplitReads_BwaMem<br /> jts/nanocorrect: Experimental pipeline for correcting nanopore reads</p><p>https://github.com/jts/nanocorrect</p><p>video - how to install flash plugin on ubuntu 14.04 LTS 64-bit version - Ask Ubuntu</p><p>https://askubuntu.com/questions/469553/how-to-install-flash-plugin-on-ubuntu-14-04-lts-64-bit-version<br /> lh3/fermi: A WGS de novo assembler based on the FMD-index for large genomes</p><p>https://github.com/lh3/fermi<br /> Multi-metagenome</p><p>http://madsalbertsen.github.io/multi-metagenome/docs/step9.html<br /> Bandage by rrwick</p><p>https://rrwick.github.io/Bandage/<br /> Codon Optimization OnLine (COOL): a web-based multi-objective optimization platform for synthetic gene design | Bioinformatics | Oxford Academic</p><p>https://academic.oup.com/bioinformatics/article/30/15/2210/2391162<br /> Genome Architecture and Evolution of a Unichromosomal Asexual Nematode - ScienceDirect</p><p>https://www.sciencedirect.com/science/article/pii/S096098221731076X?via%3Dihub#fig4<br /> How to determine chimeras in my de novo assembly? - SEQanswers</p><p>http://seqanswers.com/forums/showthread.php?t=26721<br /> samtools(1) manual page</p><p>http://www.htslib.org/doc/samtools.html<br /> How To Filter Mapped Reads With Samtools</p><p>https://www.biostars.org/p/56246/<br /> The MUMmer 3 manual</p><p>http://mummer.sourceforge.net/manual/#nucmer<br /> assembly_olc.pdf</p><p>http://www.cs.jhu.edu/~langmea/resources/lecture_notes/assembly_olc.pdf<br /> SAM and BAM filtering oneliners</p><p>https://gist.github.com/davfre/8596159<br /> Inroduction to dot-plots</p><p>http://www.code10.info/index.php%3Foption%3Dcom_content%26view%3Darticle%26id%3D64:inroduction-to-dot-plots%26catid%3D52:cat_coding_algorithms_dot-plots%26Itemid%3D76<br /> RepeatFinder Home Page</p><p>http://www.cbcb.umd.edu/software/RepeatFinder/<br /> RepeatFinderReprint.pdf</p><p>http://www.cbcb.umd.edu/software/RepeatFinder/RepeatFinderReprint.pdf<br /> https://bernatgel.github.io/karyoploter_tutorial//Tutorial/CreateIdeogram/CreateIdeogram.html</p><p>https://bernatgel.github.io/karyoploter_tutorial//Tutorial/CreateIdeogram/CreateIdeogram.html<br /> Circular Visualization in R</p><p>http://zuguang.de/circlize_book/book/introduction.html#a-qiuck-glance<br /> Creating a coverage plot using BEDTools and R</p><p>https://davetang.org/muse/2015/08/05/creating-a-coverage-plot-using-bedtools-and-r/<br /> Eval: A software package for analysis of genome annotations | BMC Bioinformatics | Full Text</p><p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-4-50<br /> eval-documentation.pdf</p><p>http://mblab.wustl.edu/media/software/eval-documentation.pdf<br /> OmicCircos: A Simple-to-Use R Package for the Circular Visualization of Multidimensional Omics Data</p><p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3921174/<br /> sequence - download.tardigrades.org &gt; v1 &gt; sequence</p><p>http://download.tardigrades.org/v1/sequence/<br /> ksahlin/BESST: BESST - scaffolder for genomic assemblies</p><p>https://github.com/ksahlin/BESST<br /> reubwn/scripts: Useful scripts for various things</p><p>https://github.com/reubwn/scripts<br /> ICEberg</p><p>http://db-mml.sjtu.edu.cn/ICEberg/index.php<br /> Satsuma - Evolution and Genomics</p><p>http://evomics.org/learning/genomics/satsuma/<br /> A complete bacterial genome assembled de novo using only nanopore sequencing data | Nature Methods</p><p>https://www.nature.com/articles/nmeth.3444<br /> vezzi/FRC_align: Computes FRC from SAM/BAM file and not from afg files</p><p>https://mail.google.com/mail/u/0/#inbox<br /> Read GTF file into R - Dave Tang's blog</p><p>https://davetang.org/muse/2017/08/04/read-gtf-file-r/</p><p>https://bernatgel.github.io/karyoploter_tutorial//Tutorial/CustomGenomes/CustomGenomes.html</p><p>https://bernatgel.github.io/karyoploter_tutorial//Tutorial/CustomGenomes/CustomGenomes.html<br /> Dot: Interactive dot plot for genome-genome alignments</p><p>https://dnanexus.github.io/dot/<br /> Zoho Accounts</p><p>https://accounts.zoho.eu/signin?servicename=ZohoProjects&amp;serviceurl=https%3A%2F%2Fprojects.zoho.eu%2Fportal%2Favaga2<br /> lh3/minimap2: A versatile pairwise aligner for genomic and spliced nucleotide sequences</p><p>https://github.com/lh3/minimap2<br /> SSPACE-LongRead: scaffolding bacterial draft genomes using long read sequence information | BMC Bioinformatics | Full Text</p><p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-15-211<br /> Palindromic gene amplification &mdash; an evolutionarily conserved role for DNA inverted repeats in the genome | Nature Reviews Cancer</p><p>https://www.nature.com/articles/nrc2591<br /> bioinformatics - BLAST DNA Sequences Reversed - Biology Stack Exchange</p><p>https://biology.stackexchange.com/questions/8160/blast-dna-sequences-reversed<br /> LASTZ</p><p>http://www.bx.psu.edu/miller_lab/dist/README.lastz-1.02.00/README.lastz-1.02.00a.html<br /> SOGo - (1652) Inbox</p><p>https://sogo.unamur.be/SOGo/so/jnarayan/Mail/view<br /> Tetra-Nucleotide Analysis (TNA) | BIOiPLUG Help center</p><p>http://help.bioiplug.com/tetra-nucleotide-analysis-tna/</p><p>Clustering metagenomic contigs on tetranucleotide frequency &mdash; CGAT documentation</p><p>http://cgat.readthedocs.io/en/latest/recipes/metagenome_contigs_kmers.html</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/1491/2013-nextgen-genomics-bioinformatics-technologies-ngbt-conference-new-delhi-india</guid>
  <pubDate>Thu, 08 Aug 2013 16:21:16 -0500</pubDate>
  <link></link>
  <title><![CDATA[2013 NextGen Genomics &amp; Bioinformatics Technologies (NGBT) Conference, New Delhi, INDIA]]></title>
  <description><![CDATA[
<p>2013 NextGen Genomics &amp; Bioinformatics Technologies (NGBT) Conference</p>

<p>SciGenom Research Foundation (SGRF) and Institute of Genomics and Integrative Biology (IGIB) are pleased to host the Next-Generation Sequencing and Bioinformatics for Genomics &amp; Healthcare conference.</p>

<p>In the ten years since the first human reference genome was completed for US$3 billion the sequencing technologies have radically changed leading to great reduction in sequencing cost. Today a human genome can be sequenced for under US$ 5000 in less than two weeks. It is expected that by the end of 2015 the cost of sequencing a human genome will drop to below thousand dollars. The next generation sequencing technologies over the past five years have enabled a large number of genomic studies that impact human health and disease. Also, this has made possible the growth of microbial, animal and plant genomics studies. While the data production has increased at a rapid pace challenges remain in analyzing and understanding the data. The conference will cover the next generation sequencing (NGS) technologies, bioinformatics for NGS and applications of NGS in many areas including personalized medicine.</p>

<p>For more info : http://www.scigenomconferences.com/2013/default.php</p>
]]></description>
</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/opportunity/view/1720/postdoctoral-associate-bioinformatics-at-duke-university-medical-center</guid>
  <pubDate>Sat, 10 Aug 2013 18:38:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral Associate - Bioinformatics  at Duke University Medical Center]]></title>
  <description><![CDATA[
<p>The Department of Biostatistics and Bioinformatics at Duke University Medical Center is seeking a Postdoctoral Associate for a one year appointment to work on several high-dimensional research projects. The specific goals of the project are to identify genes or molecular markers that are predictive of clinical outcomes in renal and prostate cancer.</p>

<p>Candidates must have: a PhD degree in statistics, biostatistics or bioinformatics, extensive experience in analyzing high-dimensional data (microarray, SNP, CNVs) and of validation approaches. In addition, experience in penalized regression methods, data base manipulation; and strong programming skills in order to conduct Monte Carlo studies and applications (R). Candidate must have excellent communication skills (verbal, written and presentation), a strong proficiency in Linux system.</p>

<p>This position is available immediately and will be filled as soon as possible. Appointment could be extended beyond the first year based on additional funding.</p>

<p>For more information about the Department of Biostatistics and Bioinformatics, please visit our website: http://www.biostat.duke.edu.</p>

<p>For more info: http://biostat.duke.edu/sites/biostat.duke.edu/files/Halabi%20-%20Postdoc%20Job%20Posting%202013%20updated.pdf</p>

<p>Duke University is an Equal Opportunity/Affirmative Action Employer.</p>
]]></description>
</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/view/2021</guid>
	<pubDate>Mon, 12 Aug 2013 09:27:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/2021</link>
	<title><![CDATA[What are the difference between BioRuby and BioGem?]]></title>
	<description><![CDATA[<p>I came across two diferent but matching term BioRuby and BioGem. What are the difference between these two term? If both are using same Ruby language for development then why did they develope two different biological packages.</p>]]></description>
	<dc:creator>Neel</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/videolist/watch/4090/computational-biology-in-the-21st-century-making-sense-out-of-massive-data</guid>
	<pubDate>Thu, 29 Aug 2013 08:32:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4090/computational-biology-in-the-21st-century-making-sense-out-of-massive-data</link>
	<title><![CDATA[Computational Biology in the 21st Century: Making Sense out of Massive Data]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/I99UiA_vaJQ" frameborder="0" allowfullscreen></iframe>Computational Biology in the 21st Century: Making Sense out of Massive Data    
    
Air date:  Wednesday, February 01, 2012, 3:00:00 PM
Category:  Wednesday Afternoon Lectures  
 
Description:  The last two decades have seen an exponential increase in genomic and biomedical data, which will soon outstrip advances in computing power to perform current methods of analysis. Extracting new science from these massive datasets will require not only faster computers; it will require smarter algorithms. We show how ideas from cutting-edge algorithms, including spectral graph theory and modern data structures, can be used to attack challenges in sequencing, medical genomics and biological networks. 

The NIH Wednesday Afternoon Lecture Series includes weekly scientific talks by some of the top researchers in the biomedical sciences worldwide. 

Author:  Dr. Bonnie Berger  
Runtime:  00:58:06  
Permanent link:  http://videocast.nih.gov/launch.asp?17563]]></description>
	
</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>

</channel>
</rss>