News for hackers. Stuff that matters.
Re:Stochastic Pattern Recognition Dramatically Outperforms C... by lkrubner on Thursday February 23, 2012 @02:49PM (#3626419)
Imagine if, for any given position in a list, there were only 4 values allowed:

A

T

G

C

What is the value of the next item in the list? Pure guessing and you have a 25% chance of being right. But what if a review of past lists allows you to develop weighted averages, to the point where you could be, say, 70% correct? What if there was a way to do multiple scans, such that the chance of correctness gets to be some value of 99.x% ?

Imagine the 4 values stand for:

Adenine

Thymine

Guanine

Cytosine

It seems to me there is here suggested a new way of parsing a genome. I have friends who've worked on automated cancer detection based on recognizing certain patters in photos of cells. Possibly similar techniques could take electron microscope scans and figure out a sequence of DNA?

Re:Stochastic Pattern Recognition Dramatically Outperforms C... by ArbitraryLimits on Thursday February 23, 2012 @03:56PM (#3626729)
Well, this is actually the old way of parsing a genome. What you've described is essentially a Hidden Markov Model with discrete states, which is the bread and butter of genome sequencing.
Re:Stochastic Pattern Recognition Dramatically Outperforms C... by a1k0n on Thursday February 23, 2012 @05:32PM (#3627117)
I'm actually curious about that distribution; could you gain compression efficiency by grouping them into 3-base-pair codons? Or is DNA pretty much random at the base-pair level and the codon redundancy makes it actually work anyway?