<?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?</link>
	<atom:link href="https://bioinformaticsonline.com/related/44157?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35907/alienness-rapid-detection-of-candidate-horizontal-gene-transfers-across-the-tree-of-life</guid>
	<pubDate>Mon, 12 Mar 2018 09:24:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35907/alienness-rapid-detection-of-candidate-horizontal-gene-transfers-across-the-tree-of-life</link>
	<title><![CDATA[alienness : Rapid Detection of Candidate Horizontal Gene Transfers across the Tree of Life]]></title>
	<description><![CDATA[<p><span>Horizontal gene transfer (HGT) is the transmission of genes between organisms by other means than parental to offspring inheritance. While it is prevalent in prokaryotes, HGT is less frequent in eukaryotes and particularly in Metazoa. Here, we propose Alienness, a taxonomy-aware web application available at&nbsp;</span>http://alienness.sophia.inra.fr</p>
<p>http://www.mdpi.com/2073-4425/8/10/248</p><p>Address of the bookmark: <a href="http://alienness.sophia.inra.fr/cgi/index.cgi" rel="nofollow">http://alienness.sophia.inra.fr/cgi/index.cgi</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</guid>
	<pubDate>Fri, 02 Nov 2018 08:16:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</link>
	<title><![CDATA[Ancestral Genomes: a resource for reconstructed ancestral genes and genomes across the tree of life]]></title>
	<description><![CDATA[<p><span>&nbsp;Ancestral Genomes (</span><a href="http://ancestralgenomes.org/" target="">http://ancestralgenomes.org</a><span>) is a resource for comprehensive reconstructions of these &lsquo;fossil genomes&rsquo;. Comprehensive sets of protein-coding genes have been reconstructed for 78 genomes of now-extinct species that were the common ancestors of extant species from across the tree of life.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ancestralgenomes.org/" rel="nofollow">http://ancestralgenomes.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/42327/blaxter-lab</guid>
  <pubDate>Thu, 19 Nov 2020 08:05:28 -0600</pubDate>
  <link></link>
  <title><![CDATA[Blaxter Lab]]></title>
  <description><![CDATA[
<p>Using these high quality genomes we explore</p>

<p>the evolutionary history of genes and species, building phylogenetic trees of life<br />the contrasting roles of horizontal gene transfer and introgression in shaping evolution<br />the biology of symbioses, especially symbioses between eukaryotes and bacteria, and between parasites and their hosts<br />the processes that drive the evolution of pattern in the structure of chromosomes<br />the diversity of meiofauna, particularly tardigrades, nematodes and other Ecdysozoa<br />the genomics of extremophilia</p>

<p>More at https://www.sanger.ac.uk/group/blaxter-group/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33909/itol-interactive-tree-of-life</guid>
	<pubDate>Tue, 18 Jul 2017 05:36:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33909/itol-interactive-tree-of-life</link>
	<title><![CDATA[iTOL: Interactive Tree Of Life]]></title>
	<description><![CDATA[<p><strong>Interactive Tree Of Life</strong>&nbsp;is an online tool for the display, annotation and management of phylogenetic trees.</p>
<p>Explore your trees directly in the browser, and annotate them with various types of data.</p>
<p><span>iTOL can easily visualize trees with 50'000 or more leaves. With advanced search capabilities and display of unrooted, circular and regular cladograms or phylograms, exploring and navigating trees of any size is simple.</span></p>
<p>https://itol.embl.de/</p><p>Address of the bookmark: <a href="https://itol.embl.de/" rel="nofollow">https://itol.embl.de/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5962/berex-biomedical-entity-relation-explorer</guid>
	<pubDate>Wed, 30 Oct 2013 15:53:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5962/berex-biomedical-entity-relation-explorer</link>
	<title><![CDATA[BEReX :   Biomedical Entity-Relation eXplorer]]></title>
	<description><![CDATA[<p>BEReX is a new biomedical knowledge integration, search, and exploration tool. BEReX integrates eight popular databases (STRING, DrugBank, KEGG, PharmGKB, BioGRID, GO, HPRD, and MSigDB) and delineates an integrated network by combining the information available from these databases. Users search the integrated network by entering keywords and BEReX returns a sub-network matching the keywords. The resulting graph can be explored interactively. BEReX allows users to find the shortest paths between two remote nodes; find the most relevant drugs, diseases, pathways and so on, related to the current network; expand the network by particular types of entities and relations; and modify the network by removing or adding selected nodes. BEReX is implemented as a stand-alone Java application.</p><p>More at http://infos.korea.ac.kr/berex</p><p>News reference @ http://infos.korea.ac.kr</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</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/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>

</channel>
</rss>