A common ancestor DNA motif for invertebrate and vertebrate hormone response elements.
نویسندگان
چکیده
منابع مشابه
A MODEL FOR THE BASIC HELIX- LOOPHELIX MOTIF AND ITS SEQUENCE SPECIFIC RECOGNITION OF DNA
A three dimensional model of the basic Helix-Loop-Helix motif and its sequence specific recognition of DNA is described. The basic-helix I is modeled as a continuous ?-helix because no ?-helix breaking residue is found between the basic region and the first helix. When the basic region of the two peptide monomers are aligned in the successive major groove of the cognate DNA, the hydrophobi...
متن کاملVertebrate versus invertebrate neural circuits
doi: 10.4088/JCP.12m08083). Thus, the meditation proved efficient in the activation of the ventrolateral pre-frontal cortex and in increasing the connectivity between amygdala and pre-frontal cortex. Both these neurological changes are believed to be beneficial for the reduction of GAD symptoms. Such findings demonstrating that soft healing approaches like meditation can be backed up by hard ev...
متن کاملAge of the common ancestor of human mitochondrial DNA.
Studying the evolutionary change of the control region of human (H) and chimpanzee (C) mitochondrial DNAs (mtDNAs), Vigilant et al. ( 199 1) concluded that the root of the phylogenetic tree for H mtDNAs is located at a sequence from African populations and that the age of the common H ancestral mtDNA is 166,000-249,000 years. Hedges et al. ( 1992) and Templeton ( 1992) challenged the first of t...
متن کاملLowest Common Ancestor(LCA)
Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we will be using throughout this article. Let there be a rooted tree T(E,V). A node x ∈ T is called an ancestor of a node y ∈ T if the path from the root of T to y goes through x. Also, a node v ∈ T is called to be a common ancestor of x and y if it is an ancestor of both x a...
متن کامل2 Least Common Ancestor
In particular, we are allowed to preprocess the texts in order to be able to answer the query faster. Our preprocessing choice was the use of a single suffix tree, in which all the suffixes of all the texts appear, each suffix ending with a distinct symbol that determines the text in which the suffix appears. In order to answer the query we reduced the problem to range-min queries, which in tur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The EMBO Journal
سال: 1991
ISSN: 0261-4189
DOI: 10.1002/j.1460-2075.1991.tb07946.x