Stochastic Context-Free Grammars (SCFG) has been shown to be effective in modelling RNA secondary structure for searches. Our previous work (Cai et al., 2003) in Stochastic Parallel Communicating Grammar Systems (SPCGS) has extended SCFG to model RNA pseudoknots. However, the alignment algorithm requires O(n4) memory for a sequence of length n. In this paper, we develop a memory efficient algor...

[61Cu]diacetyl-bis(N4-methylthiosemicarbazone) ([61Cu] ATSM) was prepared using in house-made diacetyl-bis(N4-methylthiosemicarbazone) (ATSM) ligand and [61Cu]CuCl2 produced via the natZn(p, x)61Cu (180 muA proton irradiation, 22 MeV, 3.2 h) and purified by a ion chromatography method. [61Cu]ATSM radiochemical purity was >98 %, as shown by HPLC and RTLC methods. [61Cu]ATSM was administered into...

We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite graph property with bipartitions of size n. This improves the previous best bound of(n4/3) due to Hajnal [Haj91]. Our proof works by improving a graph packing lemma used in earlier work, and this improvement in turn s...

The problem of determining the largest order nd,k of a graph of maximum degree at most d and diameter at most k is well known as the degree/diameter problem. It is known that nd,k Md,k where Md,k is the Moore bound. For d = 4, the current best upper bound for n4,k is M4,k − 1. In this paper we study properties of graphs of order Md,k − 2 and we give a new upper bound for n4,k for k 3. © 2007 El...

Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined for the surfaces S0, S1, N1,and N2. An algorithm is presented for generating the irreducible triangulations of a fixed surface using triangulations of other ...