<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Digging Through the Family Tree</title>
	<atom:link href="http://blog.benchside.com/2009/02/digging-through-the-family-tree/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.benchside.com/2009/02/digging-through-the-family-tree/</link>
	<description>The Crossroads of Science and Tech</description>
	<lastBuildDate>Mon, 26 Dec 2011 19:37:41 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Recognition at Bench Press</title>
		<link>http://blog.benchside.com/2009/02/digging-through-the-family-tree/comment-page-1/#comment-159</link>
		<dc:creator>Recognition at Bench Press</dc:creator>
		<pubDate>Wed, 17 Jun 2009 04:51:27 +0000</pubDate>
		<guid isPermaLink="false">http://blog.benchside.com/?p=439#comment-159</guid>
		<description>[...] can do some pretty incredible stuff. We&#8217;ve seen computers analyze evolutionary trees, master the game of Go, and even take on the challenge of Jeopardy!. However, as amazing as [...]</description>
		<content:encoded><![CDATA[<p>[...] can do some pretty incredible stuff. We&#8217;ve seen computers analyze evolutionary trees, master the game of Go, and even take on the challenge of Jeopardy!. However, as amazing as [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Are you positive it&#8217;s positive? at Bench Press</title>
		<link>http://blog.benchside.com/2009/02/digging-through-the-family-tree/comment-page-1/#comment-143</link>
		<dc:creator>Are you positive it&#8217;s positive? at Bench Press</dc:creator>
		<pubDate>Tue, 21 Apr 2009 07:37:38 +0000</pubDate>
		<guid isPermaLink="false">http://blog.benchside.com/?p=439#comment-143</guid>
		<description>[...] developed numerous algorithms with goals ranging from organizing evolutionary family trees (inspired by plagiarism detecting software) to aligning genetic sequences. All of this to answer the numerous questions that can now be asked [...]</description>
		<content:encoded><![CDATA[<p>[...] developed numerous algorithms with goals ranging from organizing evolutionary family trees (inspired by plagiarism detecting software) to aligning genetic sequences. All of this to answer the numerous questions that can now be asked [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tree 2.0 at Bench Press</title>
		<link>http://blog.benchside.com/2009/02/digging-through-the-family-tree/comment-page-1/#comment-113</link>
		<dc:creator>Tree 2.0 at Bench Press</dc:creator>
		<pubDate>Mon, 02 Mar 2009 12:33:04 +0000</pubDate>
		<guid isPermaLink="false">http://blog.benchside.com/?p=439#comment-113</guid>
		<description>[...] thousands of species at once to pick out all the relevant relationships; we posted before about how algorithms used to detect cheating may help in picking out evolutionary relationships – we probably need many more to detect and [...]</description>
		<content:encoded><![CDATA[<p>[...] thousands of species at once to pick out all the relevant relationships; we posted before about how algorithms used to detect cheating may help in picking out evolutionary relationships – we probably need many more to detect and [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

