Suborbits of a point stabilizer in the orthogonal group on the last subconstituent of orthogonal dual polar graphs

AbstractAs one of the serial papers on suborbits of point stabilizers in classical groups on the last subconstituent of dual polar graphs, the corresponding problem for orthogonal dual polar graphs over a finite field of odd characteristic is discussed in this paper. We determine all the suborbits of a point-stabilizer in the orthogonal group on the last subconstituent, and calculate the length of each suborbit. Moreover, we discuss the quasi-strongly regular graphs and the association schemes based on the last subconstituent, respectively

Single Tube, High Throughput Cloning of Inverted Repeat Constructs for Double-Stranded RNA Expression

BACKGROUND: RNA interference (RNAi) has emerged as a powerful tool for the targeted knockout of genes for functional genomics, system biology studies and drug discovery applications. To meet the requirements for high throughput screening in plants we have developed a new method for the rapid assembly of inverted repeat-containing constructs for the in vivo production of dsRNAs. METHODOLOGY/PRINCIPAL FINDINGS: The procedure that we describe is based on tagging the sense and antisense fragments with unique single-stranded (ss) tails which are then assembled in a single tube Ligase Independent Cloning (LIC) reaction. Since the assembly reaction is based on the annealing of unique complementary single stranded tails which can only assemble in one orientation, greater than ninety percent of the resultant clones contain the desired insert. CONCLUSION/SIGNIFICANCE: Our single-tube reaction provides a highly efficient method for the assembly of inverted repeat constructs for gene suppression applications. The single tube assembly is directional, highly efficient and readily adapted for high throughput applications

Singular linear space and its applications

AbstractAs a generalization of attenuated spaces, the concept of singular linear spaces was introduced in [K. Wang, J. Guo, F. Li, Association schemes based on attenuated spaces, European J. Combin. 31 (2010) 297–305]. This paper first gives two anzahl theorems in singular linear spaces, and then discusses their applications to the constructions of Deza digraphs, quasi-strongly regular graphs, lattices and authentication codes

Association schemes based on maximal totally isotropic subspaces in singular pseudo-symplectic spaces

AbstractThis paper provides some new families of symmetric association schemes based on maximal totally isotropic subspaces in (singular) pseudo-symplectic spaces. All intersection numbers of these schemes are computed