Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem.

Algorithms Mol Biol · 2016 · PMC4875752 · PMID 27213010

Europe PMC DOI

hedged sentence

—

closest p

—

boldest claim

The sentences

highly significantno p-value reported

This result is highly significant as the running time reduction is achieved using less resources, while providing a framework with a higher degree of accuracy, as the Improved Node Mapping algorithm guarantees that the solutions inferred are biologically feasible.

also in 132,142 other papers

Quoted from the open-access full text in Europe PMC under the licence the publisher applied. The sentence is reproduced exactly as published; the emphasis is ours.