Skip to content

Latest commit

 

History

History
185 lines (133 loc) · 14 KB

changelog.md

File metadata and controls

185 lines (133 loc) · 14 KB

0.11.3: Bug fixed

  • calls to some random number generator errorred after the recent switch to treetime owned RNGs.
  • default argument for clock-filter method had a spelling mistake
  • a branch length optimization function didn't handle profiles==True correctly.

0.11.2: improvements in VCF parsing/writing + clock-filter functionality

  • rewrite of the vcf reading and writing code including many more tests, closer alignment with spec, and performance improvements by @jameshadfield PR #263
  • clock-filter command can now remove detected outliers with the additional flag --prune-outliers.

0.11.1: bug fixes and tweaks to plotting

  • fix division by zero error during GTR inference
  • improve doc strings in parse dates
  • tweaks to background shading in timetree plot function (plot_vs_years)
  • allow to specify branches on which date confidence intervals are shown.

0.11.0: new clock filter method

Previously, only a crude analysis of whether the divergence of tips roughly follows a linear trend was implemented. Tips that deviated too much from that regression line were flagged as outliers and this threshold was parameterized as number of interquartile distances of the distribution of residuals n_iqd. This filter is not very sensitive and often misses misdated tips that severely distort the tree but still fall within the distribution of root-to-tip distances at that time. To overcome this, we implemented a novel filtering method that fits a simple gaussian model of divergence accumulation. Information on outliers is saved in a pandas DataFrame self.outliers of TreeTime and written to file as a tsv file when running treetime as command line tool.

Other fixes

  • error when rate estimate is negative during the rate susceptibility calculation. Give hint in error message to specify the rate and its uncertainty explicitly.
  • Fix bug issue #250 introduced in 0.10.0 where treetime fails in absence of an alignment when trying to create an auspice json file. PR #251

0.10.1: bug fix release

  • avoid probability loss at the end of the domain of distributions
  • fix erroneous check for merger model.
  • raise error when probability is lost.
  • improve initial guess in branch length optimizations

0.10.0: add auspice.json output, drop python 3.6

  • the output directory now contains a json file that is compatible with auspice.us. Both time scaled phylogenies and ancestral inferences can now be visualized and explored using auspice. Available colorings are "Date", "genotype", "Branch support", and "Excluded". See PR #232 for details.
  • move most function related to IO of the command line wrappers into a separate file.
  • make TreeTime own its random number generator and add --rng-seed to control state in CLI. Any previous usage of numpy.random.seed will now be ignored in favor of --rng-seed. See PR #234
  • add flag --greedy-resolve (currently default) as inverse to --stochastic-resolve with the aim of switching the default behavior in the future. Add deprecation warning for greedy-resolve.
  • tighten conditions that trigger approximation of narrow distribution as a delta function in convolution using FFT PR #235.
  • Drop support for python 3.6.
  • Don't attempt to show figure when calling Phylo.draw to suppress matplotlib back-end warning.

0.9.6: bug fixes and new mode of polytomy resolution

  • in cases when very large polytomies are resolved, the multiplication of the discretized message results in messages/distributions of length 1. This resulted in an error, since interpolation objects require at least two points. This is now caught and a small discrete grid created.
  • increase recursion limit to 10000 by default. The recursion limit can now also be set via the environment variable TREETIME_RECURSION_LIMIT.
  • removed unused imports, fixed typos
  • add new way to resolve polytomies. the previous polytomy resolution greedily pulled out pairs of child-clades at a time and merged then into a single clade. This often results in atypical caterpillar like subtrees. This is undesirable since it (i) is very atypical, (ii) causes numerical issues due to repeated convolutions, and (iii) triggers recursion errors during newick export. The new optional way of resolving replaces a multi-furcation by a randomly generated coalescent tree that backwards in time mutates (all mutations are singletons and need to 'go' before coalescence), and merges lineages. Lineages that remain when time reaches the time of the parent remain as children of the parent. This new way of resolving is much faster for large polytomies. This experimental feature can be used via the flag --stochastic-resolve. Note that the outcome of this stochastic resolution is stochastic!

