Sentence examples for for the problem of computing from inspiring English sources

We have presented a Maximum A Posteriori estimator for the problem of computing fragmentation trees, that performs significantly better than previous approaches for the problem, roughly doubling the number of correctly identified molecular formulas.

Here, we present a novel formulation of the problem of computing an evolutionary history for a set of segmental duplications that are organized in duplication blocks.

Results: We formulate contact replacement for resonance assignment as the problem of computing correspondences between a contact graph representing the structure and an NMR graph representing the data; the NMR graph is a significantly corrupted, ambiguous version of the contact graph.

The problem of synthesizing a composite/fused image translates into the problem of computing the weights for the fusion of the source images.

Review by Alexey Nesvizhskii (nominated by King Jordan), Department of Pathology, University of Michigan, Ann Arbor The manuscripts deals with the problem of computing confidence measures for peptide assignments to tandem mass (MS/MS) spectra produced by database search programs such as SEQUEST, Mascot, OMSSA and etc.

In particular, we propose a partial solution to the problem of computing a proper reparametrization for a rational ruled surface.

This work has investigated the application of a belief-based approach, the Dempster-Shafer theory, to the problem of computing spectrum occupancy maps for heterogeneous mobile radio environments.

Namely, we have shown that a minimal hitting set for a collection of j-containing pathway fragments is a cut set for j in a metabolic network S. As a result, the problem of computing cut sets for an objective reaction j can be reduced to the enumeration of minimal hitting sets for the j-containing pathway fragments.

Therefore, our definition of a tanglegram for two rooted phylogenetic networks generalizes the definition of a tanglegram for two rooted phylogenetic trees, and so, in particular, the problem of computing an optimal tanglegram for networks is NP-complete (Fernau et al., 2010).

Littlechild and Owen (1973) discussed the problem of computing Shapley value for large games.

This paper addresses the problem of computing planar patterns for compression garments.