Now averaging all kinetics rate rule estimates within a given distance.
Now averaging all kinetics rate rule estimates within a given distance.

The "distance" of an estimate is the total number of moves towards parents
for each node required to find one or more kinetics estimates. There's no
way a priori to know whether moving up one subtree is "better" or "worse"
than another subtree, so we simply treat each move as equal. I *think*
this is what RMG-Java does.

faribas/RMG-Py,nickvandewiele/RMG-Py,nickvandewiele/RMG-Py,comocheng/RMG-Py,comocheng/RMG-Py,nyee/RMG-Py,enochd/RMG-Py,KEHANG/RMG-Py,chatelak/RMG-Py,KEHANG/RMG-Py,chatelak/RMG-Py,pierrelb/RMG-Py,enochd/RMG-Py,nyee/RMG-Py,pierrelb/RMG-Py,faribas/RMG-Py