This step just changes storage of likelihoods so now we have, instead of an internal matrix, a class member which stores, as a hash table, a mapping from pileup element to an (allele, likelihood) pair. There's no functional change aside from internal data storage. As a bonus, we get for free a 2-3x improvement in speed in calling because redundant likelihood computations are removed. Next step will hook this up to, and redefine annotation engine interaction with UG for indel case. git-svn-id: file:///humgen/gsa-scr1/gsa-engineering/svn_contents/trunk@5809 348d0f76-0448-11de-a6fe-93d51630548a |
||
|---|---|---|
| R | ||
| analysis/depristo | ||
| archive | ||
| c | ||
| chainFiles | ||
| doc | ||
| java | ||
| lua | ||
| matlab | ||
| packages | ||
| perl | ||
| python | ||
| ruby | ||
| scala | ||
| settings | ||
| shell | ||
| testdata | ||
| LICENSE | ||
| build.xml | ||
| ivy.xml | ||