Characterisation of potentially bipartite self-complementary bipartitioned sequences

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterisation of self-complementary chordal graphs

In this note we prove that a self-complementary graph with p vertices is chordal if and only if its clique number is integral part of (p + 1)/2. (~) 1998 Elsevier Science B.V. All rights reserved

متن کامل

Efficient 5'-end labeling of oligonucleotides containing self-complementary sequences.

Synthetic oligonucleotides have become basic tools in molecular biology research and are commonly used for cloning and characterization of genes, analysis of gene expression and so on. Frequently, the success of techniques such as DNA and RNA sequencing, screening of libraries, nuclease S1 and RNase protection assays or polymerase chain reaction (PCR) amplification depends on appropriate design...

متن کامل

A Characterisation of Pfaffian Near Bipartite Graphs

A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e1 and e2 such that G − {e1, e2} is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subgraphs. The theorem extends an earlier characterisation of Pfaffian bipartite graphs.

متن کامل

Permissible base sequences for non self complementary messenger RNAs.

It is a well accepted assumption that the transcription of DNA is done along a single strand (T o c c h in i-Va l e n t in e and cols.1, S p ie g e l m a n and H a y a s h i 2, M a r m u r 3 and T o h ä C. 4) and that the biosynthetic mRNA obtained is monoteonic and is read in a linear fashion during the process of translation. In order to have a good interaction with the ribosome and an easy r...

متن کامل

Potentially H-bigraphic sequences

We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative integer sequences. The sequence pair S = (A,B) is said to be bigraphic if there is some bipartite graph G = (X ∪ Y, E) such that A and B are the degrees of the vertices in X and Y , respectively. If S is a bigraphic pair, let σ(S) denote the sum of the terms in A. Given a bigraphic pair S, and a fixe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1982

ISSN: 0012-365X

DOI: 10.1016/0012-365x(82)90286-2