<?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/44157?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/44157?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/38590/senior-bioinformatics-scientist-strand-life-sciences-bangalore-india</guid>
  <pubDate>Wed, 02 Jan 2019 09:23:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[Senior Bioinformatics Scientist @ Strand Life Sciences -- Bangalore, India]]></title>
  <description><![CDATA[
<p>RESPONSIBILITIES<br />The candidate is expected to work on a variety of projects related to analysis of data from NGS, Mass Spectrometry, Flow Cytometry and other related modalities. The position expects hands-on work and a strong eye for detail. The candidate will be able to contribute to impactful work spanning patient care, clinical research, and new assay and method development.<br />REQUIREMENTS<br />A PhD in a quantitative field (statistics, math, bioinformatics, computer science, physics or similar) and work experience or post-doc experience handling high throughout genomics data.<br />PREFERENCES<br />Experience in working in inter-disciplinary groups and ability to author research publications are additional desired qualities.<br />LOCALE<br />The position is in Bangalore and reports to the Chief Scientific Officer.<br />HOW TO APPLY<br />Write to ramesh[at]strandls.com.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/38293/tree-illustrating-the-lack-of-interchromosomal-rearrangement-of-the-microchromosomes</guid>
	<pubDate>Mon, 26 Nov 2018 04:20:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/38293/tree-illustrating-the-lack-of-interchromosomal-rearrangement-of-the-microchromosomes</link>
	<title><![CDATA[Tree illustrating the lack of interchromosomal rearrangement of the microchromosomes.]]></title>
	<description><![CDATA[<p><span>Tree illustrating the lack of interchromosomal rearrangement of the microchromosomes. No interchromosomal microchromosome fusions from the avian ancestor unless otherwise stated (macrochromosomal fusions not listed). The overall pattern of microchromosome stability and rearrangement across the species is illustrated</span></p><p><span><span>Jarvis et al. (2014)</span></span></p><p><span><span>Reference&nbsp;https://link.springer.com/article/10.1007/s00412-018-0685-6</span></span></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/38293" length="291560" type="image/png" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33924/figtree</guid>
	<pubDate>Wed, 19 Jul 2017 08:06:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33924/figtree</link>
	<title><![CDATA[FigTree]]></title>
	<description><![CDATA[<p><span>FigTree is designed as a graphical viewer of phylogenetic trees and as a program for producing publication-ready figures. As with most of my programs, it was written for my own needs so may not be as polished and feature-complete as a commercial program. In particular it is designed to display summarized and annotated trees produced by BEAST.</span></p><p>Address of the bookmark: <a href="http://tree.bio.ed.ac.uk/software/figtree/" rel="nofollow">http://tree.bio.ed.ac.uk/software/figtree/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43319/k-mers-tutorial-classification-and-taxonomy</guid>
	<pubDate>Thu, 26 Aug 2021 10:28:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43319/k-mers-tutorial-classification-and-taxonomy</link>
	<title><![CDATA[k-mers tutorial - classification and taxonomy]]></title>
	<description><![CDATA[<p>DNA k-mers underlie much of our assembly work, and we (along with many others!) have spent a lot of time thinking about how to&nbsp;<a href="http://www.pnas.org/content/109/33/13272">store k-mer graphs efficiently</a>,&nbsp;<a href="http://ivory.idyll.org/blog/what-is-diginorm.html">discard redundant data</a>, and&nbsp;<a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0101271">count them efficiently</a>.</p>
<p>More recently, we've been enthused about&nbsp;<a href="http://joss.theoj.org/papers/3d793c6e7db683bee7c03377a4a7f3c9">using k-mer based similarity measures</a>&nbsp;and&nbsp;<a href="http://ivory.idyll.org/blog/2016-sourmash-sbt.html">computing and searching k-mer-based sketch search databases for all the things</a>.</p>
<p>But I haven't spent too much talking about using k-mers for taxonomy, although that has become an&nbsp;<em>ahem</em>&nbsp;area of interest recently,&nbsp;<a href="http://www.biorxiv.org/content/early/2017/07/03/155358">if you read into our papers a bit</a>.</p>
<p>In this blog post I'm going to fix this by doing a little bit of a literature review and waxing enthusiastic about other people's work. Then in a future blog post I'll talk about how we're building off of this work in fun! and interesting? ways!</p><p>Address of the bookmark: <a href="http://ivory.idyll.org/blog/2017-something-about-kmers.html" rel="nofollow">http://ivory.idyll.org/blog/2017-something-about-kmers.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/8987/the-dna-of-a-successful-bioinformatician-decoded</guid>
	<pubDate>Wed, 12 Mar 2014 13:41:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/8987/the-dna-of-a-successful-bioinformatician-decoded</link>
	<title><![CDATA[The DNA of a Successful Bioinformatician decoded !!!]]></title>
	<description><![CDATA[<p>Many blogs exist about successful bioinformatician, but this blog so far now is my personal view on characteristics of successful bioinformatician or computational biologist. &nbsp;Hmm &hellip; of course these views are subjective to my own personal experiences and therefore I don't claim that the view listed here is complete. As a human, I don&rsquo;t take them too serious. The success must not be the only target of your work. The target is to work on your own virtues; some of those virtues are the topic of this blog.</p><p><img src="http://bioinformaticsonline.com/mod/photo/genome_decode.png" alt="image" width="509" height="458" style="border: 0px; border: 0px;"><br /> <br /> <strong>1. Update new things continuously<br /></strong>As per my personal experience, it&rsquo;s not always easy to work as a bioinformatician! &nbsp;There are couple of reasons to say that; First computational part of biology make our life&rsquo;s a little harder compared to other professional categories. The fact - for instance - that the technology cycle in the bioinformatics world is very short, the actual knowledge becomes outdated in a few months or years. Therefore, we need to learn continuously - new things get important. Second, to stay on top of things we really need the strong will to be good at our job. That's probably the most important characteristic to bioinformatician. They are usually an excellent knowledge worker with great technical abilities, and have the will to be that over decades!<br /> <br /> <strong>2. Avoid the sentence </strong><strong>"I did not know what to do!"</strong><br /> In our computational biology lab, we generally face lots of technical problems. But as you know, it's impossible to know everything to do the computational biology jobs ( Yup.. because you need diverse and multidisciplinary knowledge to understand biological problems and resolve their respective solutions), therefore it's absolutely necessary that a bioinformatician finds its way through a new topic. How I typically do that is I use google and I talk to other experts in our laboratory or online biostar community to find out what they think. "I did not know what to do!" should not be an argument for us.<strong><br /><br /> <strong>3. To make oneself useful</strong></strong><br /> Several time it does happen, you finished our task earlier than expected; in such cases if you have some time left then: Take a coffee and play chess; reversi, etc. In my case I take a rest. Afterwards I think about what I could do that helps the team to achieve its targets, 'cause some of my team mates probably didn't finish! (at least if I didn't met them at coffee bar !!)</p><p><strong>4. Care for all</strong><br /> During my rigorous research duration; I attended several workshop organized by my University departments. I had a discussion with other research fellow, professors; I generally ask &hellip; what it really takes to make a team successful or to be a successful research leader. They always said: "Well, you need some caring people!" I think there is a lot truth in that statement. If we do not care about quality, timelines, good team culture, respectful communication (!!), clean code, if all this doesn&rsquo;t matter to us, then I believe the probability is higher that we fail in research and analysis. <br /> <br /> <strong>5. Be good with people</strong><br /> Because bioinformatician and computational biologist jobs typically involves to work in a (most wanted J cross-departmental!) team, therefore it's important that we're (more or less) good in dealing with other individuals. Everyone have their own strengths and weaknesses, just like us. It's important to treat all the research team mates with respect, regardless of their technical competence or contributions. Of course, sometimes people deserve a clear statement (!!!), but try to do these things one-on-one. Make sure nobody loses his face. Attend the meetings at the coffee bar; be good at table top soccer and go out once in a while to have a beer with your team. You know what I'm talking about.</p><p>At the end of a week I look back and I ask myself what I have produced. This could be paperwork, community days or (best!!) programming code. Always remember there is always a solution to a problem. Most of the times there are at least three solutions. So, don&rsquo;t just blame, suggest a solution.<br /> <br /> That's it. I am looking forward to your thoughts and comments!</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30698/itol-interactive-tree-of-life</guid>
	<pubDate>Tue, 31 Jan 2017 05:56:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30698/itol-interactive-tree-of-life</link>
	<title><![CDATA[iTOL: interactive Tree Of Life]]></title>
	<description><![CDATA[<p><strong>Interactive Tree Of Life</strong><span>&nbsp;is an online tool for the display and manipulation of phylogenetic trees. It provides most of the features available in other tree viewers, and offers a novel circular tree layout, which makes it easy to visualize mid-sized tree (up to several thousand leaves). Trees can be exported to several graphical formats, both bitmap and vector based.</span></p>
<p><img src="http://itol.embl.de/img/home/ex3.png" alt="image" style="border: 0px;"><br><span>There are several pre-computed trees available for display, including the main Tree Of Life, described in&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/16513982">Ciccarelli, et al., 2006</a><span>. In addition to the precomputed trees, users can upload and display personal trees and data, using the 'Data upload' page or through a personal user account.</span></p><p>Address of the bookmark: <a href="http://itol.embl.de/" rel="nofollow">http://itol.embl.de/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</guid>
	<pubDate>Wed, 27 Nov 2019 05:32:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</link>
	<title><![CDATA[Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees]]></title>
	<description><![CDATA[<p><span>The Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees (although clustering trees or any other tree-like data structure are also supported).</span></p>
<p><span>Other tools</span></p>
<p><span><a href="https://github.com/shenwei356/taxonkit">https://github.com/shenwei356/taxonkit</a></span></p>
<p>&nbsp;</p>
<ul>
<li>ETE, version:&nbsp;<a href="https://pypi.org/project/ete3/3.1.1/">3.1.1</a></li>
<li>BioPython, version:&nbsp;<a href="https://pypi.org/project/biopython/1.73/">1.73</a></li>
<li>taxadb, version:&nbsp;<a href="https://pypi.org/project/taxadb/0.9.0">0.10.1</a></li>
<li>TaxonKit, version:&nbsp;<a href="https://github.com/shenwei356/taxonkit/releases/tag/0.10.1">0.5.0</a></li>
</ul><p>Address of the bookmark: <a href="https://pypi.org/project/ete3/3.1.1/" rel="nofollow">https://pypi.org/project/ete3/3.1.1/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</guid>
	<pubDate>Fri, 06 Apr 2018 12:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</link>
	<title><![CDATA[d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.]]></title>
	<description><![CDATA[<p><a href="http://bost.ocks.org/mike/">Mike Bostock</a><span>&rsquo;s&nbsp;</span><a href="http://d3js.org/">D3.js</a><span>&nbsp;is great for creating&nbsp;</span><a href="http://bl.ocks.org/mbostock/4062045">interactive network graphs</a><span>&nbsp;with JavaScript. The&nbsp;</span><a href="https://github.com/christophergandrud/d3Network">d3Network</a><span>&nbsp;package makes it easy to create these network graphs from&nbsp;</span><a href="http://www.r-project.org/">R</a><span>. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.</span></p><p>Address of the bookmark: <a href="http://christophergandrud.github.io/d3Network/" rel="nofollow">http://christophergandrud.github.io/d3Network/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43916/understanding-dump-files-from-ncbi-taxonomy-database</guid>
	<pubDate>Fri, 15 Jul 2022 04:29:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43916/understanding-dump-files-from-ncbi-taxonomy-database</link>
	<title><![CDATA[Understanding DUMP files from NCBI Taxonomy database !]]></title>
	<description><![CDATA[<p>*.dmp files are bcp-like dump from GenBank taxonomy database</p><p>General information.</p><p>Field terminator is "\t|\t"</p><p>Row terminator is "\t|\n"</p><p>&nbsp;</p><p>nodes.dmp file consists of taxonomy nodes. The description for each node includes the following</p><p>fields:</p><p>tax_id -- node id in GenBank taxonomy database</p><p>&nbsp; parent tax_id -- parent node id in GenBank taxonomy database</p><p>&nbsp; rank -- rank of this node (superkingdom, kingdom, ...)&nbsp;</p><p>&nbsp; embl code -- locus-name prefix; not unique</p><p>&nbsp; division id -- see division.dmp file</p><p>&nbsp; inherited div flag&nbsp; (1 or 0) -- 1 if node inherits division from parent</p><p>&nbsp; genetic code id -- see gencode.dmp file</p><p>&nbsp; inherited GC&nbsp; flag&nbsp; (1 or 0) -- 1 if node inherits genetic code from parent</p><p>&nbsp; mitochondrial genetic code id -- see gencode.dmp file</p><p>&nbsp; inherited MGC flag&nbsp; (1 or 0) -- 1 if node inherits mitochondrial gencode from parent</p><p>&nbsp; GenBank hidden flag (1 or 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; -- 1 if name is suppressed in GenBank entry lineage</p><p>&nbsp; hidden subtree root flag (1 or 0) &nbsp; &nbsp; &nbsp; -- 1 if this subtree has no sequence data yet</p><p>&nbsp; comments -- free-text comments and citations</p><p>&nbsp;</p><p>Taxonomy names file (names.dmp):</p><p>tax_id -- the id of node associated with this name</p><p>name_txt -- name itself</p><p>unique name -- the unique variant of this name if name not unique</p><p>name class -- (synonym, common name, ...)</p><p>&nbsp;</p><p>Divisions file (division.dmp):</p><p>division id -- taxonomy database division id</p><p>division cde -- GenBank division code (three characters)</p><p>division name -- e.g. BCT, PLN, VRT, MAM, PRI...</p><p>comments</p><p>&nbsp;</p><p>Genetic codes file (gencode.dmp):</p><p>genetic code id -- GenBank genetic code id</p><p>abbreviation -- genetic code name abbreviation</p><p>name -- genetic code name</p><p>cde -- translation table for this genetic code</p><p>starts -- start codons for this genetic code</p><p>&nbsp;</p><p>Deleted nodes file (delnodes.dmp):</p><p>tax_id -- deleted node id</p><p>&nbsp;</p><p>Merged nodes file (merged.dmp):</p><p>old_tax_id&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; -- id of nodes which has been merged</p><p>new_tax_id&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; -- id of nodes which is result of merging</p><p>Citations file (citations.dmp):</p><p>cit_id -- the unique id of citation</p><p>cit_key -- citation key</p><p>pubmed_id -- unique id in PubMed database (0 if not in PubMed)</p><p>medline_id -- unique id in MedLine database (0 if not in MedLine)</p><p>url -- URL associated with citation</p><p>text -- any text (usually article name and authors).</p><p>-- The following characters are escaped in this text by a backslash:</p><p>-- newline (appear as "\n"),</p><p>-- tab character ("\t"),</p><p>-- double quotes ('\"'),</p><p>-- backslash character ("\\").</p><p>taxid_list -- list of node ids separated by a single space</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</guid>
	<pubDate>Fri, 01 Apr 2022 19:05:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</link>
	<title><![CDATA[R Shiny in Life Sciences – Top 7 Dashboard Examples]]></title>
	<description><![CDATA[<p><span>&nbsp;R Shiny is one of the easiest ways for developers to make production-ready dashboards when speed and functionality are crucial. Shiny is approachable with a lot of documentation available, and because of this, a lot of developers/researchers with non-coding backgrounds are able to produce some impressive results. The whole ecosystem is easy to get your head around and pretty much limitless with regard to what you can do.</span></p><p>Address of the bookmark: <a href="https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/" rel="nofollow">https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>