Going past the float size limits?

[jimmy.musselwhite at gmail.com]

On Oct 26, 8:03 pm, Stéphane Larouche <stephane.larou... at polymtl.ca>
wrote:
>  <jimmy.musselwhite <at> gmail.com> writes:
>
> > The calculation looks like this
>
> > A = 0.35
> > T = 0.30
> > C = 0.25
> > G = 0.10
>
> > and then I basically continually multiply those numbers together. I
> > need to do it like 200,000+ times but that's nuts. I can't even do it
> > 1000 times or the number rounds off to 0.0. I tried taking the inverse
> > of these numbers as I go but then it just shoots up to "inf".
>
> I suggest you add the logarithm of those numbers.
>
> Stéphane

Well I'd add the logarithms if it was me that made the algorithm. I
don't think I understand it all that well. My professor wrote it out
and I don't want to veer away and add the logs of the values because I
don't know if that's the same thing or not.