Time Trees can be computed in MEGA where divergence times are estimated for all branching points in a tree using an approach that is based on the RelTime method (RelTime is described in Tamura et al. 2012) which does not require assumptions for lineage rate variations. The implementation in MEGA is very fast and expands on the RelTime method so that multiple calibration constraints can be provided, in which case MEGA will produce absolute divergence times along with relative divergence times while respecting the provided constraints. Additionally, the implementation in MEGA can compute divergence times without calibration constraints, in which case, only relative times will be produced.

See also