<?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/28937?offset=400</link>
	<atom:link href="https://bioinformaticsonline.com/related/28937?offset=400" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</guid>
	<pubDate>Sun, 02 Apr 2017 14:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</link>
	<title><![CDATA[Fools guide]]></title>
	<description><![CDATA[<p><span>This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.</span></p>
<p>http://sfg.stanford.edu/denovo.html</p>
<p>http://sfg.stanford.edu/sequencing.html</p>
<p>http://sfg.stanford.edu/BLAST.html</p>
<p>http://sfg.stanford.edu/denovo.html&nbsp;</p><p>Address of the bookmark: <a href="http://sfg.stanford.edu/guide.html" rel="nofollow">http://sfg.stanford.edu/guide.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30833/dnasp-v5-a-software-for-comprehensive-analysis-of-dna-polymorphism-data</guid>
	<pubDate>Mon, 06 Feb 2017 04:45:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30833/dnasp-v5-a-software-for-comprehensive-analysis-of-dna-polymorphism-data</link>
	<title><![CDATA[DnaSP v5: a software for comprehensive analysis of DNA polymorphism data]]></title>
	<description><![CDATA[<p><span>DnaSP is a software package for a comprehensive analysis of DNA polymorphism data. Version 5 implements a number of new features and analytical methods allowing extensive DNA polymorphism analyses on large datasets. Among other features, the newly implemented methods allow for: (i) analyses on multiple data files; (ii) haplotype phasing; (iii) analyses on insertion/deletion polymorphism data; (iv) visualizing sliding window results integrated with available genome annotations in the UCSC browser.</span></p><p>Address of the bookmark: <a href="http://www.ub.edu/dnasp/" rel="nofollow">http://www.ub.edu/dnasp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</guid>
	<pubDate>Tue, 02 May 2017 07:58:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</link>
	<title><![CDATA[Mapping NGS]]></title>
	<description><![CDATA[<p>NGS data are just a bunch of sequences, you have no idea which region in the genome each sequences comes from, which gene it represents...<br>To know that you have to align the sequences to the reference sequence. The reference sequence is in most cases the full genome sequence but sometimes, a library of EST sequences is used.<br>In either way, aligning your sequence reads to the reference sequence is called mapping.</p>
<p>The most used mappers of DNA-seq data are&nbsp;<a href="http://bio-bwa.sourceforge.net/" target="_blank">BWA</a>&nbsp;and&nbsp;<a href="http://bowtie-bio.sourceforge.net/bowtie2/index.shtml" target="_blank">Bowtie</a>&nbsp;for DNA-Seq data and&nbsp;<a href="http://tophat.cbcb.umd.edu/" target="_blank">Tophat</a>,&nbsp;<a href="https://github.com/alexdobin/STAR" target="_blank">STAR</a>&nbsp;or&nbsp;<a href="http://www.ccb.jhu.edu/software/hisat/index.shtml" target="_blank">HISAT</a>&nbsp;for RNA-Seq data. Mappers differ in which options they can take in, how fast and how accurate they are. Bowtie is faster than BWA, but looses some sensitivity (does not map an equal amount of reads to the correct position in the genome).</p><p>Address of the bookmark: <a href="http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data" rel="nofollow">http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32379/enrichr-a-comprehensive-gene-set-enrichment-analysis</guid>
	<pubDate>Thu, 27 Apr 2017 05:42:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32379/enrichr-a-comprehensive-gene-set-enrichment-analysis</link>
	<title><![CDATA[Enrichr: a comprehensive gene set enrichment analysis]]></title>
	<description><![CDATA[<p><span>Enrichment analysis is a popular method for analyzing gene sets generated by genome-wide experiments. Here we present a significant update to one of the tools in this domain called Enrichr. Enrichr currently contains a large collection of diverse gene set libraries available for analysis and download. In total, Enrichr currently contains 180 184 annotated gene sets from 102 gene set libraries. New features have been added to Enrichr including the ability to submit fuzzy sets, upload BED files, improved application programming interface and visualization of the results as clustergrams. Overall, Enrichr is a comprehensive resource for curated gene sets and a search engine that accumulates biological knowledge for further biological discoveries. Enrichr is freely available at:&nbsp;</span><a href="http://amp.pharm.mssm.edu/Enrichr" target="">http://amp.pharm.mssm.edu/Enrichr</a><span>.</span></p>
<p>https://academic.oup.com/nar/article-lookup/doi/10.1093/nar/gkw377</p><p>Address of the bookmark: <a href="http://amp.pharm.mssm.edu/Enrichr/" rel="nofollow">http://amp.pharm.mssm.edu/Enrichr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37233/rna-seq-analysis-workshop-course-materials</guid>
	<pubDate>Tue, 03 Jul 2018 08:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37233/rna-seq-analysis-workshop-course-materials</link>
	<title><![CDATA[RNA-seq Analysis Workshop Course Materials]]></title>
	<description><![CDATA[RNAseq can be roughly divided into two "types":

Reference genome-based - an assembled genome exists for a species for which an RNAseq experiment is performed. It allows reads to be aligned against the reference genome and significantly improves our ability to reconstruct transcripts. This category would obviously include humans and most model organisms but excludes the majority of truly biologically intereting species (e.g., Hyacinth macaw);

Reference genome-free - no genome assembly for the species of interest is available. In this case one would need to assemble the reads into transcripts using de novo approaches. This type of RNAseq is as much of an art as well as science because assembly is heavily parameter-dependent and difficult to do well.
In this lesson we will focus on the Reference genome-based type of RNA seq.

http://chagall.med.cornell.edu/RNASEQcourse/<p>Address of the bookmark: <a href="http://chagall.med.cornell.edu/RNASEQcourse/" rel="nofollow">http://chagall.med.cornell.edu/RNASEQcourse/</a></p>]]></description>
	<dc:creator>Jit</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/bookmarks/view/39875/lrsday-long-read-sequencing-data-analysis-for-yeasts</guid>
	<pubDate>Mon, 26 Aug 2019 18:07:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39875/lrsday-long-read-sequencing-data-analysis-for-yeasts</link>
	<title><![CDATA[LRSDAY: Long-read Sequencing Data Analysis for Yeasts]]></title>
	<description><![CDATA[<p><span>Long-read sequencing technologies have become increasingly popular in genome projects due to their strengths in resolving complex genomic regions. As a leading model organism with small genome size and great biotechnological importance, the budding yeast,&nbsp;</span><em>Saccharomyces cerevisiae</em><span>, has many isolates currently being sequenced with long reads.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/yjx1217/LRSDAY" rel="nofollow">https://github.com/yjx1217/LRSDAY</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</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/bookmarks/view/42419/biojupies-automatically-generates-rna-seq-data-analysis-notebooks</guid>
	<pubDate>Sun, 20 Dec 2020 11:43:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42419/biojupies-automatically-generates-rna-seq-data-analysis-notebooks</link>
	<title><![CDATA[BioJupies: Automatically Generates RNA-seq Data Analysis Notebooks]]></title>
	<description><![CDATA[<p>With BioJupies you can produce in seconds a customized, reusable, and interactive report from your own raw or processed RNA-seq data through a simple user interface</p>
<p>BioJupies now supports user accounts! Sign in from the top right corner of the page for access to unlimited private notebooks, RNA-seq datasets and alignment jobs.</p><p>Address of the bookmark: <a href="https://amp.pharm.mssm.edu/biojupies/" rel="nofollow">https://amp.pharm.mssm.edu/biojupies/</a></p>]]></description>
	<dc:creator>Rahul Nayak</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>

</channel>
</rss>