<?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/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/videolist/watch/3964/what-is-life-a-21st-century-perspective-by-dr-craig-venter</guid>
	<pubDate>Mon, 26 Aug 2013 17:09:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/3964/what-is-life-a-21st-century-perspective-by-dr-craig-venter</link>
	<title><![CDATA['What is Life? A 21st Century Perspective' by Dr Craig Venter]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/qi2MhsUSu0U" frameborder="0" allowfullscreen></iframe>One of the landmark events of 20th century science was celebrated and reinterpreted for the 21st century in Trinity College Dublin on 12 July 2012 as part of the Science in the City programme of ESOF2012. Dr Craig Venter, one of the leaders of the Human Genome Project in the 1990s and a pioneer of synthetic biology delivered a lecture entitled, 'What is Life? A 21st century perspective' recreating the Irish event that inspired the discovery of the structure of DNA. 

In February, 1943 one of the most distinguished scientists of the 20th Century, Erwin Schrödinger, delivered a seminal lecture, entitled 'What is Life?', under the auspices of the Dublin Institute for Advanced Studies, in Trinity College Dublin. The lecture presented far-sighted ideas on how hereditary information could be encoded in a chemical structure (aperiodic crystal) in living cells. Schrödinger's book (1944) of the same title is considered to be a scientific classic. The book was cited by Crick and Watson as one of the inspirations which ultimately led them to unravel the structure of DNA in 1953, a breakthrough which won them the Nobel prize.]]></description>
	
</item>

<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/45169/life-of-a-bioinformatician</guid>
	<pubDate>Fri, 15 May 2026 02:30:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/45169/life-of-a-bioinformatician</link>
	<title><![CDATA[Life of a Bioinformatician !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div dir="auto"><div><div><p>Somewhere between FASTQ files, volcano plots, and 3 AM coffee&hellip; the gene is probably hiding too.</p><p>#Bioinformatics #Genomics #ResearchL</p></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/45169" length="2686336" type="image/png" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33791/slactree-svg-large-annotated-circular-tree-drawing</guid>
	<pubDate>Mon, 03 Jul 2017 08:02:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33791/slactree-svg-large-annotated-circular-tree-drawing</link>
	<title><![CDATA[slacTree: SVG Large Annotated Circular Tree drawing]]></title>
	<description><![CDATA[<p>A simple, extensible, Perl script for producing figures of large phylogenetic trees.</p>
<ul>
<li>While there are many other tree drawing programs, slacTree was originally written in 2009 to fill a need for producing publication quality figures of circular trees with more than 1000 taxa with custom annotations</li>
<li>Because it is a single Perl script with very few dependencies, it is easy to run, and easy to further customize</li>
<li>SVG is used because it is a scalable format allowing for very small representations of entire trees or highly magnified regions with unlimited resolution</li>
<li>Circular and radial trees are more compact than linear representations</li>
<li></li>
</ul>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/mccrowjp/slacTree" rel="nofollow">https://github.com/mccrowjp/slacTree</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43548/upgma-worked-example</guid>
	<pubDate>Wed, 13 Oct 2021 06:13:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43548/upgma-worked-example</link>
	<title><![CDATA[UPGMA Worked Example]]></title>
	<description><![CDATA[<p><span>The tabs below include a walkthrough of clustering 7 biological sequences (A-G) using the Unweighted Pair-Group Method with Arithmetic mean (UPGMA) method. Note that UPGMA is actually a generic method and thus the walkthrough could apply to any objects A-G for which pairwise distances can be calculated. A small CGI site for generating a UPGMA tree from a distance matrix can be found&nbsp;</span><a href="http://bioware.soton.ac.uk/upgma.html">here</a><span>.</span></p><p>Address of the bookmark: <a href="http://www.slimsuite.unsw.edu.au/teaching/upgma/" rel="nofollow">http://www.slimsuite.unsw.edu.au/teaching/upgma/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42794/tmrca-calculator</guid>
	<pubDate>Wed, 03 Feb 2021 05:07:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42794/tmrca-calculator</link>
	<title><![CDATA[TMRCA Calculator]]></title>
	<description><![CDATA[<p><span>This program calculates the probability that two people have a certain number of generations between them, based on the standard&nbsp;</span><em>infinite alleles</em><span>&nbsp;formula of Walsh. It calculates both the probability of being at an exact number of generations back to the Most Recent Common Ancestor (MRCA) of a certain pair of people and the cumulative probability that the actual number of generations is less than a certain value. Note that the convention using generations is changed from an earlier version of this calculator which used "transmission events". It can list both result types in a table or graph. In either case the horizontal axis stops at the point where the cumulative probability reaches 95% or 10 generations, whichever is longer, or an absolute max of 50,000. Beyond 90% the calculation becomes inaccurate.</span></p>
<p>https://clandonaldusa.org/index.php/tmrca-calculator</p><p>Address of the bookmark: <a href="https://clandonaldusa.org/index.php/tmrca-calculator" rel="nofollow">https://clandonaldusa.org/index.php/tmrca-calculator</a></p>]]></description>
	<dc:creator>BioStar</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/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>

</channel>
</rss>