<?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/40946/free-genomics-data</guid>
	<pubDate>Fri, 07 Feb 2020 14:08:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40946/free-genomics-data</link>
	<title><![CDATA[Free Genomics data !]]></title>
	<description><![CDATA[<p><span>The specimens were collected by the Oxford Wytham Woods and Edinburgh Lohse lab teams. DNA extraction and sequencing was carried out by the Sanger Institute Scientific Operations teams. Assemblies were carried out by the Tree of Life team (Shane McCarthy) and colleagues in Pacific Biosciences (Jonas Korlach).</span></p>
<p><a href="https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/">https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/</a></p><p>Address of the bookmark: <a href="https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/" rel="nofollow">https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<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>

</channel>
</rss>