We give an O(n) algorithm to find a minimum clique cover of a (bull, C4)-free graph, or equivalently, a minimum colouring of a (bull, 2K2)-free graph, where n is the number of vertices of the graphs.

the present study was aimed to develop and validate a high performace liquid chromatography method for determination of thiocolchicoside and dexketoprofen trometamol in combined dosage form. the proposed hplc method utilizes an agilent eclipse c-8 column (5 µm, 250×4.6 mm) at ambient temperature. a 23 full factorial design was performed for optimization of mobile phase for separation of two dru...

The present paper aims to investigate the role of open metal site metal-organic frameworks (MOFs) on hydrogen adsorptivity using periodic boundary condition (PBC) density functional theory (DFT). Hence, MIL-47-M (M = V and Fe) were selected and one hydrogen molecule adsorptivity was calculated in different orientations on them. Four different chemical sites were identified in every cluster sect...

In this paper, we consider an algorithm for solving the minimum k-supplier problem using the Adleman–Lipton model. The procedure works in O(n) steps for the minimum k-supplier problem of an undirected graph with n vertices, which is an NP-hard combinatorial optimization problem. Keywords-DNA Computing, minimum k-supplier, AdlemanLipton

We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum diameter, having minimum area (perimeter) bounding box, having minimum area (perimeter) convex hull. For constant values of c, all our algorithms run in O(n log n) time.

The title compound, C(16)H(19)NO(5), which was synthesized from p-meth-oxy-cinnamic acid, has intra-molecular O-H⋯O and N-H⋯O hydrogen-bonding inter-actions. In the crystal, mol-ecules are linked by weak C-H⋯O hydrogen bonds and aromatic π-π stacking inter-actions [minimum ring centroid-centroid separation = 3.790 (1) Å].

The Minimum Evolution (ME) approach to phylogeny estimation has been shown to be statistically consistent when it is used in conjunction with ordinary least-squares (OLS) tting of a metric to a tree structure. The traditional approach to using ME has been to start with the Neighbor Joining (NJ) topology for a given matrix, and then do a topological search from that starting point. The rst stage...

The Minimum Evolution (ME) approach to phylogeny estimation has been shown to be statistically consistent when it is used in conjunction with ordinary least-squares (OLS) tting of a metric to a tree structure. The traditional approach to using ME has been to start with the Neighbor Joining (NJ) topology for a given matrix, and then do a topological search from that starting point. The rst stage...

In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The previous best result for this problem was an O(mn) algorithm, where ω is the best exponent of matrix multiplication. It is presently known that ω < 2.376. We obtain an O(mn +mn logn) algorithm for this problem. Our algorithm als...

Let f : [1..n] → [1..n] be a function, and ` : [1..n] → [1..σ] indicate a label assigned to each element of the domain. We design several compact data structures that answer various queries on the labels of paths in f . For example, we can find the minimum label in f(i) for a given i and any k ≥ 0 in a given range [k1..k2], using n lgn+O(n) bits, or the minimum label in f−k(i) for given i and k...