Sentence examples for minimum reconciliation cost from inspiring English sources

The problem is then to select, from this space, the tree giving rise to the minimum reconciliation cost.

Given G and S, the MPR problem is to find a DTL scenario for G and S with minimum reconciliation cost.

The traditional goal of DTL-reconciliation is to find a most parsimonious reconciliation, i.e. a DTL-scenario for G and S with minimum reconciliation cost.

The tractability of the MinNADref Problem remains open, as is the problem to select, among all possible solutions, those leading to a minimum reconciliation cost.

TreeFix-DTL assumes that among all statistically equivalent candidates for the gene tree, the one with minimum reconciliation cost is most likely to be the true tree.

In case the search finds multiple gene trees with statistically equivalent likelihood and the same minimum reconciliation cost, it outputs the one that has the highest likelihood.

In the future, it might be instructive to consider all gene trees with statistically equivalent likelihood scores and minimum reconciliation costs, and to study the similarities and differences in the alternative gene tree topologies.

Note that several distinct alternative reconciliations can have an optimal reconciliation cost.

The optimal reconciliation cost is C (G, S ′ ) = min α { cost } over all reconciliations α between G and S′.

Under this framework, each duplication, transfer and loss event is assigned a cost and the goal is to find a reconciliation that has the lowest total reconciliation cost.

On the whole, the reconciliation cost goes from 9.5 down to 5.5.