<?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/33924?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/33924?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/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>