<?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: Obtaining overrepresented motifs in DNA sequences, part 5</title>
	<atom:link href="http://python.genedrift.org/2008/05/21/obtaining-overrepresented-motifs-in-dna-sequences-part-iv/feed/" rel="self" type="application/rss+xml" />
	<link>http://python.genedrift.org/2008/05/21/obtaining-overrepresented-motifs-in-dna-sequences-part-iv/</link>
	<description>a step-by-step guide to create Python applications in bioinformatics</description>
	<lastBuildDate>Mon, 22 Feb 2010 18:22:18 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=3.0-alpha</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Obtaining overrepresented motifs in DNA sequences, part 10</title>
		<link>http://python.genedrift.org/2008/05/21/obtaining-overrepresented-motifs-in-dna-sequences-part-iv/comment-page-1/#comment-14038</link>
		<dc:creator>Obtaining overrepresented motifs in DNA sequences, part 10</dc:creator>
		<pubDate>Wed, 04 Jun 2008 16:33:55 +0000</pubDate>
		<guid isPermaLink="false">http://python.genedrift.org/?p=107#comment-14038</guid>
		<description>[...] as mentioned in the comments by Dave and by Mike via email the method used is not the best method to calculate factorial in Python. The [...]</description>
		<content:encoded><![CDATA[<p>[...] as mentioned in the comments by Dave and by Mike via email the method used is not the best method to calculate factorial in Python. The [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Paulo Nuin</title>
		<link>http://python.genedrift.org/2008/05/21/obtaining-overrepresented-motifs-in-dna-sequences-part-iv/comment-page-1/#comment-13536</link>
		<dc:creator>Paulo Nuin</dc:creator>
		<pubDate>Sat, 24 May 2008 14:03:46 +0000</pubDate>
		<guid isPermaLink="false">http://python.genedrift.org/?p=107#comment-13536</guid>
		<description>Hi Dave

Thanks for the suggestion. The operator.mul function will be covered in the next post. I saw this solution sometime ago, but historically following the blog I haven&#039;t introduced operator yet.

Cheers</description>
		<content:encoded><![CDATA[<p>Hi Dave</p>
<p>Thanks for the suggestion. The operator.mul function will be covered in the next post. I saw this solution sometime ago, but historically following the blog I haven&#8217;t introduced operator yet.</p>
<p>Cheers</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dave Kirby</title>
		<link>http://python.genedrift.org/2008/05/21/obtaining-overrepresented-motifs-in-dna-sequences-part-iv/comment-page-1/#comment-13532</link>
		<dc:creator>Dave Kirby</dc:creator>
		<pubDate>Sat, 24 May 2008 13:09:10 +0000</pubDate>
		<guid isPermaLink="false">http://python.genedrift.org/?p=107#comment-13532</guid>
		<description>Lambda calls are somewhat slower than functions implemented directly in C, so you can get a speedup by using the operator.mul function.  On my system this gives a 19% speedup for factorial(1000).

The operator module contains function equivalents to all the builtin operators (plus a few extra goodies), and the module is pure C, so is always faster than using lambda.</description>
		<content:encoded><![CDATA[<p>Lambda calls are somewhat slower than functions implemented directly in C, so you can get a speedup by using the operator.mul function.  On my system this gives a 19% speedup for factorial(1000).</p>
<p>The operator module contains function equivalents to all the builtin operators (plus a few extra goodies), and the module is pure C, so is always faster than using lambda.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