0.9.5: load custom GTR via CLI

  • fix bug that omitted the inferred state of the root in the nexus export of the migration command
  • add CLI flag and functionality to load sequence evolution models inferred and saved by TreeTime as human-readable text files. The flag is --custom-gtr <filename> and overwrites any arguments passed under the --gtr flag.
  • explicitly specify the optimization method, brackets, bounds, and tolerances in calls of scipy.optimize.minimize to suppress scipy warning. Scipy had previously silently ignored bounds when the method wasn't explicitly set to bounded.

0.9.4: bug fix and performance improvements

  • avoid negative variance associated with branch lengths in tree regression. This could happen in rare cases when marginal time tree estimation returned short negative branch length and the variance was estimated as being proportional to branch length. Variances in the TreeRegression clock model are now always non-negative.
  • downsample the grid during multiplication of distribution objects. This turned out to be an issue for trees with very large polytomies. In these cases, a large number of distributions get multiplied which resulted in grid sizes above 100000 points. Grid sizes are now downsampled to the average grid size.

0.9.3

  • Add extra error class for "unknown" (==unhandled) errors
  • Wrap run function and have it optionally raise unhandled exceptions as TreeTimeUnknownError. This is mainly done to improve interaction with augur that uses TreeTime internals as a library. (both by @anna-parker with input from @victorlin)

PR #206 PR #208

0.9.2

bug fix release:

  • CLI now works for windows (thanks @corneliusroemer for the fix)
  • fixes vcf parsing. haploid no-calls were not properly parsed and treated as reference (thanks @jodyphelan for the issue).
  • fix file names in CLI output. (thanks @gtonkinhill)

0.9.1

This release is mostly a bug-fix release and contains some additional safeguards against unwanted side-effects of greedy polytomy resolution.

  • resolve polytomies only when significant LH gain can be achieved
  • performance enhancement in pre-order iteration during marginal time tree estimate when hitting large polytomies.
  • allow users to set branch specific rates (only when used as a library)

0.9.0

This release contains several major changes to how TreeTime calculates time scaled phylogenies. Most of this is work by @anna-parker!

  • implements convolutions needed for marginal time tree inference using FFT. Previously, these were calculated by explicit integration using optimized irregular grids. Using FFT requires regular (and hence much finer/larger) grids, but greatly reduces computational complexity from n^2 to n log(n), where n is the number of grid points. The FFT feature can be switched on an off with the use_fft attribute of the ClockTree class.
  • Using FFT in convolutions required moving the contributions of the coalescent models from th branches to the nodes. This should not change the results in any way, but cleans up the code.
  • The number concurrent of lineages determines the rate of coalescence. This can now optionally be calculated using the uncertainty of the timing of merger events, instead of the step functions used previously.
  • Adds a subcommand to read in ancestral reassortment graphs of two segments produced by TreeKnit. This command takes two trees and a file with MCCs inferred by TreeKnit. See these docs for command line usage.

0.8.6

  • optionally allow incomplete alignment PR #178
  • reduce memory footprint through better clean up and optimizing types. PR #179

0.8.5

  • bug fixes related to edge cases were sequences consist only of missing data
  • bug fix when the CLI command treetime is run without alignment
  • more robust behavior when parsing biopython alignments (id vs name of sequence records)
  • drop python 3.5 support

0.8.4 -- re-release of 0.8.3.1

0.8.3.1 -- bug fix related to Bio.Seq.Seq now bytearray

  • Biopython changed the representation of sequences from strings to bytearrays. This caused crashes of mugration inference with more than 62 states as states than exceeded the ascii range. This fix now bypasses Bio.Seq in the mugration analysis.

