<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/">
	<channel>
		<title>First 4 challenges complete on the bioinformatics &#x22;stronghold&#x22;.</title>
		<link>/blogentry/198075</link>
		<atom:link href="https://www.lotterypost.com/rss/blogcomments/198075" rel="self" type="application/rss+xml" />
		<description>hypersoniq's Blog: First 4 challenges complete on the bioinformatics &#x22;stronghold&#x22;.</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>Original Blog Entry: First 4 challenges complete on the bioinformatics &#x22;stronghold&#x22;.</title>
			<link>/blogentry/198075</link>
			<guid isPermaLink="true">/blogentry/198075</guid>
			<pubDate>Mon, 06 Apr 2026 14:09:05 GMT</pubDate>
			<dc:creator>hypersoniq</dc:creator>
			<description><![CDATA[<p>This is a fun challenge series.<br /><br />While there are simple solutions to these problems given their relatively small size, bioinformatics can scale up past your RAM quickly.<br /><br />I have given myself the extra challenge of making my solutions scalable and mindful of big O (the worst case run scenario). They let you use any language to solve the challenges, and Python is my main one, but I have passed the first 4 challenges using the power of C language subroutines in the Numpy package.<br /><br />My answers were the same as the simpler solutions, but they can handle scaling. If I had to deal with 1,000,000 nucleotides instead of 1,000, my solution would not break.<br /><br />Going to keep that momentum going throughout the challenges.<br /><br />The stronghold section requires you to create the algorithms to solve the problems... in the following section, the armory , the challenges are to be solved with existing industry wide software packages like Biopython in python and Bioconductor in the R language.<br /><br />They briefly touched on the power of Numpy to make powerful reductions in big O problems, but the majority of what I learned about the practical application of Numpy and efficient coding came directly from the lottery hobby!<br /><br />Even though this lottery problem was impossible to solve, the skills learned are literally directly transferred to other domains! Markov models are all over the bioinformatics domain.<br /><br />Who knows, maybe I will pick up something in this pursuit that can be brought back to the lottery domain...... &#x5b;&#xa0;<a href="/blogentry/198075">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>Blog Entry</category>
			<category>hypersoniq</category>
			<wfw:comment>https://www.lotterypost.com/blogentry/198075</wfw:comment>
		</item>
	</channel>
</rss>

