search

petrelharp / treestats_ms

1 stars 1 forks source link

Algorithms description pass 1 #13

Closed jeromekelleher closed 5 years ago

jeromekelleher commented 5 years ago

Here's a first pass at the algorithm description and analysis (note #12; not fully sure what the correct O expression is). Also added in the performance plots, including a quick annotation to show the difference in terms of variants per second for the largest values. This is because log-scales can be deceiving, and it's nice to be concrete that this is 3 orders of magitude faster, not 3X.

petrelharp commented 5 years ago

Looks good! I will merge and we can continue to tweak the complexity analysis.