0.8.3 -- unpin biopython version

  • Biopython 1.77 and 1.78 had a bug in their nexus export. This is fixed in 1.79. We now explictly exclude the buggy versions but allow others.

0.8.2 -- bug fixes and small feature additions

This release fixes a few bugs and adds a few features

  • output statistics of different iterations of the treetime optimization loop (trace-log, thanks to @ktmeaton)
  • speed ups by @akislyuk
  • fix errors with dates in the distant future
  • better precision of tabular skyline output
  • adds clock-deviation to the root-to-tip output of the clock command

0.8.1 -- bug fixe amino acid profile map.

0.8.0 -- drop python 2.7 support, bug fixes.

0.7.6 -- catch of distributions are too short for calculating confidence intervals.

0.7.5 -- fix desync of peak from grid of distributions after pruning

0.7.4 -- bug fix in reconstruct discrete trait routine

The reconstruct_discrete_traits wrapper function didn't handle missing data correctly (after the changed released in 0.7.2) which resulted in alphabets and weights of different lengths.

0.7.3 -- bug fix in average rate calculation

This release fixes a problem that surfaced when inferring GTR models from trees of very similar sequences but quite a few gaps. This resulted in mutation counts like so:

A: [[ 0. 1. 8. 3. 0.] C: [ 1. 0. 2. 7. 0.] G: [ 9. 0. 0. 2. 0.] T: [ 1. 23. 6. 0. 0.] -: [46. 22. 28. 38. 0.]]

As a result, the rate "to gap" is inferred quite high, while the equilibrium gap fraction is low. Since we cap the equilibrium gap fraction from below to avoid reconstruction problems when branches are very short, this resulted in an average rate that had substantial contribution from and assumed 1% equilibrum gap frequency where gaps mutate at 20times the rate as others. Since gaps are ignored in distance calculations anyway, it is more sensible to exclude these transitions from the calculation of the average rate. This is now happening in line 7 of treetime/gtr.py. The average rate is restricted to mutation substitutions from non-gap states to any state.

0.7.2 -- weights in discrete trait reconstruction

This release implements a more consistent handling of weights (fixed equilibrium frequencies) in discrete state reconstruction. It also fixes a number of problems in who the arguments were processed. TreeTime now allows

  • unobserved discrete states
  • uses expected time-in-tree instead of observed time-in-tree in GTR estimation when weights are fixed. The former resulted in very unstable rate estimates.

0.7.0 -- restructuring

Major changes

This release largely includes changes under the hood, some of which also affect how treetime behaves. The biggest changes are

  • sequence data handling is now done by a separate class SequenceData. There is now a clear distinction between input data that is never changed and inferred sequences. This class also provides consolidated set of functions to convert sparse, compressed, and full sequence representations into each other.
  • sequences are now unicode when running from python3. This does not seem to come with a measurable performance hit compared to byte sequences as long as all characters are ASCII. Moving away from bytes to unicode proved much less hassle than converting sequences back and forth from unicode to bytes during IO.
  • Ancestral state reconstruction no longer reconstructs the state of terminal nodes by default and sequence accessors and output will return the input data by default. Reconstruction is optional.
  • The command-line mugration model inference now optimize the overall rate numerically and is hence no longer making a short-branch length assumption.
  • TreeTime raises now a number of custom errors rather than returning success or error codes. This should result in fewer "silent errors" that cause problems downstream.

Minor new features

In addition, we implemented a number of other changes to the interface

  • treetime, treetime clock now accept the arguments --name-column and -date-column to explicitly specify the metadata columns to be used as name or date
  • treetime mugration accepts a --name-column argument.

Bug fixes

  • scaling of skyline confidence intervals was wrong. It now reflects the inverse second derivative in log-space
  • catch problems after rerooting associated with missing attributes in the newly generated root node.
  • make conversion from calendar dates to numeric dates and vice versa compatible and remove approximate handling of leap-years.
  • avoid overwriting content of output directory with default names
  • don't export inferred dates of tips labeled as bad_branch.