Dr Tewari has developed computational resources with an expansible object-oriented framework in Java for handling exact coalescent recursions and doing Monte Carlo simulations with importance sampling. We have advanced our combinatorial understanding of coalescent results, resulting in concrete improvements to coalescent algorithms. In particular, Drs. Tewari and Spouge have discovered a general means of accelerating coalescent recursions and have implemented it within the Java framework, to evaluate the practical implications of the acceleration. Having publisheded a manuscript on a computational framework for calculating exact coalescent recursions, we plan to evaluate computationally our acceleration to the coalescent recursions. Dr. Spouge has also developed some coalescent results relevant to barcode sampling strategies, reported in his project on DNA barcodes.
|Spouge, John L (2014) Within a sample from a population, the distribution of the number of descendants of a subsample's most recent common ancestor. Theor Popul Biol 92:51-4|