gatk-3.8/protected/java/test/org/broadinstitute/sting
Mark DePristo 2aac9e2782 More efficient ZipLinearChains algorithm
-- Goes through the graph looking for chains to zip, accumulates the vertices of the chains, and then finally go through and updates the graph in one big go.  Vastly more efficient than the previous version, but unfortunately doesn't actually work now
-- Also incorporate edge weight propagation into SeqGraph zipLinearChains.  The edge weights for all incoming and outgoing edges are now their previous value, plus the sum of the internal chain edges / n such edges
2013-04-08 12:47:48 -04:00
..
gatk/walkers More efficient ZipLinearChains algorithm 2013-04-08 12:47:48 -04:00
utils LD-based merging algorithm for nearby events in the haplotypes 2013-04-08 12:47:48 -04:00