Sentence examples for a problem of enumerating from inspiring English sources

To seek solutions effectively in a relaxed constraint, Shimizu et al. [13] recently introduced a problem of enumerating tree-like hydrogen-suppressed chemical graphs that satisfy one of a given set of feature vectors which is specified by a pair of upper and lower feature vectors.

More formally, we introduce a constrained version of the problem of enumerating all maximal DAGs of a graph G (Schwikowski and Speckenmeyer, 2002).

Both co-clustering and template assignment identify small differences between similar samples, and solve the problem of enumerating an absent or very small population, e.g., 0 5 cells in a negative control.

In this paper, we study the problem of enumerating the state space of a molecular network with small copy numbers of molecular species.

We address the problem of enumerating all neighbor pairs in a large string pool in terms of edit distance, where the cost of insertion, deletion and substitution is one.

We consider the problem of enumerating chemical graphs with monocyclic structure (a graph structure that contains exactly one cycle) from a given set of feature vectors, where a feature vector represents the frequency of the prescribed paths in a chemical compound to be constructed and the set is specified by a pair of upper and lower feature vectors.

We considered the problem of enumerating all chemical graphs of 1-augmented tree structure from a given set of path-frequency based feature vectors specified by upper and lower feature vectors, and proposed a new exact algorithm by extending 2-Phase algorithm [14].

We define the problem of enumerating k-augmented trees as follows.

In this regard, we examine analogous notions to the problem of enumerating preferred extensions and present algorithms that decide subjective, respectively objective, acceptance.

Our method addresses the problem of enumerating codebook vectors in lattice Zn and is designed for the compression of Generalized Gaussian sources.

We then focus on the more general problem of enumerating sets of compatible paths.