<?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>Patterns that are not visible</title>
		<link>/blogentry/200200</link>
		<atom:link href="https://www.lotterypost.com/rss/blogcomments/200200" rel="self" type="application/rss+xml" />
		<description>hypersoniq's Blog: Patterns that are not visible</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>Original Blog Entry: Patterns that are not visible</title>
			<link>/blogentry/200200</link>
			<guid isPermaLink="true">/blogentry/200200</guid>
			<pubDate>Wed, 05 Aug 2026 16:50:18 GMT</pubDate>
			<dc:creator>hypersoniq</dc:creator>
			<description><![CDATA[<p>In a recent exercise on a biology problem, the glaring inefficiency of lottery systems became apparent. The problem asked to scan 50 entries of 100 nucleotides (letters A, G,C and T) to find a motif (pattern) of a fixed length, Even if the pattern is not exact due to single nucleotide polymorphism (over evolutionary time, a C may be changed to another letter. So this introduced the concept of edit distance, or the number of changes needed to turn one string into another, this was then the constraint... find all matches within a certain edit distance. Now, the problem supplied the fixed motif length, but the authors brought up a great point... what if you do not know even the length of the pattern? That hit home for the lottery problem... look at how many parameters we are left to guess... how many draws to use? Spotting a trend before it goes away? What about patterns that may hold but some of the numbers change, completely obscuring the pattern to begin with? I admit that the CS degree trains one to find deterministic answers, and should cause one to reject the idea of a lottery system to begin with... but Biology introduces messy, noisy data, non deterministic answers that must look to probability to make accurate calculations, best guesses while sticking to biological realities that can&#x27;t just be glossed over by coding tricks. Some of these techniques might be used in this problem domain. I still need to figure out which ones and exactly how, but after over 20 years of a pointless chase, this may be the inspiration needed. If patterns that are similar but not exact can be identified, this could also answer such questions as how many draws to use or how there might be other less obvious structures instead of direct followers to apply a Markov decision process to. Not rushing back to the lottery lab anytime soon, but problems that seem impossible in one domain may be solved by applying techniques from a completely different domain.... &#x5b;&#xa0;<a href="/blogentry/200200">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>Blog Entry</category>
			<category>hypersoniq</category>
			<wfw:comment>https://www.lotterypost.com/blogentry/200200</wfw:comment>
		</item>
	</channel>
</rss>

