WorldWideScience

Sample records for au-rich signature motif

  1. Spectroscopic Signatures and Structural Motifs of Dopamine: a Computational Study

    Science.gov (United States)

    Srivastava, Santosh Kumar; Singh, Vipin Bahadur

    2016-06-01

    Dopamine (DA) is an essential neurotransmitter in the central nervous system and it plays integral role in numerous brain functions including behaviour, cognition, emotion, working memory and associated learning. In the present work the conformational landscapes of neutral and protonated dopamine have been investigated in the gas phase and in aqueous solution by MP2 and DFT (M06-2X, ωB97X-D, B3LYP and B3LYP-D3) methods. Twenty lowest energy structures of neutral DA were subjected to geometry optimization and the gauche conformer, GIa, was found to be the lowest gas phase structure at the each level of theory in agreement with the experimental rotational spectroscopy. All folded gauche conformers (GI) where lone electron pair of the NH2 group is directed towards the π system of the aromatic ring ( 'non up' ) are found more stable in the gas phase. While in aqueous solution, all those gauche conformers (GII) where lone electron pair of the NH2 group is directed opposite from the π system of the aromatic ring ('up' structures) are stabilized significantly.Nine lowest energy structures, protonated at the amino group, are optimized at the same MP2/aug-cc-pVDZ level of theory. In the most stable gauche structures, g-1 and g+1, mainly electrostatic cation - π interaction is further stabilized by significant dispersion forces as predicted by the substantial differences between the DFT and dispersion corrected DFT-D3 calculations. In aqueous environment the intra-molecular cation- π distance in g-1 and g+1 isomers, slightly increases compared to the gas phase and the magnitude of the cation- π interaction is reduced relative to the gas phase, because solvation of the cation decreases its interaction energy with the π face of aromatic system. The IR intensity of the bound N-H+ stretching mode provides characteristic 'IR spectroscopic signatures' which can reflect the strength of cation- π interaction energy. The CC2 lowest lying S1 ( 1ππ* ) excited state of neutral

  2. Structural relationships in the lysozyme superfamily: significant evidence for glycoside hydrolase signature motifs.

    Directory of Open Access Journals (Sweden)

    Alexandre Wohlkönig

    Full Text Available BACKGROUND: Chitin is a polysaccharide that forms the hard, outer shell of arthropods and the cell walls of fungi and some algae. Peptidoglycan is a polymer of sugars and amino acids constituting the cell walls of most bacteria. Enzymes that are able to hydrolyze these cell membrane polymers generally play important roles for protecting plants and animals against infection with insects and pathogens. A particular group of such glycoside hydrolase enzymes share some common features in their three-dimensional structure and in their molecular mechanism, forming the lysozyme superfamily. RESULTS: Besides having a similar fold, all known catalytic domains of glycoside hydrolase proteins of lysozyme superfamily (families and subfamilies GH19, GH22, GH23, GH24 and GH46 share in common two structural elements: the central helix of the all-α domain, which invariably contains the catalytic glutamate residue acting as general-acid catalyst, and a β-hairpin pointed towards the substrate binding cleft. The invariant β-hairpin structure is interestingly found to display the highest amino acid conservation in aligned sequences of a given family, thereby allowing to define signature motifs for each GH family. Most of such signature motifs are found to have promising performances for searching sequence databases. Our structural analysis further indicates that the GH motifs participate in enzymatic catalysis essentially by containing the catalytic water positioning residue of inverting mechanism. CONCLUSIONS: The seven families and subfamilies of the lysozyme superfamily all have in common a β-hairpin structure which displays a family-specific sequence motif. These GH β-hairpin motifs contain potentially important residues for the catalytic activity, thereby suggesting the participation of the GH motif to catalysis and also revealing a common catalytic scheme utilized by enzymes of the lysozyme superfamily.

  3. Requirement for asparagine in the aquaporin NPA sequence signature motifs for cation exclusion

    DEFF Research Database (Denmark)

    Wree, Dorothea; Wu, Binghua; Zeuthen, Thomas;

    2011-01-01

    Two highly conserved NPA motifs are a hallmark of the aquaporin (AQP) family. The NPA triplets form N-terminal helix capping structures with the Asn side chains located in the centre of the water or solute-conducting channel, and are considered to play an important role in AQP selectivity. Although...... electrophysiology, we found that an analogous mammalian AQP1 N76S mutant excluded protons and potassium ions, but leaked sodium ions, providing an argument for the overwhelming prevalence of Asn over other amino acids. We conclude that, at the first position in the NPA motifs, only Asn provides efficient helix cap...

  4. Signature motifs identify an Acinetobacter Cif virulence factor with epoxide hydrolase activity.

    Science.gov (United States)

    Bahl, Christopher D; Hvorecny, Kelli L; Bridges, Andrew A; Ballok, Alicia E; Bomberger, Jennifer M; Cady, Kyle C; O'Toole, George A; Madden, Dean R

    2014-03-14

    Endocytic recycling of the cystic fibrosis transmembrane conductance regulator (CFTR) is blocked by the CFTR inhibitory factor (Cif). Originally discovered in Pseudomonas aeruginosa, Cif is a secreted epoxide hydrolase that is transcriptionally regulated by CifR, an epoxide-sensitive repressor. In this report, we investigate a homologous protein found in strains of the emerging nosocomial pathogens Acinetobacter nosocomialis and Acinetobacter baumannii ("aCif"). Like Cif, aCif is an epoxide hydrolase that carries an N-terminal secretion signal and can be purified from culture supernatants. When applied directly to polarized airway epithelial cells, mature aCif triggers a reduction in CFTR abundance at the apical membrane. Biochemical and crystallographic studies reveal a dimeric assembly with a stereochemically conserved active site, confirming our motif-based identification of candidate Cif-like pathogenic EH sequences. Furthermore, cif expression is transcriptionally repressed by a CifR homolog ("aCifR") and is induced in the presence of epoxides. Overall, this Acinetobacter protein recapitulates the essential attributes of the Pseudomonas Cif system and thus may facilitate airway colonization in nosocomial lung infections. PMID:24474692

  5. Identification of a signature motif for the eIF4a3-SECIS interaction.

    Science.gov (United States)

    Budiman, Michael E; Bubenik, Jodi L; Driscoll, Donna M

    2011-09-01

    eIF4a3, a DEAD-box protein family member, is a component of the exon junction complex which assembles on spliced mRNAs. The protein also acts as a transcript-selective translational repressor of selenoprotein synthesis during selenium deficiency. Selenocysteine (Sec) incorporation into selenoproteins requires a Sec Insertion Sequence (SECIS) element in the 3' untranslated region. During selenium deficiency, eIF4a3 binds SECIS elements from non-essential selenoproteins, preventing Sec insertion. We identified a molecular signature for the eIF4a3-SECIS interaction using RNA gel shifts, surface plasmon resonance and enzymatic foot printing. Our results support a two-site interaction model, where eIF4a3 binds the internal and apical loops of the SECIS. Additionally, the stability of the complex requires uridine in the SECIS core. In terms of protein requirements, the two globular domains of eIF4a3, which are connected by a linker, are both critical for SECIS binding. Compared to full-length eIF4a3, the two domains in trans bind with a lower association rate but notably, the uridine is no longer important for complex stability. These results provide insight into how eIF4a3 discriminates among SECIS elements and represses translation.

  6. The nuclear-cytoplasmic shuttling of virion host shutoff RNase is enabled by pUL47 and an embedded nuclear export signal and defines the sites of degradation of AU-rich and stable cellular mRNAs.

    Science.gov (United States)

    Shu, Minfeng; Taddeo, Brunella; Roizman, Bernard

    2013-12-01

    The herpes simplex virus host shutoff RNase (VHS-RNase) is the major early block of host responses to infection. VHS-RNase is introduced into cells during infection and selectively degrades stable mRNAs made before infection and the normally short-lived AU-rich stress response mRNAs induced by sensors of innate immunity. Through its interactions with pUL47, another tegument protein, it spares from degradation viral mRNAs. Analyses of embedded motifs revealed that VHS-RNase contains a nuclear export signal (NES) but not a nuclear localization signal. To reconcile the potential nuclear localization with earlier studies showing that VHS-RNase degrades mRNAs in polyribosomes, we constructed a mutant in which NES was ablated. Comparison of the mutant and wild-type VHS-RNases revealed the following. (i) On infection, VHS-RNase is transported to the nucleus, but only the wild-type protein shuttles between the nucleus and cytoplasm. (ii) Both VHS-RNases localized in the cytoplasm following transfection. On cotransfection with pUL47, a fraction of VHS-RNase was translocated to the nucleus, suggesting that pUL47 may enable nuclear localization of VHS-RNase. (iii) In infected cells, VHS-RNase lacking NES degraded the short-lived AU-rich mRNAs but not the stable mRNAs. In transfected cells, both wild-type and NES mutant VHS-RNases effectively degraded cellular mRNAs. Our results suggest that the stable mRNAs are degraded in the cytoplasm, whereas the AU-rich mRNAs may be degraded in both cellular compartments. The selective sparing of viral mRNAs may take place during the nuclear phase in the course of interaction of pUL47, VHS-RNase, and nascent viral mRNAs.

  7. Evolution of the Twist Subfamily Vertebrate Proteins: Discovery of a Signature Motif and Origin of the Twist1 Glycine-Rich Motifs in the Amino-Terminus Disordered Domain.

    Science.gov (United States)

    Rodriguez, Yacidzohara; Gonzalez-Mendez, Ricardo R; Cadilla, Carmen L

    2016-01-01

    Twist proteins belong to the basic helix-loop-helix (bHLH) family of multifunctional transcriptional factors. These factors are known to use domains other than the common bHLH in protein-protein interactions. There has been much work characterizing the bHLH domain and the C-terminus in protein-protein interactions but despite a few attempts more focus is needed at the N-terminus. Since the region of highest diversity in Twist proteins is the N-terminus, we analyzed the conservation of this region in different vertebrate Twist proteins and study the sequence differences between Twist1 and Twist2 with emphasis on the glycine-rich regions found in Twist1. We found a highly conserved sequence motif in all Twist1 (SSSPVSPADDSLSNSEEE) and Twist2 (SSSPVSPVDSLGTSEEE) mammalian species with unknown function. Through sequence comparison we demonstrate that the Twist protein family ancestor was "Twist2-like" and the two glycine-rich regions found in Twist1 sequences were acquired late in evolution, apparently not at the same time. The second glycine-rich region started developing first in the fish vertebrate group, while the first glycine region arose afterwards within the reptiles. Disordered domain and secondary structure predictions showed that the amino acid sequence and disorder feature found at the N-terminus is highly evolutionary conserved and could be a functional site that interacts with other proteins. Detailed examination of the glycine-rich regions in the N-terminus of Twist1 demonstrate that the first region is completely aliphatic while the second region contains some polar residues that could be subject to post-translational modification. Phylogenetic and sequence space analysis showed that the Twist1 subfamily is the result of a gene duplication during Twist2 vertebrate fish evolution, and has undergone more evolutionary drift than Twist2. We identified a new signature motif that is characteristic of each Twist paralog and identified important residues within

  8. TTP and BRF proteins nucleate processing body formation to silence mRNAs with AU-rich elements

    OpenAIRE

    Franks, Tobias M.; Lykke-Andersen, Jens

    2007-01-01

    In mammalian cells, mRNAs with AU-rich elements (AREs) are targeted for translational silencing and rapid degradation. Here we present evidence that in human cells the proteins Tristetraprolin (TTP) and BRF-1 deliver ARE-mRNAs to processing bodies (PBs), cytoplasmic assemblies of mRNAs, and associated factors that promote translational silencing and mRNA decay. First, depletion of endogenous TTP and BRF proteins, or overexpression of dominant-negative mutant TTP proteins, impairs the localiza...

  9. The cholesterol-dependent cytolysin signature motif: a critical element in the allosteric pathway that couples membrane binding to pore assembly.

    Directory of Open Access Journals (Sweden)

    Kelley J Dowd

    Full Text Available The cholesterol-dependent cytolysins (CDCs constitute a family of pore-forming toxins that contribute to the pathogenesis of a large number of Gram-positive bacterial pathogens.The most highly conserved region in the primary structure of the CDCs is the signature undecapeptide sequence (ECTGLAWEWWR. The CDC pore forming mechanism is highly sensitive to changes in its structure, yet its contribution to the molecular mechanism of the CDCs has remained enigmatic. Using a combination of fluorescence spectroscopic methods we provide evidence that shows the undecapeptide motif of the archetype CDC, perfringolysin O (PFO, is a key structural element in the allosteric coupling of the cholesterol-mediated membrane binding in domain 4 (D4 to distal structural changes in domain 3 (D3 that are required for the formation of the oligomeric pore complex. Loss of the undecapeptide function prevents all measurable D3 structural transitions, the intermolecular interaction of membrane bound monomers and the assembly of the oligomeric pore complex. We further show that this pathway does not exist in intermedilysin (ILY, a CDC that exhibits a divergent undecapeptide and that has evolved to use human CD59 rather than cholesterol as its receptor. These studies show for the first time that the undecapeptide of the cholesterol-binding CDCs forms a critical element of the allosteric pathway that controls the assembly of the pore complex.

  10. AU-Rich-Element-Dependent Translation Repression Requires the Cooperation of Tristetraprolin and RCK/P54

    OpenAIRE

    Qi, Mei-Yan; Wang, Zhi-Zhang; Zhang, Zhuo; SHAO, QIN; Zeng, An; Li, Xiang-Qi; Li, Wen-Qing; Wang, Chen; Tian, Fu-Ju; Li, Qing; ZOU, Jun; Qin, Yong-Wen; Brewer, Gary; Huang, Shuang; Jing, Qing

    2012-01-01

    AU-rich elements (AREs), residing in the 3′ untranslated region (UTR) of many labile mRNAs, are important cis-acting elements that modulate the stability of these mRNAs by collaborating with trans-acting factors such as tristetraprolin (TTP). AREs also regulate translation, but the underlying mechanism is not fully understood. Here we examined the function and mechanism of TTP in ARE-mRNA translation. Through a luciferase-based reporter system, we used knockdown, overexpression, and tethering...

  11. The p53 target Wig-1 regulates p53 mRNA stability through an AU-rich element

    DEFF Research Database (Denmark)

    Vilborg, Anna; Glahder, Jacob-Andreas Harald; Wilhelm, Margareta T;

    2009-01-01

    The p53 target gene Wig-1 encodes a double-stranded-RNA-binding zinc finger protein. We show here that Wig-1 binds to p53 mRNA and stabilizes it through an AU-rich element (ARE) in the 3' UTR of the p53 mRNA. This effect is mirrored by enhanced p53 protein levels in both unstressed cells and cells...... exposed to p53-activating stress agents. Thus, the p53 target Wig-1 is a previously undescribed ARE-regulating protein that acts as a positive feedback regulator of p53, with implications both for the steady-state levels of p53 and for the p53 stress response. Our data reveal a previously undescribed link...... between the tumor suppressor p53 and posttranscriptional gene regulation via AREs in mRNA....

  12. Characterization of Butyrate response factor 2 and study of its role in AU-rich element-mediated mRNA decay

    OpenAIRE

    Kulkarni, Meeta Girish

    2012-01-01

    AU-rich element-mediated mRNA decay (AMD) is a prominent mode of mRNA degradation in the cell considering 10-15 % of mRNA in the cells include an AU-rich element (ARE) in their 3’ UTR. These mRNAs code for proteins involved in important cellular processes, namely, growth and maintenance, development, transcription, inflammation, apoptosis, etc. AMD is majorly promoted by the TTP family of proteins consisting of TTP, BRF1, and BRF2, which bind to the AREs in the 3’UTR of mRNAs and accelerate t...

  13. Tristetraprolin and Its Family Members Can Promote the Cell-Free Deadenylation of AU-Rich Element-Containing mRNAs by Poly(A) Ribonuclease

    OpenAIRE

    Lai, Wi S.; Kennington, Elizabeth A; Blackshear, Perry J.

    2003-01-01

    Eukaryotic mRNA stability can be influenced by AU-rich elements (AREs) within mRNA primary sequences. Tristetraprolin (TTP) is a CCCH tandem zinc finger protein that binds to ARE-containing transcripts and destabilizes them, apparently by first promoting the removal of their poly(A) tails. We developed a cell-free system in which TTP and its related proteins stimulated the deadenylation of ARE-containing, polyadenylated transcripts. Transcript deadenylation was not stimulated when a mutant TT...

  14. Nutritional Control of mRNA Stability Is Mediated by a Conserved AU-rich Element That Binds the Cytoplasmic Shuttling Protein HuR*

    OpenAIRE

    Yaman, Ibrahim; Fernandez, James; Sarkar, Bedabrata; Schneider, Robert J.; Snider, Martin D.; Nagy, Laura E.; Hatzoglou, Maria

    2002-01-01

    The cationic amino acid transporter, Cat-1, is a high affinity transporter of the essential amino acids, arginine and lysine. Expression of the cat-1 gene increases during nutritional stress as part of the adaptive response to starvation. Amino acid limitation induces coordinate increases in stability and translation of the cat-1 mRNA, at a time when global protein synthesis decreases. It is shown here that increased cat-1 mRNA stability requires an 11 nucleotide AU-rich element within the di...

  15. Tristetraprolin Recruits Eukaryotic Initiation Factor 4E2 To Repress Translation of AU-Rich Element-Containing mRNAs

    OpenAIRE

    Tao, Xianzun; Gao, Guangxia

    2015-01-01

    Tristetraprolin (TTP) regulates the expression of AU-rich element-containing mRNAs through promoting the degradation and repressing the translation of target mRNA. While the mechanism for promoting target mRNA degradation has been extensively studied, the mechanism underlying translational repression is not well established. Here, we show that TTP recruits eukaryotic initiation factor 4E2 (eIF4E2) to repress target mRNA translation. TTP interacted with eIF4E2 but not with eIF4E. Overexpressio...

  16. The RNA Binding Zinc Finger Protein Tristetraprolin Regulates AU-Rich mRNAs Involved in Breast Cancer-Related Processes

    OpenAIRE

    Al-Souhibani, Norah; Al-Ahmadi, Wijdan; Hesketh, John E.; Blackshear, Perry J.; Khabar, Khalid S.A.

    2010-01-01

    Tristetraprolin (TTP or ZFP36) is a tandem CCCH zinc finger RNA binding protein that regulates the stability of certain AU-rich mRNAs. Recent work suggests that TTP is deficient in cancer cells when compared to normal cell types. Here we found that TTP expression was lower in invasive breast cancer cells (MDA-MB-231) compared to normal breast cell lines, MCF12A and MCF-10. TTP targets were probed using a novel approach by expressing the C124R zinc finger TTP mutant that act as dominant negati...

  17. The AU-rich element mRNA decay-promoting activity of BRF1 is regulated by mitogen-activated protein kinase-activated protein kinase 2

    OpenAIRE

    Maitra, Sushmit; Chou, Chu-Fang; Luber, Christian A.; Lee, Kyung-Yeol; Mann, Matthias; Chen, Ching-Yi

    2008-01-01

    Regulated mRNA decay is a highly important process for the tight control of gene expression. Inherently unstable mRNAs contain AU-rich elements (AREs) in the 3′ untranslated regions that direct rapid mRNA decay by interaction with decay-promoting ARE-binding proteins (ARE-BPs). The decay of ARE-containing mRNAs is regulated by signaling pathways that are believed to directly target ARE-BPs. Here, we show that BRF1 involved in ARE-mediated mRNA decay (AMD) is phosphorylated by MAPK-activated p...

  18. Signatures of RNA binding proteins globally coupled to effective microRNA target sites

    DEFF Research Database (Denmark)

    Jacobsen, Anders; Wen, Jiayu; Marks, Debora S;

    2010-01-01

    in 3' untranslated regions (UTRs) correlate with expression changes following transfection of small RNAs. The most significantly overrepresented motifs in down-regulated mRNAs are two novel U-rich motifs (URMs), UUUUAAA and UUUGUUU, recently discovered as binding sites for the ELAVL4 (also known as Hu......D) RNA-BP. Surprisingly, the most significantly overrepresented motif in up-regulated mRNAs is the heptanucleotide AU-rich element (ARE), UAUUUAU, which is known to affect mRNA stability via at least 20 different RNA-BPs. We show that destabilization mediated by the transfected miRNA is generally...

  19. Signature motifs of GDP polyribonucleotidyltransferase, a non-segmented negative strand RNA viral mRNA capping enzyme, domain in the L protein are required for covalent enzyme-pRNA intermediate formation.

    Science.gov (United States)

    Neubauer, Julie; Ogino, Minako; Green, Todd J; Ogino, Tomoaki

    2016-01-01

    The unconventional mRNA capping enzyme (GDP polyribonucleotidyltransferase, PRNTase; block V) domain in RNA polymerase L proteins of non-segmented negative strand (NNS) RNA viruses (e.g. rabies, measles, Ebola) contains five collinear sequence elements, Rx(3)Wx(3-8)ΦxGxζx(P/A) (motif A; Φ, hydrophobic; ζ, hydrophilic), (Y/W)ΦGSxT (motif B), W (motif C), HR (motif D) and ζxxΦx(F/Y)QxxΦ (motif E). We performed site-directed mutagenesis of the L protein of vesicular stomatitis virus (VSV, a prototypic NNS RNA virus) to examine participation of these motifs in mRNA capping. Similar to the catalytic residues in motif D, G1100 in motif A, T1157 in motif B, W1188 in motif C, and F1269 and Q1270 in motif E were found to be essential or important for the PRNTase activity in the step of the covalent L-pRNA intermediate formation, but not for the GTPase activity that generates GDP (pRNA acceptor). Cap defective mutations in these residues induced termination of mRNA synthesis at position +40 followed by aberrant stop-start transcription, and abolished virus gene expression in host cells. These results suggest that the conserved motifs constitute the active site of the PRNTase domain and the L-pRNA intermediate formation followed by the cap formation is essential for successful synthesis of full-length mRNAs.

  20. The association of Alu repeats with the generation of potential AU-rich elements (ARE at 3' untranslated regions.

    Directory of Open Access Journals (Sweden)

    Bhak Jonghwa

    2004-12-01

    Full Text Available Abstract Background A significant portion (about 8% in the human genome of mammalian mRNA sequences contains AU (Adenine and Uracil rich elements or AREs at their 3' untranslated regions (UTR. These mRNA sequences are usually stable. However, an increasing number of observations have been made of unstable species, possibly depending on certain elements such as Alu repeats. ARE motifs are repeats of the tetramer AUUU and a monomer A at the end of the repeats ((AUUUnA. The importance of AREs in biology is that they make certain mRNA unstable. Proto-oncogene, such as c-fos, c-myc, and c-jun in humans, are associated with AREs. Although it has been known that the increased number of ARE motifs caused the decrease of the half-life of mRNA containing ARE repeats, the exact mechanism is as of yet unknown. We analyzed the occurrences of AREs and Alu and propose a possible mechanism for how human mRNA could acquire and keep AREs at its 3' UTR originating from Alu repeats. Results Interspersed in the human genome, Alu repeats occupy 5% of the 3' UTR of mRNA sequences. Alu has poly-adenine (poly-A regions at its end, which lead to poly-thymine (poly-T regions at the end of its complementary Alu. It has been found that AREs are present at the poly-T regions. From the 3' UTR of the NCBI's reference mRNA sequence database, we found nearly 40% (38.5% of ARE (Class I were associated with Alu sequences (Table 1 within one mismatch allowance in ARE sequences. Other ARE classes had statistically significant associations as well. This is far from a random occurrence given their limited quantity. At each ARE class, random distribution was simulated 1,000 times, and it was shown that there is a special relationship between ARE patterns and the Alu repeats. Table 1 Defined ARE classes. (Symbol marks are used in this study instead of full sequences. Symbol ARE sequence Class I (AUUU5A AUUUAUUUAUUUAUUUAUUUA Class II (AUUU4A AUUUAUUUAUUUAUUUA Class III U(AUUU3AU

  1. Ore-forming mechanism for the Xiaoxinancha Au-rich Cu deposit in Yanbian, Jilin Province, China: Evidence from noble gas isotope geochemistry of fluid inclusions in minerals

    Institute of Scientific and Technical Information of China (English)

    SUN JingGui; ZHAO JunKang; CHEN JunQiang; KEISUKE Nagao; HIROCHiKA Sumino; SHEN Kun; MEN LanJing; CHEN Lei

    2008-01-01

    The Xiaoxinancha Au-rich copper deposit is one of important Au-Cu deposits along the continental margin in Eastern China. The deposit consists of two sections: the Beishan mine (North), composed of altered rocks with veinlet-dissemination sulfides and melnicovite-dominated sulfide-quartz veins, and the Nanshan mine (South), composed of pyrrhotite-dominated sulfide-quartz veins and pure sulfide veins. The isotope compositions of noble gases extracted from fluid inclusions in ore minerals, i.e. ratios of 3He/4He, 20Ne/22Ne and 40Ar/36Ar are in the ranges of 4.45-0.08 Ra, 10.2-8.8 and 306-430, respectively. Fluid inclusions in minerals from the Nanshan mine have higher 3He/4He and 20Ne/22Ne ratios whereas those from the Beishan mine have lower 3He/4He ratios. The analysis of origin, and evolution of the ore fluids and its relations with the ore-forming stages and the ages of mineralization suggests that the initial hydrothermal fluids probably come from the melts generated by partial melting of oceanic crust with the participation of fluids from the mantle (mantle-plume type)/aesthenosphere. This also corresponds to the continental margin settings during the subduction of Izanagi ocaneic plate towards the palaeo-Asian continent (123-102 Ma). The veinlet-dissemination ore bodies of the Beishan mine were formed through replacement and crystallization of the mixed fluids generated by mixing of the ascending high-temperature boiling fluid with young crustal fluid whereas the melnicovite-dominated sulfide-quartz veins were formed subsequently by filling of the high-temperature ore fluid in fissures. Pyrrhotite-dominated sulfide-quartz veins in the Nanshan mine were formed by filling-deposition- crystallization of the moderate-temperature ore fluids and the pure sulfide veins were formed later by filling-deposition-crystallization of ore substance-rich fluids after boiling of the moderate-temperature ore fluids. The metallogenic dynamic processes can be summarized as: (1

  2. Deletion of AU-rich elements within the Bcl2 3'UTR reduces protein expression and B cell survival in vivo.

    Directory of Open Access Journals (Sweden)

    Manuel D Díaz-Muñoz

    Full Text Available Post-transcriptional mRNA regulation by RNA binding proteins (RBPs associated with AU-rich elements (AREs present in the 3' untranslated region (3'UTR of specific mRNAs modulates transcript stability and translation in eukaryotic cells. Here we have functionally characterised the importance of the AREs present within the Bcl2 3'UTR in order to maintain Bcl2 expression. Gene targeting deletion of 300 nucleotides of the Bcl2 3'UTR rich in AREs diminishes Bcl2 mRNA stability and protein levels in primary B cells, decreasing cell lifespan. Generation of chimeric mice indicates that Bcl2-ARE∆/∆ B cells have an intrinsic competitive disadvantage compared to wild type cells. Biochemical assays and predictions using a bioinformatics approach show that several RBPs bind to the Bcl2 AREs, including AUF1 and HuR proteins. Altogether, association of RBPs to Bcl2 AREs contributes to Bcl2 protein expression by stabilizing Bcl2 mRNA and promotes B cell maintenance.

  3. The Motif Tracking Algorithm

    CERN Document Server

    Wilson, William; Aickelin, Uwe; 10.1007/s11633.008.0032.0

    2010-01-01

    The search for patterns or motifs in data represents a problem area of key interest to finance and economic researchers. In this paper we introduce the Motif Tracking Algorithm, a novel immune inspired pattern identification tool that is able to identify unknown motifs of a non specified length which repeat within time series data. The power of the algorithm comes from the fact that it uses a small number of parameters with minimal assumptions regarding the data being examined or the underlying motifs. Our interest lies in applying the algorithm to financial time series data to identify unknown patterns that exist. The algorithm is tested using three separate data sets. Particular suitability to financial data is shown by applying it to oil price data. In all cases the algorithm identifies the presence of a motif population in a fast and efficient manner due to the utilisation of an intuitive symbolic representation. The resulting population of motifs is shown to have considerable potential value for other ap...

  4. The Motif Tracking Algorithm

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    The search for patterns or motifs in data represents a problem area of key interest to finance and economic researchers. In this paper, we introduce the motif tracking algorithm (MTA), a novel immune inspired (IS) pattern identification tool that is able to identify unknown motifs of a non specified length which repeat within time series data. The power of the algorithm comes from the fact that it uses a small number of parameters with minimal assumptions regarding the data being examined or the underlying motifs. Our interest lies in applying the algorithm to financial time series data to identify unknown patterns that exist. The algorithm is tested using three separate data sets. Particular suitability to financial data is shown by applying it to oil price data. In all cases, the algorithm identifies the presence of a motif population in a fast and efficient manner due to the utilization of an intuitive symbolic representation.The resulting population of motifs is shown to have considerable potential value for other applications such as forecasting and algorithm seeding.

  5. Crystal Structure of the N-Terminal RNA Recognition Motif of mRNA Decay Regulator AUF1

    Directory of Open Access Journals (Sweden)

    Young Jun Choi

    2016-01-01

    Full Text Available AU-rich element binding/degradation factor 1 (AUF1 plays a role in destabilizing mRNAs by forming complexes with AU-rich elements (ARE in the 3′-untranslated regions. Multiple AUF1-ARE complexes regulate the translation of encoded products related to the cell cycle, apoptosis, and inflammation. AUF1 contains two tandem RNA recognition motifs (RRM and a Gln- (Q- rich domain in their C-terminal region. To observe how the two RRMs are involved in recognizing ARE, we obtained the AUF1-p37 protein covering the two RRMs. However, only N-terminal RRM (RRM1 was crystallized and its structure was determined at 1.7 Å resolution. It appears that the RRM1 and RRM2 separated before crystallization. To demonstrate which factors affect the separate RRM1-2, we performed limited proteolysis using trypsin. The results indicated that the intact proteins were cleaved by unknown proteases that were associated with them prior to crystallization. In comparison with each of the monomers, the conformations of the β2-β3 loops were highly variable. Furthermore, a comparison with the RRM1-2 structures of HuR and hnRNP A1 revealed that a dimer of RRM1 could be one of the possible conformations of RRM1-2. Our data may provide a guidance for further structural investigations of AUF1 tandem RRM repeat and its mode of ARE binding.

  6. Visibility graph motifs

    CERN Document Server

    Iacovacci, Jacopo

    2015-01-01

    Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of visibility graph motifs, smaller substructures that appear with characteristic frequencies. We develop a theory to compute in an exact way the motif profiles associated to general classes of deterministic and stochastic dynamics. We find that this simple property is indeed a highly informative and computationally efficient feature capable to distinguish among different dynamics and robust against noise contamination. We finally confirm that it can be used in practice to perform unsupervised learning, by extracting motif profiles from experimental heart-rate series and being able, accordingly, to disentangle meditative from other relaxation states. Applications of this general theory include the automatic classification a...

  7. The MHC motif viewer

    DEFF Research Database (Denmark)

    Rapin, Nicolas Philippe Jean-Pierre; Hoof, Ilka; Lund, Ole;

    2010-01-01

    In vertebrates, the onset of cellular immune reactions is controlled by presentation of peptides in complex with major histocompatibility complex (MHC) molecules to T cell receptors. In humans, MHCs are called human leukocyte antigens (HLAs). Different MHC molecules present different subsets of...... peptides, and knowledge of their binding specificities is important for understanding differences in the immune response between individuals. Algorithms predicting which peptides bind a given MHC molecule have recently been developed with high prediction accuracy. The utility of these algorithms is...... binding motif for each MHC molecule is predicted using state-of-the-art, pan-specific peptide-MHC binding-prediction methods, and is visualized as a sequence logo, in a format that allows for a comprehensive interpretation of binding motif anchor positions and amino acid preferences....

  8. Ore-forming mechanism for the Xiaoxinancha Au-rich Cu deposit in Yanbian,Jilin Province,China:Evidence from noble gas isotope geochemistry of fluid inclusions in minerals

    Institute of Scientific and Technical Information of China (English)

    KEISUKE; Nagao; HIROCHIKA; Sumino

    2008-01-01

    The Xiaoxinancha Au-rich copper deposit is one of important Au-Cu deposits along the continental margin in Eastern China. The deposit consists of two sections: the Beishan mine (North), composed of altered rocks with veinlet-dissemination sulfides and melnicovite-dominated sulfide-quartz veins, and the Nanshan mine (South), composed of pyrrhotite-dominated sulfide-quartz veins and pure sulfide veins. The isotope compositions of noble gases extracted from fluid inclusions in ore minerals, i.e. ratios of 3He/4He, 20Ne/22Ne and40Ar/36Ar are in the ranges of 4.45―0.08 Ra, 10.2―8.8 and 306―430, respectively. Fluid inclusions in minerals from the Nanshan mine have higher 3He/4He and 20Ne/22Ne ratios whereas those from the Beishan mine have lower 3He/4He ratios. The analysis of origin, and evolution of the ore fluids and its relations with the ore-forming stages and the ages of mineralization suggests that the initial hydrothermal fluids probably come from the melts generated by partial melting of oceanic crust with the participation of fluids from the mantle (mantle-plume type)/aesthenosphere. This also corresponds to the continental margin settings during the subduction of Izanagi ocaneic plate towards the palaeo-Asian continent (123―102 Ma). The veinlet-dissemination ore bodies of the Beishan mine were formed through replacement and crystallization of the mixed fluids generated by mixing of the ascending high-temperature boiling fluid with young crustal fluid whereas the melnicovite-dominated sulfide-quartz veins were formed subsequently by filling of the high-temperature ore fluid in fissures. Pyrrhotite-dominated sulfide-quartz veins in the Nanshan mine were formed by filling-deposition-crystallization of the moderate-temperature ore fluids and the pure sulfide veins were formed later by filling-deposition-crystallization of ore substance-rich fluids after boiling of the moderate-temperature ore fluids. The metallogenic dynamic processes can be summarized as

  9. Mining protein sequences for motifs.

    Science.gov (United States)

    Narasimhan, Giri; Bu, Changsong; Gao, Yuan; Wang, Xuning; Xu, Ning; Mathee, Kalai

    2002-01-01

    We use methods from Data Mining and Knowledge Discovery to design an algorithm for detecting motifs in protein sequences. The algorithm assumes that a motif is constituted by the presence of a "good" combination of residues in appropriate locations of the motif. The algorithm attempts to compile such good combinations into a "pattern dictionary" by processing an aligned training set of protein sequences. The dictionary is subsequently used to detect motifs in new protein sequences. Statistical significance of the detection results are ensured by statistically determining the various parameters of the algorithm. Based on this approach, we have implemented a program called GYM. The Helix-Turn-Helix motif was used as a model system on which to test our program. The program was also extended to detect Homeodomain motifs. The detection results for the two motifs compare favorably with existing programs. In addition, the GYM program provides a lot of useful information about a given protein sequence. PMID:12487759

  10. MHC motif viewer

    DEFF Research Database (Denmark)

    Rapin, Nicolas Philippe Jean-Pierre; Hoof, Ilka; Lund, Ole;

    2008-01-01

    In vertebrates, the major histocompatibility complex (MHC) presents peptides to the immune system. In humans, MHCs are called human leukocyte antigens (HLAs), and some of the loci encoding them are the most polymorphic in the human genome. Different MHC molecules present different subsets of....... Algorithms that predict which peptides MHC molecules bind have recently been developed and cover many different alleles, but the utility of these algorithms is hampered by the lack of tools for browsing and comparing the specificity of these molecules. We have, therefore, developed a web server, MHC motif...

  11. Comparative genomic analysis of upstream miRNA regulatory motifs in Caenorhabditis.

    Science.gov (United States)

    Jovelin, Richard; Krizus, Aldis; Taghizada, Bakhtiyar; Gray, Jeremy C; Phillips, Patrick C; Claycomb, Julie M; Cutter, Asher D

    2016-07-01

    MicroRNAs (miRNAs) comprise a class of short noncoding RNA molecules that play diverse developmental and physiological roles by controlling mRNA abundance and protein output of the vast majority of transcripts. Despite the importance of miRNAs in regulating gene function, we still lack a complete understanding of how miRNAs themselves are transcriptionally regulated. To fill this gap, we predicted regulatory sequences by searching for abundant short motifs located upstream of miRNAs in eight species of Caenorhabditis nematodes. We identified three conserved motifs across the Caenorhabditis phylogeny that show clear signatures of purifying selection from comparative genomics, patterns of nucleotide changes in motifs of orthologous miRNAs, and correlation between motif incidence and miRNA expression. We then validated our predictions with transgenic green fluorescent protein reporters and site-directed mutagenesis for a subset of motifs located in an enhancer region upstream of let-7 We demonstrate that a CT-dinucleotide motif is sufficient for proper expression of GFP in the seam cells of adult C. elegans, and that two other motifs play incremental roles in combination with the CT-rich motif. Thus, functional tests of sequence motifs identified through analysis of molecular evolutionary signatures provide a powerful path for efficiently characterizing the transcriptional regulation of miRNA genes. PMID:27140965

  12. CERTIFICATELESS SIGNATURE AND BLIND SIGNATURE

    Institute of Scientific and Technical Information of China (English)

    Zhang Lei; Zhang Futai

    2008-01-01

    Certificateless public key cryptography is a new paradigm introduced by AI-Riyami and Paterson. It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-based Public Key Cryptography (ID-PKC). Due to the advantages of the certificateless public key cryptography,a new efficient certificateless pairing-based signature scheme is presented,which has some advantages over previous constructions in computational cost. Based on this new signature scheme,a certificateless blind signature scheme is proposed. The security of our schemes is proven based on the hardness of computational Diffie-Hellman problem.

  13. cWords - systematic microRNA regulatory motif discovery from mRNA expression data

    DEFF Research Database (Denmark)

    Rasmussen, Simon Horskjær; Jacobsen, Anders; Krogh, Anders

    2013-01-01

    -transcriptional regulation by small RNAs is mediated through partial complementary binding to messenger RNAs leaving nucleotide signatures or motifs throughout the entire transcriptome. Computational methods for discovery and analysis of sequence motifs in high-throughput mRNA expression profiling experiments are becoming...... increasingly important tools for the identification of post-transcriptional regulatory motifs and the inference of the regulators and their targets. RESULTS:cWords is a method designed for regulatory motif discovery in differential case-control mRNA expression datasets. We have improved the algorithms...... and statistical methods of cWords, resulting in at least a factor 100 speed gain over the previous implementation. On a benchmark dataset of 19 microRNA (miRNA) perturbation experiments cWords showed equal or better performance than two comparable methods, miReduce and Sylamer. We have developed rigorous motif...

  14. Sequential visibility-graph motifs

    Science.gov (United States)

    Iacovacci, Jacopo; Lacasa, Lucas

    2016-04-01

    Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of sequential visibility-graph motifs, smaller substructures of n consecutive nodes that appear with characteristic frequencies. We develop a theory to compute in an exact way the motif profiles associated with general classes of deterministic and stochastic dynamics. We find that this simple property is indeed a highly informative and computationally efficient feature capable of distinguishing among different dynamics and robust against noise contamination. We finally confirm that it can be used in practice to perform unsupervised learning, by extracting motif profiles from experimental heart-rate series and being able, accordingly, to disentangle meditative from other relaxation states. Applications of this general theory include the automatic classification and description of physical, biological, and financial time series.

  15. Main: SEF1MOTIF [PLACE

    Lifescience Database Archive (English)

    Full Text Available inding motif; sequence found in 5'-upstream region (-640; -765) of soybean beta-conglicinin (7S globulin) ge...ne; W=A/T; SOYBEAN; STORAGE PROTEIN; 7S; GLOBULIN; BETA-CONGLICININ; seed; soybean (Glycine max) ATATTTAWW ...

  16. Reference: TCA1MOTIF [PLACE

    Lifescience Database Archive (English)

    Full Text Available TCA1MOTIF Goldsbrough AP, Albrecht H, Stratford R Salicylic acid-inducible binding ...of a tobacco nuclear protein to a 10 bp sequence which is highly conserved amongst stress-inducible genes. Plant J 3:563-571 (1993) PubMed: 8220463; ...

  17. Predicting conserved protein motifs with Sub-HMMs

    Directory of Open Access Journals (Sweden)

    Girke Thomas

    2010-04-01

    Full Text Available Abstract Background Profile HMMs (hidden Markov models provide effective methods for modeling the conserved regions of protein families. A limitation of the resulting domain models is the difficulty to pinpoint their much shorter functional sub-features, such as catalytically relevant sequence motifs in enzymes or ligand binding signatures of receptor proteins. Results To identify these conserved motifs efficiently, we propose a method for extracting the most information-rich regions in protein families from their profile HMMs. The method was used here to predict a comprehensive set of sub-HMMs from the Pfam domain database. Cross-validations with the PROSITE and CSA databases confirmed the efficiency of the method in predicting most of the known functionally relevant motifs and residues. At the same time, 46,768 novel conserved regions could be predicted. The data set also allowed us to link at least 461 Pfam domains of known and unknown function by their common sub-HMMs. Finally, the sub-HMM method showed very promising results as an alternative search method for identifying proteins that share only short sequence similarities. Conclusions Sub-HMMs extend the application spectrum of profile HMMs to motif discovery. Their most interesting utility is the identification of the functionally relevant residues in proteins of known and unknown function. Additionally, sub-HMMs can be used for highly localized sequence similarity searches that focus on shorter conserved features rather than entire domains or global similarities. The motif data generated by this study is a valuable knowledge resource for characterizing protein functions in the future.

  18. MODIS: an audio motif discovery software

    OpenAIRE

    Catanese, Laurence; Souviraà-Labastie, Nathan; Qu, Bingqing; Campion, Sébastien; Gravier, Guillaume; Vincent, Emmanuel; Bimbot, Frédéric

    2013-01-01

    International audience MODIS is a free speech and audio motif discovery software developed at IRISA Rennes. Motif discovery is the task of discovering and collecting occurrences of repeating patterns in the absence of prior knowledge, or training material. MODIS is based on a generic approach to mine repeating audio sequences, with tolerance to motif variability. The algorithm implementation allows to process large audio streams at a reasonable speed where motif discovery often requires hu...

  19. Structural Motifs of Gold Nanoparticles.

    Science.gov (United States)

    Cleveland, C. L.; Luedtke, W. D.; Landman, Uzi

    1996-03-01

    Through an extensive search, involving energy minimization using embedded atom potentials, we found(R.L. Whetten et al./), submitted to Nature (1995). that the energetically optimal sequence for AuN clusters (30 motif, and variants thereof. These predictions for bare gold particles, and for particles coated by sef-assembled thiol monolayers, are discussed in light of recent experiments on the preparation and characterization (including mass spectrometry, electron microscopy, and X-ray diffraction) of nanocrystalline gold molecules (see Ref. 2).

  20. Main: TCA1MOTIF [PLACE

    Lifescience Database Archive (English)

    Full Text Available TCA1MOTIF S000159 17-May-1998 (last modified) kehi TCA-1 (tobacco nuclear protein 1...) binding site; Related to salicylic acid-inducible expression of many genes; Found in barley beta-1,3-gluca...nase and over 30 different plant genes which are known to be induced by one or more forms of stress; A similar sequence (TCA... et al., 1997); SA; salicylic acid; stress; TCA-1; barley (Hordeum vulgare); tobacco (Nicotiana tabacum); TCATCTTCTT ...

  1. Comprehensive discovery of DNA motifs in 349 human cells and tissues reveals new features of motifs.

    Science.gov (United States)

    Zheng, Yiyu; Li, Xiaoman; Hu, Haiyan

    2015-01-01

    Comprehensive motif discovery under experimental conditions is critical for the global understanding of gene regulation. To generate a nearly complete list of human DNA motifs under given conditions, we employed a novel approach to de novo discover significant co-occurring DNA motifs in 349 human DNase I hypersensitive site datasets. We predicted 845 to 1325 motifs in each dataset, for a total of 2684 non-redundant motifs. These 2684 motifs contained 54.02 to 75.95% of the known motifs in seven large collections including TRANSFAC. In each dataset, we also discovered 43 663 to 2 013 288 motif modules, groups of motifs with their binding sites co-occurring in a significant number of short DNA regions. Compared with known interacting transcription factors in eight resources, the predicted motif modules on average included 84.23% of known interacting motifs. We further showed new features of the predicted motifs, such as motifs enriched in proximal regions rarely overlapped with motifs enriched in distal regions, motifs enriched in 5' distal regions were often enriched in 3' distal regions, etc. Finally, we observed that the 2684 predicted motifs classified the cell or tissue types of the datasets with an accuracy of 81.29%. The resources generated in this study are available at http://server.cs.ucf.edu/predrem/.

  2. Motif Detection Inspired by Immune Memory

    CERN Document Server

    Wilson, William; Aickelin, Uwe

    2010-01-01

    The search for patterns or motifs in data represents an area of key interest to many researchers. In this paper we present the Motif Tracking Algorithm, a novel immune inspired pattern identification tool that is able to identify variable length unknown motifs which repeat within time series data. The algorithm searches from a completely neutral perspective that is independent of the data being analysed and the underlying motifs. In this paper we test the flexibility of the motif tracking algorithm by applying it to the search for patterns in two industrial data sets. The algorithm is able to identify a population of motifs successfully in both cases, and the value of these motifs is discussed.

  3. Statistical tests to compare motif count exceptionalities

    Directory of Open Access Journals (Sweden)

    Vandewalle Vincent

    2007-03-01

    Full Text Available Abstract Background Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs are identified and represent candidate functional motifs. The present work addresses the related question of comparing the exceptionality of one motif in two different sequences. Just comparing the motif count p-values in each sequence is indeed not sufficient to decide if this motif is significantly more exceptional in one sequence compared to the other one. A statistical test is required. Results We develop and analyze two statistical tests, an exact binomial one and an asymptotic likelihood ratio test, to decide whether the exceptionality of a given motif is equivalent or significantly different in two sequences of interest. For that purpose, motif occurrences are modeled by Poisson processes, with a special care for overlapping motifs. Both tests can take the sequence compositions into account. As an illustration, we compare the octamer exceptionalities in the Escherichia coli K-12 backbone versus variable strain-specific loops. Conclusion The exact binomial test is particularly adapted for small counts. For large counts, we advise to use the likelihood ratio test which is asymptotic but strongly correlated with the exact binomial test and very simple to use.

  4. An Algorithm for Motif Discovery with Iteration on Lengths of Motifs.

    Science.gov (United States)

    Fan, Yetian; Wu, Wei; Yang, Jie; Yang, Wenyu; Liu, Rongrong

    2015-01-01

    Analysis of DNA sequence motifs is becoming increasingly important in the study of gene regulation, and the identification of motif in DNA sequences is a complex problem in computational biology. Motif discovery has attracted the attention of more and more researchers, and varieties of algorithms have been proposed. Most existing motif discovery algorithms fix the motif's length as one of the input parameters. In this paper, a novel method is proposed to identify the optimal length of the motif and the optimal motif with that length, through an iteration process on increasing length numbers. For each fixed length, a modified genetic algorithm (GA) is used for finding the optimal motif with that length. Three operators are used in the modified GA: Mutation that is similar to the one used in usual GA but is modified to avoid local optimum in our case, and Addition and Deletion that are proposed by us for the problem. A criterion is given for singling out the optimal length in the increasing motif's lengths. We call this method AMDILM (an algorithm for motif discovery with iteration on lengths of motifs). The experiments on simulated data and real biological data show that AMDILM can accurately identify the optimal motif length. Meanwhile, the optimal motifs discovered by AMDILM are consistent with the real ones and are similar with the motifs obtained by the three well-known methods: Gibbs Sampler, MEME and Weeder. PMID:26357084

  5. rMotifGen: random motif generator for DNA and protein sequences

    Directory of Open Access Journals (Sweden)

    Hardin C Timothy

    2007-08-01

    Full Text Available Abstract Background Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such as transcription factor and DNA binding sites as well as conserved protein domains. In order to help assess motif detection algorithms on motifs with varying properties and levels of conservation, we have developed a computational tool, rMotifGen, with the sole purpose of generating a number of random DNA or protein sequences containing short sequence motifs. Each motif consensus can be user-defined, randomly generated, or created from a position-specific scoring matrix (PSSM. Insertions and mutations within these motifs are created according to user-defined parameters and substitution matrices. The resulting sequences can be helpful in mutational simulations and in testing the limits of motif detection algorithms. Results Two implementations of rMotifGen have been created, one providing a graphical user interface (GUI for random motif construction, and the other serving as a command line interface. The second implementation has the added advantages of platform independence and being able to be called in a batch mode. rMotifGen was used to construct sample sets of sequences containing DNA motifs and amino acid motifs that were then tested against the Gibbs sampler and MEME packages. Conclusion rMotifGen provides an efficient and convenient method for creating random DNA or amino acid sequences with a variable number of motifs, where the instance of each motif can be incorporated using a position-specific scoring matrix (PSSM or by creating an instance mutated from its corresponding consensus using an evolutionary model based on substitution matrices. rMotifGen is freely available at: http://bioinformatics.louisville.edu/brg/rMotifGen/.

  6. Biological network motif detection: principles and practice.

    Science.gov (United States)

    Wong, Elisabeth; Baur, Brittany; Quader, Saad; Huang, Chun-Hsi

    2012-03-01

    Network motifs are statistically overrepresented sub-structures (sub-graphs) in a network, and have been recognized as 'the simple building blocks of complex networks'. Study of biological network motifs may reveal answers to many important biological questions. The main difficulty in detecting larger network motifs in biological networks lies in the facts that the number of possible sub-graphs increases exponentially with the network or motif size (node counts, in general), and that no known polynomial-time algorithm exists in deciding if two graphs are topologically equivalent. This article discusses the biological significance of network motifs, the motivation behind solving the motif-finding problem, and strategies to solve the various aspects of this problem. A simple classification scheme is designed to analyze the strengths and weaknesses of several existing algorithms. Experimental results derived from a few comparative studies in the literature are discussed, with conclusions that lead to future research directions. PMID:22396487

  7. Exotic signatures from supersymmetry

    Energy Technology Data Exchange (ETDEWEB)

    Hall, L.J. (California Univ., Berkeley, CA (USA). Dept. of Physics Lawrence Berkeley Lab., CA (USA))

    1989-08-01

    Minor changes to the standard supersymmetric model, such as soft flavor violation and R parity violation, cause large changes in the signatures. The origin of these changes and the resulting signatures are discussed. 15 refs., 7 figs., 2 tabs.

  8. Qualified Mobile Server Signature

    OpenAIRE

    Orthacker, Clemens; Centner, Martin; Kittl, Christian

    2010-01-01

    International audience A legal basis for the use of electronic signatures exists since the introduction of qualified electronic signatures in EU Directive 1999/ 93/EC. Although considered as key enablers for e-Government and e-Commerce, qualified electronic signatures are still not widely used. Introducing amobile component addresses most of the shortcomings of existing qualified signature approaches but poses certain difficulties in the security reasoning. The proposed server based mobile...

  9. PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search

    OpenAIRE

    Qiang Yu; Hongwei Huo; Yipu Zhang; Hongzhi Guo

    2012-01-01

    Motif search is a fundamental problem in bioinformatics with an important application in locating transcription factor binding sites (TFBSs) in DNA sequences. The exact algorithms can report all (l, d) motifs and find the best one under a specific objective function. However, it is still a challenging task to identify weak motifs, since either a large amount of memory or execution time is required by current exact algorithms. A new exact algorithm, PairMotif, is proposed for planted (l, d) mo...

  10. Assessment of composite motif discovery methods

    Directory of Open Access Journals (Sweden)

    Johansen Jostein

    2008-02-01

    Full Text Available Abstract Background Computational discovery of regulatory elements is an important area of bioinformatics research and more than a hundred motif discovery methods have been published. Traditionally, most of these methods have addressed the problem of single motif discovery – discovering binding motifs for individual transcription factors. In higher organisms, however, transcription factors usually act in combination with nearby bound factors to induce specific regulatory behaviours. Hence, recent focus has shifted from single motifs to the discovery of sets of motifs bound by multiple cooperating transcription factors, so called composite motifs or cis-regulatory modules. Given the large number and diversity of methods available, independent assessment of methods becomes important. Although there have been several benchmark studies of single motif discovery, no similar studies have previously been conducted concerning composite motif discovery. Results We have developed a benchmarking framework for composite motif discovery and used it to evaluate the performance of eight published module discovery tools. Benchmark datasets were constructed based on real genomic sequences containing experimentally verified regulatory modules, and the module discovery programs were asked to predict both the locations of these modules and to specify the single motifs involved. To aid the programs in their search, we provided position weight matrices corresponding to the binding motifs of the transcription factors involved. In addition, selections of decoy matrices were mixed with the genuine matrices on one dataset to test the response of programs to varying levels of noise. Conclusion Although some of the methods tested tended to score somewhat better than others overall, there were still large variations between individual datasets and no single method performed consistently better than the rest in all situations. The variation in performance on individual

  11. MSDmotif: exploring protein sites and motifs

    Directory of Open Access Journals (Sweden)

    Henrick Kim

    2008-07-01

    Full Text Available Abstract Background Protein structures have conserved features – motifs, which have a sufficient influence on the protein function. These motifs can be found in sequence as well as in 3D space. Understanding of these fragments is essential for 3D structure prediction, modelling and drug-design. The Protein Data Bank (PDB is the source of this information however present search tools have limited 3D options to integrate protein sequence with its 3D structure. Results We describe here a web application for querying the PDB for ligands, binding sites, small 3D structural and sequence motifs and the underlying database. Novel algorithms for chemical fragments, 3D motifs, ϕ/ψ sequences, super-secondary structure motifs and for small 3D structural motif associations searches are incorporated. The interface provides functionality for visualization, search criteria creation, sequence and 3D multiple alignment options. MSDmotif is an integrated system where a results page is also a search form. A set of motif statistics is available for analysis. This set includes molecule and motif binding statistics, distribution of motif sequences, occurrence of an amino-acid within a motif, correlation of amino-acids side-chain charges within a motif and Ramachandran plots for each residue. The binding statistics are presented in association with properties that include a ligand fragment library. Access is also provided through the distributed Annotation System (DAS protocol. An additional entry point facilitates XML requests with XML responses. Conclusion MSDmotif is unique by combining chemical, sequence and 3D data in a single search engine with a range of search and visualisation options. It provides multiple views of data found in the PDB archive for exploring protein structures.

  12. Quantum threshold group signature

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In most situations, the signer is generally a single person. However, when the message is written on behalf of an organization, a valid message may require the approval or consent of several persons. Threshold signature is a solution to this problem. Generally speaking, as an authority which can be trusted by all members does not exist, a threshold signature scheme without a trusted party appears more attractive. Following some ideas of the classical Shamir’s threshold signature scheme, a quantum threshold group signature one is proposed. In the proposed scheme, only t or more of n persons in the group can generate the group signature and any t-1 or fewer ones cannot do that. In the verification phase, any t or more of n signature receivers can verify the message and any t-1 or fewer receivers cannot verify the validity of the signature.

  13. Helix-packing motifs in membrane proteins.

    Science.gov (United States)

    Walters, R F S; DeGrado, W F

    2006-09-12

    The fold of a helical membrane protein is largely determined by interactions between membrane-imbedded helices. To elucidate recurring helix-helix interaction motifs, we dissected the crystallographic structures of membrane proteins into a library of interacting helical pairs. The pairs were clustered according to their three-dimensional similarity (rmsd universe of common transmembrane helix-pairing motifs is relatively simple. The largest cluster, which comprises 29% of the library members, consists of an antiparallel motif with left-handed packing angles, and it is frequently stabilized by packing of small side chains occurring every seven residues in the sequence. Right-handed parallel and antiparallel structures show a similar tendency to segregate small residues to the helix-helix interface but spaced at four-residue intervals. Position-specific sequence propensities were derived for the most populated motifs. These structural and sequential motifs should be quite useful for the design and structural prediction of membrane proteins.

  14. Temporal motifs in time-dependent networks

    International Nuclear Information System (INIS)

    Temporal networks are commonly used to represent systems where connections between elements are active only for restricted periods of time, such as telecommunication, neural signal processing, biochemical reaction and human social interaction networks. We introduce the framework of temporal motifs to study the mesoscale topological–temporal structure of temporal networks in which the events of nodes do not overlap in time. Temporal motifs are classes of similar event sequences, where the similarity refers not only to topology but also to the temporal order of the events. We provide a mapping from event sequences to coloured directed graphs that enables an efficient algorithm for identifying temporal motifs. We discuss some aspects of temporal motifs, including causality and null models, and present basic statistics of temporal motifs in a large mobile call network

  15. MotifLab: a tools and data integration workbench for motif discovery and regulatory sequence analysis

    Directory of Open Access Journals (Sweden)

    Klepper Kjetil

    2013-01-01

    Full Text Available Abstract Background Traditional methods for computational motif discovery often suffer from poor performance. In particular, methods that search for sequence matches to known binding motifs tend to predict many non-functional binding sites because they fail to take into consideration the biological state of the cell. In recent years, genome-wide studies have generated a lot of data that has the potential to improve our ability to identify functional motifs and binding sites, such as information about chromatin accessibility and epigenetic states in different cell types. However, it is not always trivial to make use of this data in combination with existing motif discovery tools, especially for researchers who are not skilled in bioinformatics programming. Results Here we present MotifLab, a general workbench for analysing regulatory sequence regions and discovering transcription factor binding sites and cis-regulatory modules. MotifLab supports comprehensive motif discovery and analysis by allowing users to integrate several popular motif discovery tools as well as different kinds of additional information, including phylogenetic conservation, epigenetic marks, DNase hypersensitive sites, ChIP-Seq data, positional binding preferences of transcription factors, transcription factor interactions and gene expression. MotifLab offers several data-processing operations that can be used to create, manipulate and analyse data objects, and complete analysis workflows can be constructed and automatically executed within MotifLab, including graphical presentation of the results. Conclusions We have developed MotifLab as a flexible workbench for motif analysis in a genomic context. The flexibility and effectiveness of this workbench has been demonstrated on selected test cases, in particular two previously published benchmark data sets for single motifs and modules, and a realistic example of genes responding to treatment with forskolin. MotifLab is freely

  16. Detecting Motifs in System Call Sequences

    CERN Document Server

    Wilson, William O; Aickelin, Uwe

    2010-01-01

    The search for patterns or motifs in data represents an area of key interest to many researchers. In this paper we present the Motif Tracking Algorithm, a novel immune inspired pattern identification tool that is able to identify unknown motifs which repeat within time series data. The power of the algorithm is derived from its use of a small number of parameters with minimal assumptions. The algorithm searches from a completely neutral perspective that is independent of the data being analysed, and the underlying motifs. In this paper the motif tracking algorithm is applied to the search for patterns within sequences of low level system calls between the Linux kernel and the operating system's user space. The MTA is able to compress data found in large system call data sets to a limited number of motifs which summarise that data. The motifs provide a resource from which a profile of executed processes can be built. The potential for these profiles and new implications for security research are highlighted. A...

  17. Automated motif discovery from glycan array data.

    Science.gov (United States)

    Cholleti, Sharath R; Agravat, Sanjay; Morris, Tim; Saltz, Joel H; Song, Xuezheng; Cummings, Richard D; Smith, David F

    2012-10-01

    Assessing interactions of a glycan-binding protein (GBP) or lectin with glycans on a microarray generates large datasets, making it difficult to identify a glycan structural motif or determinant associated with the highest apparent binding strength of the GBP. We have developed a computational method, termed GlycanMotifMiner, that uses the relative binding of a GBP with glycans within a glycan microarray to automatically reveal the glycan structural motifs recognized by a GBP. We implemented the software with a web-based graphical interface for users to explore and visualize the discovered motifs. The utility of GlycanMotifMiner was determined using five plant lectins, SNA, HPA, PNA, Con A, and UEA-I. Data from the analyses of the lectins at different protein concentrations were processed to rank the glycans based on their relative binding strengths. The motifs, defined as glycan substructures that exist in a large number of the bound glycans and few non-bound glycans, were then discovered by our algorithm and displayed in a web-based graphical user interface ( http://glycanmotifminer.emory.edu ). The information is used in defining the glycan-binding specificity of GBPs. The results were compared to the known glycan specificities of these lectins generated by manual methods. A more complex analysis was also carried out using glycan microarray data obtained for a recombinant form of human galectin-8. Results for all of these lectins show that GlycanMotifMiner identified the major motifs known in the literature along with some unexpected novel binding motifs. PMID:22877213

  18. A Conserved GPG-Motif in the HIV-1 Nef Core Is Required for Principal Nef-Activities.

    Directory of Open Access Journals (Sweden)

    Marta Martínez-Bonet

    Full Text Available To find out new determinants required for Nef activity we performed a functional alanine scanning analysis along a discrete but highly conserved region at the core of HIV-1 Nef. We identified the GPG-motif, located at the 121-137 region of HIV-1 NL4.3 Nef, as a novel protein signature strictly required for the p56Lck dependent Nef-induced CD4-downregulation in T-cells. Since the Nef-GPG motif was dispensable for CD4-downregulation in HeLa-CD4 cells, Nef/AP-1 interaction and Nef-dependent effects on Tf-R trafficking, the observed effects on CD4 downregulation cannot be attributed to structure constraints or to alterations on general protein trafficking. Besides, we found that the GPG-motif was also required for Nef-dependent inhibition of ring actin re-organization upon TCR triggering and MHCI downregulation, suggesting that the GPG-motif could actively cooperate with the Nef PxxP motif for these HIV-1 Nef-related effects. Finally, we observed that the Nef-GPG motif was required for optimal infectivity of those viruses produced in T-cells. According to these findings, we propose the conserved GPG-motif in HIV-1 Nef as functional region required for HIV-1 infectivity and therefore with a potential interest for the interference of Nef activity during HIV-1 infection.

  19. Fitness for synchronization of network motifs

    DEFF Research Database (Denmark)

    Vega, Y.M.; Vázquez-Prada, M.; Pacheco, A.F.;

    2004-01-01

    We study the synchronization of Kuramoto's oscillators in small parts of networks known as motifs. We first report on the system dynamics for the case of a scale-free network and show the existence of a non-trivial critical point. We compute the probability that network motifs synchronize, and fi...... that the fitness for synchronization correlates well with motifs interconnectedness and structural complexity. Possible implications for present debates about network evolution in biological and other systems are discussed. © 2004 Elsevier B.V. All rights reserved....

  20. Unconditionally Secure Quantum Signatures

    Directory of Open Access Journals (Sweden)

    Ryan Amiri

    2015-08-01

    Full Text Available Signature schemes, proposed in 1976 by Diffie and Hellman, have become ubiquitous across modern communications. They allow for the exchange of messages from one sender to multiple recipients, with the guarantees that messages cannot be forged or tampered with and that messages also can be forwarded from one recipient to another without compromising their validity. Signatures are different from, but no less important than encryption, which ensures the privacy of a message. Commonly used signature protocols—signatures based on the Rivest–Adleman–Shamir (RSA algorithm, the digital signature algorithm (DSA, and the elliptic curve digital signature algorithm (ECDSA—are only computationally secure, similar to public key encryption methods. In fact, since these rely on the difficulty of finding discrete logarithms or factoring large primes, it is known that they will become completely insecure with the emergence of quantum computers. We may therefore see a shift towards signature protocols that will remain secure even in a post-quantum world. Ideally, such schemes would provide unconditional or information-theoretic security. In this paper, we aim to provide an accessible and comprehensive review of existing unconditionally securesecure signature schemes for signing classical messages, with a focus on unconditionally secure quantum signature schemes.

  1. Blind Collective Signature Protocol

    Directory of Open Access Journals (Sweden)

    Nikolay A. Moldovyan

    2011-06-01

    Full Text Available Using the digital signature (DS scheme specified by Belarusian DS standard there are designed the collective and blind collective DS protocols. Signature formation is performed simultaneously by all of the assigned signers, therefore the proposed protocols can be used also as protocols for simultaneous signing a contract. The proposed blind collective DS protocol represents a particular implementation of the blind multisignature schemes that is a novel type of the signature schemes. The proposed protocols are the first implementations of the multisignature schemes based on Belarusian signature standard.

  2. MotifMiner: A Table Driven Greedy Algorithm for DNA Motif Mining

    Science.gov (United States)

    Seeja, K. R.; Alam, M. A.; Jain, S. K.

    DNA motif discovery is a much explored problem in functional genomics. This paper describes a table driven greedy algorithm for discovering regulatory motifs in the promoter sequences of co-expressed genes. The proposed algorithm searches both DNA strands for the common patterns or motifs. The inputs to the algorithm are set of promoter sequences, the motif length and minimum Information Content. The algorithm generates subsequences of given length from the shortest input promoter sequence. It stores these subsequences and their reverse complements in a table. Then it searches the remaining sequences for good matches of these subsequences. The Information Content score is used to measure the goodness of the motifs. The algorithm has been tested with synthetic data and real data. The results are found promising. The algorithm could discover meaningful motifs from the muscle specific regulatory sequences.

  3. Detecting seeded motifs in DNA sequences

    OpenAIRE

    Pizzi, Cinzia; Bortoluzzi, Stefania; Bisognin, Andrea; Coppe, Alessandro; Danieli, Gian Antonio

    2005-01-01

    The problem of detecting DNA motifs with functional relevance in real biological sequences is difficult due to a number of biological, statistical and computational issues and also because of the lack of knowledge about the structure of searched patterns. Many algorithms are implemented in fully automated processes, which are often based upon a guess of input parameters from the user at the very first step. In this paper, we present a novel method for the detection of seeded DNA motifs, compo...

  4. Revocable Ring Signature

    Institute of Scientific and Technical Information of China (English)

    Dennis Y. W. Liu; Joseph K. Liu; Yi Mu; Willy Susilo; Duncan S. Wong

    2007-01-01

    Group signature allows the anonymity of a real signer in a group to be revoked by a trusted party called group manager. It also gives the group manager the absolute power of controlling the formation of the group. Ring signature, on the other hand, does not allow anyone to revoke the signer anonymity, while allowing the real signer to forma group (also known as a ring) arbitrarily without being controlled by any other party. In this paper, we propose a new variant for ring signature, called Revocable Ring Signature. The signature allows a real signer to form a ring arbitrarily while allowing a set of authorities to revoke the anonymity of the real signer. This new variant inherits the desirable properties from both group signature and ring signature in such a way that the real signer will be responsible for what it has signed as the anonymity is revocable by authorities while the real signer still has the freedom on ring formation. We provide a formal security model for revocable ring signature and propose an efficient construction which is proven secure under our security model.

  5. A survey of motif finding Web tools for detecting binding site motifs in ChIP-Seq data

    OpenAIRE

    Ngoc Tam L. Tran; Huang, Chun-Hsi

    2014-01-01

    Abstract ChIP-Seq (chromatin immunoprecipitation sequencing) has provided the advantage for finding motifs as ChIP-Seq experiments narrow down the motif finding to binding site locations. Recent motif finding tools facilitate the motif detection by providing user-friendly Web interface. In this work, we reviewed nine motif finding Web tools that are capable for detecting binding site motifs in ChIP-Seq data. We showed each motif finding Web tool has its own advantages for detecting motifs tha...

  6. Detecting seeded motifs in DNA sequences.

    Science.gov (United States)

    Pizzi, Cinzia; Bortoluzzi, Stefania; Bisognin, Andrea; Coppe, Alessandro; Danieli, Gian Antonio

    2005-01-01

    The problem of detecting DNA motifs with functional relevance in real biological sequences is difficult due to a number of biological, statistical and computational issues and also because of the lack of knowledge about the structure of searched patterns. Many algorithms are implemented in fully automated processes, which are often based upon a guess of input parameters from the user at the very first step. In this paper, we present a novel method for the detection of seeded DNA motifs, composed by regions with a different extent of variability. The method is based on a multi-step approach, which was implemented in a motif searching web tool (MOST). Overrepresented exact patterns are extracted from input sequences and clustered to produce motifs core regions, which are then extended and scored to generate seeded motifs. The combination of automated pattern discovery algorithms and different display tools for the evaluation and selection of results at several analysis steps can potentially lead to much more meaningful results than complete automation can produce. Experimental results on different yeast and human real datasets proved the methodology to be a promising solution for finding seeded motifs. MOST web tool is freely available at http://telethon.bio.unipd.it/bioinfo/MOST. PMID:16141193

  7. Chaotic motifs in gene regulatory networks.

    Science.gov (United States)

    Zhang, Zhaoyang; Ye, Weiming; Qian, Yu; Zheng, Zhigang; Huang, Xuhui; Hu, Gang

    2012-01-01

    Chaos should occur often in gene regulatory networks (GRNs) which have been widely described by nonlinear coupled ordinary differential equations, if their dimensions are no less than 3. It is therefore puzzling that chaos has never been reported in GRNs in nature and is also extremely rare in models of GRNs. On the other hand, the topic of motifs has attracted great attention in studying biological networks, and network motifs are suggested to be elementary building blocks that carry out some key functions in the network. In this paper, chaotic motifs (subnetworks with chaos) in GRNs are systematically investigated. The conclusion is that: (i) chaos can only appear through competitions between different oscillatory modes with rivaling intensities. Conditions required for chaotic GRNs are found to be very strict, which make chaotic GRNs extremely rare. (ii) Chaotic motifs are explored as the simplest few-node structures capable of producing chaos, and serve as the intrinsic source of chaos of random few-node GRNs. Several optimal motifs causing chaos with atypically high probability are figured out. (iii) Moreover, we discovered that a number of special oscillators can never produce chaos. These structures bring some advantages on rhythmic functions and may help us understand the robustness of diverse biological rhythms. (iv) The methods of dominant phase-advanced driving (DPAD) and DPAD time fraction are proposed to quantitatively identify chaotic motifs and to explain the origin of chaotic behaviors in GRNs.

  8. A novel motif identified in dependence receptors.

    Directory of Open Access Journals (Sweden)

    Gabriel del Rio

    Full Text Available Programmed cell death signaling is a critical feature of development, cellular turnover, oncogenesis, and neurodegeneration, among other processes. Such signaling may be transduced via specific receptors, either following ligand binding-to death receptors-or following the withdrawal of trophic ligands-from dependence receptors. Although dependence receptors display functional similarities, no common structural domains have been identified. Therefore, we employed the Multiple Expectation Maximization for Motif Elicitation and the Motif Alignment and Search Tool software programs to identify a novel transmembrane motif, dubbed dependence-associated receptor transmembrane (DART motif, that is common to all described dependence receptors. Of 3,465 human transmembrane proteins, 25 (0.7% display the DART motif. The predicted secondary structure features an alpha helical structure, with an unusually high percentage of valine residues. At least four of the proteins undergo regulated intramembrane proteolysis. To date, we have not identified a function for this putative domain. We speculate that the DART motif may be involved in protein processing, interaction with other proteins or lipids, or homomultimerization.

  9. Detecting seeded motifs in DNA sequences

    Science.gov (United States)

    Pizzi, Cinzia; Bortoluzzi, Stefania; Bisognin, Andrea; Coppe, Alessandro; Danieli, Gian Antonio

    2005-01-01

    The problem of detecting DNA motifs with functional relevance in real biological sequences is difficult due to a number of biological, statistical and computational issues and also because of the lack of knowledge about the structure of searched patterns. Many algorithms are implemented in fully automated processes, which are often based upon a guess of input parameters from the user at the very first step. In this paper, we present a novel method for the detection of seeded DNA motifs, composed by regions with a different extent of variability. The method is based on a multi-step approach, which was implemented in a motif searching web tool (MOST). Overrepresented exact patterns are extracted from input sequences and clustered to produce motifs core regions, which are then extended and scored to generate seeded motifs. The combination of automated pattern discovery algorithms and different display tools for the evaluation and selection of results at several analysis steps can potentially lead to much more meaningful results than complete automation can produce. Experimental results on different yeast and human real datasets proved the methodology to be a promising solution for finding seeded motifs. MOST web tool is freely available at . PMID:16141193

  10. 3matrix and 3motif: a protein structure visualization system for conserved sequence motifs

    OpenAIRE

    Bennett, Steven P.; Lu, Lin; Brutlag, Douglas L.

    2003-01-01

    Computational methods such as sequence alignment and motif construction are useful in grouping related proteins into families, as well as helping to annotate new proteins of unknown function. These methods identify conserved amino acids in protein sequences, but cannot determine the specific functional or structural roles of conserved amino acids without additional study. In this work, we present 3matrix (http://3matrix.stanford.edu) and 3motif (http://3motif.stanford.edu), a web-based sequen...

  11. WebMOTIFS: automated discovery, filtering and scoring of DNA sequence motifs using multiple programs and Bayesian approaches.

    Science.gov (United States)

    Romer, Katherine A; Kayombya, Guy-Richard; Fraenkel, Ernest

    2007-07-01

    WebMOTIFS provides a web interface that facilitates the discovery and analysis of DNA-sequence motifs. Several studies have shown that the accuracy of motif discovery can be significantly improved by using multiple de novo motif discovery programs and using randomized control calculations to identify the most significant motifs or by using Bayesian approaches. WebMOTIFS makes it easy to apply these strategies. Using a single submission form, users can run several motif discovery programs and score, cluster and visualize the results. In addition, the Bayesian motif discovery program THEME can be used to determine the class of transcription factors that is most likely to regulate a set of sequences. Input can be provided as a list of gene or probe identifiers. Used with the default settings, WebMOTIFS accurately identifies biologically relevant motifs from diverse data in several species. WebMOTIFS is freely available at http://fraenkel.mit.edu/webmotifs.

  12. MOTIFATOR : detection and characterization of regulatory motifs using prokaryote transcriptome data

    NARCIS (Netherlands)

    Blom, Evert-Jan; Roerdink, Jos B.T.M.; Kuipers, Oscar P.; Hijum, Sacha A.F.T. van

    2009-01-01

    Unraveling regulatory mechanisms (e.g. identification of motifs in cis-regulatory regions) remains a major challenge in the analysis of transcriptome experiments. Existing applications identify putative motifs from gene lists obtained at rather arbitrary cutoff and require additional manual processi

  13. Sublinear Time Motif Discovery from Multiple Sequences

    Directory of Open Access Journals (Sweden)

    Yunhui Fu

    2013-10-01

    Full Text Available In this paper, a natural probabilistic model for motif discovery has been used to experimentally test the quality of motif discovery programs. In this model, there are k background sequences, and each character in a background sequence is a random character from an alphabet, Σ. A motif G = g1g2 ... gm is a string of m characters. In each background sequence is implanted a probabilistically-generated approximate copy of G. For a probabilistically-generated approximate copy b1b2 ... bm of G, every character, bi, is probabilistically generated, such that the probability for bi ≠ gi is at most α. We develop two new randomized algorithms and one new deterministic algorithm. They make advancements in the following aspects: (1 The algorithms are much faster than those before. Our algorithms can even run in sublinear time. (2 They can handle any motif pattern. (3 The restriction for the alphabet size is a lower bound of four. This gives them potential applications in practical problems, since gene sequences have an alphabet size of four. (4 All algorithms have rigorous proofs about their performances. The methods developed in this paper have been used in the software implementation. We observed some encouraging results that show improved performance for motif detection compared with other software.

  14. Functional characterization of variations on regulatory motifs.

    Directory of Open Access Journals (Sweden)

    Michal Lapidot

    2008-03-01

    Full Text Available Transcription factors (TFs regulate gene expression through specific interactions with short promoter elements. The same regulatory protein may recognize a variety of related sequences. Moreover, once they are detected it is hard to predict whether highly similar sequence motifs will be recognized by the same TF and regulate similar gene expression patterns, or serve as binding sites for distinct regulatory factors. We developed computational measures to assess the functional implications of variations on regulatory motifs and to compare the functions of related sites. We have developed computational means for estimating the functional outcome of substituting a single position within a binding site and applied them to a collection of putative regulatory motifs. We predict the effects of nucleotide variations within motifs on gene expression patterns. In cases where such predictions could be compared to suitable published experimental evidence, we found very good agreement. We further accumulated statistics from multiple substitutions across various binding sites in an attempt to deduce general properties that characterize nucleotide substitutions that are more likely to alter expression. We found that substitutions involving Adenine are more likely to retain the expression pattern and that substitutions involving Guanine are more likely to alter expression compared to the rest of the substitutions. Our results should facilitate the prediction of the expression outcomes of binding site variations. One typical important implication is expected to be the ability to predict the phenotypic effect of variation in regulatory motifs in promoters.

  15. SMOTIF: efficient structured pattern and profile motif search

    OpenAIRE

    Zaki Mohammed J; Zhang Yongqiang

    2006-01-01

    Abstract Background A structured motif allows variable length gaps between several components, where each component is a simple motif, which allows either no gaps or only fixed length gaps. The motif can either be represented as a pattern or a profile (also called positional weight matrix). We propose an efficient algorithm, called SMOTIF, to solve the structured motif search problem, i.e., given one or more sequences and a structured motif, SMOTIF searches the sequences for all occurrences o...

  16. Are there molecular signatures?

    Energy Technology Data Exchange (ETDEWEB)

    Bennett, W.P.

    1995-10-01

    This report describes molecular signatures and mutational spectrum analysis. The mutation spectrum is defined as the type and location of DNA base change. There are currently about five well documented cases. Mutations and radon-associated tumors are discussed.

  17. THE ELECTRONIC SIGNATURE

    OpenAIRE

    Voiculescu Madalina Irena; Gramada Dragu Argentina

    2009-01-01

    Article refers to significance and the digital signature in electronic commerce. Internet and electronic commerce open up many new opportunities for the consumer, yet, the security (or perceived lack of security) of exchanging personal and financial data

  18. Advanced Missile Signature Center

    Data.gov (United States)

    Federal Laboratory Consortium — The Advanced Missile Signature Center (AMSC) is a national facility supporting the Missile Defense Agency (MDA) and other DoD programs and customers with analysis,...

  19. Meteor signature interpretation

    Energy Technology Data Exchange (ETDEWEB)

    Canavan, G.H.

    1997-01-01

    Meteor signatures contain information about the constituents of space debris and present potential false alarms to early warnings systems. Better models could both extract the maximum scientific information possible and reduce their danger. Accurate predictions can be produced by models of modest complexity, which can be inverted to predict the sizes, compositions, and trajectories of object from their signatures for most objects of interest and concern.

  20. Stateless Transitive Signature Schemes

    Institute of Scientific and Technical Information of China (English)

    MA Chun-guang; CAI Man-chun; YANG Yi-xian

    2004-01-01

    A new practical method is introduced to transform the stateful transitive signature scheme to stateless one without the loss of security. According to the approach, two concrete stateless transitive signature schemes based on Factoring and RSA are presented respectively. Under the assumption of the hardness of factoring and one-more- RSA-inversion problem, both two schemes are secure under the adaptive chosen-message attacks in random oracle model.

  1. Armadillo motifs involved in vesicular transport.

    Directory of Open Access Journals (Sweden)

    Harald Striegl

    Full Text Available Armadillo (ARM repeat proteins function in various cellular processes including vesicular transport and membrane tethering. They contain an imperfect repeating sequence motif that forms a conserved three-dimensional structure. Recently, structural and functional insight into tethering mediated by the ARM-repeat protein p115 has been provided. Here we describe the p115 ARM-motifs for reasons of clarity and nomenclature and show that both sequence and structure are highly conserved among ARM-repeat proteins. We argue that there is no need to invoke repeat types other than ARM repeats for a proper description of the structure of the p115 globular head region. Additionally, we propose to define a new subfamily of ARM-like proteins and show lack of evidence that the ARM motifs found in p115 are present in other long coiled-coil tethering factors of the golgin family.

  2. Sequential motif profile of natural visibility graphs

    CERN Document Server

    Iacovacci, Jacopo

    2016-01-01

    The concept of sequential visibility graph motifs -subgraphs appearing with characteristic frequencies in the visibility graphs associated to time series- has been advanced recently along with a theoretical framework to compute analytically the motif profiles associated to Horizontal Visibility Graphs (HVGs). Here we develop a theory to compute the profile of sequential visibility graph motifs in the context of Natural Visibility Graphs (VGs). This theory gives exact results for deterministic aperiodic processes with a smooth invariant density or stochastic processes that fulfil the Markov property and have a continuous marginal distribution. The framework also allows for a linear time numerical estimation in the case of empirical time series. A comparison between the HVG and the VG case (including evaluation of their robustness for short series polluted with measurement noise) is also presented.

  3. Motifs and structural blocks retrieval by GHT

    Science.gov (United States)

    Cantoni, Virginio; Ferone, Alessio; Petrosino, Alfredo; Polat, Ozlem

    2014-06-01

    The structure of a protein gives more insight on the protein function than its amino acid sequence. Protein structure analysis and comparison are important for understanding the evolutionary relationships among proteins, predicting protein functions, and predicting protein folding. Proteins are formed by two basic regular 3D structural patterns, called Secondary Structures (SSs): helices and sheets. A structural motif is a compact 3D protein block referring to a small specific combination of secondary structural elements, which appears in a variety of molecules. In this paper we compare a few approaches for motif retrieval based on the Generalized Hough Transform (GHT). A primary technique is to adopt the single SS as structural primitives; alternatives are to adopt a SSs pair as primitive structural element, or a SSs triplet, and so on up-to an entire motif. The richer the primitive, the higher the time for pre-analysis and search, and the simpler the inspection process on the parameter space for analyzing the peaks. Performance comparisons, in terms of precision and computation time, are here presented considering the retrieval of motifs composed by three to five SSs for more than 15 million searches. The approach can be easily applied to the retrieval of greater blocks, up to protein domains, or even entire proteins.

  4. Highly scalable Ab initio genomic motif identification

    KAUST Repository

    Marchand, Benoît

    2011-01-01

    We present results of scaling an ab initio motif family identification system, Dragon Motif Finder (DMF), to 65,536 processor cores of IBM Blue Gene/P. DMF seeks groups of mutually similar polynucleotide patterns within a set of genomic sequences and builds various motif families from them. Such information is of relevance to many problems in life sciences. Prior attempts to scale such ab initio motif-finding algorithms achieved limited success. We solve the scalability issues using a combination of mixed-mode MPI-OpenMP parallel programming, master-slave work assignment, multi-level workload distribution, multi-level MPI collectives, and serial optimizations. While the scalability of our algorithm was excellent (94% parallel efficiency on 65,536 cores relative to 256 cores on a modest-size problem), the final speedup with respect to the original serial code exceeded 250,000 when serial optimizations are included. This enabled us to carry out many large-scale ab initio motiffinding simulations in a few hours while the original serial code would have needed decades of execution time. Copyright 2011 ACM.

  5. The Motif of Meeting in Digital Education

    Science.gov (United States)

    Sheail, Philippa

    2015-01-01

    This article draws on theoretical work which considers the composition of meetings, in order to think about the form of the meeting in digital environments for higher education. To explore the motif of meeting, I undertake a "compositional interpretation" (Rose, 2012) of the default interface offered by "Collaborate", an…

  6. Actions for signature change

    CERN Document Server

    Embacher, F

    1995-01-01

    This is a contribution on the controversy about junction conditions for classical signature change. The central issue in this debate is whether the extrinsic curvature on slices near the hypersurface of signature change has to be continuous ({\\it weak} signature change) or to vanish ({\\it strong} signature change). Led by a Lagrangian point of view, we write down eight candidate action functionals S_1,...S_8 as possible generalizations of general relativity and investigate to what extent each of these defines a sensible variational problem, and which junction condition is implied. Four of the actions involve an integration over the total manifold. A particular subtlety arises from the precise definition of the Einstein-Hilbert Lagrangian density |g|^{1/2} R[g]. The other four actions are constructed as sums of integrals over singe-signature domains. The result is that {\\it both} types of junction conditions occur in different models, i.e. are based on different first principles, none of which can be claimed t...

  7. Parallel motif extraction from very long sequences

    KAUST Repository

    Sahli, Majed

    2013-01-01

    Motifs are frequent patterns used to identify biological functionality in genomic sequences, periodicity in time series, or user trends in web logs. In contrast to a lot of existing work that focuses on collections of many short sequences, modern applications require mining of motifs in one very long sequence (i.e., in the order of several gigabytes). For this case, there exist statistical approaches that are fast but inaccurate; or combinatorial methods that are sound and complete. Unfortunately, existing combinatorial methods are serial and very slow. Consequently, they are limited to very short sequences (i.e., a few megabytes), small alphabets (typically 4 symbols for DNA sequences), and restricted types of motifs. This paper presents ACME, a combinatorial method for extracting motifs from a single very long sequence. ACME arranges the search space in contiguous blocks that take advantage of the cache hierarchy in modern architectures, and achieves almost an order of magnitude performance gain in serial execution. It also decomposes the search space in a smart way that allows scalability to thousands of processors with more than 90% speedup. ACME is the only method that: (i) scales to gigabyte-long sequences; (ii) handles large alphabets; (iii) supports interesting types of motifs with minimal additional cost; and (iv) is optimized for a variety of architectures such as multi-core systems, clusters in the cloud, and supercomputers. ACME reduces the extraction time for an exact-length query from 4 hours to 7 minutes on a typical workstation; handles 3 orders of magnitude longer sequences; and scales up to 16, 384 cores on a supercomputer. Copyright is held by the owner/author(s).

  8. DNA motif elucidation using belief propagation

    KAUST Repository

    Wong, Ka-Chun

    2013-06-29

    Protein-binding microarray (PBM) is a high-throughout platform that can measure the DNA-binding preference of a protein in a comprehensive and unbiased manner. A typical PBM experiment can measure binding signal intensities of a protein to all the possible DNA k-mers (k = 8 ?10); such comprehensive binding affinity data usually need to be reduced and represented as motif models before they can be further analyzed and applied. Since proteins can often bind to DNA in multiple modes, one of the major challenges is to decompose the comprehensive affinity data into multimodal motif representations. Here, we describe a new algorithm that uses Hidden Markov Models (HMMs) and can derive precise and multimodal motifs using belief propagations. We describe an HMM-based approach using belief propagations (kmerHMM), which accepts and preprocesses PBM probe raw data into median-binding intensities of individual k-mers. The k-mers are ranked and aligned for training an HMM as the underlying motif representation. Multiple motifs are then extracted from the HMM using belief propagations. Comparisons of kmerHMM with other leading methods on several data sets demonstrated its effectiveness and uniqueness. Especially, it achieved the best performance on more than half of the data sets. In addition, the multiple binding modes derived by kmerHMM are biologically meaningful and will be useful in interpreting other genome-wide data such as those generated from ChIP-seq. The executables and source codes are available at the authors\\' websites: e.g. http://www.cs.toronto.edu/?wkc/kmerHMM. 2013 The Author(s).

  9. Uncertainty in hydrological signatures

    Science.gov (United States)

    McMillan, Hilary; Westerberg, Ida

    2015-04-01

    Information that summarises the hydrological behaviour or flow regime of a catchment is essential for comparing responses of different catchments to understand catchment organisation and similarity, and for many other modelling and water-management applications. Such information types derived as an index value from observed data are known as hydrological signatures, and can include descriptors of high flows (e.g. mean annual flood), low flows (e.g. mean annual low flow, recession shape), the flow variability, flow duration curve, and runoff ratio. Because the hydrological signatures are calculated from observed data such as rainfall and flow records, they are affected by uncertainty in those data. Subjective choices in the method used to calculate the signatures create a further source of uncertainty. Uncertainties in the signatures may affect our ability to compare different locations, to detect changes, or to compare future water resource management scenarios. The aim of this study was to contribute to the hydrological community's awareness and knowledge of data uncertainty in hydrological signatures, including typical sources, magnitude and methods for its assessment. We proposed a generally applicable method to calculate these uncertainties based on Monte Carlo sampling and demonstrated it for a variety of commonly used signatures. The study was made for two data rich catchments, the 50 km2 Mahurangi catchment in New Zealand and the 135 km2 Brue catchment in the UK. For rainfall data the uncertainty sources included point measurement uncertainty, the number of gauges used in calculation of the catchment spatial average, and uncertainties relating to lack of quality control. For flow data the uncertainty sources included uncertainties in stage/discharge measurement and in the approximation of the true stage-discharge relation by a rating curve. The resulting uncertainties were compared across the different signatures and catchments, to quantify uncertainty

  10. Practical quantum digital signature

    Science.gov (United States)

    Yin, Hua-Lei; Fu, Yao; Chen, Zeng-Bing

    2016-03-01

    Guaranteeing nonrepudiation, unforgeability as well as transferability of a signature is one of the most vital safeguards in today's e-commerce era. Based on fundamental laws of quantum physics, quantum digital signature (QDS) aims to provide information-theoretic security for this cryptographic task. However, up to date, the previously proposed QDS protocols are impractical due to various challenging problems and most importantly, the requirement of authenticated (secure) quantum channels between participants. Here, we present the first quantum digital signature protocol that removes the assumption of authenticated quantum channels while remaining secure against the collective attacks. Besides, our QDS protocol can be practically implemented over more than 100 km under current mature technology as used in quantum key distribution.

  11. Ab initio coordination chemistry for nickel chelation motifs.

    Science.gov (United States)

    Sudan, R Jesu Jaya; Kumari, J Lesitha Jeeva; Sudandiradoss, C

    2015-01-01

    Chelation therapy is one of the most appreciated methods in the treatment of metal induced disease predisposition. Coordination chemistry provides a way to understand metal association in biological structures. In this work we have implemented coordination chemistry to study nickel coordination due to its high impact in industrial usage and thereby health consequences. This paper reports the analysis of nickel coordination from a large dataset of nickel bound structures and sequences. Coordination patterns predicted from the structures are reported in terms of donors, chelate length, coordination number, chelate geometry, structural fold and architecture. The analysis revealed histidine as the most favored residue in nickel coordination. The most common chelates identified were histidine based namely HHH, HDH, HEH and HH spaced at specific intervals. Though a maximum coordination number of 8 was observed, the presence of a single protein donor was noted to be mandatory in nickel coordination. The coordination pattern did not reveal any specific fold, nevertheless we report preferable residue spacing for specific structural architecture. In contrast, the analysis of nickel binding proteins from bacterial and archeal species revealed no common coordination patterns. Nickel binding sequence motifs were noted to be organism specific and protein class specific. As a result we identified about 13 signatures derived from 13 classes of nickel binding proteins. The specifications on nickel coordination presented in this paper will prove beneficial for developing better chelation strategies.

  12. Ab initio coordination chemistry for nickel chelation motifs.

    Directory of Open Access Journals (Sweden)

    R Jesu Jaya Sudan

    Full Text Available Chelation therapy is one of the most appreciated methods in the treatment of metal induced disease predisposition. Coordination chemistry provides a way to understand metal association in biological structures. In this work we have implemented coordination chemistry to study nickel coordination due to its high impact in industrial usage and thereby health consequences. This paper reports the analysis of nickel coordination from a large dataset of nickel bound structures and sequences. Coordination patterns predicted from the structures are reported in terms of donors, chelate length, coordination number, chelate geometry, structural fold and architecture. The analysis revealed histidine as the most favored residue in nickel coordination. The most common chelates identified were histidine based namely HHH, HDH, HEH and HH spaced at specific intervals. Though a maximum coordination number of 8 was observed, the presence of a single protein donor was noted to be mandatory in nickel coordination. The coordination pattern did not reveal any specific fold, nevertheless we report preferable residue spacing for specific structural architecture. In contrast, the analysis of nickel binding proteins from bacterial and archeal species revealed no common coordination patterns. Nickel binding sequence motifs were noted to be organism specific and protein class specific. As a result we identified about 13 signatures derived from 13 classes of nickel binding proteins. The specifications on nickel coordination presented in this paper will prove beneficial for developing better chelation strategies.

  13. Using SCOPE to identify potential regulatory motifs in coregulated genes.

    Science.gov (United States)

    Martyanov, Viktor; Gross, Robert H

    2011-05-31

    SCOPE is an ensemble motif finder that uses three component algorithms in parallel to identify potential regulatory motifs by over-representation and motif position preference. Each component algorithm is optimized to find a different kind of motif. By taking the best of these three approaches, SCOPE performs better than any single algorithm, even in the presence of noisy data. In this article, we utilize a web version of SCOPE to examine genes that are involved in telomere maintenance. SCOPE has been incorporated into at least two other motif finding programs and has been used in other studies. The three algorithms that comprise SCOPE are BEAM, which finds non-degenerate motifs (ACCGGT), PRISM, which finds degenerate motifs (ASCGWT), and SPACER, which finds longer bipartite motifs (ACCnnnnnnnnGGT). These three algorithms have been optimized to find their corresponding type of motif. Together, they allow SCOPE to perform extremely well. Once a gene set has been analyzed and candidate motifs identified, SCOPE can look for other genes that contain the motif which, when added to the original set, will improve the motif score. This can occur through over-representation or motif position preference. Working with partial gene sets that have biologically verified transcription factor binding sites, SCOPE was able to identify most of the rest of the genes also regulated by the given transcription factor. Output from SCOPE shows candidate motifs, their significance, and other information both as a table and as a graphical motif map. FAQs and video tutorials are available at the SCOPE web site which also includes a "Sample Search" button that allows the user to perform a trial run. Scope has a very friendly user interface that enables novice users to access the algorithm's full power without having to become an expert in the bioinformatics of motif finding. As input, SCOPE can take a list of genes, or FASTA sequences. These can be entered in browser text fields, or read from

  14. The dark energy signature

    International Nuclear Information System (INIS)

    Though the concept of a dark energy driven accelerating universe was introduced by the author in 1997, to date dark energy itself, as described below has remained a paradigm. We quickly review these and find a second cosmological signature of the 1997 model, consistent with latest observations. (author)

  15. Signatures of the Invisible

    CERN Multimedia

    Strom, D

    2003-01-01

    On the Net it is possible to take a look at art from afar via Virtual Museums. One such exhibition was recently in the New York Museum of Modern Art's branch, PS1. Entitled 'Signatures of the Invisible' it was a collaborative effort between artists and physicists (1/2 page).

  16. UV missile plume signatures

    NARCIS (Netherlands)

    Neele, F.P.; Schleijpen, H.M.A.

    2002-01-01

    As a result of the deployment of UV missile warning systems, recent years have seen an increasing interest in threat assessment in the UV band. Unfortunately, due to the different nature of the physical processes that are needed to describe a missile signature in the UV, available codes for the IR c

  17. Anticipated synchronization in neuronal network motifs

    Science.gov (United States)

    Matias, F. S.; Gollo, L. L.; Carelli, P. V.; Copelli, M.; Mirasso, C. R.

    2013-01-01

    Two identical dynamical systems coupled unidirectionally (in a so called master-slave configuration) exhibit anticipated synchronization (AS) if the one which receives the coupling (the slave) also receives a negative delayed self-feedback. In oscillatory neuronal systems AS is characterized by a phase-locking with negative time delay τ between the spikes of the master and of the slave (slave fires before the master), while in the usual delayed synchronization (DS) regime τ is positive (slave fires after the master). A 3-neuron motif in which the slave self-feedback is replaced by a feedback loop mediated by an interneuron can exhibits both AS and DS regimes. Here we show that AS is robust in the presence of noise in a 3 Hodgkin-Huxley type neuronal motif. We also show that AS is stable for large values of τ in a chain of connected slaves-interneurons.

  18. Locomotif - a graphical programming system for RNA motif search

    OpenAIRE

    Reeder, Janina

    2006-01-01

    In this thesis, I am presenting the results of my work in designing, implementing and installing a software environment for RNA motif searches: Locomotif. It includes a visual editor for motif definition, translation of the motif structure to XML code and client-server interactions, and further, translation of the XML code to ADP and compilation to C.

  19. MENGUNGKAP SEJARAH DAN MOTIF BATIK SEMARANGAN

    Directory of Open Access Journals (Sweden)

    Dewi Yuliati

    2011-10-01

    Full Text Available Batik Semarang was born in line with the needs of the people of Hyderabad of the material with a new motif or style tailored to the taste, intention, and creativity of the craftsmen. Batik is a combination of several countries influence developing in Indonesian culture. Based on its shape, Batik designs can be divided into two major groups, namely geometric and non-Geometric. The development of Semarangan batik was due to the fact that certain motif of batik can only be worn by certain people, not for all group of people. Batik semarangan craftments are found in coastal regions. It displays the design composing of ornaments plucked from marine environment. Indonesian Batik develops not only to display a blending of court Batik designs with the coastal Batik technique, but also to incorporate other ornaments which come from many various ethnic groups in Indonesia.   Key words: batik, history, ornaments, marine environment, designs   Batik Semarang lahirkan sejalan dengan kebutuhan dari orang-orang dari Hyderabad akan bahan dengan motif atau gaya baru yang berdasarkan pada rasa, niat, dan kreatifitas dari pembuatnya. Batik merupakan perpaduan dari pengaruh beberapa negara yang berkembang dalam budaya Indonesia. Ditinjau dari desainnya, desain batik dapat dibagi menjadi dua kelompok utama, yakni geometrik dan nongeometrik. Pengembangan yang dilakukan terhadap batik semarangan disebabkan adanya beberapa motif batik yang hanya digunakan oleh kalangan tertentu, dan tidak boleh untuk kalangan umum. Pengrajin batik Semarangan berkembang di kawasan pesisir. Ia menampilkan desain yang terdiri atas berbagai ornamen yang menunjukkan ciri khas kemaritiman. Batik ini dikembangakan tidak hanya menampilkan desain batik khas pesisiran, tetapi juga memasukkan berbagai ornament dari beragam kelompok etnis di Indonesia.   Kata kunci: batik, sejarah, ragam hias, lingkungan pesisir, desain  

  20. Multilayer motif analysis of brain networks

    OpenAIRE

    Battiston, Federico; Nicosia, Vincenzo; Chavez, Mario; Latora, Vito

    2016-01-01

    In the last decade network science has shed new light on the anatomical connectivity and on correlations in the activity of different areas of the human brain. The study of brain networks has made possible in fact to detect the central areas of a neural system, and to identify its building blocks by looking at overabundant small subgraphs, known as motifs. However, network analysis of the brain has so far mainly focused on structural and functional networks as separate entities. The recently ...

  1. Multilayer motif analysis of brain networks

    CERN Document Server

    Battiston, Federico; Chavez, Mario; Latora, Vito

    2016-01-01

    In the last decade network science has shed new light on the anatomical connectivity and on correlations in the activity of different areas of the human brain. The study of brain networks has made possible in fact to detect the central areas of a neural system, and to identify its building blocks by looking at overabundant small subgraphs, known as motifs. However, network analysis of the brain has so far mainly focused on structural and functional networks as separate entities. The recently developed mathematical framework of multi-layer networks allows to perform a multiplex analysis of the human brain where the structural and functional layers are considered at the same time. In this work we describe how to classify subgraphs in multiplex networks, and we extend motif analysis to networks with many layers. We then extract multi-layer motifs in brain networks of healthy subjects by considering networks with two layers, respectively obtained from diffusion and functional magnetic resonance imaging. Results i...

  2. A PRACTICAL PROXY SIGNATURE SCHEME

    Directory of Open Access Journals (Sweden)

    Sattar Aboud

    2012-01-01

    Full Text Available A proxy signature scheme is a variation of the ordinary digital signature scheme which enables a proxy signer to generate signatures on behalf of an original signer. In this paper, we present two efficient types of proxy signature scheme. The first one is the proxy signature for warrant partial delegation combines an advantage of two well known warrant partial delegation schemes. This proposed proxy signature scheme is based on the difficulty of solving the discrete logarithm problem. The second proposed scheme is based on threshold delegation the proxy signer power to sign the message is share. We claim that the proposed proxy signature schemes meet the security requirements and more practical than the existing proxy signature schemes.

  3. Discovering sequence motifs with arbitrary insertions and deletions.

    Directory of Open Access Journals (Sweden)

    Martin C Frith

    2008-04-01

    Full Text Available BIOLOGY IS ENCODED IN MOLECULAR SEQUENCES: deciphering this encoding remains a grand scientific challenge. Functional regions of DNA, RNA, and protein sequences often exhibit characteristic but subtle motifs; thus, computational discovery of motifs in sequences is a fundamental and much-studied problem. However, most current algorithms do not allow for insertions or deletions (indels within motifs, and the few that do have other limitations. We present a method, GLAM2 (Gapped Local Alignment of Motifs, for discovering motifs allowing indels in a fully general manner, and a companion method GLAM2SCAN for searching sequence databases using such motifs. glam2 is a generalization of the gapless Gibbs sampling algorithm. It re-discovers variable-width protein motifs from the PROSITE database significantly more accurately than the alternative methods PRATT and SAM-T2K. Furthermore, it usefully refines protein motifs from the ELM database: in some cases, the refined motifs make orders of magnitude fewer overpredictions than the original ELM regular expressions. GLAM2 performs respectably on the BAliBASE multiple alignment benchmark, and may be superior to leading multiple alignment methods for "motif-like" alignments with N- and C-terminal extensions. Finally, we demonstrate the use of GLAM2 to discover protein kinase substrate motifs and a gapped DNA motif for the LIM-only transcriptional regulatory complex: using GLAM2SCAN, we identify promising targets for the latter. GLAM2 is especially promising for short protein motifs, and it should improve our ability to identify the protein cleavage sites, interaction sites, post-translational modification attachment sites, etc., that underlie much of biology. It may be equally useful for arbitrarily gapped motifs in DNA and RNA, although fewer examples of such motifs are known at present. GLAM2 is public domain software, available for download at http://bioinformatics.org.au/glam2.

  4. Large-scale discovery of promoter motifs in Drosophila melanogaster.

    Directory of Open Access Journals (Sweden)

    Thomas A Down

    2007-01-01

    Full Text Available A key step in understanding gene regulation is to identify the repertoire of transcription factor binding motifs (TFBMs that form the building blocks of promoters and other regulatory elements. Identifying these experimentally is very laborious, and the number of TFBMs discovered remains relatively small, especially when compared with the hundreds of transcription factor genes predicted in metazoan genomes. We have used a recently developed statistical motif discovery approach, NestedMICA, to detect candidate TFBMs from a large set of Drosophila melanogaster promoter regions. Of the 120 motifs inferred in our initial analysis, 25 were statistically significant matches to previously reported motifs, while 87 appeared to be novel. Analysis of sequence conservation and motif positioning suggested that the great majority of these discovered motifs are predictive of functional elements in the genome. Many motifs showed associations with specific patterns of gene expression in the D. melanogaster embryo, and we were able to obtain confident annotation of expression patterns for 25 of our motifs, including eight of the novel motifs. The motifs are available through Tiffin, a new database of DNA sequence motifs. We have discovered many new motifs that are overrepresented in D. melanogaster promoter regions, and offer several independent lines of evidence that these are novel TFBMs. Our motif dictionary provides a solid foundation for further investigation of regulatory elements in Drosophila, and demonstrates techniques that should be applicable in other species. We suggest that further improvements in computational motif discovery should narrow the gap between the set of known motifs and the total number of transcription factors in metazoan genomes.

  5. Two Improved Digital Signature Schemes

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In this paper, two improved digital signature schemes are presented based on the design of directed signaturescheme [3]. The peculiarity of the system is that only if the scheme is specific recipient, the signature is authenticated.Since the scheme adds the screen of some information parameters, the difficulty of deciphered keys and the security ofdigital signature system are increased.

  6. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.

    Science.gov (United States)

    Al-Okaily, Anas; Huang, Chun-Hsi

    2016-07-01

    Motif finding is an important and a challenging problem in many biological applications such as discovering promoters, enhancers, locus control regions, transcription factors, and more. The (l, d)-planted motif search, PMS, is one of several variations of the problem. In this problem, there are n given sequences over alphabets of size [Formula: see text], each of length m, and two given integers l and d. The problem is to find a motif m of length l, where in each sequence there is at least an l-mer at a Hamming distance of [Formula: see text] of m. In this article, we propose ET-Motif, an algorithm that can solve the PMS problem in [Formula: see text] time and [Formula: see text] space. The time bound can be further reduced by a factor of m with [Formula: see text] space. In case the suffix tree that is built for the input sequences is balanced, the problem can be solved in [Formula: see text] time and [Formula: see text] space. Similarly, the time bound can be reduced by a factor of m using [Formula: see text] space. Moreover, the variations of the problem, namely the edit distance PMS and edited PMS (Quorum), can be solved using ET-Motif with simple modifications but upper bands of space and time. For edit distance PMS, the time and space bounds will be increased by [Formula: see text], while for edited PMS the increase will be of [Formula: see text] in the time bound. PMID:27152692

  7. Dynamics of network motifs in genetic regulatory networks

    Institute of Scientific and Technical Information of China (English)

    Li Ying; Liu Zeng-Rong; Zhang Jian-Bao

    2007-01-01

    Network motifs hold a very important status in genetic regulatory networks. This paper aims to analyse the dynamical property of the network motifs in genetic regulatory networks. The main result we obtained is that the dynamical property of a single motif is very simple with only an asymptotically stable equilibrium point, but the combination of several motifs can make more complicated dynamical properties emerge such as limit cycles. The above-mentioned result shows that network motif is a stable substructure in genetic regulatory networks while their combinations make the genetic regulatory network more complicated.

  8. The EH1 motif in metazoan transcription factors

    Directory of Open Access Journals (Sweden)

    Copley Richard R

    2005-11-01

    Full Text Available Abstract Background The Engrailed Homology 1 (EH1 motif is a small region, believed to have evolved convergently in homeobox and forkhead containing proteins, that interacts with the Drosophila protein groucho (C. elegans unc-37, Human Transducin-like Enhancers of Split. The small size of the motif makes its reliable identification by computational means difficult. I have systematically searched the predicted proteomes of Drosophila, C. elegans and human for further instances of the motif. Results Using motif identification methods and database searching techniques, I delimit which homeobox and forkhead domain containing proteins also have likely EH1 motifs. I show that despite low database search scores, there is a significant association of the motif with transcription factor function. I further show that likely EH1 motifs are found in combination with T-Box, Zinc Finger and Doublesex domains as well as discussing other plausible candidate associations. I identify strong candidate EH1 motifs in basal metazoan phyla. Conclusion Candidate EH1 motifs exist in combination with a variety of transcription factor domains, suggesting that these proteins have repressor functions. The distribution of the EH1 motif is suggestive of convergent evolution, although in many cases, the motif has been conserved throughout bilaterian orthologs. Groucho mediated repression was established prior to the evolution of bilateria.

  9. CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design.

    Science.gov (United States)

    Zhang, Shaoqiang; Chen, Yong

    2016-01-01

    A set of conserved binding sites recognized by a transcription factor is called a motif, which can be found by many applications of comparative genomics for identifying over-represented segments. Moreover, when numerous putative motifs are predicted from a collection of genome-wide data, their similarity data can be represented as a large graph, where these motifs are connected to one another. However, an efficient clustering algorithm is desired for clustering the motifs that belong to the same groups and separating the motifs that belong to different groups, or even deleting an amount of spurious ones. In this work, a new motif clustering algorithm, CLIMP, is proposed by using maximal cliques and sped up by parallelizing its program. When a synthetic motif dataset from the database JASPAR, a set of putative motifs from a phylogenetic foot-printing dataset, and a set of putative motifs from a ChIP dataset are used to compare the performances of CLIMP and two other high-performance algorithms, the results demonstrate that CLIMP mostly outperforms the two algorithms on the three datasets for motif clustering, so that it can be a useful complement of the clustering procedures in some genome-wide motif prediction pipelines. CLIMP is available at http://sqzhang.cn/climp.html. PMID:27487245

  10. CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design.

    Science.gov (United States)

    Zhang, Shaoqiang; Chen, Yong

    2016-01-01

    A set of conserved binding sites recognized by a transcription factor is called a motif, which can be found by many applications of comparative genomics for identifying over-represented segments. Moreover, when numerous putative motifs are predicted from a collection of genome-wide data, their similarity data can be represented as a large graph, where these motifs are connected to one another. However, an efficient clustering algorithm is desired for clustering the motifs that belong to the same groups and separating the motifs that belong to different groups, or even deleting an amount of spurious ones. In this work, a new motif clustering algorithm, CLIMP, is proposed by using maximal cliques and sped up by parallelizing its program. When a synthetic motif dataset from the database JASPAR, a set of putative motifs from a phylogenetic foot-printing dataset, and a set of putative motifs from a ChIP dataset are used to compare the performances of CLIMP and two other high-performance algorithms, the results demonstrate that CLIMP mostly outperforms the two algorithms on the three datasets for motif clustering, so that it can be a useful complement of the clustering procedures in some genome-wide motif prediction pipelines. CLIMP is available at http://sqzhang.cn/climp.html.

  11. No tradeoff between versatility and robustness in gene circuit motifs

    Science.gov (United States)

    Payne, Joshua L.

    2016-05-01

    Circuit motifs are small directed subgraphs that appear in real-world networks significantly more often than in randomized networks. In the Boolean model of gene circuits, most motifs are realized by multiple circuit genotypes. Each of a motif's constituent circuit genotypes may have one or more functions, which are embodied in the expression patterns the circuit forms in response to specific initial conditions. Recent enumeration of a space of nearly 17 million three-gene circuit genotypes revealed that all circuit motifs have more than one function, with the number of functions per motif ranging from 12 to nearly 30,000. This indicates that some motifs are more functionally versatile than others. However, the individual circuit genotypes that constitute each motif are less robust to mutation if they have many functions, hinting that functionally versatile motifs may be less robust to mutation than motifs with few functions. Here, I explore the relationship between versatility and robustness in circuit motifs, demonstrating that functionally versatile motifs are robust to mutation despite the inherent tradeoff between versatility and robustness at the level of an individual circuit genotype.

  12. AISMOTIF-An Artificial Immune System for DNA Motif Discovery

    Directory of Open Access Journals (Sweden)

    Seeja K R

    2011-03-01

    Full Text Available Discovery of transcription factor binding sites is a much explored and still exploring area of research in functional genomics. Many computational tools have been developed for finding motifs and each of them has their own advantages as well as disadvantages. Most of these algorithms need prior knowledge about the data to construct background models. However there is not a single technique that can be considered as best for finding regulatory motifs. This paper proposes an artificial immune system based algorithm for finding the transcription factor binding sites or motifs and two new weighted scores for motif evaluation. The algorithm is enumerative, but sufficient pruning of the pattern search space has been incorporated using immune system concepts. The performance of AISMOTIF has been evaluated by comparing it with eight state of art composite motif discovery algorithms and found that AISMOTIF predicts known motifs as well as new motifs from the benchmark dataset without any prior knowledge about the data.

  13. AISMOTIF-An Artificial Immune System for DNA Motif Discovery

    CERN Document Server

    Seeja, K R

    2011-01-01

    Discovery of transcription factor binding sites is a much explored and still exploring area of research in functional genomics. Many computational tools have been developed for finding motifs and each of them has their own advantages as well as disadvantages. Most of these algorithms need prior knowledge about the data to construct background models. However there is not a single technique that can be considered as best for finding regulatory motifs. This paper proposes an artificial immune system based algorithm for finding the transcription factor binding sites or motifs and two new weighted scores for motif evaluation. The algorithm is enumerative, but sufficient pruning of the pattern search space has been incorporated using immune system concepts. The performance of AISMOTIF has been evaluated by comparing it with eight state of art composite motif discovery algorithms and found that AISMOTIF predicts known motifs as well as new motifs from the benchmark dataset without any prior knowledge about the data...

  14. Chaotic motif sampler: detecting motifs from biological sequences by using chaotic neurodynamics

    Science.gov (United States)

    Matsuura, Takafumi; Ikeguchi, Tohru

    Identification of a region in biological sequences, motif extraction problem (MEP) is solved in bioinformatics. However, the MEP is an NP-hard problem. Therefore, it is almost impossible to obtain an optimal solution within a reasonable time frame. To find near optimal solutions for NP-hard combinatorial optimization problems such as traveling salesman problems, quadratic assignment problems, and vehicle routing problems, chaotic search, which is one of the deterministic approaches, has been proposed and exhibits better performance than stochastic approaches. In this paper, we propose a new alignment method that employs chaotic dynamics to solve the MEPs. It is called the Chaotic Motif Sampler. We show that the performance of the Chaotic Motif Sampler is considerably better than that of the conventional methods such as the Gibbs Site Sampler and the Neighborhood Optimization for Multiple Alignment Discovery.

  15. Assessing the Exceptionality of Coloured Motifs in Networks

    Directory of Open Access Journals (Sweden)

    Lacroix Vincent

    2009-01-01

    Full Text Available Various methods have been recently employed to characterise the structure of biological networks. In particular, the concept of network motif and the related one of coloured motif have proven useful to model the notion of a functional/evolutionary building block. However, algorithms that enumerate all the motifs of a network may produce a very large output, and methods to decide which motifs should be selected for downstream analysis are needed. A widely used method is to assess if the motif is exceptional, that is, over- or under-represented with respect to a null hypothesis. Much effort has been put in the last thirty years to derive -values for the frequencies of topological motifs, that is, fixed subgraphs. They rely either on (compound Poisson and Gaussian approximations for the motif count distribution in Erdös-Rényi random graphs or on simulations in other models. We focus on a different definition of graph motifs that corresponds to coloured motifs. A coloured motif is a connected subgraph with fixed vertex colours but unspecified topology. Our work is the first analytical attempt to assess the exceptionality of coloured motifs in networks without any simulation. We first establish analytical formulae for the mean and the variance of the count of a coloured motif in an Erdös-Rényi random graph model. Using simulations under this model, we further show that a Pólya-Aeppli distribution better approximates the distribution of the motif count compared to Gaussian or Poisson distributions. The Pólya-Aeppli distribution, and more generally the compound Poisson distributions, are indeed well designed to model counts of clumping events. Altogether, these results enable to derive a -value for a coloured motif, without spending time on simulations.

  16. Acidic/IQ Motif Regulator of Calmodulin*

    OpenAIRE

    Putkey, John A.; Waxham, M. Neal; Gaertner, Tara R.; Brewer, Kari J.; Goldsmith, Michael; Kubota, Yoshihisa; Kleerekoper, Quinn K.

    2007-01-01

    The small IQ motif proteins PEP-19 (62 amino acids) and RC3 (78 amino acids) greatly accelerate the rates of Ca2+ binding to sites III and IV in the C-domain of calmodulin (CaM). We show here that PEP-19 decreases the degree of cooperativity of Ca2+ binding to sites III and IV, and we present a model showing that this could increase Ca2+ binding rate constants. Comparative sequence analysis showed that residues 28 to 58 from PEP-19 are conserved in other proteins. This region includes the IQ ...

  17. RMOD: a tool for regulatory motif detection in signaling network.

    Directory of Open Access Journals (Sweden)

    Jinki Kim

    Full Text Available Regulatory motifs are patterns of activation and inhibition that appear repeatedly in various signaling networks and that show specific regulatory properties. However, the network structures of regulatory motifs are highly diverse and complex, rendering their identification difficult. Here, we present a RMOD, a web-based system for the identification of regulatory motifs and their properties in signaling networks. RMOD finds various network structures of regulatory motifs by compressing the signaling network and detecting the compressed forms of regulatory motifs. To apply it into a large-scale signaling network, it adopts a new subgraph search algorithm using a novel data structure called path-tree, which is a tree structure composed of isomorphic graphs of query regulatory motifs. This algorithm was evaluated using various sizes of signaling networks generated from the integration of various human signaling pathways and it showed that the speed and scalability of this algorithm outperforms those of other algorithms. RMOD includes interactive analysis and auxiliary tools that make it possible to manipulate the whole processes from building signaling network and query regulatory motifs to analyzing regulatory motifs with graphical illustration and summarized descriptions. As a result, RMOD provides an integrated view of the regulatory motifs and mechanism underlying their regulatory motif activities within the signaling network. RMOD is freely accessible online at the following URL: http://pks.kaist.ac.kr/rmod.

  18. A combinatorial optimization approach for diverse motif finding applications

    Directory of Open Access Journals (Sweden)

    Singh Mona

    2006-08-01

    Full Text Available Abstract Background Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most frequently, motif finding applications arise when identifying shared regulatory signals within DNA sequences or shared functional and structural elements within protein sequences. Due to the diversity of contexts in which motif finding is applied, several variations of the problem are commonly studied. Results We introduce a versatile combinatorial optimization framework for motif finding that couples graph pruning techniques with a novel integer linear programming formulation. Our approach is flexible and robust enough to model several variants of the motif finding problem, including those incorporating substitution matrices and phylogenetic distances. Additionally, we give an approach for determining statistical significance of uncovered motifs. In testing on numerous DNA and protein datasets, we demonstrate that our approach typically identifies statistically significant motifs corresponding to either known motifs or other motifs of high conservation. Moreover, in most cases, our approach finds provably optimal solutions to the underlying optimization problem. Conclusion Our results demonstrate that a combined graph theoretic and mathematical programming approach can be the basis for effective and powerful techniques for diverse motif finding applications.

  19. Protein functional-group 3D motif and its applications

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Representing and recognizing protein active sites sequence motif (1D motif) and structural motif (3D motif) is an important topic for predicting and designing protein function. Prevalent methods for extracting and searching 3D motif always consider residue as the minimal unit, which have limited sensitivity. Here we present a new spatial representation of protein active sites, called "functional-group 3D motif ", based on the fact that the functional groups inside a residue contribute mostly to its function. Relevant algorithm and computer program are developed, which could be widely used in the function prediction and the study of structural-function relationship of proteins. As a test, we defined a functional-group 3D motif of the catalytic triad and oxyanion hole with the structure of porcine trypsin (PDB code: 1mct) as the template. With our motif-searching program, we successfully found similar sub-structures in trypsins, subtilisins and a/b hydrolases, which show distinct folds but share similar catalytic mechanism. Moreover, this motif can be used to elucidate the structural basis of other proteins with variant catalytic triads by comparing it to those proteins. Finally, we scanned this motif against a non-redundant protein structure database to find its matches, and the results demonstrated the potential application of functional group 3D motif in function prediction. Above all, compared with the other 3D-motif representations on residues, the functional group 3D motif achieves better representation of protein active region, which is more sensitive for protein function prediction.

  20. On Constructing Certificateless Proxy Signature from Certificateless Signature

    Institute of Scientific and Technical Information of China (English)

    WAN Zhong-mei; LAI Xue-jia; WENG Jian; HONG Xuan; LONG Yu; JIA Wei-wei

    2008-01-01

    In proxy signature schemes,an original signer A delegates its signing capability to a proxy signer B,in such a way that B can sign message on behalf of A.The recipient of the final message verifies at the same time that B computes the signature and that A has delegated its signing capability to B.Recently many identity-based (ID-based) proxy signature schemes have been proposed,however,the problem of key escrow is inherent in this setting.Certificateless cryptography can overcome the key escrow problem.In this paper,we present a general security model for certificateless proxy signature scheme.Then,we give a method to construct a secure certificateless proxy scheme from a secure certificateless signature scheme,and prove that the security of the construction can be reduced to the security of the original certificateless signature scheme.

  1. The network motif architecture of dominance hierarchies.

    Science.gov (United States)

    Shizuka, Daizaburo; McDonald, David B

    2015-04-01

    The widespread existence of dominance hierarchies has been a central puzzle in social evolution, yet we lack a framework for synthesizing the vast empirical data on hierarchy structure in animal groups. We applied network motif analysis to compare the structures of dominance networks from data published over the past 80 years. Overall patterns of dominance relations, including some aspects of non-interactions, were strikingly similar across disparate group types. For example, nearly all groups exhibited high frequencies of transitive triads, whereas cycles were very rare. Moreover, pass-along triads were rare, and double-dominant triads were common in most groups. These patterns did not vary in any systematic way across taxa, study settings (captive or wild) or group size. Two factors significantly affected network motif structure: the proportion of dyads that were observed to interact and the interaction rates of the top-ranked individuals. Thus, study design (i.e. how many interactions were observed) and the behaviour of key individuals in the group could explain much of the variations we see in social hierarchies across animals. Our findings confirm the ubiquity of dominance hierarchies across all animal systems, and demonstrate that network analysis provides new avenues for comparative analyses of social hierarchies. PMID:25762649

  2. The network motif architecture of dominance hierarchies.

    Science.gov (United States)

    Shizuka, Daizaburo; McDonald, David B

    2015-04-01

    The widespread existence of dominance hierarchies has been a central puzzle in social evolution, yet we lack a framework for synthesizing the vast empirical data on hierarchy structure in animal groups. We applied network motif analysis to compare the structures of dominance networks from data published over the past 80 years. Overall patterns of dominance relations, including some aspects of non-interactions, were strikingly similar across disparate group types. For example, nearly all groups exhibited high frequencies of transitive triads, whereas cycles were very rare. Moreover, pass-along triads were rare, and double-dominant triads were common in most groups. These patterns did not vary in any systematic way across taxa, study settings (captive or wild) or group size. Two factors significantly affected network motif structure: the proportion of dyads that were observed to interact and the interaction rates of the top-ranked individuals. Thus, study design (i.e. how many interactions were observed) and the behaviour of key individuals in the group could explain much of the variations we see in social hierarchies across animals. Our findings confirm the ubiquity of dominance hierarchies across all animal systems, and demonstrate that network analysis provides new avenues for comparative analyses of social hierarchies.

  3. Signatures of nonthermal melting

    Directory of Open Access Journals (Sweden)

    Tobias Zier

    2015-09-01

    Full Text Available Intense ultrashort laser pulses can melt crystals in less than a picosecond but, in spite of over thirty years of active research, for many materials it is not known to what extent thermal and nonthermal microscopic processes cause this ultrafast phenomenon. Here, we perform ab-initio molecular-dynamics simulations of silicon on a laser-excited potential-energy surface, exclusively revealing nonthermal signatures of laser-induced melting. From our simulated atomic trajectories, we compute the decay of five structure factors and the time-dependent structure function. We demonstrate how these quantities provide criteria to distinguish predominantly nonthermal from thermal melting.

  4. The signature package on Witt spaces, II. Higher signatures

    CERN Document Server

    Albin, Pierre; Mazzeo, Rafe; Piazza, Paolo

    2009-01-01

    This is a sequel to the paper "The signature package on Witt spaces, I. Index classes" by the same authors. In the first part we investigated, via a parametrix construction, the regularity properties of the signature operator on a stratified Witt pseudomanifold, proving, in particular, that one can define a K-homology signature class. We also established the existence of an analytic index class for the signature operator twisted by a C^*_r\\Gamma Mischenko bundle and proved that the K-homology signature class is mapped to the signature index class by the assembly map. In this paper we continue our study, showing that the signature index class is invariant under rational Witt bordisms and stratified homotopies. We are also able to identify this analytic class with the topological analogue of the Mischenko symmetric signature recently defined by Banagl. Finally, we define Witt-Novikov higher signatures and show that our analytic results imply a purely topological theorem, namely that the Witt-Novikov higher sign...

  5. A Gibbs sampler for motif detection in phylogenetically close sequences

    Science.gov (United States)

    Siddharthan, Rahul; van Nimwegen, Erik; Siggia, Eric

    2004-03-01

    Genes are regulated by transcription factors that bind to DNA upstream of genes and recognize short conserved ``motifs'' in a random intergenic ``background''. Motif-finders such as the Gibbs sampler compare the probability of these short sequences being represented by ``weight matrices'' to the probability of their arising from the background ``null model'', and explore this space (analogous to a free-energy landscape). But closely related species may show conservation not because of functional sites but simply because they have not had sufficient time to diverge, so conventional methods will fail. We introduce a new Gibbs sampler algorithm that accounts for common ancestry when searching for motifs, while requiring minimal ``prior'' assumptions on the number and types of motifs, assessing the significance of detected motifs by ``tracking'' clusters that stay together. We apply this scheme to motif detection in sporulation-cycle genes in the yeast S. cerevisiae, using recent sequences of other closely-related Saccharomyces species.

  6. MADMX: A Novel Strategy for Maximal Dense Motif Extraction

    CERN Document Server

    Grossi, Roberto; Pisanti, Nadia; Pucci, Geppino; Upfal, Eli; Vandin, Fabio

    2010-01-01

    We develop, analyze and experiment with a new tool, called MADMX, which extracts frequent motifs, possibly including don't care characters, from biological sequences. We introduce density, a simple and flexible measure for bounding the number of don't cares in a motif, defined as the ratio of solid (i.e., different from don't care) characters to the total length of the motif. By extracting only maximal dense motifs, MADMX reduces the output size and improves performance, while enhancing the quality of the discoveries. The efficiency of our approach relies on a newly defined combining operation, dubbed fusion, which allows for the construction of maximal dense motifs in a bottom-up fashion, while avoiding the generation of nonmaximal ones. We provide experimental evidence of the efficiency and the quality of the motifs returned by MADMX

  7. Triadic motifs in the dependence networks of virtual societies

    CERN Document Server

    Xie, Wen-Jie; Jiang, Zhi-Qiang; Zhou, Wei-Xing

    2014-01-01

    In friendship networks, individuals have different numbers of friends, and the closeness or intimacy between an individual and her friends is heterogeneous. Using a statistical filtering method to identify relationships about who depends on whom, we construct dependence networks (which are directed) from weighted friendship networks of avatars in more than two hundred virtual societies of a massively multiplayer online role-playing game (MMORPG). We investigate the evolution of triadic motifs in dependence networks. Several metrics show that the virtual societies evolved through a transient stage in the first two to three weeks and reached a relatively stable stage. We find that the unidirectional loop motif (${\\rm{M}}_9$) is underrepresented and does not appear, open motifs are also underrepresented, while other close motifs are overrepresented. We also find that, for most motifs, the overall level difference of the three avatars in the same motif is significantly lower than average, whereas the sum of ranks...

  8. An Affinity Propagation-Based DNA Motif Discovery Algorithm.

    Science.gov (United States)

    Sun, Chunxiao; Huo, Hongwei; Yu, Qiang; Guo, Haitao; Sun, Zhigang

    2015-01-01

    The planted (l, d) motif search (PMS) is one of the fundamental problems in bioinformatics, which plays an important role in locating transcription factor binding sites (TFBSs) in DNA sequences. Nowadays, identifying weak motifs and reducing the effect of local optimum are still important but challenging tasks for motif discovery. To solve the tasks, we propose a new algorithm, APMotif, which first applies the Affinity Propagation (AP) clustering in DNA sequences to produce informative and good candidate motifs and then employs Expectation Maximization (EM) refinement to obtain the optimal motifs from the candidate motifs. Experimental results both on simulated data sets and real biological data sets show that APMotif usually outperforms four other widely used algorithms in terms of high prediction accuracy.

  9. An Affinity Propagation-Based DNA Motif Discovery Algorithm

    Directory of Open Access Journals (Sweden)

    Chunxiao Sun

    2015-01-01

    Full Text Available The planted (l,d motif search (PMS is one of the fundamental problems in bioinformatics, which plays an important role in locating transcription factor binding sites (TFBSs in DNA sequences. Nowadays, identifying weak motifs and reducing the effect of local optimum are still important but challenging tasks for motif discovery. To solve the tasks, we propose a new algorithm, APMotif, which first applies the Affinity Propagation (AP clustering in DNA sequences to produce informative and good candidate motifs and then employs Expectation Maximization (EM refinement to obtain the optimal motifs from the candidate motifs. Experimental results both on simulated data sets and real biological data sets show that APMotif usually outperforms four other widely used algorithms in terms of high prediction accuracy.

  10. Probabilistic models for semisupervised discriminative motif discovery in DNA sequences.

    Science.gov (United States)

    Kim, Jong Kyoung; Choi, Seungjin

    2011-01-01

    Methods for discriminative motif discovery in DNA sequences identify transcription factor binding sites (TFBSs), searching only for patterns that differentiate two sets (positive and negative sets) of sequences. On one hand, discriminative methods increase the sensitivity and specificity of motif discovery, compared to generative models. On the other hand, generative models can easily exploit unlabeled sequences to better detect functional motifs when labeled training samples are limited. In this paper, we develop a hybrid generative/discriminative model which enables us to make use of unlabeled sequences in the framework of discriminative motif discovery, leading to semisupervised discriminative motif discovery. Numerical experiments on yeast ChIP-chip data for discovering DNA motifs demonstrate that the best performance is obtained between the purely-generative and the purely-discriminative and the semisupervised learning improves the performance when labeled sequences are limited.

  11. AptaTRACE Elucidates RNA Sequence-Structure Motifs from Selection Trends in HT-SELEX Experiments.

    Science.gov (United States)

    Dao, Phuong; Hoinka, Jan; Takahashi, Mayumi; Zhou, Jiehua; Ho, Michelle; Wang, Yijie; Costa, Fabrizio; Rossi, John J; Backofen, Rolf; Burnett, John; Przytycka, Teresa M

    2016-07-01

    Aptamers, short RNA or DNA molecules that bind distinct targets with high affinity and specificity, can be identified using high-throughput systematic evolution of ligands by exponential enrichment (HT-SELEX), but scalable analytic tools for understanding sequence-function relationships from diverse HT-SELEX data are not available. Here we present AptaTRACE, a computational approach that leverages the experimental design of the HT-SELEX protocol, RNA secondary structure, and the potential presence of many secondary motifs to identify sequence-structure motifs that show a signature of selection. We apply AptaTRACE to identify nine motifs in C-C chemokine receptor type 7 targeted by aptamers in an in vitro cell-SELEX experiment. We experimentally validate two aptamers whose binding required both sequence and structural features. AptaTRACE can identify low-abundance motifs, and we show through simulations that, because of this, it could lower HT-SELEX cost and time by reducing the number of selection cycles required. PMID:27467247

  12. RNA motif search with data-driven element ordering

    OpenAIRE

    Rampasek, L; Jimenez, RM; Luptak, A; Vinar, T; Brejova, B

    2016-01-01

    Background In this paper, we study the problem of RNA motif search in long genomic sequences. This approach uses a combination of sequence and structure constraints to uncover new distant homologs of known functional RNAs. The problem is NP-hard and is traditionally solved by backtracking algorithms. Results We have designed a new algorithm for RNA motif search and implemented a new motif search tool RNArobo. The tool enhances the RNAbob descriptor language, allowing insertions in helices, wh...

  13. Detecting DNA regulatory motifs by incorporating positional trendsin information content

    Energy Technology Data Exchange (ETDEWEB)

    Kechris, Katherina J.; van Zwet, Erik; Bickel, Peter J.; Eisen,Michael B.

    2004-05-04

    On the basis of the observation that conserved positions in transcription factor binding sites are often clustered together, we propose a simple extension to the model-based motif discovery methods. We assign position-specific prior distributions to the frequency parameters of the model, penalizing deviations from a specified conservation profile. Examples with both simulated and real data show that this extension helps discover motifs as the data become noisier or when there is a competing false motif.

  14. Sequence motif discovery with computational genome-wide analysis

    OpenAIRE

    Akashi, Hirofumi; Aoki, Fumio; Toyota, Minoru; Maruyama, Reo; Sasaki, Yasushi; Mita, Hiroaki; Tokura, Hajime; Imai, Kohzoh; Tatsumi, Haruyuki

    2006-01-01

    As a result of the human genome project and advancements in DNA sequencing technology, we can utilize a huge amount of nucleotide sequence data and can search DNA sequence motifs in whole human genome. However, searching motifs with the naked eye is an enormous task and searching throughout the whole genome is absolutely impossible. Therefore, we have developed a computational genome-wide analyzing system for detecting DNA sequence motifs with biological significance. We used a multi-parallel...

  15. Signatures of AGN feedback

    Science.gov (United States)

    Wylezalek, D.; Zakamska, N.

    2016-06-01

    Feedback from active galactic nuclei (AGN) is widely considered to be the main driver in regulating the growth of massive galaxies. It operates by either heating or driving the gas that would otherwise be available for star formation out of the galaxy, preventing further increase in stellar mass. Observational proof for this scenario has, however, been hard to come by. We have assembled a large sample of 133 radio-quiet type-2 and red AGN at 0.1importantly, we find a negative correlation between W_{90} and sSFR in the AGN hosts with the highest star formation rates, i.e., with the highest gas content. This relationship implies that AGN with strong outflow signatures are hosted in galaxies that are more `quenched' considering their stellar mass than galaxies with weaker outflow signatures. This correlation is only seen in AGN host galaxies with SFR >100 M_{⊙} yr^{-1} where presumably the coupling of the AGN-driven wind to the gas is strongest. This observation is consistent with the AGN having a net suppression, or `negative' impact, through feedback on the galaxies' star formation history.

  16. Indicators and signatures

    International Nuclear Information System (INIS)

    Full text: The goal of this presentation is to give an idea of the methodology used to deal with proliferation problems. It can be useful for chemical, biological, balistical proliferation. Here, we underline nuclear proliferation scenarios. Nevertheless, the overall approach is also similar to activities related to terrorism. Everyone knows that to strengthen the NPT/IAEA safeguards and similar treaties verification protocols, the organisations in charge need to build strong capabilities to assess known situations and also to prepare themselves to unknown, or undeclared events and activities. To accomplish this, to collect, analyze, build ad hoc knowledge, organisations have to select the information, to manage the enormous amount of available data. Rather recently, the emergence of new crisis has confirmed the central and vital role that information processing plays at each levels of the international or national non-proliferation community. It is why looking for indicators and signatures is so important, to focus on pertinent information, that could mean something from a nuclear proliferation perspective. This allows people dealing with nuclear proliferation not to be overwhelmed by tons of paper or G bites of memory. A strong need for expertise. Identifying, select and following indicators or looking for signatures is not an easy task. It requires strong expertise. From the development and maintenance of its nuclear deterrence, France acquired expertise in the design, production of fissile material, manufacture and testing of nuclear weapons. There is also in France a long history of nuclear achievements, with small or large scale facilities, both in civilian and military fields; each step of the nuclear fuel cycle can be very precisely described. French nuclear technical assessment relies on Commissariat a l'Energie Atomique (CEA, i.e. Atomic Energy Commission). Since 1958, CEA laboratories are in charge of nuclear civilian and military applications. Other

  17. A Comparative Study of Bases for Motif Inference

    OpenAIRE

    Pisanti, Nadia; Crochemore, Maxime; Grossi, Roberto; Sagot, Marie-France

    2005-01-01

    International audience Motif inference is at the heart of several time-demanding computational tasks, such as in molecular biology, data mining and identification of structured motifs in sequences, and in data compression, to name a few. In this scenario, a motif is a pattern that appears repeated at least a certain number of times (the quorum), to be of interest. The pattern can be approximated in that some of its characters can be left unspecified (the don't cares). Motif inference is not ...

  18. STEME: a robust, accurate motif finder for large data sets.

    Science.gov (United States)

    Reid, John E; Wernisch, Lorenz

    2014-01-01

    Motif finding is a difficult problem that has been studied for over 20 years. Some older popular motif finders are not suitable for analysis of the large data sets generated by next-generation sequencing. We recently published an efficient approximation (STEME) to the EM algorithm that is at the core of many motif finders such as MEME. This approximation allows the EM algorithm to be applied to large data sets. In this work we describe several efficient extensions to STEME that are based on the MEME algorithm. Together with the original STEME EM approximation, these extensions make STEME a fully-fledged motif finder with similar properties to MEME. We discuss the difficulty of objectively comparing motif finders. We show that STEME performs comparably to existing prominent discriminative motif finders, DREME and Trawler, on 13 sets of transcription factor binding data in mouse ES cells. We demonstrate the ability of STEME to find long degenerate motifs which these discriminative motif finders do not find. As part of our method, we extend an earlier method due to Nagarajan et al. for the efficient calculation of motif E-values. STEME's source code is available under an open source license and STEME is available via a web interface. PMID:24625410

  19. STEME: a robust, accurate motif finder for large data sets.

    Directory of Open Access Journals (Sweden)

    John E Reid

    Full Text Available Motif finding is a difficult problem that has been studied for over 20 years. Some older popular motif finders are not suitable for analysis of the large data sets generated by next-generation sequencing. We recently published an efficient approximation (STEME to the EM algorithm that is at the core of many motif finders such as MEME. This approximation allows the EM algorithm to be applied to large data sets. In this work we describe several efficient extensions to STEME that are based on the MEME algorithm. Together with the original STEME EM approximation, these extensions make STEME a fully-fledged motif finder with similar properties to MEME. We discuss the difficulty of objectively comparing motif finders. We show that STEME performs comparably to existing prominent discriminative motif finders, DREME and Trawler, on 13 sets of transcription factor binding data in mouse ES cells. We demonstrate the ability of STEME to find long degenerate motifs which these discriminative motif finders do not find. As part of our method, we extend an earlier method due to Nagarajan et al. for the efficient calculation of motif E-values. STEME's source code is available under an open source license and STEME is available via a web interface.

  20. Expressiveness considerations of XML signatures

    DEFF Research Database (Denmark)

    Jensen, Meiko; Meyer, Christopher

    2011-01-01

    more and more challenging. In this paper, we investigate this issue, describing how an attacker can still interfere with Web Services communication even in the presence of XML Signatures. Additionally, we discuss the interrelation of XML Signatures and XML Encryption, focussing on their security......XML Signatures are used to protect XML-based Web Service communication against a broad range of attacks related to man-in-the-middle scenarios. However, due to the complexity of the Web Services specification landscape, the task of applying XML Signatures in a robust and reliable manner becomes...... properties and expressiveness in different application scenarios. © 2011 IEEE....

  1. Application of a case–control study design to investigate genotypic signatures of HIV-1 transmission

    OpenAIRE

    Mota Talia M; Murray John M; Center Rob J; Purcell Damian F J; McCaw James M

    2012-01-01

    Abstract Background The characterization of HIV-1 transmission strains may inform the design of an effective vaccine. Shorter variable loops with fewer predicted glycosites have been suggested as signatures enriched in envelope sequences derived during acute HIV-1 infection. Specifically, a transmission-linked lack of glycosites within the V1 and V2 loops of gp120 provides greater access to an α4β7 binding motif, which promotes the establishment of infection. Also, a histidine at position 12 ...

  2. Modeling Network Evolution Using Graph Motifs

    CERN Document Server

    Conway, Drew

    2011-01-01

    Network structures are extremely important to the study of political science. Much of the data in its subfields are naturally represented as networks. This includes trade, diplomatic and conflict relationships. The social structure of several organization is also of interest to many researchers, such as the affiliations of legislators or the relationships among terrorist. A key aspect of studying social networks is understanding the evolutionary dynamics and the mechanism by which these structures grow and change over time. While current methods are well suited to describe static features of networks, they are less capable of specifying models of change and simulating network evolution. In the following paper I present a new method for modeling network growth and evolution. This method relies on graph motifs to generate simulated network data with particular structural characteristic. This technique departs notably from current methods both in form and function. Rather than a closed-form model, or stochastic ...

  3. Motif-role-fingerprints: the building-blocks of motifs, clustering-coefficients and transitivities in directed networks.

    Directory of Open Access Journals (Sweden)

    Mark D McDonnell

    Full Text Available Complex networks are frequently characterized by metrics for which particular subgraphs are counted. One statistic from this category, which we refer to as motif-role fingerprints, differs from global subgraph counts in that the number of subgraphs in which each node participates is counted. As with global subgraph counts, it can be important to distinguish between motif-role fingerprints that are 'structural' (induced subgraphs and 'functional' (partial subgraphs. Here we show mathematically that a vector of all functional motif-role fingerprints can readily be obtained from an arbitrary directed adjacency matrix, and then converted to structural motif-role fingerprints by multiplying that vector by a specific invertible conversion matrix. This result demonstrates that a unique structural motif-role fingerprint exists for any given functional motif-role fingerprint. We demonstrate a similar result for the cases of functional and structural motif-fingerprints without node roles, and global subgraph counts that form the basis of standard motif analysis. We also explicitly highlight that motif-role fingerprints are elemental to several popular metrics for quantifying the subgraph structure of directed complex networks, including motif distributions, directed clustering coefficient, and transitivity. The relationships between each of these metrics and motif-role fingerprints also suggest new subtypes of directed clustering coefficients and transitivities. Our results have potential utility in analyzing directed synaptic networks constructed from neuronal connectome data, such as in terms of centrality. Other potential applications include anomaly detection in networks, identification of similar networks and identification of similar nodes within networks. Matlab code for calculating all stated metrics following calculation of functional motif-role fingerprints is provided as S1 Matlab File.

  4. A structure filter for the Eukaryotic Linear Motif Resource

    Directory of Open Access Journals (Sweden)

    Gemünd Christine

    2009-10-01

    Full Text Available Abstract Background Many proteins are highly modular, being assembled from globular domains and segments of natively disordered polypeptides. Linear motifs, short sequence modules functioning independently of protein tertiary structure, are most abundant in natively disordered polypeptides but are also found in accessible parts of globular domains, such as exposed loops. The prediction of novel occurrences of known linear motifs attempts the difficult task of distinguishing functional matches from stochastically occurring non-functional matches. Although functionality can only be confirmed experimentally, confidence in a putative motif is increased if a motif exhibits attributes associated with functional instances such as occurrence in the correct taxonomic range, cellular compartment, conservation in homologues and accessibility to interacting partners. Several tools now use these attributes to classify putative motifs based on confidence of functionality. Results Current methods assessing motif accessibility do not consider much of the information available, either predicting accessibility from primary sequence or regarding any motif occurring in a globular region as low confidence. We present a method considering accessibility and secondary structural context derived from experimentally solved protein structures to rectify this situation. Putatively functional motif occurrences are mapped onto a representative domain, given that a high quality reference SCOP domain structure is available for the protein itself or a close relative. Candidate motifs can then be scored for solvent-accessibility and secondary structure context. The scores are calibrated on a benchmark set of experimentally verified motif instances compared with a set of random matches. A combined score yields 3-fold enrichment for functional motifs assigned to high confidence classifications and 2.5-fold enrichment for random motifs assigned to low confidence classifications

  5. The MHC motif viewer: a visualization tool for MHC binding motifs

    DEFF Research Database (Denmark)

    Rapin, Nicolas; Hoof, Ilka; Lund, Ole;

    2010-01-01

    In vertebrates, the onset of cellular immune reactions is controlled by presentation of peptides in complex with major histocompatibility complex (MHC) molecules to T cell receptors. In humans, MHCs are called human leukocyte antigens (HLAs). Different MHC molecules present different subsets of...... peptides, and knowledge of their binding specificities is important for understanding differences in the immune response between individuals. Algorithms predicting which peptides bind a given MHC molecule have recently been developed with high prediction accuracy. The utility of these algorithms is...... binding motif for each MHC molecule is predicted using state-of-the-art, pan-specific peptide-MHC binding-prediction methods, and is visualized as a sequence logo, in a format that allows for a comprehensive interpretation of binding motif anchor positions and amino acid preferences....

  6. PROXY BLIND SIGNATURE BASED ON ECDLP

    Directory of Open Access Journals (Sweden)

    SATARUPA PRADHAN,

    2011-03-01

    Full Text Available Proxy blind signature combines the properties of both proxy signature and blind signature. In a proxy signature scheme, a signer delegates his signing power to a proxy, who signs a message on behalf of the original signer. In a blind signature scheme, the signer cannot link the relationship between the blind message and the signature of the chosen message. Therefore, it is very suitable for electronic commerceapplication. In this paper, a proxy blind signature scheme based on ECDLP (Elliptic Curve Discrete Logarithm Problem has been proposed, which satisfy the security properties of both the blind signature and the proxy signature. Analysis shows that our scheme is secure and efficient.

  7. A Secure Threshold Group Signature Scheme

    Institute of Scientific and Technical Information of China (English)

    Wang Xiaoming; Fu Fangwei

    2003-01-01

    The threshold group signature is an important kind of signature. So far, many threshold group signature schemes have been proposed, but most of them suffer from conspiracy attack and are insecure. In this paper, a secure threshold group signature scheme is proposed. It can not only satisfy the properties of the threshold group signature, but also withstand the conspiracy attack

  8. Signatures de l'invisible

    CERN Multimedia

    CERN Press Office. Geneva

    2000-01-01

    "Signatures of the Invisible" is an unique collaboration between contemporary artists and contemporary physicists which has the potential to help redefine the relationship between science and art. "Signatures of the Invisible" is jointly organised by the London Institute - the world's largest college of art and design and CERN*, the world's leading particle physics laboratory. 12 leading visual artists:

  9. Immunity related genes in dipterans share common enrichment of AT-rich motifs in their 5' regulatory regions that are potentially involved in nucleosome formation

    Directory of Open Access Journals (Sweden)

    Rodriguez Mario H

    2008-07-01

    Full Text Available Abstract Background Understanding the transcriptional regulation mechanisms in response to environmental challenges is of fundamental importance in biology. Transcription factors associated to response elements and the chromatin structure had proven to play important roles in gene expression regulation. We have analyzed promoter regions of dipteran genes induced in response to immune challenge, in search for particular sequence patterns involved in their transcriptional regulation. Results 5' upstream regions of D. melanogaster and A. gambiae immunity-induced genes and their corresponding orthologous genes in 11 non-melanogaster drosophilid species and Ae. aegypti share enrichment in AT-rich short motifs. AT-rich motifs are associated with nucleosome formation as predicted by two different algorithms. In A. gambiae and D. melanogaster, many immunity genes 5' upstream sequences also showed NFκB response elements, located within 500 bp from the transcription start site. In A. gambiae, the frequency of ATAA motif near the NFκB response elements was increased, suggesting a functional link between nucleosome formation/remodelling and NFκB regulation of transcription. Conclusion AT-rich motif enrichment in 5' upstream sequences in A. gambiae, Ae. aegypti and the Drosophila genus immunity genes suggests a particular pattern of nucleosome formation/chromatin organization. The co-occurrence of such motifs with the NFκB response elements suggests that these sequence signatures may be functionally involved in transcriptional activation during dipteran immune response. AT-rich motif enrichment in regulatory regions in this group of co-regulated genes could represent an evolutionary constrained signature in dipterans and perhaps other distantly species.

  10. SLIDER: Mining correlated motifs in protein-protein interaction networks

    NARCIS (Netherlands)

    Boyen, P.; Dijk, van A.D.J.; Ham, van R.C.H.J.; Neven, F.

    2009-01-01

    Abstract—Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereby provide a computational method for predicting binding sites for protein interaction. In this paper, we adopt a

  11. BlockLogo: Visualization of peptide and sequence motif conservation

    DEFF Research Database (Denmark)

    Olsen, Lars Rønn; Kudahl, Ulrich Johan; Simon, Christian;

    2013-01-01

    BlockLogo is a web-server application for the visualization of protein and nucleotide fragments, continuous protein sequence motifs, and discontinuous sequence motifs using calculation of block entropy from multiple sequence alignments. The user input consists of a multiple sequence alignment, se...

  12. Aztec, Incan and Mayan Motifs...Lead to Distinctive Designs.

    Science.gov (United States)

    Shields, Joanne

    2001-01-01

    Describes an art project for seventh-grade students in which they choose motifs based on Incan, Aztec, and Mayan Indian materials to incorporate into two-dimensional designs. Explains that the activity objective is to create a unified, balanced and pleasing composition using a minimum of three motifs. (CMK)

  13. The phenomenon of astral motifs on late mediaeval tombstones

    Science.gov (United States)

    Mijatović, V.; Ninković, S.; Vemić, D.

    2003-10-01

    The authors study astral motifs present on some mediaeval tombstones found in present-day Serbia and Montenegro and in the neighbouring countries (especially in Bosnia and Herzegovina). The authors discern some important astral motifs, explain them and present a short review concerning their frequency.

  14. Probing structural changes of self assembled i-motif DNA

    KAUST Repository

    Lee, Iljoon

    2015-01-01

    We report an i-motif structural probing system based on Thioflavin T (ThT) as a fluorescent sensor. This probe can discriminate the structural changes of RET and Rb i-motif sequences according to pH change. This journal is

  15. The effect of orthology and coregulation on detecting regulatory motifs.

    Directory of Open Access Journals (Sweden)

    Valerie Storms

    Full Text Available BACKGROUND: Computational de novo discovery of transcription factor binding sites is still a challenging problem. The growing number of sequenced genomes allows integrating orthology evidence with coregulation information when searching for motifs. Moreover, the more advanced motif detection algorithms explicitly model the phylogenetic relatedness between the orthologous input sequences and thus should be well adapted towards using orthologous information. In this study, we evaluated the conditions under which complementing coregulation with orthologous information improves motif detection for the class of probabilistic motif detection algorithms with an explicit evolutionary model. METHODOLOGY: We designed datasets (real and synthetic covering different degrees of coregulation and orthologous information to test how well Phylogibbs and Phylogenetic sampler, as representatives of the motif detection algorithms with evolutionary model performed as compared to MEME, a more classical motif detection algorithm that treats orthologs independently. RESULTS AND CONCLUSIONS: Under certain conditions detecting motifs in the combined coregulation-orthology space is indeed more efficient than using each space separately, but this is not always the case. Moreover, the difference in success rate between the advanced algorithms and MEME is still marginal. The success rate of motif detection depends on the complex interplay between the added information and the specificities of the applied algorithms. Insights in this relation provide information useful to both developers and users. All benchmark datasets are available at http://homes.esat.kuleuven.be/~kmarchal/Supplementary_Storms_Valerie_PlosONE.

  16. MotifCombinator: a web-based tool to search for combinations of cis-regulatory motifs

    Directory of Open Access Journals (Sweden)

    Tsunoda Tatsuhiko

    2007-03-01

    Full Text Available Abstract Background A combination of multiple types of transcription factors and cis-regulatory elements is often required for gene expression in eukaryotes, and the combinatorial regulation confers specific gene expression to tissues or environments. To reveal the combinatorial regulation, computational methods are developed that efficiently infer combinations of cis-regulatory motifs that are important for gene expression as measured by DNA microarrays. One promising type of computational method is to utilize regression analysis between expression levels and scores of motifs in input sequences. This type takes full advantage of information on expression levels because it does not require that the expression level of each gene be dichotomized according to whether or not it reaches a certain threshold level. However, there is no web-based tool that employs regression methods to systematically search for motif combinations and that practically handles combinations of more than two or three motifs. Results We here introduced MotifCombinator, an online tool with a user-friendly interface, to systematically search for combinations composed of any number of motifs based on regression methods. The tool utilizes well-known regression methods (the multivariate linear regression, the multivariate adaptive regression spline or MARS, and the multivariate logistic regression method for this purpose, and uses the genetic algorithm to search for combinations composed of any desired number of motifs. The visualization systems in this tool help users to intuitively grasp the process of the combination search, and the backup system allows users to easily stop and restart calculations that are expected to require large computational time. This tool also provides preparatory steps needed for systematic combination search – i.e., selecting single motifs to constitute combinations and cutting out redundant similar motifs based on clustering analysis. Conclusion

  17. Guanine nucleotide dissociation inhibitor activity of the triple GoLoco motif protein G18: alanine-to-aspartate mutation restores function to an inactive second GoLoco motif.

    Science.gov (United States)

    Kimple, Randall J; Willard, Francis S; Hains, Melinda D; Jones, Miller B; Nweke, Gift K; Siderovski, David P

    2004-03-15

    GoLoco ('Galpha(i/o)-Loco' interaction) motif proteins have recently been identified as novel GDIs (guanine nucleotide dissociation inhibitors) for heterotrimeric G-protein alpha subunits. G18 is a member of the mammalian GoLoco-motif gene family and was uncovered by analyses of human and mouse genomes for anonymous open-reading frames. The encoded G18 polypeptide is predicted to contain three 19-amino-acid GoLoco motifs, which have been shown in other proteins to bind Galpha subunits and inhibit spontaneous nucleotide release. However, the G18 protein has thus far not been characterized biochemically. Here, we have cloned and expressed the G18 protein and assessed its ability to act as a GDI. G18 is capable of simultaneously binding more than one Galpha(i1) subunit. In binding assays with the non-hydrolysable GTP analogue guanosine 5'-[gamma-thio]triphosphate, G18 exhibits GDI activity, slowing the exchange of GDP for GTP by Galpha(i1). Only the first and third GoLoco motifs within G18 are capable of interacting with Galpha subunits, and these bind with low micromolar affinity only to Galpha(i1) in the GDP-bound form, and not to Galpha(o), Galpha(q), Galpha(s) or Galpha12. Mutation of Ala-121 to aspartate in the inactive second GoLoco motif of G18, to restore the signature acidic-glutamine-arginine tripeptide that forms critical contacts with Galpha and its bound nucleotide [Kimple, Kimple, Betts, Sondek and Siderovski (2002) Nature (London) 416, 878-881], results in gain-of-function with respect to Galpha binding and GDI activity. PMID:14656218

  18. An algorithm for motif-based network design

    CERN Document Server

    Mäki-Marttunen, Tuomo

    2016-01-01

    A determinant property of the structure of a biological network is the distribution of local connectivity patterns, i.e., network motifs. In this work, a method for creating directed, unweighted networks while promoting a certain combination of motifs is presented. This motif-based network algorithm starts with an empty graph and randomly connects the nodes by advancing or discouraging the formation of chosen motifs. The in- or out-degree distribution of the generated networks can be explicitly chosen. The algorithm is shown to perform well in producing networks with high occurrences of the targeted motifs, both ones consisting of 3 nodes as well as ones consisting of 4 nodes. Moreover, the algorithm can also be tuned to bring about global network characteristics found in many natural networks, such as small-worldness and modularity.

  19. Dynamic Motifs of Strategies in Prisoner's Dilemma Games

    CERN Document Server

    Kim, Young Jin; Jeong, Seon-Young; Son, Seung-Woo

    2014-01-01

    We investigate the win-lose relations between strategies of iterated prisoner's dilemma games by using a directed network concept to display the replicator dynamics results. In the giant strongly-connected component of the win/lose network, we find win-lose circulations similar to rock-paper-scissors and analyze the fixed point and its stability. Applying the network motif concept, we introduce dynamic motifs, which describe the population dynamics relations among the three strategies. Through exact enumeration, we find 22 dynamic motifs and display their phase portraits. Visualization using directed networks and motif analysis is a useful method to make complex dynamic behavior simple in order to understand it more intuitively. Dynamic motifs can be building blocks for dynamic behavior among strategies when they are applied to other types of games.

  20. Discovering multiple realistic TFBS motifs based on a generalized model

    Directory of Open Access Journals (Sweden)

    Leung Kwong-Sak

    2009-10-01

    Full Text Available Abstract Background Identification of transcription factor binding sites (TFBSs is a central problem in Bioinformatics on gene regulation. de novo motif discovery serves as a promising way to predict and better understand TFBSs for biological verifications. Real TFBSs of a motif may vary in their widths and their conservation degrees within a certain range. Deciding a single motif width by existing models may be biased and misleading. Additionally, multiple, possibly overlapping, candidate motifs are desired and necessary for biological verification in practice. However, current techniques either prohibit overlapping TFBSs or lack explicit control of different motifs. Results We propose a new generalized model to tackle the motif widths by considering and evaluating a width range of interest simultaneously, which should better address the width uncertainty. Moreover, a meta-convergence framework for genetic algorithms (GAs, is proposed to provide multiple overlapping optimal motifs simultaneously in an effective and flexible way. Users can easily specify the difference amongst expected motif kinds via similarity test. Incorporating Genetic Algorithm with Local Filtering (GALF for searching, the new GALF-G (G for generalized algorithm is proposed based on the generalized model and meta-convergence framework. Conclusion GALF-G was tested extensively on over 970 synthetic, real and benchmark datasets, and is usually better than the state-of-the-art methods. The range model shows an increase in sensitivity compared with the single-width ones, while providing competitive precisions on the E. coli benchmark. Effectiveness can be maintained even using a very small population, exhibiting very competitive efficiency. In discovering multiple overlapping motifs in a real liver-specific dataset, GALF-G outperforms MEME by up to 73% in overall F-scores. GALF-G also helps to discover an additional motif which has probably not been annotated in the dataset

  1. De Novo Regulatory Motif Discovery Identifies Significant Motifs in Promoters of Five Classes of Plant Dehydrin Genes.

    Science.gov (United States)

    Zolotarov, Yevgen; Strömvik, Martina

    2015-01-01

    Plants accumulate dehydrins in response to osmotic stresses. Dehydrins are divided into five different classes, which are thought to be regulated in different manners. To better understand differences in transcriptional regulation of the five dehydrin classes, de novo motif discovery was performed on 350 dehydrin promoter sequences from a total of 51 plant genomes. Overrepresented motifs were identified in the promoters of five dehydrin classes. The Kn dehydrin promoters contain motifs linked with meristem specific expression, as well as motifs linked with cold/dehydration and abscisic acid response. KS dehydrin promoters contain a motif with a GATA core. SKn and YnSKn dehydrin promoters contain motifs that match elements connected with cold/dehydration, abscisic acid and light response. YnKn dehydrin promoters contain motifs that match abscisic acid and light response elements, but not cold/dehydration response elements. Conserved promoter motifs are present in the dehydrin classes and across different plant lineages, indicating that dehydrin gene regulation is likely also conserved.

  2. UTSig: A Persian Offline Signature Dataset

    OpenAIRE

    Soleimani, Amir; Fouladi, Kazim; Araabi, Babak N.

    2016-01-01

    The crucial role of datasets in signature verification systems has motivated researchers to collect signature samples. However, with regard to the distinct characteristics of Persian signature, existing offline signature datasets cannot be used in Persian systems. This paper presents a new and public Persian offline signature dataset, UTSig, which consists of 8280 images from 115 classes that each class has 27 genuine, 3 opposite-hand signatures of the genuine signer, and 42 skilled forgeries...

  3. Harmonic 'signatures' of microorganisms.

    Science.gov (United States)

    Blake-Coleman, B C; Hutchings, M J; Silley, P

    1994-01-01

    The frequency/amplitude effect of various microorganisms exposed to periodic (time varying) electric fields, when proximate to immersed electrodes, has been studied using a novel analytical instrument. The harmonic distribution, in complex signals caused by cells exposed to harmonic free waveforms and occupying part of the electrode/suspension interface volume, was shown to be almost entirely due to the change in the standing interfacial transfer function by the (dielectrically nonlinear) presence of cells. Thus, the characteristic interfacial non-linearity is viewed as variable, being uniquely modulated by the presence of particular cells in the interfacial region. Little can be attributed to bulk (far field) effects. The tendency for subtle (characteristic) signal distortion to occur as a function of particulate (cell or molecular) occupancy of the near electrode interfacial region under controlled current conditions leads to the method of sample characterisation by harmonic (Fourier) analysis. We report here, as a sequel to our original studies (Hutchings et al., 1993; Hutchings and Blake-Coleman, 1993), preliminary results of the harmonic analysis of microbial suspensions under controlled signal conditions using a three-electrode configuration. These data provide three-dimensional graphical representations producing harmonic 'surfaces' for various microorganisms. Thus, cell type differences are characterised by their 'harmonic signature'. The visual distinction provided by these 'surface' forming three-dimensional plots is striking and gives a convincing impression of the ability to identify and enumerate specific microorganisms by acquisition of cell-modulated electrode interfacial Fourier spectra. PMID:8060593

  4. Statistical clumped isotope signatures.

    Science.gov (United States)

    Röckmann, T; Popa, M E; Krol, M C; Hofmann, M E G

    2016-01-01

    High precision measurements of molecules containing more than one heavy isotope may provide novel constraints on element cycles in nature. These so-called clumped isotope signatures are reported relative to the random (stochastic) distribution of heavy isotopes over all available isotopocules of a molecule, which is the conventional reference. When multiple indistinguishable atoms of the same element are present in a molecule, this reference is calculated from the bulk (≈average) isotopic composition of the involved atoms. We show here that this referencing convention leads to apparent negative clumped isotope anomalies (anti-clumping) when the indistinguishable atoms originate from isotopically different populations. Such statistical clumped isotope anomalies must occur in any system where two or more indistinguishable atoms of the same element, but with different isotopic composition, combine in a molecule. The size of the anti-clumping signal is closely related to the difference of the initial isotope ratios of the indistinguishable atoms that have combined. Therefore, a measured statistical clumped isotope anomaly, relative to an expected (e.g. thermodynamical) clumped isotope composition, may allow assessment of the heterogeneity of the isotopic pools of atoms that are the substrate for formation of molecules. PMID:27535168

  5. Paradigm Signature S8

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    不说不知道,Paradigm在北美市场可是占用率位居前列的品牌,而且产品在世界各地获奖连连.足以证明他的成功。但风光的背后,肯定离不开默默的耕耘。Paradigm工厂就在加拿大,全世界销售的Paradigm产品都出自这个地广人稀、资源丰富、风景优美的北美绿洲。Paradigm的产品线甚广,SignatureS8是其中的现役旗舰。和很多旗舰产品动不动就要价数十万的品牌相比,这个Paradigm的产品定位可是务实得多,

  6. Secure mediated certificateless signature scheme

    Institute of Scientific and Technical Information of China (English)

    YANG Chen; MA Wen-ping; WANG Xin-mei

    2007-01-01

    Ju et al proposed a certificateless signature scheme with instantaneous revocation by introducing security mediator (SEM) mechanism. This article presents a detailed cryptoanalysis of this scheme and shows that, in their proposed scheme, once a valid signature has been produced, the signer can recover his private key information and the instantaneous revocation property will be damaged. Furthermore, an improved mediated signature scheme, which can eliminate these disadvantages, is proposed, and security proof of the improved scheme under elliptic curve factorization problem (ECFP) assumption and bilinear computational diffie-hellman problem (BCDH) assumption is also proposed.

  7. Computational analyses of synergism in small molecular network motifs.

    Directory of Open Access Journals (Sweden)

    Yili Zhang

    2014-03-01

    Full Text Available Cellular functions and responses to stimuli are controlled by complex regulatory networks that comprise a large diversity of molecular components and their interactions. However, achieving an intuitive understanding of the dynamical properties and responses to stimuli of these networks is hampered by their large scale and complexity. To address this issue, analyses of regulatory networks often focus on reduced models that depict distinct, reoccurring connectivity patterns referred to as motifs. Previous modeling studies have begun to characterize the dynamics of small motifs, and to describe ways in which variations in parameters affect their responses to stimuli. The present study investigates how variations in pairs of parameters affect responses in a series of ten common network motifs, identifying concurrent variations that act synergistically (or antagonistically to alter the responses of the motifs to stimuli. Synergism (or antagonism was quantified using degrees of nonlinear blending and additive synergism. Simulations identified concurrent variations that maximized synergism, and examined the ways in which it was affected by stimulus protocols and the architecture of a motif. Only a subset of architectures exhibited synergism following paired changes in parameters. The approach was then applied to a model describing interlocked feedback loops governing the synthesis of the CREB1 and CREB2 transcription factors. The effects of motifs on synergism for this biologically realistic model were consistent with those for the abstract models of single motifs. These results have implications for the rational design of combination drug therapies with the potential for synergistic interactions.

  8. Triadic motifs in the dependence networks of virtual societies

    Science.gov (United States)

    Xie, Wen-Jie; Li, Ming-Xia; Jiang, Zhi-Qiang; Zhou, Wei-Xing

    2014-06-01

    In friendship networks, individuals have different numbers of friends, and the closeness or intimacy between an individual and her friends is heterogeneous. Using a statistical filtering method to identify relationships about who depends on whom, we construct dependence networks (which are directed) from weighted friendship networks of avatars in more than two hundred virtual societies of a massively multiplayer online role-playing game (MMORPG). We investigate the evolution of triadic motifs in dependence networks. Several metrics show that the virtual societies evolved through a transient stage in the first two to three weeks and reached a relatively stable stage. We find that the unidirectional loop motif (M9) is underrepresented and does not appear, open motifs are also underrepresented, while other close motifs are overrepresented. We also find that, for most motifs, the overall level difference of the three avatars in the same motif is significantly lower than average, whereas the sum of ranks is only slightly larger than average. Our findings show that avatars' social status plays an important role in the formation of triadic motifs.

  9. Profile-based short linear protein motif discovery

    Directory of Open Access Journals (Sweden)

    Haslam Niall J

    2012-05-01

    Full Text Available Abstract Background Short linear protein motifs are attracting increasing attention as functionally independent sites, typically 3–10 amino acids in length that are enriched in disordered regions of proteins. Multiple methods have recently been proposed to discover over-represented motifs within a set of proteins based on simple regular expressions. Here, we extend these approaches to profile-based methods, which provide a richer motif representation. Results The profile motif discovery method MEME performed relatively poorly for motifs in disordered regions of proteins. However, when we applied evolutionary weighting to account for redundancy amongst homologous proteins, and masked out poorly conserved regions of disordered proteins, the performance of MEME is equivalent to that of regular expression methods. However, the two approaches returned different subsets within both a benchmark dataset, and a more realistic discovery dataset. Conclusions Profile-based motif discovery methods complement regular expression based methods. Whilst profile-based methods are computationally more intensive, they are likely to discover motifs currently overlooked by regular expression methods.

  10. A speedup technique for (l, d-motif finding algorithms

    Directory of Open Access Journals (Sweden)

    Dinh Hieu

    2011-03-01

    Full Text Available Abstract Background The discovery of patterns in DNA, RNA, and protein sequences has led to the solution of many vital biological problems. For instance, the identification of patterns in nucleic acid sequences has resulted in the determination of open reading frames, identification of promoter elements of genes, identification of intron/exon splicing sites, identification of SH RNAs, location of RNA degradation signals, identification of alternative splicing sites, etc. In protein sequences, patterns have proven to be extremely helpful in domain identification, location of protease cleavage sites, identification of signal peptides, protein interactions, determination of protein degradation elements, identification of protein trafficking elements, etc. Motifs are important patterns that are helpful in finding transcriptional regulatory elements, transcription factor binding sites, functional genomics, drug design, etc. As a result, numerous papers have been written to solve the motif search problem. Results Three versions of the motif search problem have been proposed in the literature: Simple Motif Search (SMS, (l, d-motif search (or Planted Motif Search (PMS, and Edit-distance-based Motif Search (EMS. In this paper we focus on PMS. Two kinds of algorithms can be found in the literature for solving the PMS problem: exact and approximate. An exact algorithm identifies the motifs always and an approximate algorithm may fail to identify some or all of the motifs. The exact version of PMS problem has been shown to be NP-hard. Exact algorithms proposed in the literature for PMS take time that is exponential in some of the underlying parameters. In this paper we propose a generic technique that can be used to speedup PMS algorithms. Conclusions We present a speedup technique that can be used on any PMS algorithm. We have tested our speedup technique on a number of algorithms. These experimental results show that our speedup technique is indeed very

  11. Evaluating deterministic motif significance measures in protein databases

    Directory of Open Access Journals (Sweden)

    Azevedo Paulo J

    2007-12-01

    Full Text Available Abstract Background Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in automatically ranking those motifs, and therefore alleviating the analysis work. Spotting the most interesting and relevant motifs is then dependent on the choice of the right measures. The combined use of several measures may provide more robust results. However caution has to be taken in order to avoid spurious evaluations. Results From the set of conducted experiments, it was verified that several of the selected significance measures show a very similar behavior in a wide range of situations therefore providing redundant information. Some measures have proved to be more appropriate to rank highly conserved motifs, while others are more appropriate for weakly conserved ones. Support appears as a very important feature to be considered for correct motif ranking. We observed that not all the measures are suitable for situations with poorly balanced class information, like for instance, when positive data is significantly less than negative data. Finally, a visualization scheme was proposed that, when several measures are applied, enables an easy identification of high scoring motifs. Conclusion In this work we have surveyed and categorized 14 significance measures for pattern evaluation. Their ability to rank three types of deterministic motifs was evaluated. Measures were applied in different testing conditions, where relations were identified. This study provides some pertinent insights on the choice of the right set of significance measures for the evaluation of deterministic motifs extracted from protein databases.

  12. Identification of protein superfamily from structure- based sequence motif

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    The structure-based sequence motif of the distant proteins in evolution, protein tyrosine phosphatases (PTP) Ⅰ and Ⅱ superfamilies, as an example, has been defined by the structural comparison, structure-based sequence alignment and analyses on substitution patterns of residues in common sequence conserved regions. And the phosphatases Ⅰ and Ⅱ can be correctly identified together by the structure-based PTP sequence motif from SWISS-PROT and TrEBML databases. The results show that the correct rates of identification are over 98%. This is the first time to identify PTP Ⅰ and Ⅱ together by this motif.

  13. A comprehensive search for recombinogenic motifs in the human genome.

    Directory of Open Access Journals (Sweden)

    Henry R Johnston

    Full Text Available The patterns of male and female recombination vary greatly on a macro scale. A unique motif in each gender, triggering a double strand break at its location, much in the way Chi sites operate in E. coli, could logically explain this difference. As such, we have undertaken a comprehensive search of all small motifs in an attempt to identify one or more that match to the available data. In the end, we conclude that no such motifs appear to exist in the human genome.

  14. Initial Semantics for Strengthened Signatures

    CERN Document Server

    Hirschowitz, André; 10.4204/EPTCS.77.5

    2012-01-01

    We give a new general definition of arity, yielding the companion notions of signature and associated syntax. This setting is modular in the sense requested by Ghani and Uustalu: merging two extensions of syntax corresponds to building an amalgamated sum. These signatures are too general in the sense that we are not able to prove the existence of an associated syntax in this general context. So we have to select arities and signatures for which there exists the desired initial monad. For this, we follow a track opened by Matthes and Uustalu: we introduce a notion of strengthened arity and prove that the corresponding signatures have initial semantics (i.e. associated syntax). Our strengthened arities admit colimits, which allows the treatment of the \\lambda-calculus with explicit substitution.

  15. Initial Semantics for Strengthened Signatures

    Directory of Open Access Journals (Sweden)

    André Hirschowitz

    2012-02-01

    Full Text Available We give a new general definition of arity, yielding the companion notions of signature and associated syntax. This setting is modular in the sense requested by Ghani and Uustalu: merging two extensions of syntax corresponds to building an amalgamated sum. These signatures are too general in the sense that we are not able to prove the existence of an associated syntax in this general context. So we have to select arities and signatures for which there exists the desired initial monad. For this, we follow a track opened by Matthes and Uustalu: we introduce a notion of strengthened arity and prove that the corresponding signatures have initial semantics (i.e. associated syntax. Our strengthened arities admit colimits, which allows the treatment of the λ-calculus with explicit substitution.

  16. C-terminal motif prediction in eukaryotic proteomes using comparative genomics and statistical over-representation across protein families

    Science.gov (United States)

    Austin, Ryan S; Provart, Nicholas J; Cutler, Sean R

    2007-01-01

    Background The carboxy termini of proteins are a frequent site of activity for a variety of biologically important functions, ranging from post-translational modification to protein targeting. Several short peptide motifs involved in protein sorting roles and dependent upon their proximity to the C-terminus for proper function have already been characterized. As a limited number of such motifs have been identified, the potential exists for genome-wide statistical analysis and comparative genomics to reveal novel peptide signatures functioning in a C-terminal dependent manner. We have applied a novel methodology to the prediction of C-terminal-anchored peptide motifs involving a simple z-statistic and several techniques for improving the signal-to-noise ratio. Results We examined the statistical over-representation of position-specific C-terminal tripeptides in 7 eukaryotic proteomes. Sequence randomization models and simple-sequence masking were applied to the successful reduction of background noise. Similarly, as C-terminal homology among members of large protein families may artificially inflate tripeptide counts in an irrelevant and obfuscating manner, gene-family clustering was performed prior to the analysis in order to assess tripeptide over-representation across protein families as opposed to across all proteins. Finally, comparative genomics was used to identify tripeptides significantly occurring in multiple species. This approach has been able to predict, to our knowledge, all C-terminally anchored targeting motifs present in the literature. These include the PTS1 peroxisomal targeting signal (SKL*), the ER-retention signal (K/HDEL*), the ER-retrieval signal for membrane bound proteins (KKxx*), the prenylation signal (CC*) and the CaaX box prenylation motif. In addition to a high statistical over-representation of these known motifs, a collection of significant tripeptides with a high propensity for biological function exists between species, among

  17. A Novel Alignment-Free Method for Comparing Transcription Factor Binding Site Motifs

    OpenAIRE

    Minli Xu; Zhengchang Su

    2010-01-01

    BACKGROUND: Transcription factor binding site (TFBS) motifs can be accurately represented by position frequency matrices (PFM) or other equivalent forms. We often need to compare TFBS motifs using their PFMs in order to search for similar motifs in a motif database, or cluster motifs according to their binding preference. The majority of current methods for motif comparison involve a similarity metric for column-to-column comparison and a method to find the optimal position alignment between ...

  18. ROMANIAN FOLKLORE MOTIFS IN FASHION DESIGN

    Directory of Open Access Journals (Sweden)

    MOCENCO Alexandra

    2014-05-01

    Full Text Available The traditional Romanian costume such as the entire popular art (architecture, woodcarvins, pottery etc. was born and lasted in our country since ancient times. Closely related to human existence, the traditional costume reflected over the years as reflected nowadays, the mentality and artistic conception of the people. Today the traditional Romanian costume became an inspiration source to the wholesale fashion production industry designers, both Romanian and international. Although the contemporary designers are working in accordance with a vision, using a wide area of styles, methods and current technology, they usually return to traditional techniques and ethnic folklore motifs, which converts and resize them, integrating them in their contemporary space. Adrian Oianu is a very appreciated Romanian designer who launched two collections inspired by his native’s country traditional costumes: “Suflecata pan’ la brau” (“Turned up ‘til the belt” and “Bucurie” (“Joy”. Dorin Negrau had as inspiration for his “Lost” collection the traditional costume from the Bihor region. Yves Saint Laurent had a collection inspired by the Romanian traditional flax blouses called “La blouse roumaine”. The paper presents the traditional Romanian values throw fashion collections. The research activity will create innovative concepts to support the garment industry in order to develop their own brand and to bring the design activities in Romania at an international level. The research was conducted during the initial stage of a project, financed through national founds, consisting in a documentary study on ethnographic characteristics of the popular costume from different regions of the country.

  19. Targeting functional motifs of a protein family

    Science.gov (United States)

    Bhadola, Pradeep; Deo, Nivedita

    2016-10-01

    The structural organization of a protein family is investigated by devising a method based on the random matrix theory (RMT), which uses the physiochemical properties of the amino acid with multiple sequence alignment. A graphical method to represent protein sequences using physiochemical properties is devised that gives a fast, easy, and informative way of comparing the evolutionary distances between protein sequences. A correlation matrix associated with each property is calculated, where the noise reduction and information filtering is done using RMT involving an ensemble of Wishart matrices. The analysis of the eigenvalue statistics of the correlation matrix for the β -lactamase family shows the universal features as observed in the Gaussian orthogonal ensemble (GOE). The property-based approach captures the short- as well as the long-range correlation (approximately following GOE) between the eigenvalues, whereas the previous approach (treating amino acids as characters) gives the usual short-range correlations, while the long-range correlations are the same as that of an uncorrelated series. The distribution of the eigenvector components for the eigenvalues outside the bulk (RMT bound) deviates significantly from RMT observations and contains important information about the system. The information content of each eigenvector of the correlation matrix is quantified by introducing an entropic estimate, which shows that for the β -lactamase family the smallest eigenvectors (low eigenmodes) are highly localized as well as informative. These small eigenvectors when processed gives clusters involving positions that have well-defined biological and structural importance matching with experiments. The approach is crucial for the recognition of structural motifs as shown in β -lactamase (and other families) and selectively identifies the important positions for targets to deactivate (activate) the enzymatic actions.

  20. Early illness recognition using frequent motif discovery.

    Science.gov (United States)

    Hajihashemi, Zahra; Popescu, Mihail

    2015-08-01

    Living alone in their own residence, older adults are at risk for late assessment of physical or cognitive changes due to many factors such as their impression that such changes are simply a normal part of aging or their reluctance to admit to a problem. This paper describes an early illness recognition framework using sensor network technology to identify the health trajectory of older adults reflected in patterns of day-today activities. Describing the behavior of older adults could help clinicians to identify those at the greatest risk for functional decline and adverse events. The proposed framework, denoted as Abnormal Frequent Activity Pattern (AFAP), is based on the identification of known past abnormal frequent activities in current sensor data. More specifically, AFAP declares a day abnormal when past frequent abnormal behavior patterns, not found during normal days, are discovered in the current activity data. While AFAP requires the labeling of past days as normal/abnormal, it doesn't need specific activity identification. Frequent activity patterns (FAP) are found using MEME, a bioinformatics motif detection algorithm. To validate our approach, we used data obtained from TigerPlace, an aging in place community situated in Columbia, MO, where apartments are equipped with sensor networks (motion, bed and depth sensors). A retrospective multiple case study (N=3) design was used to quantify the in-home older adult's daily routines, over a period of two weeks. Within-person variability of routine activities may be used as a new predictor in the study of health trajectories of older adults. PMID:26737096

  1. Object Recognition Using Spatiotemporal Signatures

    OpenAIRE

    James V Stone

    1998-01-01

    The sequence of images generated by motion between observer and object specifies a spatiotemporal signature for that object. Evidence is presented that such spatiotemporal signatures are used in object recognition. Subjects learned novel, three-dimensional, rotating objects from image sequences in a continuous recognition task. During learning, the temporal order of images of a given object was constant. During testing, the order of images in each sequence was reversed, relative to its order ...

  2. Visual identification by signature tracking

    OpenAIRE

    Munich, Mario E.; Perona, Pietro

    2003-01-01

    We propose a new camera-based biometric: visual signature identification. We discuss the importance of the parameterization of the signatures in order to achieve good classification results, independently of variations in the position of the camera with respect to the writing surface. We show that affine arc-length parameterization performs better than conventional time and Euclidean arc-length ones. We find that the system verification performance is better than 4 percent error on skilled fo...

  3. Contract Signature Using Quantum Information

    CERN Document Server

    De Sousa, P B M; Ramos, Rubens Viana; Sousa, Paulo Benicio Melo de

    2006-01-01

    This paper describes how to perform contract signature in a fair way using quantum information. The protocol proposed permits two partners, users of a communication network, to exchange their signatures with non-repudiation. For this, we assume that there is a trustable arbitrator, responsible for the authentication of the signers and that performs a central task in a quantum teleportation protocol of the XOR function between two classical bits.

  4. An arbitrated quantum signature scheme

    CERN Document Server

    Zeng, G; Zeng, Guihua; Keitel, Christoph H.

    2002-01-01

    The general principle for a quantum signature scheme is proposed and investigated based on ideas from classical signature schemes and quantum cryptography. The suggested algorithm is implemented by a symmetrical quantum key cryptosystem and Greenberger-Horne-Zeilinger (GHZ) triplet states and relies on the availability of an arbitrator. We can guarantee the unconditional security of the algorithm, mostly due to the correlation of the GHZ triplet states and the use of quantum one-time pads.

  5. Equiangular Frames and Signature Sets

    OpenAIRE

    Singh, Preeti

    2009-01-01

    We will present a relation between real equiangular frames and certain special sets in groups which we call signature sets and show that many equiangular frames arise in this manner. Then we will define quasi-signature sets and will examine equiangular frames associated to these subsets of groups. We will extend these results to complex equiangular frames where the inner product between any pair of vectors is a common multiple of a cube root of unity and exhibit equiangular frames that arise ...

  6. An autoinhibited conformation of LGN reveals a distinct interaction mode between GoLoco motifs and TPR motifs.

    Science.gov (United States)

    Pan, Zhu; Zhu, Jinwei; Shang, Yuan; Wei, Zhiyi; Jia, Min; Xia, Caihao; Wen, Wenyu; Wang, Wenning; Zhang, Mingjie

    2013-06-01

    LGN plays essential roles in asymmetric cell divisions via its N-terminal TPR-motif-mediated binding to mInsc and NuMA. This scaffolding activity requires the release of the autoinhibited conformation of LGN by binding of Gα(i) to its C-terminal GoLoco (GL) motifs. The interaction between the GL and TPR motifs of LGN represents a distinct GL/target binding mode with an unknown mechanism. Here, we show that two consecutive GL motifs of LGN form a minimal TPR-motif-binding unit. GL12 and GL34 bind to TPR0-3 and TPR4-7, respectively. The crystal structure of a truncated LGN reveals that GL34 forms a pair of parallel α helices and binds to the concave surface of TPR4-7, thereby preventing LGN from binding to other targets. Importantly, the GLs bind to TPR motifs with a mode distinct from that observed in the GL/Gα(i)·GDP complexes. Our results also indicate that multiple and orphan GL motif proteins likely respond to G proteins with distinct mechanisms.

  7. Linear array of conserved sequence motifs to discriminate protein subfamilies: study on pyridine nucleotide-disulfide reductases

    Directory of Open Access Journals (Sweden)

    De Las Rivas Javier

    2007-03-01

    Full Text Available Abstract Background The pyridine nucleotide disulfide reductase (PNDR is a large and heterogeneous protein family divided into two classes (I and II, which reflect the divergent evolution of its characteristic disulfide redox active site. However, not all the PNDR members fit into these categories and this suggests the need of further studies to achieve a more comprehensive classification of this complex family. Results A workflow to improve the clusterization of protein families based on the array of linear conserved motifs is designed. The method is applied to the PNDR large family finding two main groups, which correspond to PNDR classes I and II. However, two other separate protein clusters, previously classified as class I in most databases, are outgrouped: the peroxide reductases (NAOX, NAPE and the type II NADH dehydrogenases (NDH-2. In this way, two novel PNDR classes III and IV for NAOX/NAPE and NDH-2 respectively are proposed. By knowledge-driven biochemical and functional data analyses done on the new class IV, a linear array of motifs putatively related to Cu(II-reductase activity is detected in a specific subset of NDH-2. Conclusion The results presented are a novel contribution to the classification of the complex and large PNDR protein family, supporting its reclusterization into four classes. The linear array of motifs detected within the class IV PNDR subfamily could be useful as a signature for a particular subgroup of NDH-2.

  8. Local graph alignment and motif search in biological networks

    Science.gov (United States)

    Berg, Johannes; Lässig, Michael

    2004-10-01

    Interaction networks are of central importance in postgenomic molecular biology, with increasing amounts of data becoming available by high-throughput methods. Examples are gene regulatory networks or protein interaction maps. The main challenge in the analysis of these data is to read off biological functions from the topology of the network. Topological motifs, i.e., patterns occurring repeatedly at different positions in the network, have recently been identified as basic modules of molecular information processing. In this article, we discuss motifs derived from families of mutually similar but not necessarily identical patterns. We establish a statistical model for the occurrence of such motifs, from which we derive a scoring function for their statistical significance. Based on this scoring function, we develop a search algorithm for topological motifs called graph alignment, a procedure with some analogies to sequence alignment. The algorithm is applied to the gene regulation network of Escherichia coli.

  9. Review article: The mountain motif in the plot of Matthew

    Directory of Open Access Journals (Sweden)

    Gert J. Volschenk

    2010-02-01

    Full Text Available This article reviewed T.L. Donaldson’s book, Jesus on the mountain: A study in Matthean theology, published in 1985 by JSOT Press, Sheffield, and focused on the mountain motif in the structure and plot of the Gospel of Matthew, in addition to the work of Donaldson on the mountain motif as a literary motif and as theological symbol. The mountain is a primary theological setting for Jesus’ ministry and thus is an important setting, serving as one of the literary devices by which Matthew structured and progressed his narrative. The Zion theological and eschatological significance and Second Temple Judaism serve as the historical and theological background for the mountain motif. The last mountain setting (Mt 28:16–20 is the culmination of the three theological themes in the plot of Matthew, namely Christology, ecclesiology and salvation history.

  10. Automatic Network Fingerprinting through Single-Node Motifs

    CERN Document Server

    Echtermeyer, Christoph; Rodrigues, Francisco A; Kaiser, Marcus; 10.1371/journal.pone.0015765

    2011-01-01

    Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs---a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes...

  11. 76 FR 30542 - Adult Signature Services

    Science.gov (United States)

    2011-05-26

    ... 111 Adult Signature Services AGENCY: Postal Service\\TM\\. ACTION: Final rule. SUMMARY: The Postal... ) 503.8, to add a new extra service called Adult Signature. This new service has two available options: Adult Signature Required and Adult Signature Restricted Delivery. DATES: Effective July 5, 2011....

  12. Robust and Adaptive MicroRNA-Mediated Incoherent Feedforward Motifs

    Science.gov (United States)

    Xu, Feng-Dan; Liu, Zeng-Rong; Zhang, Zhi-Yong; Shen, Jian-Wei

    2009-02-01

    We integrate transcriptional and post-transcriptional regulation into microRNA-mediated incoherent feedforward motifs and analyse their dynamical behaviour and functions. The analysis show that the behaviour of the system is almost uninfluenced by the varying input in certain ranges and by introducing of delay and noise. The results indicate that microRNA-mediated incoherent feedforward motifs greatly enhance the robustness of gene regulation.

  13. Robust and Adaptive MicroRNA-Mediated Incoherent Feedforward Motifs

    Institute of Scientific and Technical Information of China (English)

    XU Feng-Dan; LIU Zeng-Rong; ZHANG Zhi-Yong; SHEN Jian-Wei

    2009-01-01

    We integrate transcriptional and post-transcriptional regulation into microRNA-mediated incoherent feedforward motifs and analyse their dynamical behaviour and functions. The analysis show that the behaviour of the system is almost uninfluenced by the varying input in certain ranges and by introducing of delay and noise. The results indicate that microRNA-mediated incoherent feedforward motifs greatly enhance the robustness of gene regulation.

  14. Mining Tertiary Structural Motifs for Assessment of Designability

    OpenAIRE

    Zhang, Jian; Grigoryan, Gevorg

    2013-01-01

    The observation of a limited secondary-structural alphabet in native proteins, with significant sequence preferences, has profoundly influenced the fields of protein design and structure prediction (Simons et al., 1997; Verschueren et al., 2011). In the era of structural genomics, as the size of the structural dataset continues to grow rapidly, it is becoming possible to extend this analysis to tertiary structural motifs and their sequences. For a hypothetical tertiary motif, the rate of its ...

  15. Temporal Analysis of Motif Mixtures using Dirichlet Processes

    OpenAIRE

    Emonet, Rémi; Varadarajan, J.; Odobez, Jean-Marc

    2014-01-01

    International audience In this paper, we present a new model for unsupervised discovery of recurrent temporal patterns (or motifs) in time series (or documents). The model is designed to handle the difficult case of multivariate time series obtained from a mixture of activities, that is, our observations are caused by the superposition of multiple phenomena occurring concurrently and with no synchronization. The model uses nonparametric Bayesian methods to describe both the motifs and thei...

  16. Triplex-induced recombination and repair in the pyrimidine motif

    OpenAIRE

    Kalish, Jennifer M.; Seidman, Michael M.; Weeks, Daniel L.; Glazer, Peter M.

    2005-01-01

    Triplex-forming oligonucleotides (TFOs) bind DNA in a sequence-specific manner at polypurine/polypyrimidine sites and mediate targeted genome modification. Triplexes are formed by either pyrimidine TFOs, which bind parallel to the purine strand of the duplex (pyrimidine, parallel motif), or purine TFOs, which bind in an anti-parallel orientation (purine, anti-parallel motif). Both purine and pyrimidine TFOs, when linked to psoralen, have been shown to direct psoralen adduct formation in cells...

  17. Cross-Disciplinary Detection and Analysis of Network Motifs

    OpenAIRE

    Ngoc Tam L. Tran; Luke DeLuccia; McDonald, Aidan F; Chun-Hsi Huang

    2015-01-01

    The detection of network motifs has recently become an important part of network analysis across all disciplines. In this work, we detected and analyzed network motifs from undirected and directed networks of several different disciplines, including biological network, social network, ecological network, as well as other networks such as airlines, power grid, and co-purchase of political books networks. Our analysis revealed that undirected networks are similar at the basic three and four nod...

  18. The Origin of Motif Families in Food Webs

    OpenAIRE

    Klaise, Janis; Johnson, Samuel

    2016-01-01

    Food webs have been found to exhibit remarkable motif profiles, patterns in the relative prevalences of all possible three-species sub-graphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46 food webs of various kinds, we find that most food webs fall into one of two distinct motif families. The separation between the families is well predicted by a global measure of hierarchical order in directed networks - trophic coherence. We find that trop...

  19. Motif depletion in bacteriophages infecting hosts with CRISPR systems

    OpenAIRE

    Kupczok, Anne; Bollback, Jonathan P

    2014-01-01

    Background CRISPR is a microbial immune system likely to be involved in host-parasite coevolution. It functions using target sequences encoded by the bacterial genome, which interfere with invading nucleic acids using a homology-dependent system. The system also requires protospacer associated motifs (PAMs), short motifs close to the target sequence that are required for interference in CRISPR types I and II. Here, we investigate whether PAMs are depleted in phage genomes due to selection pre...

  20. SIGNATURE: A workbench for gene expression signature analysis

    Directory of Open Access Journals (Sweden)

    Chang Jeffrey T

    2011-11-01

    Full Text Available Abstract Background The biological phenotype of a cell, such as a characteristic visual image or behavior, reflects activities derived from the expression of collections of genes. As such, an ability to measure the expression of these genes provides an opportunity to develop more precise and varied sets of phenotypes. However, to use this approach requires computational methods that are difficult to implement and apply, and thus there is a critical need for intelligent software tools that can reduce the technical burden of the analysis. Tools for gene expression analyses are unusually difficult to implement in a user-friendly way because their application requires a combination of biological data curation, statistical computational methods, and database expertise. Results We have developed SIGNATURE, a web-based resource that simplifies gene expression signature analysis by providing software, data, and protocols to perform the analysis successfully. This resource uses Bayesian methods for processing gene expression data coupled with a curated database of gene expression signatures, all carried out within a GenePattern web interface for easy use and access. Conclusions SIGNATURE is available for public use at http://genepattern.genome.duke.edu/signature/.

  1. Quantum messages with signatures forgeable in arbitrated quantum signature schemes

    Science.gov (United States)

    Kim, Taewan; Choi, Jeong Woon; Jho, Nam-Su; Lee, Soojoon

    2015-02-01

    Even though a method to perfectly sign quantum messages has not been known, the arbitrated quantum signature scheme has been considered as one of the good candidates. However, its forgery problem has been an obstacle to the scheme becoming a successful method. In this paper, we consider one situation, which is slightly different from the forgery problem, that we use to check whether at least one quantum message with signature can be forged in a given scheme, although all the messages cannot be forged. If there are only a finite number of forgeable quantum messages in the scheme, then the scheme can be secured against the forgery attack by not sending forgeable quantum messages, and so our situation does not directly imply that we check whether the scheme is secure against the attack. However, if users run a given scheme without any consideration of forgeable quantum messages, then a sender might transmit such forgeable messages to a receiver and in such a case an attacker can forge the messages if the attacker knows them. Thus it is important and necessary to look into forgeable quantum messages. We show here that there always exists such a forgeable quantum message-signature pair for every known scheme with quantum encryption and rotation, and numerically show that there are no forgeable quantum message-signature pairs that exist in an arbitrated quantum signature scheme.

  2. Transcriptional Network growing Models using Motif-based Preferential Attachment

    Directory of Open Access Journals (Sweden)

    Ahmed Farouk Abdelzaher

    2015-10-01

    Full Text Available Understanding relationships between architectural properties of gene-regulatory networks (GRNs has been one of the major goals in systems biology and bioinformatics, as it can provide insights into, e.g., disease dynamics and drug development. Such GRNs are characterized by their scale-free degree distributions and existence of network motifs--i.e., small-node subgraphs that occur more abundantly in GRNs than expected from chance alone. Because these transcriptional modules represent ``building blocks'' of complex networks and exhibit a wide range of functional and dynamical properties, they may contribute to the remarkable robustness and dynamical stability associated with the whole of GRNs. Here we developed network-construction models to better understand this relationship, which produce randomized GRNs by using transcriptional motifs as the fundamental growth unit in contrast to other methods that construct similar networks on a node-by-node basis. Because this model produces networks with a prescribed lower bound on the number of choice transcriptional motifs (e.g., downlinks, feed-forward loops, its fidelity to the motif distributions observed in model organisms represents an improvement over existing methods, which we validated by contrasting their resultant motif and degree distributions against existing network-growth models and data from the model organism of the bacterium Escherichia coli. These models may therefore serve as novel testbeds for further elucidating relationships between the topology of transcriptional motifs and network-wide dynamical properties.

  3. Discovering Motifs in Biological Sequences Using the Micron Automata Processor.

    Science.gov (United States)

    Roy, Indranil; Aluru, Srinivas

    2016-01-01

    Finding approximately conserved sequences, called motifs, across multiple DNA or protein sequences is an important problem in computational biology. In this paper, we consider the (l, d) motif search problem of identifying one or more motifs of length l present in at least q of the n given sequences, with each occurrence differing from the motif in at most d substitutions. The problem is known to be NP-complete, and the largest solved instance reported to date is (26,11). We propose a novel algorithm for the (l,d) motif search problem using streaming execution over a large set of non-deterministic finite automata (NFA). This solution is designed to take advantage of the micron automata processor, a new technology close to deployment that can simultaneously execute multiple NFA in parallel. We demonstrate the capability for solving much larger instances of the (l, d) motif search problem using the resources available within a single automata processor board, by estimating run-times for problem instances (39,18) and (40,17). The paper serves as a useful guide to solving problems using this new accelerator technology. PMID:26886735

  4. An experimental test of a fundamental food web motif.

    Science.gov (United States)

    Rip, Jason M K; McCann, Kevin S; Lynn, Denis H; Fawcett, Sonia

    2010-06-01

    Large-scale changes to the world's ecosystem are resulting in the deterioration of biostructure-the complex web of species interactions that make up ecological communities. A difficult, yet crucial task is to identify food web structures, or food web motifs, that are the building blocks of this baroque network of interactions. Once identified, these food web motifs can then be examined through experiments and theory to provide mechanistic explanations for how structure governs ecosystem stability. Here, we synthesize recent ecological research to show that generalist consumers coupling resources with different interaction strengths, is one such motif. This motif amazingly occurs across an enormous range of spatial scales, and so acts to distribute coupled weak and strong interactions throughout food webs. We then perform an experiment that illustrates the importance of this motif to ecological stability. We find that weak interactions coupled to strong interactions by generalist consumers dampen strong interaction strengths and increase community stability. This study takes a critical step by isolating a common food web motif and through clear, experimental manipulation, identifies the fundamental stabilizing consequences of this structure for ecological communities. PMID:20129988

  5. Efficient motif finding algorithms for large-alphabet inputs

    Directory of Open Access Journals (Sweden)

    Pavlovic Vladimir

    2010-10-01

    Full Text Available Abstract Background We consider the problem of identifying motifs, recurring or conserved patterns, in the biological sequence data sets. To solve this task, we present a new deterministic algorithm for finding patterns that are embedded as exact or inexact instances in all or most of the input strings. Results The proposed algorithm (1 improves search efficiency compared to existing algorithms, and (2 scales well with the size of alphabet. On a synthetic planted DNA motif finding problem our algorithm is over 10× more efficient than MITRA, PMSPrune, and RISOTTO for long motifs. Improvements are orders of magnitude higher in the same setting with large alphabets. On benchmark TF-binding site problems (FNP, CRP, LexA we observed reduction in running time of over 12×, with high detection accuracy. The algorithm was also successful in rapidly identifying protein motifs in Lipocalin, Zinc metallopeptidase, and supersecondary structure motifs for Cadherin and Immunoglobin families. Conclusions Our algorithm reduces computational complexity of the current motif finding algorithms and demonstrate strong running time improvements over existing exact algorithms, especially in important and difficult cases of large-alphabet sequences.

  6. Signature molecular descriptor : advanced applications.

    Energy Technology Data Exchange (ETDEWEB)

    Visco, Donald Patrick, Jr. (Tennessee Technological University, Cookeville, TN)

    2010-04-01

    In this work we report on the development of the Signature Molecular Descriptor (or Signature) for use in the solution of inverse design problems as well as in highthroughput screening applications. The ultimate goal of using Signature is to identify novel and non-intuitive chemical structures with optimal predicted properties for a given application. We demonstrate this in three studies: green solvent design, glucocorticoid receptor ligand design and the design of inhibitors for Factor XIa. In many areas of engineering, compounds are designed and/or modified in incremental ways which rely upon heuristics or institutional knowledge. Often multiple experiments are performed and the optimal compound is identified in this brute-force fashion. Perhaps a traditional chemical scaffold is identified and movement of a substituent group around a ring constitutes the whole of the design process. Also notably, a chemical being evaluated in one area might demonstrate properties very attractive in another area and serendipity was the mechanism for solution. In contrast to such approaches, computer-aided molecular design (CAMD) looks to encompass both experimental and heuristic-based knowledge into a strategy that will design a molecule on a computer to meet a given target. Depending on the algorithm employed, the molecule which is designed might be quite novel (re: no CAS registration number) and/or non-intuitive relative to what is known about the problem at hand. While CAMD is a fairly recent strategy (dating to the early 1980s), it contains a variety of bottlenecks and limitations which have prevented the technique from garnering more attention in the academic, governmental and industrial institutions. A main reason for this is how the molecules are described in the computer. This step can control how models are developed for the properties of interest on a given problem as well as how to go from an output of the algorithm to an actual chemical structure. This report

  7. Structural motif screening reveals a novel, conserved carbohydrate-binding surface in the pathogenesis-related protein PR-5d

    Directory of Open Access Journals (Sweden)

    Moffatt Barbara A

    2010-08-01

    Full Text Available Abstract Background Aromatic amino acids play a critical role in protein-glycan interactions. Clusters of surface aromatic residues and their features may therefore be useful in distinguishing glycan-binding sites as well as predicting novel glycan-binding proteins. In this work, a structural bioinformatics approach was used to screen the Protein Data Bank (PDB for coplanar aromatic motifs similar to those found in known glycan-binding proteins. Results The proteins identified in the screen were significantly associated with carbohydrate-related functions according to gene ontology (GO enrichment analysis, and predicted motifs were found frequently within novel folds and glycan-binding sites not included in the training set. In addition to numerous binding sites predicted in structural genomics proteins of unknown function, one novel prediction was a surface motif (W34/W36/W192 in the tobacco pathogenesis-related protein, PR-5d. Phylogenetic analysis revealed that the surface motif is exclusive to a subfamily of PR-5 proteins from the Solanaceae family of plants, and is absent completely in more distant homologs. To confirm PR-5d's insoluble-polysaccharide binding activity, a cellulose-pulldown assay of tobacco proteins was performed and PR-5d was identified in the cellulose-binding fraction by mass spectrometry. Conclusions Based on the combined results, we propose that the putative binding site in PR-5d may be an evolutionary adaptation of Solanaceae plants including potato, tomato, and tobacco, towards defense against cellulose-containing pathogens such as species of the deadly oomycete genus, Phytophthora. More generally, the results demonstrate that coplanar aromatic clusters on protein surfaces are a structural signature of glycan-binding proteins, and can be used to computationally predict novel glycan-binding proteins from 3 D structure.

  8. Signature Visualization of Software Binaries

    Energy Technology Data Exchange (ETDEWEB)

    Panas, T

    2008-07-01

    In this paper we present work on the visualization of software binaries. In particular, we utilize ROSE, an open source compiler infrastructure, to pre-process software binaries, and we apply a landscape metaphor to visualize the signature of each binary (malware). We define the signature of a binary as a metric-based layout of the functions contained in the binary. In our initial experiment, we visualize the signatures of a series of computer worms that all originate from the same line. These visualizations are useful for a number of reasons. First, the images reveal how the archetype has evolved over a series of versions of one worm. Second, one can see the distinct changes between version. This allows the viewer to form conclusions about the development cycle of a particular worm.

  9. Structural and functional studies of a phosphatidic acid-binding antifungal plant defensin MtDef4: Identification of an RGFRRR motif governing fungal cell entry

    Energy Technology Data Exchange (ETDEWEB)

    Sagaram, Uma S.; El-Mounadi, Kaoutar; Buchko, Garry W.; Berg, Howard R.; Kaur, Jagdeep; Pandurangi, Raghoottama; Smith, Thomas J.; Shah, Dilip

    2013-12-04

    A highly conserved plant defensin MtDef4 potently inhibits the growth of a filamentous fungus Fusarium graminearum. MtDef4 is internalized by cells of F. graminearum. To determine its mechanism of fungal cell entry and antifungal action, NMR solution structure of MtDef4 has been determined. The analysis of its structure has revealed a positively charged patch on the surface of the protein consisting of arginine residues in its γ-core signature, a major determinant of the antifungal activity of MtDef4. Here, we report functional analysis of the RGFRRR motif of the γ-core signature of MtDef4. The replacement of RGFRRR to AAAARR or to RGFRAA not only abolishes fungal cell entry but also results in loss of the antifungal activity of MtDef4. MtDef4 binds strongly to phosphatidic acid (PA), a precursor for the biosynthesis of membrane phospholipids and a signaling lipid known to recruit cytosolic proteins to membranes. Mutations of RGFRRR which abolish fungal cell entry of MtDef4 also impair its binding to PA. Our results suggest that RGFRRR motif is a translocation signal for entry of MtDef4 into fungal cells and that this positively charged motif likely mediates interaction of this defensin with PA as part of its antifungal action.

  10. Equiangular Frames and Signature Sets

    CERN Document Server

    Singh, Preeti

    2009-01-01

    We will present a relation between real equiangular frames and certain special sets in groups which we call signature sets and show that many equiangular frames arise in this manner. Then we will define quasi-signature sets and will examine equiangular frames associated to these subsets of groups. We will extend these results to complex equiangular frames where the inner product between any pair of vectors is a common multiple of a cube root of unity and exhibit equiangular frames that arise from groups in this manner.

  11. A Signature Scheme with Non-Repudiation

    Institute of Scientific and Technical Information of China (English)

    XIN Xiangjun; GUO Xiaoli; XIAO Guozhen

    2006-01-01

    Based on the Schnorr signature scheme, a new signature scheme with non-repudiation is proposed. In this scheme, only the signer and the designated receiver can verify the signature signed by the signer, and if necessary, both the signer and the designated receiver can prove and show the validity of the signature signed by the signer. The proof of the validity of the signature is noninteractive and transferable. To verify and prove the validity of the signature, the signer and the nominated receiver needn't store extra information besides the signature. At the same time, neither the signer nor the designated receiver can deny a valid signature signed. Then, there is no repudiation in this new signature scheme. According to the security analysis of this scheme, it is found the proposed scheme is secure against existential forgery on adaptive chosen message attack.

  12. Discovering motifs in ranked lists of DNA sequences.

    Directory of Open Access Journals (Sweden)

    Eran Eden

    2007-03-01

    Full Text Available Computational methods for discovery of sequence elements that are enriched in a target set compared with a background set are fundamental in molecular biology research. One example is the discovery of transcription factor binding motifs that are inferred from ChIP-chip (chromatin immuno-precipitation on a microarray measurements. Several major challenges in sequence motif discovery still require consideration: (i the need for a principled approach to partitioning the data into target and background sets; (ii the lack of rigorous models and of an exact p-value for measuring motif enrichment; (iii the need for an appropriate framework for accounting for motif multiplicity; (iv the tendency, in many of the existing methods, to report presumably significant motifs even when applied to randomly generated data. In this paper we present a statistical framework for discovering enriched sequence elements in ranked lists that resolves these four issues. We demonstrate the implementation of this framework in a software application, termed DRIM (discovery of rank imbalanced motifs, which identifies sequence motifs in lists of ranked DNA sequences. We applied DRIM to ChIP-chip and CpG methylation data and obtained the following results. (i Identification of 50 novel putative transcription factor (TF binding sites in yeast ChIP-chip data. The biological function of some of them was further investigated to gain new insights on transcription regulation networks in yeast. For example, our discoveries enable the elucidation of the network of the TF ARO80. Another finding concerns a systematic TF binding enhancement to sequences containing CA repeats. (ii Discovery of novel motifs in human cancer CpG methylation data. Remarkably, most of these motifs are similar to DNA sequence elements bound by the Polycomb complex that promotes histone methylation. Our findings thus support a model in which histone methylation and CpG methylation are mechanistically linked

  13. Fitting a mixture model by expectation maximization to discover motifs in biopolymers

    Energy Technology Data Exchange (ETDEWEB)

    Bailey, T.L.; Elkan, C. [Univ. of California, La Jolla, CA (United States)

    1994-12-31

    The algorithm described in this paper discovers one or more motifs in a collection of DNA or protein sequences by using the technique of expectation maximization to fit a two-component finite mixture model to the set of sequences. Multiple motifs are found by fitting a mixture model to the data, probabilistically erasing the occurrences of the motif thus found, and repeating the process to find successive motifs. The algorithm requires only a set of unaligned sequences and a number specifying the width of the motifs as input. It returns a model of each motif and a threshold which together can be used as a Bayes-optimal classifier for searching for occurrences of the motif in other databases. The algorithm estimates how many times each motif occurs in each sequence in the dataset and outputs an alignment of the occurrences of the motif. The algorithm is capable of discovering several different motifs with differing numbers of occurrences in a single dataset.

  14. Verifiably Encrypted Signatures Without Random Oracles

    Institute of Scientific and Technical Information of China (English)

    LI Xiang-xue; CHEN Ke-fei; LIU Sheng-li; LI Shi-qun

    2006-01-01

    Verifiably encrypted signatures are employed when a signer wants to sign a message for a verifier but does not want the verifier to possess his signature on the message until some certain requirements of his are satisfied. This paper presented new verifiably encrypted signatures from bilinear pairings. The proposed signatures share the properties of simplicity and efficiency with existing verifiably encrypted signature schemes. To support the proposed scheme, it also exhibited security proofs that do not use random oracle assumption. For existential unforgeability, there exist tight security reductions from the proposed verifiably encrypted signature scheme to a strong but reasonable computational assumption.

  15. An Improved Proxy Multi-Signature Scheme

    Institute of Scientific and Technical Information of China (English)

    GU Li-ze; ZHANG Sheng; YANG Yi-xian

    2005-01-01

    Based on the Kim-like's proxy multi-signature scheme[1],an improved proxy multi-signature scheme is proposed.The new scheme overcomes the two problems in the Kim-like's proxy multi-signature scheme:(1)Security issue(every original signer can forge a valid proxy multi-signature for any message);(2)Efficiency issue(both the size of the proxy multi-signature and the efficiency of signature checking are dependent on the number of the original signers).

  16. Galaxy interactions : The HI signature

    NARCIS (Netherlands)

    Sancisi, R; Barnes, JE; Sanders, DB

    1999-01-01

    HI observations are an excellent tool for investigating tidal interactions. Ongoing major and minor interactions which can lead to traumatic mergers or to accretion and the triggering of star formation, show distinct HI signatures. Interactions and mergers in the recent past can also be recognized i

  17. Disaster relief through composite signatures

    Science.gov (United States)

    Hawley, Chadwick T.; Hyde, Brian; Carpenter, Tom; Nichols, Steve

    2012-06-01

    A composite signature is a group of signatures that are related in such a way to more completely or further define a target or operational endeavor at a higher fidelity. This paper builds on previous work developing innovative composite signatures associated with civil disasters, including physical, chemical and pattern/behavioral. For the composite signature approach to be successful it requires effective data fusion and visualization. This plays a key role in both preparedness and the response and recovery which are critical to saving lives. Visualization tools enhance the overall understanding of the crisis by pulling together and analyzing the data, and providing a clear and complete analysis of the information to the organizations/agencies dependant on it for a successful operation. An example of this, Freedom Web, is an easy-to-use data visualization and collaboration solution for use in homeland security, emergency preparedness, situational awareness, and event management. The solution provides a nationwide common operating picture for all levels of government through a web based, map interface. The tool was designed to be utilized by non-geospatial experts and is easily tailored to the specific needs of the users. Consisting of standard COTS and open source databases and a web server, users can view, edit, share, and highlight information easily and quickly through a standard internet browser.

  18. Modeling Small Noncanonical RNA Motifs with the Rosetta FARFAR Server.

    Science.gov (United States)

    Yesselman, Joseph D; Das, Rhiju

    2016-01-01

    Noncanonical RNA motifs help define the vast complexity of RNA structure and function, and in many cases, these loops and junctions are on the order of only ten nucleotides in size. Unfortunately, despite their small size, there is no reliable method to determine the ensemble of lowest energy structures of junctions and loops at atomic accuracy. This chapter outlines straightforward protocols using a webserver for Rosetta Fragment Assembly of RNA with Full Atom Refinement (FARFAR) ( http://rosie.rosettacommons.org/rna_denovo/submit ) to model the 3D structure of small noncanonical RNA motifs for use in visualizing motifs and for further refinement or filtering with experimental data such as NMR chemical shifts. PMID:27665600

  19. PMS6MC: A Multicore Algorithm for Motif Discovery

    Directory of Open Access Journals (Sweden)

    Shibdas Bandyopadhyay

    2013-11-01

    Full Text Available We develop an efficient multicore algorithm, PMS6MC, for the (l; d-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is currently the fastest single-core algorithm for motif discovery in large instances. The speedup, relative to PMS6, attained by our multicore algorithm ranges from a high of 6.62 for the (17,6 challenging instances to a low of 2.75 for the (13,4 challenging instances on an Intel 6-core system. We estimate that PMS6MC is 2 to 4 times faster than other parallel algorithms for motif search on large instances.

  20. Motifs in Triadic Random Graphs based on Steiner Triple Systems

    CERN Document Server

    Winkler, Marco

    2013-01-01

    Conventionally, pairwise relationships between nodes are considered to be the fundamental building blocks of complex networks. However, over the last decade the overabundance of certain sub-network patterns, so called motifs, has attracted high attention. It has been hypothesized, these motifs, instead of links, serve as the building blocks of network structures. Although the relation between a network's topology and the general properties of the system, such as its function, its robustness against perturbations, or its efficiency in spreading information is the central theme of network science, there is still a lack of sound generative models needed for testing the functional role of subgraph motifs. Our work aims to overcome this limitation. We employ the framework of exponential random graphs (ERGMs) to define novel models based on triadic substructures. The fact that only a small portion of triads can actually be set independently poses a challenge for the formulation of such models. To overcome this obst...

  1. How pathogens use linear motifs to perturb host cell networks

    KAUST Repository

    Via, Allegra

    2015-01-01

    Molecular mimicry is one of the powerful stratagems that pathogens employ to colonise their hosts and take advantage of host cell functions to guarantee their replication and dissemination. In particular, several viruses have evolved the ability to interact with host cell components through protein short linear motifs (SLiMs) that mimic host SLiMs, thus facilitating their internalisation and the manipulation of a wide range of cellular networks. Here we present convincing evidence from the literature that motif mimicry also represents an effective, widespread hijacking strategy in prokaryotic and eukaryotic parasites. Further insights into host motif mimicry would be of great help in the elucidation of the molecular mechanisms behind host cell invasion and the development of anti-infective therapeutic strategies.

  2. Selection against spurious promoter motifs correlates withtranslational efficiency across bacteria

    Energy Technology Data Exchange (ETDEWEB)

    Froula, Jeffrey L.; Francino, M. Pilar

    2007-05-01

    Because binding of RNAP to misplaced sites could compromise the efficiency of transcription, natural selection for the optimization of gene expression should regulate the distribution of DNA motifs capable of RNAP-binding across the genome. Here we analyze the distribution of the -10 promoter motifs that bind the {sigma}{sup 70} subunit of RNAP in 42 bacterial genomes. We show that selection on these motifs operates across the genome, maintaining an over-representation of -10 motifs in regulatory sequences while eliminating them from the nonfunctional and, in most cases, from the protein coding regions. In some genomes, however, -10 sites are over-represented in the coding sequences; these sites could induce pauses effecting regulatory roles throughout the length of a transcriptional unit. For nonfunctional sequences, the extent of motif under-representation varies across genomes in a manner that broadly correlates with the number of tRNA genes, a good indicator of translational speed and growth rate. This suggests that minimizing the time invested in gene transcription is an important selective pressure against spurious binding. However, selection against spurious binding is detectable in the reduced genomes of host-restricted bacteria that grow at slow rates, indicating that components of efficiency other than speed may also be important. Minimizing the number of RNAP molecules per cell required for transcription, and the corresponding energetic expense, may be most relevant in slow growers. These results indicate that genome-level properties affecting the efficiency of transcription and translation can respond in an integrated manner to optimize gene expression. The detection of selection against promoter motifs in nonfunctional regions also implies that no sequence may evolve free of selective constraints, at least in the relatively small and unstructured genomes of bacteria.

  3. Some results on more flexible versions of Graph Motif

    CERN Document Server

    Rizzi, Romeo

    2012-01-01

    The problems studied in this paper originate from Graph Motif, a problem introduced in 2006 in the context of biological networks. Informally speaking, it consists in deciding if a multiset of colors occurs in a connected subgraph of a vertex-colored graph. Due to the high rate of noise in the biological data, more flexible definitions of the problem have been outlined. We present in this paper two inapproximability results for two different optimization variants of Graph Motif. We also study another definition of the problem, when the connectivity constraint is replaced by modularity. While the problem stays NP-complete, it allows algorithms in FPT for biologically relevant parameterizations.

  4. Elliptic Curve Blind Digital Signature Schemes

    Institute of Scientific and Technical Information of China (English)

    YOULin; YANGYixian; WENQiaoyan

    2003-01-01

    Blind signature schemes are important cryptographic protocols in guaranteeing the privacy or anonymity of the users.Three new blind signature schemes and their corresponding generalizations are pro-posed. Moreover, their securities are simply analyzed.

  5. Blind Signature Scheme Based on Chebyshev Polynomials

    Directory of Open Access Journals (Sweden)

    Maheswara Rao Valluri

    2011-12-01

    Full Text Available A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete logarithms ofChebyshev polynomials.

  6. Positional bias of general and tissue-specific regulatory motifs in mouse gene promoters

    Directory of Open Access Journals (Sweden)

    Farré Domènec

    2007-12-01

    Full Text Available Abstract Background The arrangement of regulatory motifs in gene promoters, or promoter architecture, is the result of mutation and selection processes that have operated over many millions of years. In mammals, tissue-specific transcriptional regulation is related to the presence of specific protein-interacting DNA motifs in gene promoters. However, little is known about the relative location and spacing of these motifs. To fill this gap, we have performed a systematic search for motifs that show significant bias at specific promoter locations in a large collection of housekeeping and tissue-specific genes. Results We observe that promoters driving housekeeping gene expression are enriched in particular motifs with strong positional bias, such as YY1, which are of little relevance in promoters driving tissue-specific expression. We also identify a large number of motifs that show positional bias in genes expressed in a highly tissue-specific manner. They include well-known tissue-specific motifs, such as HNF1 and HNF4 motifs in liver, kidney and small intestine, or RFX motifs in testis, as well as many potentially novel regulatory motifs. Based on this analysis, we provide predictions for 559 tissue-specific motifs in mouse gene promoters. Conclusion The study shows that motif positional bias is an important feature of mammalian proximal promoters and that it affects both general and tissue-specific motifs. Motif positional constraints define very distinct promoter architectures depending on breadth of expression and type of tissue.

  7. Polarization signatures of airborne particulates

    Science.gov (United States)

    Raman, Prashant; Fuller, Kirk A.; Gregory, Don A.

    2013-07-01

    Exploratory research has been conducted with the aim of completely determining the polarization signatures of selected particulates as a function of wavelength. This may lead to a better understanding of the interaction between electromagnetic radiation and such materials, perhaps leading to the point detection of bio-aerosols present in the atmosphere. To this end, a polarimeter capable of measuring the complete Mueller matrix of highly scattering samples in transmission and reflection (with good spectral resolution from 300 to 1100 nm) has been developed. The polarization properties of Bacillus subtilis (surrogate for anthrax spore) are compared to ambient particulate matter species such as pollen, dust, and soot. Differentiating features in the polarization signatures of these samples have been identified, thus demonstrating the potential applicability of this technique for the detection of bio-aerosol in the ambient atmosphere.

  8. How curved membranes recruit amphipathic helices and protein anchoring motifs

    DEFF Research Database (Denmark)

    Hatzakis, Nikos; Bhatia, Vikram Kjøller; Larsen, Jannik;

    2009-01-01

    Lipids and several specialized proteins are thought to be able to sense the curvature of membranes (MC). Here we used quantitative fluorescence microscopy to measure curvature-selective binding of amphipathic motifs on single liposomes 50-700 nm in diameter. Our results revealed that sensing is p...

  9. Motifs in triadic random graphs based on Steiner triple systems

    Science.gov (United States)

    Winkler, Marco; Reichardt, Jörg

    2013-08-01

    Conventionally, pairwise relationships between nodes are considered to be the fundamental building blocks of complex networks. However, over the last decade, the overabundance of certain subnetwork patterns, i.e., the so-called motifs, has attracted much attention. It has been hypothesized that these motifs, instead of links, serve as the building blocks of network structures. Although the relation between a network's topology and the general properties of the system, such as its function, its robustness against perturbations, or its efficiency in spreading information, is the central theme of network science, there is still a lack of sound generative models needed for testing the functional role of subgraph motifs. Our work aims to overcome this limitation. We employ the framework of exponential random graph models (ERGMs) to define models based on triadic substructures. The fact that only a small portion of triads can actually be set independently poses a challenge for the formulation of such models. To overcome this obstacle, we use Steiner triple systems (STSs). These are partitions of sets of nodes into pair-disjoint triads, which thus can be specified independently. Combining the concepts of ERGMs and STSs, we suggest generative models capable of generating ensembles of networks with nontrivial triadic Z-score profiles. Further, we discover inevitable correlations between the abundance of triad patterns, which occur solely for statistical reasons and need to be taken into account when discussing the functional implications of motif statistics. Moreover, we calculate the degree distributions of our triadic random graphs analytically.

  10. Themes or Motifs? Aiming for Coherence through Interdisciplinary Outlines.

    Science.gov (United States)

    Barton, Keith C.; Smith Lynne A.

    2000-01-01

    Describes how "motif-units" undermine the potential benefits of integrated thematic instruction. Suggests replacing the term "thematic unit" with the concept of "interdisciplinary outline," which focus on meaningful content, authentic activities, students' needs, teacher mediation, and a variety of resources. Shows how one fourth-grade teacher…

  11. Linear motif atlas for phosphorylation-dependent signaling

    DEFF Research Database (Denmark)

    Miller, Martin Lee; Jensen, LJ; Diella, F;

    2008-01-01

    Systematic and quantitative analysis of protein phosphorylation is revealing dynamic regulatory networks underlying cellular responses to environmental cues. However, matching these sites to the kinases that phosphorylate them and the phosphorylation-dependent binding domains that may subsequently...... sequence models of linear motifs. The atlas is available as a community resource (http://netphorest.info)....

  12. Nonlinear control of magnetic signatures

    Science.gov (United States)

    Niemoczynski, Bogdan

    Magnetic properties of ferrite structures are known to cause fluctuations in Earth's magnetic field around the object. These fluctuations are known as the object's magnetic signature and are unique based on the object's geometry and material. It is a common practice to neutralize magnetic signatures periodically after certain time intervals, however there is a growing interest to develop real time degaussing systems for various applications. Development of real time degaussing system is a challenging problem because of magnetic hysteresis and difficulties in measurement or estimation of near-field flux data. The goal of this research is to develop a real time feedback control system that can be used to minimize magnetic signatures for ferrite structures. Experimental work on controlling the magnetic signature of a cylindrical steel shell structure with a magnetic disturbance provided evidence that the control process substantially increased the interior magnetic flux. This means near field estimation using interior sensor data is likely to be inaccurate. Follow up numerical work for rectangular and cylindrical cross sections investigated variations in shell wall flux density under a variety of ambient excitation and applied disturbances. Results showed magnetic disturbances could corrupt interior sensor data and magnetic shielding due to the shell walls makes the interior very sensitive to noise. The magnetic flux inside the shell wall showed little variation due to inner disturbances and its high base value makes it less susceptible to noise. This research proceeds to describe a nonlinear controller to use the shell wall data as an input. A nonlinear plant model of magnetics is developed using a constant tau to represent domain rotation lag and a gain function k to describe the magnetic hysteresis curve for the shell wall. The model is justified by producing hysteresis curves for multiple materials, matching experimental data using a particle swarm algorithm, and

  13. Quantum signatures of Chimera states

    OpenAIRE

    Bastidas, V. M.; Omelchenko, I.; ZAKHAROVA, A.; Schöll, E.; Brandes, T.

    2015-01-01

    Chimera states are complex spatiotemporal patterns in networks of identical oscillators, characterized by the coexistence of synchronized and desynchronized dynamics. Here we propose to extend the phenomenon of chimera states to the quantum regime, and uncover intriguing quantum signatures of these states. We calculate the quantum fluctuations about semiclassical trajectories and demonstrate that chimera states in the quantum regime can be characterized by bosonic squeezing, weighted quantum ...

  14. Robust RSA for Digital Signature

    OpenAIRE

    Virendra Kumar; Puran Krishen Koul

    2011-01-01

    The RSA cryptosystem is currently used in a wide variety of products, platforms, and industries around the world. It is found in many commercial software products and is planned to be in many more. In hardware, the RSA algorithm can be found in secure telephones, on ethernet network cards, and on smart cards.It offers encryption and digital signatures (authentication). In this paper we will illustrate the application and problem associated with RSA Algorithm.

  15. Variable structure motifs for transcription factor binding sites

    Directory of Open Access Journals (Sweden)

    Wernisch Lorenz

    2010-01-01

    Full Text Available Abstract Background Classically, models of DNA-transcription factor binding sites (TFBSs have been based on relatively few known instances and have treated them as sites of fixed length using position weight matrices (PWMs. Various extensions to this model have been proposed, most of which take account of dependencies between the bases in the binding sites. However, some transcription factors are known to exhibit some flexibility and bind to DNA in more than one possible physical configuration. In some cases this variation is known to affect the function of binding sites. With the increasing volume of ChIP-seq data available it is now possible to investigate models that incorporate this flexibility. Previous work on variable length models has been constrained by: a focus on specific zinc finger proteins in yeast using restrictive models; a reliance on hand-crafted models for just one transcription factor at a time; and a lack of evaluation on realistically sized data sets. Results We re-analysed binding sites from the TRANSFAC database and found motivating examples where our new variable length model provides a better fit. We analysed several ChIP-seq data sets with a novel motif search algorithm and compared the results to one of the best standard PWM finders and a recently developed alternative method for finding motifs of variable structure. All the methods performed comparably in held-out cross validation tests. Known motifs of variable structure were recovered for p53, Stat5a and Stat5b. In addition our method recovered a novel generalised version of an existing PWM for Sp1 that allows for variable length binding. This motif improved classification performance. Conclusions We have presented a new gapped PWM model for variable length DNA binding sites that is not too restrictive nor over-parameterised. Our comparison with existing tools shows that on average it does not have better predictive accuracy than existing methods. However, it does

  16. Enhance Confidentiality of Threshold Signature for MANET

    Institute of Scientific and Technical Information of China (English)

    GUO Wei; XIONG Zhongwei

    2006-01-01

    The participating wireless mobile node that mobile ad hoc network (MANET) communications need to forward may be malicious. That means not only adversary might be able to acquire some sensitive information of the threshold signatures from the compromised node, but also the partial signatures may be fabricated by malicious node, the advantages of threshold signatures would disappear. Signing and encrypting the sensitive information of the threshold signatures, and only the specified receiver can recover it, which will improve the confidentiality of threshold signatures. The security analysis shows the method is suitable for the secure characteristic of MANET that has the malicious nodes, and the message transmission is secure can against the attack.

  17. Comparison of MMW ground vehicle signatures

    Science.gov (United States)

    Saylor, Ph. D., Annie V.; Kissell, Ann

    2006-05-01

    A continuing question asked of MMW target signature and model providers is the applicability of data from one frequency band to another. Recent monopulse Ka-band ground target signature measurements made by US Army programs provide an opportunity to do an in-depth comparison of signatures of several ground vehicles. The vehicles measured correspond to those measured at W-band by another Army program. This paper provides a comparison of vehicle signatures produced by models derived by AMRDEC from the measurements. The results have implications for missile programs that do not have an extensive measurement budget but require target signatures and models for algorithm development.

  18. Signature Inversion in Odd-odd Nuclei

    Institute of Scientific and Technical Information of China (English)

    LIU Min-liang; ZHANG Yu-hu; ZHOU Xiao-hong; GUO Ying-xiang; LEI Xiang-guo; GUO Wen-tao

    2009-01-01

    Signature inversion in odd-odd nuclei is investigated by using a proton and a neutron coupling to the coherent state of the core.Two parameters are employed in the Hamiltonian to set the energy scales of rotation,neutron-proton coupling and their competition.Typical level staggering is extracted from the calculated level energies.The calculation can approximately reproduce experimental signature inversion.Signature inversion is attributed to the rotational motion and neutronproton residual interaction having reversed signature splitting rules.It is found signature inversion can appear at axially symmetric shape and high-K band.

  19. A New Signature Scheme with Shared Verification

    Institute of Scientific and Technical Information of China (English)

    JIA Xiao-yun; LUO Shou-shan; YUAN Chao-wei

    2006-01-01

    With expanding user demands, digital signature techniques are also being expanded greatly, from single signature and single verification techniques to techniques supporting multi-users. This paper presents a new digital signature scheme vith shared verification based on the fiat-shamir signature scheme. This scheme is suitable not only for digital signatures of one public key, but also for situations where multiple public keys are required. In addition, the scheme can resist all kinds of collusion, making it more practicable and safer. Additionally it is more efficient than other schemes.

  20. TopSig: Topology Preserving Document Signatures

    CERN Document Server

    Geva, Shlomo

    2012-01-01

    Performance comparisons between File Signatures and Inverted Files for text retrieval have previously shown several significant shortcomings of file signatures relative to inverted files. The inverted file approach underpins most state-of-the-art search engine algorithms, such as Language and Probabilistic models. It has been widely accepted that traditional file signatures are inferior alternatives to inverted files. This paper describes TopSig, a new approach to the construction of file signatures. Many advances in semantic hashing and dimensionality reduction have been made in recent times, but these were not so far linked to general purpose, signature file based, search engines. This paper introduces a different signature file approach that builds upon and extends these recent advances. We are able to demonstrate significant improvements in the performance of signature file based indexing and retrieval, performance that is comparable to that of state of the art inverted file based systems, including Langu...

  1. Provably secure robust threshold partial blind signature

    Institute of Scientific and Technical Information of China (English)

    CAO Zhenfu; ZHU Haojin; LU Rongxing

    2006-01-01

    Threshold digital signature and blind signature are playing important roles in cryptography as well as in practical applications such as e-cash and e-voting systems.Over the past few years, many cryptographic researchers have made considerable headway in this field. However, to our knowledge, most of existing threshold blind signature schemes are based on the discrete logarithm problem. In this paper, we propose a new robust threshold partial blind signature scheme based on improved RSA cryptosystem.This scheme is the first threshold partial blind signature scheme based on factoring, and the robustness of threshold partial blind signature is also introduced. Moreover, in practical application, the proposed scheme will be especially suitable for blind signature-based voting systems with multiple administrators and secure electronic cash systems to prevent their abuse.

  2. Certificateless universal designated verifier signature schemes

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Universal designated verifier signature schemes allows a signature holder to designate the signature to a desire designated verifier, in such a way that only designated verifier can verify this signature, but is unable to convince anyone else of this fact.The previous constructions of universal designated verifier signature rely on the underlying public key infrastructure, that needs both signers and verifiers to verify the authenticity of the public keys, and hence, the certificates are required.This article presents the first model and construction of the certificateless universal designated verifier signature scheme, in which the certificates are not needed.The proposed scheme satisfies all the requirements of the universal designated verifier signature in the certificateless system.Security proofs are provided for the scheme based on the random oracle model, assuming that the Bilinear diffie-hellman (BDH) problem is hard to solve.

  3. Composite motifs integrating multiple protein structures increase sensitivity for function prediction.

    Science.gov (United States)

    Chen, Brian Y; Bryant, Drew H; Cruess, Amanda E; Bylund, Joseph H; Fofanov, Viacheslav Y; Kristensen, David M; Kimmel, Marek; Lichtarge, Olivier; Kavraki, Lydia E

    2007-01-01

    The study of disease often hinges on the biological function of proteins, but determining protein function is a difficult experimental process. To minimize duplicated effort, algorithms for function prediction seek characteristics indicative of possible protein function. One approach is to identify substructural matches of geometric and chemical similarity between motifs representing known active sites and target protein structures with unknown function. In earlier work, statistically significant matches of certain effective motifs have identified functionally related active sites. Effective motifs must be carefully designed to maintain similarity to functionally related sites (sensitivity) and avoid incidental similarities to functionally unrelated protein geometry (specificity). Existing motif design techniques use the geometry of a single protein structure. Poor selection of this structure can limit motif effectiveness if the selected functional site lacks similarity to functionally related sites. To address this problem, this paper presents composite motifs, which combine structures of functionally related active sites to potentially increase sensitivity. Our experimentation compares the effectiveness of composite motifs with simple motifs designed from single protein structures. On six distinct families of functionally related proteins, leave-one-out testing showed that composite motifs had sensitivity comparable to the most sensitive of all simple motifs and specificity comparable to the average simple motif. On our data set, we observed that composite motifs simultaneously capture variations in active site conformation, diminish the problem of selecting motif structures, and enable the fusion of protein structures from diverse data sources. PMID:17951837

  4. FPGA implementation of motifs-based neuronal network and synchronization analysis

    Science.gov (United States)

    Deng, Bin; Zhu, Zechen; Yang, Shuangming; Wei, Xile; Wang, Jiang; Yu, Haitao

    2016-06-01

    Motifs in complex networks play a crucial role in determining the brain functions. In this paper, 13 kinds of motifs are implemented with Field Programmable Gate Array (FPGA) to investigate the relationships between the networks properties and motifs properties. We use discretization method and pipelined architecture to construct various motifs with Hindmarsh-Rose (HR) neuron as the node model. We also build a small-world network based on these motifs and conduct the synchronization analysis of motifs as well as the constructed network. We find that the synchronization properties of motif determine that of motif-based small-world network, which demonstrates effectiveness of our proposed hardware simulation platform. By imitation of some vital nuclei in the brain to generate normal discharges, our proposed FPGA-based artificial neuronal networks have the potential to replace the injured nuclei to complete the brain function in the treatment of Parkinson's disease and epilepsy.

  5. A Bioinformatics Approach for Detecting Repetitive Nested Motifs using Pattern Matching

    Science.gov (United States)

    Romero, José R.; Carballido, Jessica A.; Garbus, Ingrid; Echenique, Viviana C.; Ponzoni, Ignacio

    2016-01-01

    The identification of nested motifs in genomic sequences is a complex computational problem. The detection of these patterns is important to allow the discovery of transposable element (TE) insertions, incomplete reverse transcripts, deletions, and/or mutations. In this study, a de novo strategy for detecting patterns that represent nested motifs was designed based on exhaustive searches for pairs of motifs and combinatorial pattern analysis. These patterns can be grouped into three categories, motifs within other motifs, motifs flanked by other motifs, and motifs of large size. The methodology used in this study, applied to genomic sequences from the plant species Aegilops tauschii and Oryza sativa, revealed that it is possible to identify putative nested TEs by detecting these three types of patterns. The results were validated through BLAST alignments, which revealed the efficacy and usefulness of the new method, which is called Mamushka. PMID:27812277

  6. An Identity Based Aggregate Signature from Pairings

    Directory of Open Access Journals (Sweden)

    Yike Yu

    2011-04-01

    Full Text Available An aggregate signature is a useful digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, aggregate signature scheme is possible to aggregate all these signature into a single short signature. This single signature, along with the n original messages will convince any verifier that the n users did indeed sign the n original messages respectively (i.e., for i=1,...,n user i signed message  mi. In this paper, we propose an identity based aggregate signature scheme which requires constant pairing operations in the verification and the size of aggregate signature is independent of the number of signers. We prove that the proposed signature scheme is secure against existential forgery under adaptively chosen message and identity attack in the random oracle model assuming the intractability of the computational Diffie-Hellman problem.

  7. Genetic signatures of heroin addiction.

    Science.gov (United States)

    Chen, Shaw-Ji; Liao, Ding-Lieh; Shen, Tsu-Wang; Yang, Hsin-Chou; Chen, Kuang-Chi; Chen, Chia-Hsiang

    2016-08-01

    Heroin addiction is a complex psychiatric disorder with a chronic course and a high relapse rate, which results from the interaction between genetic and environmental factors. Heroin addiction has a substantial heritability in its etiology; hence, identification of individuals with a high genetic propensity to heroin addiction may help prevent the occurrence and relapse of heroin addiction and its complications. The study aimed to identify a small set of genetic signatures that may reliably predict the individuals with a high genetic propensity to heroin addiction. We first measured the transcript level of 13 genes (RASA1, PRKCB, PDK1, JUN, CEBPG, CD74, CEBPB, AUTS2, ENO2, IMPDH2, HAT1, MBD1, and RGS3) in lymphoblastoid cell lines in a sample of 124 male heroin addicts and 124 male control subjects using real-time quantitative PCR. Seven genes (PRKCB, PDK1, JUN, CEBPG, CEBPB, ENO2, and HAT1) showed significant differential expression between the 2 groups. Further analysis using 3 statistical methods including logistic regression analysis, support vector machine learning analysis, and a computer software BIASLESS revealed that a set of 4 genes (JUN, CEBPB, PRKCB, ENO2, or CEBPG) could predict the diagnosis of heroin addiction with the accuracy rate around 85% in our dataset. Our findings support the idea that it is possible to identify genetic signatures of heroin addiction using a small set of expressed genes. However, the study can only be considered as a proof-of-concept study. As the establishment of lymphoblastoid cell line is a laborious and lengthy process, it would be more practical in clinical settings to identify genetic signatures for heroin addiction directly from peripheral blood cells in the future study. PMID:27495086

  8. Genetic signatures of heroin addiction

    Science.gov (United States)

    Chen, Shaw-Ji; Liao, Ding-Lieh; Shen, Tsu-Wang; Yang, Hsin-Chou; Chen, Kuang-Chi; Chen, Chia-Hsiang

    2016-01-01

    Abstract Heroin addiction is a complex psychiatric disorder with a chronic course and a high relapse rate, which results from the interaction between genetic and environmental factors. Heroin addiction has a substantial heritability in its etiology; hence, identification of individuals with a high genetic propensity to heroin addiction may help prevent the occurrence and relapse of heroin addiction and its complications. The study aimed to identify a small set of genetic signatures that may reliably predict the individuals with a high genetic propensity to heroin addiction. We first measured the transcript level of 13 genes (RASA1, PRKCB, PDK1, JUN, CEBPG, CD74, CEBPB, AUTS2, ENO2, IMPDH2, HAT1, MBD1, and RGS3) in lymphoblastoid cell lines in a sample of 124 male heroin addicts and 124 male control subjects using real-time quantitative PCR. Seven genes (PRKCB, PDK1, JUN, CEBPG, CEBPB, ENO2, and HAT1) showed significant differential expression between the 2 groups. Further analysis using 3 statistical methods including logistic regression analysis, support vector machine learning analysis, and a computer software BIASLESS revealed that a set of 4 genes (JUN, CEBPB, PRKCB, ENO2, or CEBPG) could predict the diagnosis of heroin addiction with the accuracy rate around 85% in our dataset. Our findings support the idea that it is possible to identify genetic signatures of heroin addiction using a small set of expressed genes. However, the study can only be considered as a proof-of-concept study. As the establishment of lymphoblastoid cell line is a laborious and lengthy process, it would be more practical in clinical settings to identify genetic signatures for heroin addiction directly from peripheral blood cells in the future study. PMID:27495086

  9. Functional characterization of transcription factor motifs using cross-species comparison across large evolutionary distances

    OpenAIRE

    Jaebum Kim; Ryan Cunningham; Brian James; Stefan Wyder; Gibson, Joshua D.; Oliver Niehuis; Zdobnov, Evgeny M.; Hugh M Robertson; Robinson, Gene E.; Werren, John H; Saurabh Sinha

    2010-01-01

    We address the problem of finding statistically significant associations between cis-regulatory motifs and functional gene sets, in order to understand the biological roles of transcription factors. We develop a computational framework for this task, whose features include a new statistical score for motif scanning, the use of different scores for predicting targets of different motifs, and new ways to deal with redundancies among significant motif-function associations. This framework is app...

  10. Selection against spurious promoter motifs correlates with translational efficiency across bacteria

    OpenAIRE

    Froula, Jeffrey L.; M. Pilar Francino

    2008-01-01

    Because binding of RNAP to misplaced sites could compromise the efficiency of transcription, natural selection for the optimization of gene expression should regulate the distribution of DNA motifs capable of RNAP-binding across the genome. Here we analyze the distribution of the -10 promoter motifs that bind the sigma(70) subunit of RNAP in 42 bacterial genomes. We show that selection on these motifs operates across the genome, maintaining an over-representation of -10 motifs in regulatory s...

  11. RNAMotifScanX: a graph alignment approach for RNA structural motif identification

    OpenAIRE

    Zhong, Cuncong; Zhang, Shaojie

    2015-01-01

    RNA structural motifs are recurrent three-dimensional (3D) components found in the RNA architecture. These RNA structural motifs play important structural or functional roles and usually exhibit highly conserved 3D geometries and base-interaction patterns. Analysis of the RNA 3D structures and elucidation of their molecular functions heavily rely on efficient and accurate identification of these motifs. However, efficient RNA structural motif search tools are lacking due to the high complexit...

  12. SPIC: A novel similarity metric for comparing transcription factor binding site motifs based on information contents

    OpenAIRE

    Zhang, Shaoqiang; Zhou, Xiguo; Du, Chuanbin; Su, Zhengchang

    2013-01-01

    Background Discovering transcription factor binding sites (TFBS) is one of primary challenges to decipher complex gene regulatory networks encrypted in a genome. A set of short DNA sequences identified by a transcription factor (TF) is known as a motif, which can be expressed accurately in matrix form such as a position-specific scoring matrix (PSSM) and a position frequency matrix. Very frequently, we need to query a motif in a database of motifs by seeking its similar motifs, merge similar ...

  13. Quantum signatures of chimera states

    Science.gov (United States)

    Bastidas, V. M.; Omelchenko, I.; Zakharova, A.; Schöll, E.; Brandes, T.

    2015-12-01

    Chimera states are complex spatiotemporal patterns in networks of identical oscillators, characterized by the coexistence of synchronized and desynchronized dynamics. Here we propose to extend the phenomenon of chimera states to the quantum regime, and uncover intriguing quantum signatures of these states. We calculate the quantum fluctuations about semiclassical trajectories and demonstrate that chimera states in the quantum regime can be characterized by bosonic squeezing, weighted quantum correlations, and measures of mutual information. Our findings reveal the relation of chimera states to quantum information theory, and give promising directions for experimental realization of chimera states in quantum systems.

  14. Quantum broadcasting multiple blind signature with constant size

    Science.gov (United States)

    Xiao, Min; Li, Zhenli

    2016-06-01

    Using quantum homomorphic signature in quantum network, we propose a quantum broadcasting multiple blind signature scheme. Different from classical signature and current quantum signature schemes, the multi-signature proposed in our scheme is not generated by simply putting the individual signatures together, but by aggregating the individual signatures based on homomorphic property. Therefore, the size of the multi-signature is constant. Furthermore, based on a wide range of investigation for the security of existing quantum signature protocols, our protocol is designed to resist possible forgery attacks against signature and message from the various attack sources and disavowal attacks from participants.

  15. Quantum broadcasting multiple blind signature with constant size

    Science.gov (United States)

    Xiao, Min; Li, Zhenli

    2016-09-01

    Using quantum homomorphic signature in quantum network, we propose a quantum broadcasting multiple blind signature scheme. Different from classical signature and current quantum signature schemes, the multi-signature proposed in our scheme is not generated by simply putting the individual signatures together, but by aggregating the individual signatures based on homomorphic property. Therefore, the size of the multi-signature is constant. Furthermore, based on a wide range of investigation for the security of existing quantum signature protocols, our protocol is designed to resist possible forgery attacks against signature and message from the various attack sources and disavowal attacks from participants.

  16. A new motif for inhibitors of geranylgeranyl diphosphate synthase.

    Science.gov (United States)

    Foust, Benjamin J; Allen, Cheryl; Holstein, Sarah A; Wiemer, David F

    2016-08-15

    The enzyme geranylgeranyl diphosphate synthase (GGDPS) is believed to receive the substrate farnesyl diphosphate through one lipophilic channel and release the product geranylgeranyl diphosphate through another. Bisphosphonates with two isoprenoid chains positioned on the α-carbon have proven to be effective inhibitors of this enzyme. Now a new motif has been prepared with one isoprenoid chain on the α-carbon, a second included as a phosphonate ester, and the potential for a third at the α-carbon. The pivaloyloxymethyl prodrugs of several compounds based on this motif have been prepared and the resulting compounds have been tested for their ability to disrupt protein geranylgeranylation and induce cytotoxicity in myeloma cells. The initial biological studies reveal activity consistent with GGDPS inhibition, and demonstrate a structure-function relationship which is dependent on the nature of the alkyl group at the α-carbon. PMID:27338660

  17. Discovering sequence motifs in quantitative and qualitative pepetide data

    DEFF Research Database (Denmark)

    Andreatta, Massimo

    and interpret such data. The first paper in this thesis presents a new, publicly available method based on artificial neural networks that allows custom analysis of quantitative peptide data. The online NNAlign web-server provides a simple yet powerful tool for the discovery of sequence motifs in large...... of interactions in a single experiment, with virtually unlimited choice of potential targets and variants of these targets. However, the amount and complexity of data produced by high-throughput techniques poses serious challenges to researchers of limited bioinformatics expertise who need to analyze...... with the presence of multiple motifs, due to the experimental setup or the actual poly-specificity of the receptor, in peptide data. A new algorithm, based on Gibbs sampling, identifies multiple specificities by performing two tasks simultaneously: alignment and clustering of peptide data. The method, available...

  18. SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks

    NARCIS (Netherlands)

    Boyen, P.; Dyck, van D.; Neven, F.; Ham, van R.C.H.J.; Dijk, van A.D.J.

    2011-01-01

    Correlated motif mining (CMM) is the problem of finding overrepresented pairs of patterns, called motifs, in sequences of interacting proteins. Algorithmic solutions for CMM thereby provide a computational method for predicting binding sites for protein interaction. In this paper, we adopt a motif-d

  19. Distinct configurations of protein complexes and biochemical pathways revealed by epistatic interaction network motifs

    LENUS (Irish Health Repository)

    Casey, Fergal

    2011-08-22

    Abstract Background Gene and protein interactions are commonly represented as networks, with the genes or proteins comprising the nodes and the relationship between them as edges. Motifs, or small local configurations of edges and nodes that arise repeatedly, can be used to simplify the interpretation of networks. Results We examined triplet motifs in a network of quantitative epistatic genetic relationships, and found a non-random distribution of particular motif classes. Individual motif classes were found to be associated with different functional properties, suggestive of an underlying biological significance. These associations were apparent not only for motif classes, but for individual positions within the motifs. As expected, NNN (all negative) motifs were strongly associated with previously reported genetic (i.e. synthetic lethal) interactions, while PPP (all positive) motifs were associated with protein complexes. The two other motif classes (NNP: a positive interaction spanned by two negative interactions, and NPP: a negative spanned by two positives) showed very distinct functional associations, with physical interactions dominating for the former but alternative enrichments, typical of biochemical pathways, dominating for the latter. Conclusion We present a model showing how NNP motifs can be used to recognize supportive relationships between protein complexes, while NPP motifs often identify opposing or regulatory behaviour between a gene and an associated pathway. The ability to use motifs to point toward underlying biological organizational themes is likely to be increasingly important as more extensive epistasis mapping projects in higher organisms begin.

  20. Graph animals, subgraph sampling, and motif search in large networks

    Science.gov (United States)

    Baskerville, Kim; Grassberger, Peter; Paczuski, Maya

    2007-09-01

    We generalize a sampling algorithm for lattice animals (connected clusters on a regular lattice) to a Monte Carlo algorithm for “graph animals,” i.e., connected subgraphs in arbitrary networks. As with the algorithm in [N. Kashtan , Bioinformatics 20, 1746 (2004)], it provides a weighted sample, but the computation of the weights is much faster (linear in the size of subgraphs, instead of superexponential). This allows subgraphs with up to ten or more nodes to be sampled with very high statistics, from arbitrarily large networks. Using this together with a heuristic algorithm for rapidly classifying isomorphic graphs, we present results for two protein interaction networks obtained using the tandem affinity purification (TAP) method: one of Escherichia coli with 230 nodes and 695 links, and one for yeast (Saccharomyces cerevisiae) with roughly ten times more nodes and links. We find in both cases that most connected subgraphs are strong motifs ( Z scores >10 ) or antimotifs ( Z scores motifs in E. coli being (nearly) bipartite graphs and having many pairs of nodes that connect to the same neighbors, while dominant motifs in yeast tend towards completeness or contain large cliques. We also explore a number of methods that do not rely on measurements of Z scores or comparisons with null models. For instance, we discuss the influence of specific complexes like the 26S proteasome in yeast, where a small number of complexes dominate the k cores with large k and have a decisive effect on the strongest motifs with 6-8 nodes. We also present Zipf plots of counts versus rank. They show broad distributions that are not power laws, in contrast to the case when disconnected subgraphs are included.

  1. Exon silencing by UAGG motifs in response to neuronal excitation.

    Directory of Open Access Journals (Sweden)

    Ping An

    2007-02-01

    Full Text Available Alternative pre-mRNA splicing plays fundamental roles in neurons by generating functional diversity in proteins associated with the communication and connectivity of the synapse. The CI cassette of the NMDA R1 receptor is one of a variety of exons that show an increase in exon skipping in response to cell excitation, but the molecular nature of this splicing responsiveness is not yet understood. Here we investigate the molecular basis for the induced changes in splicing of the CI cassette exon in primary rat cortical cultures in response to KCl-induced depolarization using an expression assay with a tight neuron-specific readout. In this system, exon silencing in response to neuronal excitation was mediated by multiple UAGG-type silencing motifs, and transfer of the motifs to a constitutive exon conferred a similar responsiveness by gain of function. Biochemical analysis of protein binding to UAGG motifs in extracts prepared from treated and mock-treated cortical cultures showed an increase in nuclear hnRNP A1-RNA binding activity in parallel with excitation. Evidence for the role of the NMDA receptor and calcium signaling in the induced splicing response was shown by the use of specific antagonists, as well as cell-permeable inhibitors of signaling pathways. Finally, a wider role for exon-skipping responsiveness is shown to involve additional exons with UAGG-related silencing motifs, and transcripts involved in synaptic functions. These results suggest that, at the post-transcriptional level, excitable exons such as the CI cassette may be involved in strategies by which neurons mount adaptive responses to hyperstimulation.

  2. The ADAMTS (A Disintegrin and Metalloproteinase with Thrombospondin motifs) family

    OpenAIRE

    Kelwick, Richard; Desanlis, Ines; Wheeler, Grant N.; Edwards, Dylan R

    2015-01-01

    The ADAMTS (A Disintegrin and Metalloproteinase with Thrombospondin motifs) enzymes are secreted, multi-domain matrix-associated zinc metalloendopeptidases that have diverse roles in tissue morphogenesis and patho-physiological remodeling, in inflammation and in vascular biology. The human family includes 19 members that can be sub-grouped on the basis of their known substrates, namely the aggrecanases or proteoglycanases (ADAMTS1, 4, 5, 8, 9, 15 and 20), the procollagen N-propeptidases (ADAM...

  3. Defense-Inducing Volatiles: In Search of the Active Motif

    OpenAIRE

    Heil, Martin; Lion, Ulrich; Boland, Wilhelm

    2008-01-01

    Herbivore-induced volatile organic compounds (VOCs) are widely appreciated as an indirect defense mechanism since carnivorous arthropods use VOCs as cues for host localization and then attack herbivores. Another function of VOCs is plant–plant signaling. That VOCs elicit defensive responses in neighboring plants has been reported from various species, and different compounds have been found to be active. In order to search for a structural motif that characterizes active VOCs, we used lima be...

  4. A combinatorial code for splicing silencing: UAGG and GGGG motifs.

    Directory of Open Access Journals (Sweden)

    Kyoungha Han

    2005-05-01

    Full Text Available Alternative pre-mRNA splicing is widely used to regulate gene expression by tuning the levels of tissue-specific mRNA isoforms. Few regulatory mechanisms are understood at the level of combinatorial control despite numerous sequences, distinct from splice sites, that have been shown to play roles in splicing enhancement or silencing. Here we use molecular approaches to identify a ternary combination of exonic UAGG and 5'-splice-site-proximal GGGG motifs that functions cooperatively to silence the brain-region-specific CI cassette exon (exon 19 of the glutamate NMDA R1 receptor (GRIN1 transcript. Disruption of three components of the motif pattern converted the CI cassette into a constitutive exon, while predominant skipping was conferred when the same components were introduced, de novo, into a heterologous constitutive exon. Predominant exon silencing was directed by the motif pattern in the presence of six competing exonic splicing enhancers, and this effect was retained after systematically repositioning the two exonic UAGGs within the CI cassette. In this system, hnRNP A1 was shown to mediate silencing while hnRNP H antagonized silencing. Genome-wide computational analysis combined with RT-PCR testing showed that a class of skipped human and mouse exons can be identified by searches that preserve the sequence and spatial configuration of the UAGG and GGGG motifs. This analysis suggests that the multi-component silencing code may play an important role in the tissue-specific regulation of the CI cassette exon, and that it may serve more generally as a molecular language to allow for intricate adjustments and the coordination of splicing patterns from different genes.

  5. A motif-independent metric for DNA sequence specificity

    OpenAIRE

    Pinello Luca; Lo Bosco Giosuè; Hanlon Bret; Yuan Guo-Cheng

    2011-01-01

    Abstract Background Genome-wide mapping of protein-DNA interactions has been widely used to investigate biological functions of the genome. An important question is to what extent such interactions are regulated at the DNA sequence level. However, current investigation is hampered by the lack of computational methods for systematic evaluating sequence specificity. Results We present a simple, unbiased quantitative measure for DNA sequence specificity called the Motif Independent Measure (MIM)...

  6. Tricksters Trot to America: Areal Distribution of Folklore Motifs

    OpenAIRE

    Yuri Berezkin

    2010-01-01

    The folklore Trickster is usually considered a universally known combination of features intrinsic to human nature. However, there are strong anomalies in the areal distribution of such a figure. Sub-Saharan Africa, North America (except for the Arctic), Northeast Asia and South American Chaco not only are the preferred zones of tricksters’ activity but also share some peculiar trickster motifs unknown in most of the other regions. The range of animals which play the role of tricksters is als...

  7. Verifiable threshold signature schemes against conspiracy attack

    Institute of Scientific and Technical Information of China (English)

    GAN Yuan-ju(甘元驹)

    2004-01-01

    In this study, the author has designed new verifiable (t,n) threshold untraceable signature schemes. The proposed schemes have the following properties:(1) Verification: The shadows of the secret distributed by the trusted center can be verified by all of the participants;(2) Security: Even if the number of the dishonest member is over the value of the threshold, they cannot get the system secret parameters ,such as the group secret key, and forge other member's individual signature;(3) Efficient verification: The verifier can verify the group signature easily and the verification time of the group signature is equivalent to that of an individual signature; (4) Untraceability: The signers of the group signature cannot be traced.

  8. Verifiable threshold signature schemes against conspiracy attack

    Institute of Scientific and Technical Information of China (English)

    甘元驹

    2004-01-01

    In this study, the author has designed new verifiable (t, n) threshold untraceable signature schemes. The proposed schemes have the following properties: ( 1 ) Verification: The shadows of the secret distributed by the trusted center can be verified by all of the participants; (2) Security: Even if the number of the dishonest member is over the value of the threshold, they cannot get the system secret parameters , such as the group secret key, and forge other member's individual signature; (3) Efficient verification: The verifier can verify the group signature easily and the verification time of the group signature is equivalent to that of an individual signature; (4) Untraceability: The signers of the group signature cannot be traced.

  9. Event Networks and the Identification of Crime Pattern Motifs.

    Directory of Open Access Journals (Sweden)

    Toby Davies

    Full Text Available In this paper we demonstrate the use of network analysis to characterise patterns of clustering in spatio-temporal events. Such clustering is of both theoretical and practical importance in the study of crime, and forms the basis for a number of preventative strategies. However, existing analytical methods show only that clustering is present in data, while offering little insight into the nature of the patterns present. Here, we show how the classification of pairs of events as close in space and time can be used to define a network, thereby generalising previous approaches. The application of graph-theoretic techniques to these networks can then offer significantly deeper insight into the structure of the data than previously possible. In particular, we focus on the identification of network motifs, which have clear interpretation in terms of spatio-temporal behaviour. Statistical analysis is complicated by the nature of the underlying data, and we provide a method by which appropriate randomised graphs can be generated. Two datasets are used as case studies: maritime piracy at the global scale, and residential burglary in an urban area. In both cases, the same significant 3-vertex motif is found; this result suggests that incidents tend to occur not just in pairs, but in fact in larger groups within a restricted spatio-temporal domain. In the 4-vertex case, different motifs are found to be significant in each case, suggesting that this technique is capable of discriminating between clustering patterns at a finer granularity than previously possible.

  10. MAR characteristic motifs mediate episomal vector in CHO cells.

    Science.gov (United States)

    Lin, Yan; Li, Zhaoxi; Wang, Tianyun; Wang, Xiaoyin; Wang, Li; Dong, Weihua; Jing, Changqin; Yang, Xianjun

    2015-04-01

    An ideal gene therapy vector should enable persistent transgene expression without limitations in safety and reproducibility. Recent researches' insight into the ability of chromosomal matrix attachment regions (MARs) to mediate episomal maintenance of genetic elements allowed the development of a circular episomal vector. Although a MAR-mediated engineered vector has been developed, little is known on which motifs of MAR confer this function during interaction with the host genome. Here, we report an artificially synthesized DNA fragment containing only characteristic motif sequences that served as an alternative to human beta-interferon matrix attachment region sequence. The potential of the vector to mediate gene transfer in CHO cells was investigated. The short synthetic MAR motifs were found to mediate episomal vector at a low copy number for many generations without integration into the host genome. Higher transgene expression was maintained for at least 4 months. In addition, MAR was maintained episomally and conferred sustained EGFP expression even in nonselective CHO cells. All the results demonstrated that MAR characteristic sequence-based vector can function as stable episomes in CHO cells, supporting long-term and effective transgene expression.

  11. Motif structure and cooperation in real-world complex networks

    Science.gov (United States)

    Salehi, Mostafa; Rabiee, Hamid R.; Jalili, Mahdi

    2010-12-01

    Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties.

  12. Insertion of tetracysteine motifs into dopamine transporter extracellular domains.

    Directory of Open Access Journals (Sweden)

    Deanna M Navaroli

    Full Text Available The neuronal dopamine transporter (DAT is a major determinant of extracellular dopamine (DA levels and is the primary target for a variety of addictive and therapeutic psychoactive drugs. DAT is acutely regulated by protein kinase C (PKC activation and amphetamine exposure, both of which modulate DAT surface expression by endocytic trafficking. In order to use live imaging approaches to study DAT endocytosis, methods are needed to exclusively label the DAT surface pool. The use of membrane impermeant, sulfonated biarsenic dyes holds potential as one such approach, and requires introduction of an extracellular tetracysteine motif (tetraCys; CCPGCC to facilitate dye binding. In the current study, we took advantage of intrinsic proline-glycine (Pro-Gly dipeptides encoded in predicted DAT extracellular domains to introduce tetraCys motifs into DAT extracellular loops 2, 3, and 4. [(3H]DA uptake studies, surface biotinylation and fluorescence microscopy in PC12 cells indicate that tetraCys insertion into the DAT second extracellular loop results in a functional transporter that maintains PKC-mediated downregulation. Introduction of tetraCys into extracellular loops 3 and 4 yielded DATs with severely compromised function that failed to mature and traffic to the cell surface. This is the first demonstration of successful introduction of a tetracysteine motif into a DAT extracellular domain, and may hold promise for use of biarsenic dyes in live DAT imaging studies.

  13. Interlinking motifs and entropy landscapes of statistically interacting particles

    Directory of Open Access Journals (Sweden)

    P. Lu

    2012-03-01

    Full Text Available The s=1/2 Ising chain with uniform nearest-neighbor and next-nearest-neighbor coupling is used to construct a system of floating particles characterized by motifs of up to six consecutive local spins. The spin couplings cause the assembly of particles which, in turn, remain free of interaction energies even at high density. All microstates are configurations of particles from one of three different sets, excited from pseudo-vacua associated with ground states of periodicities one, two, and four. The motifs of particles and elements of pseudo-vacuum interlink in two shared site variables. The statistical interaction between particles is encoded in a generalized Pauli principle, describing how the placement of one particle modifies the options for placing further particles. In the statistical mechanical analysis arbitrary energies can be assigned to all particle species. The entropy is a function of the particle populations. The statistical interaction specifications are transparently built into that expression. The energies and structures of the particles alone govern the ordering at low temperature. Under special circumstances the particles can be replaced by more fundamental particles with shorter motifs that interlink in only one shared site variable. Structures emerge from interactions on two levels: particles with shapes from coupled spins and long-range ordering tendencies from statistically interacting particles with shapes.

  14. TOPDOM: database of conservatively located domains and motifs in proteins

    Science.gov (United States)

    Varga, Julia; Dobson, László; Tusnády, Gábor E.

    2016-01-01

    Summary: The TOPDOM database—originally created as a collection of domains and motifs located consistently on the same side of the membranes in α-helical transmembrane proteins—has been updated and extended by taking into consideration consistently localized domains and motifs in globular proteins, too. By taking advantage of the recently developed CCTOP algorithm to determine the type of a protein and predict topology in case of transmembrane proteins, and by applying a thorough search for domains and motifs as well as utilizing the most up-to-date version of all source databases, we managed to reach a 6-fold increase in the size of the whole database and a 2-fold increase in the number of transmembrane proteins. Availability and implementation: TOPDOM database is available at http://topdom.enzim.hu. The webpage utilizes the common Apache, PHP5 and MySQL software to provide the user interface for accessing and searching the database. The database itself is generated on a high performance computer. Contact: tusnady.gabor@ttk.mta.hu. Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27153630

  15. A Monte Carlo-based framework enhances the discovery and interpretation of regulatory sequence motifs

    Directory of Open Access Journals (Sweden)

    Seitzer Phillip

    2012-11-01

    Full Text Available Abstract Background Discovery of functionally significant short, statistically overrepresented subsequence patterns (motifs in a set of sequences is a challenging problem in bioinformatics. Oftentimes, not all sequences in the set contain a motif. These non-motif-containing sequences complicate the algorithmic discovery of motifs. Filtering the non-motif-containing sequences from the larger set of sequences while simultaneously determining the identity of the motif is, therefore, desirable and a non-trivial problem in motif discovery research. Results We describe MotifCatcher, a framework that extends the sensitivity of existing motif-finding tools by employing random sampling to effectively remove non-motif-containing sequences from the motif search. We developed two implementations of our algorithm; each built around a commonly used motif-finding tool, and applied our algorithm to three diverse chromatin immunoprecipitation (ChIP data sets. In each case, the motif finder with the MotifCatcher extension demonstrated improved sensitivity over the motif finder alone. Our approach organizes candidate functionally significant discovered motifs into a tree, which allowed us to make additional insights. In all cases, we were able to support our findings with experimental work from the literature. Conclusions Our framework demonstrates that additional processing at the sequence entry level can significantly improve the performance of existing motif-finding tools. For each biological data set tested, we were able to propose novel biological hypotheses supported by experimental work from the literature. Specifically, in Escherichia coli, we suggested binding site motifs for 6 non-traditional LexA protein binding sites; in Saccharomyces cerevisiae, we hypothesize 2 disparate mechanisms for novel binding sites of the Cse4p protein; and in Halobacterium sp. NRC-1, we discoverd subtle differences in a general transcription factor (GTF binding site motif

  16. Collider Signatures of Goldstone Bosons

    CERN Document Server

    Cheung, Kingman; Yuan, Tzu-Chiang

    2014-01-01

    Recently Weinberg suggested that Goldstone bosons arising from the spontaneous breakdown of some global hidden symmetries can interact weakly in the early Universe and account for a fraction of the effective number of neutrino species N_{eff}, which has been reported persistently 2\\sigma away from its expected value of three. In this work, we study in some details a number of experimental constraints on this interesting idea based on the simplest possibility of a global U(1), as studied by Weinberg. We work out the decay branching ratios of the associated light scalar field \\sigma and suggest a possible collider signature at the Large Hadron Collider (LHC). In some corners of the parameter space, the scalar field \\sigma can decay into a pair of pions with a branching ratio of order 10% while the rest is mostly a pair of Goldstone bosons. The collider signature would be gluon fusion into the standard model Higgs boson gg -> H followed by H -> \\sigma \\sigma -> (\\pi\\pi) (\\alpha\\alpha) where \\alpha is the Goldsto...

  17. Theoretical Characterizaiton of Visual Signatures

    Science.gov (United States)

    Kashinski, D. O.; Chase, G. M.; di Nallo, O. E.; Scales, A. N.; Vanderley, D. L.; Byrd, E. F. C.

    2015-05-01

    We are investigating the accuracy of theoretical models used to predict the visible, ultraviolet, and infrared spectra, as well as other properties, of product materials ejected from the muzzle of currently fielded systems. Recent advances in solid propellants has made the management of muzzle signature (flash) a principle issue in weapons development across the calibers. A priori prediction of the electromagnetic spectra of formulations will allow researchers to tailor blends that yield desired signatures and determine spectrographic detection ranges. Quantum chemistry methods at various levels of sophistication have been employed to optimize molecular geometries, compute unscaled vibrational frequencies, and determine the optical spectra of specific gas-phase species. Electronic excitations are being computed using Time Dependent Density Functional Theory (TD-DFT). A full statistical analysis and reliability assessment of computational results is currently underway. A comparison of theoretical results to experimental values found in the literature is used to assess any affects of functional choice and basis set on calculation accuracy. The status of this work will be presented at the conference. Work supported by the ARL, DoD HPCMP, and USMA.

  18. Narrow terahertz attenuation signatures in Bacillus thuringiensis.

    Science.gov (United States)

    Zhang, Weidong; Brown, Elliott R; Viveros, Leamon; Burris, Kellie P; Stewart, C Neal

    2014-10-01

    Terahertz absorption signatures from culture-cultivated Bacillus thuringiensis were measured with a THz photomixing spectrometer operating from 400 to 1200 GHz. We observe two distinct signatures centered at ∼955 and 1015 GHz, and attribute them to the optically coupled particle vibrational resonance (surface phonon-polariton) of Bacillus spores. This demonstrates the potential of the THz attenuation signatures as "fingerprints" for label-free biomolecular detection. PMID:23821459

  19. AN INSPECTION ON OFFLINE SIGNATURE AUTHENTICATION

    OpenAIRE

    Sapna Agrawal; Neelmani Verma

    2015-01-01

    In the era of emergent technology, security is that the foremost anxiety to avoid replicas and counterfeits. There are diverse Biometric systems that enable in personal identification, amongst those verification systems, one system is Signature Verification System. Signatures are substantiated discrimination on-line and offline systems. Every human being has their own writing style and hence their signature is used in the financial domain for identity verification. So it is necess...

  20. (Convertible) Undeniable Signatures Without Random Oracles

    Science.gov (United States)

    Yuen, Tsz Hon; Au, Man Ho; Liu, Joseph K.; Susilo, Willy

    We propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud.

  1. Mediated Certificateless Signature without Random Oracles

    Directory of Open Access Journals (Sweden)

    Minghui Zheng

    2011-08-01

    Full Text Available It is worthwhile challenges to deal with the key escrow problem and key revocation in identity-based signatures. We first introduce the notion of security-mediated certificateless signature scheme and proves the scheme in the standard model. The mediated certificateless public key cryptography not only provides a fast revocation with fine granularity but also overcomes the key escrow property which exists in ID-based signature. The scheme is provably secure without random oracles.

  2. Cryptoschemes Based on New Signature Formation Mechanism

    Directory of Open Access Journals (Sweden)

    A.A.Moldovyan

    2006-12-01

    Full Text Available Several variants of new digital signature schemes (DSS based on the discrete logarithm and factorization problems have been proposed. Considered DSS are characterized in that a novel mechanism of the signature generation is used, in which two parameters of the (k,S or (R,S signature are defined after solving a system of two congruences. In the case of composite modulus additional restrictions conditions have been introduced for selection of the public key.

  3. Narrow terahertz attenuation signatures in Bacillus thuringiensis.

    Science.gov (United States)

    Zhang, Weidong; Brown, Elliott R; Viveros, Leamon; Burris, Kellie P; Stewart, C Neal

    2014-10-01

    Terahertz absorption signatures from culture-cultivated Bacillus thuringiensis were measured with a THz photomixing spectrometer operating from 400 to 1200 GHz. We observe two distinct signatures centered at ∼955 and 1015 GHz, and attribute them to the optically coupled particle vibrational resonance (surface phonon-polariton) of Bacillus spores. This demonstrates the potential of the THz attenuation signatures as "fingerprints" for label-free biomolecular detection.

  4. On reliable discovery of molecular signatures

    Directory of Open Access Journals (Sweden)

    Björkegren Johan

    2009-01-01

    Full Text Available Abstract Background Molecular signatures are sets of genes, proteins, genetic variants or other variables that can be used as markers for a particular phenotype. Reliable signature discovery methods could yield valuable insight into cell biology and mechanisms of human disease. However, it is currently not clear how to control error rates such as the false discovery rate (FDR in signature discovery. Moreover, signatures for cancer gene expression have been shown to be unstable, that is, difficult to replicate in independent studies, casting doubts on their reliability. Results We demonstrate that with modern prediction methods, signatures that yield accurate predictions may still have a high FDR. Further, we show that even signatures with low FDR may fail to replicate in independent studies due to limited statistical power. Thus, neither stability nor predictive accuracy are relevant when FDR control is the primary goal. We therefore develop a general statistical hypothesis testing framework that for the first time provides FDR control for signature discovery. Our method is demonstrated to be correct in simulation studies. When applied to five cancer data sets, the method was able to discover molecular signatures with 5% FDR in three cases, while two data sets yielded no significant findings. Conclusion Our approach enables reliable discovery of molecular signatures from genome-wide data with current sample sizes. The statistical framework developed herein is potentially applicable to a wide range of prediction problems in bioinformatics.

  5. Institute of Geophysics, Planetary Physics, and Signatures

    Data.gov (United States)

    Federal Laboratory Consortium — The Institute of Geophysics, Planetary Physics, and Signatures at Los Alamos National Laboratory is committed to promoting and supporting high quality, cutting-edge...

  6. Secure Obfuscation for Encrypted Group Signatures.

    Directory of Open Access Journals (Sweden)

    Yang Shi

    Full Text Available In recent years, group signature techniques are widely used in constructing privacy-preserving security schemes for various information systems. However, conventional techniques keep the schemes secure only in normal black-box attack contexts. In other words, these schemes suppose that (the implementation of the group signature generation algorithm is running in a platform that is perfectly protected from various intrusions and attacks. As a complementary to existing studies, how to generate group signatures securely in a more austere security context, such as a white-box attack context, is studied in this paper. We use obfuscation as an approach to acquire a higher level of security. Concretely, we introduce a special group signature functionality-an encrypted group signature, and then provide an obfuscator for the proposed functionality. A series of new security notions for both the functionality and its obfuscator has been introduced. The most important one is the average-case secure virtual black-box property w.r.t. dependent oracles and restricted dependent oracles which captures the requirement of protecting the output of the proposed obfuscator against collision attacks from group members. The security notions fit for many other specialized obfuscators, such as obfuscators for identity-based signatures, threshold signatures and key-insulated signatures. Finally, the correctness and security of the proposed obfuscator have been proven. Thereby, the obfuscated encrypted group signature functionality can be applied to variants of privacy-preserving security schemes and enhance the security level of these schemes.

  7. A novel alignment-free method for comparing transcription factor binding site motifs.

    Directory of Open Access Journals (Sweden)

    Minli Xu

    Full Text Available BACKGROUND: Transcription factor binding site (TFBS motifs can be accurately represented by position frequency matrices (PFM or other equivalent forms. We often need to compare TFBS motifs using their PFMs in order to search for similar motifs in a motif database, or cluster motifs according to their binding preference. The majority of current methods for motif comparison involve a similarity metric for column-to-column comparison and a method to find the optimal position alignment between the two compared motifs. In some applications, alignment-free methods might be preferred; however, few such methods with high accuracy have been described. METHODOLOGY/PRINCIPAL FINDINGS: Here we describe a novel alignment-free method for quantifying the similarity of motifs using their PFMs by converting PFMs into k-mer vectors. The motifs could then be compared by measuring the similarity among their corresponding k-mer vectors. CONCLUSIONS/SIGNIFICANCE: We demonstrate that our method in general achieves similar performance or outperforms the existing methods for clustering motifs according to their binding preference and identifying similar motifs of transcription factors of the same family.

  8. A Novel Alignment-Free Method for Comparing Transcription Factor Binding Site Motifs

    Science.gov (United States)

    Xu, Minli; Su, Zhengchang

    2010-01-01

    Background Transcription factor binding site (TFBS) motifs can be accurately represented by position frequency matrices (PFM) or other equivalent forms. We often need to compare TFBS motifs using their PFMs in order to search for similar motifs in a motif database, or cluster motifs according to their binding preference. The majority of current methods for motif comparison involve a similarity metric for column-to-column comparison and a method to find the optimal position alignment between the two compared motifs. In some applications, alignment-free methods might be preferred; however, few such methods with high accuracy have been described. Methodology/Principal Findings Here we describe a novel alignment-free method for quantifying the similarity of motifs using their PFMs by converting PFMs into k-mer vectors. The motifs could then be compared by measuring the similarity among their corresponding k-mer vectors. Conclusions/Significance We demonstrate that our method in general achieves similar performance or outperforms the existing methods for clustering motifs according to their binding preference and identifying similar motifs of transcription factors of the same family. PMID:20098703

  9. Motif-based analysis of large nucleotide data sets using MEME-ChIP.

    Science.gov (United States)

    Ma, Wenxiu; Noble, William S; Bailey, Timothy L

    2014-01-01

    MEME-ChIP is a web-based tool for analyzing motifs in large DNA or RNA data sets. It can analyze peak regions identified by ChIP-seq, cross-linking sites identified by CLIP-seq and related assays, as well as sets of genomic regions selected using other criteria. MEME-ChIP performs de novo motif discovery, motif enrichment analysis, motif location analysis and motif clustering, providing a comprehensive picture of the DNA or RNA motifs that are enriched in the input sequences. MEME-ChIP performs two complementary types of de novo motif discovery: weight matrix-based discovery for high accuracy; and word-based discovery for high sensitivity. Motif enrichment analysis using DNA or RNA motifs from human, mouse, worm, fly and other model organisms provides even greater sensitivity. MEME-ChIP's interactive HTML output groups and aligns significant motifs to ease interpretation. This protocol takes less than 3 h, and it provides motif discovery approaches that are distinct and complementary to other online methods. PMID:24853928

  10. Leucine-based receptor sorting motifs are dependent on the spacing relative to the plasma membrane

    DEFF Research Database (Denmark)

    Geisler, C; Dietrich, J; Nielsen, B L;

    1998-01-01

    amino acid, is constitutively active. In this study, we have investigated how the spacing relative to the plasma membrane affects the function of both types of leucine-based motifs. For phosphorylation-dependent leucine-based motifs, a minimal spacing of 7 residues between the plasma membrane and the...... phospho-acceptor was required for phosphorylation and thereby activation of the motifs. For constitutively active leucine-based motifs, a minimal spacing of 6 residues between the plasma membrane and the acidic residue was required for optimal activity of the motifs. In addition, we found that the acidic......Many integral membrane proteins contain leucine-based motifs within their cytoplasmic domains that mediate internalization and intracellular sorting. Two types of leucine-based motifs have been identified. One type is dependent on phosphorylation, whereas the other type, which includes an acidic...

  11. Holographic signatures of cosmological singularities.

    Science.gov (United States)

    Engelhardt, Netta; Hertog, Thomas; Horowitz, Gary T

    2014-09-19

    To gain insight into the quantum nature of cosmological singularities, we study anisotropic Kasner solutions in gauge-gravity duality. The dual description of the bulk evolution towards the singularity involves N=4 super Yang-Mills theory on the expanding branch of deformed de Sitter space and is well defined. We compute two-point correlators of Yang-Mills operators of large dimensions using spacelike geodesics anchored on the boundary. The correlators show a strong signature of the singularity around horizon scales and decay at large boundary separation at different rates in different directions. More generally, the boundary evolution exhibits a process of particle creation similar to that in inflation. This leads us to conjecture that information on the quantum nature of cosmological singularities is encoded in long-wavelength features of the boundary wave function.

  12. Discriminative motif discovery in DNA and protein sequences using the DEME algorithm

    Directory of Open Access Journals (Sweden)

    Bailey Timothy L

    2007-10-01

    Full Text Available Abstract Background Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to increase the sensitivity and selectivity of motif discovery by utilizing a second set of sequences, and searching only for patterns that can differentiate the two sets of sequences. Potential applications of discriminative motif discovery include discovering transcription factor binding site motifs in ChIP-chip data and finding protein motifs involved in thermal stability using sets of orthologous proteins from thermophilic and mesophilic organisms. Results We describe DEME, a discriminative motif discovery algorithm for use with protein and DNA sequences. Input to DEME is two sets of sequences; a "positive" set and a "negative" set. DEME represents motifs using a probabilistic model, and uses a novel combination of global and local search to find the motif that optimally discriminates between the two sets of sequences. DEME is unique among discriminative motif finders in that it uses an informative Bayesian prior on protein motif columns, allowing it to incorporate prior knowledge of residue characteristics. We also introduce four, synthetic, discriminative motif discovery problems that are designed for evaluating discriminative motif finders in various biologically motivated contexts. We test DEME using these synthetic problems and on two biological problems: finding yeast transcription factor binding motifs in ChIP-chip data, and finding motifs that discriminate between groups of thermophilic and mesophilic orthologous proteins. Conclusion Using artificial data, we show that DEME is more effective than a non-discriminative approach when there are "decoy" motifs or when a variant of the motif is present in the "negative" sequences. With real data, we show that DEME is as good, but not better than non-discriminative algorithms at discovering yeast transcription

  13. 21 CFR 11.200 - Electronic signature components and controls.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 1 2010-04-01 2010-04-01 false Electronic signature components and controls. 11... SERVICES GENERAL ELECTRONIC RECORDS; ELECTRONIC SIGNATURES Electronic Signatures § 11.200 Electronic signature components and controls. (a) Electronic signatures that are not based upon biometrics shall:...

  14. Molecular signatures of thyroid follicular neoplasia

    DEFF Research Database (Denmark)

    Borup, R.; Rossing, M.; Henao, Ricardo;

    2010-01-01

    The molecular pathways leading to thyroid follicular neoplasia are incompletely understood, and the diagnosis of follicular tumors is a clinical challenge. To provide leads to the pathogenesis and diagnosis of the tumors, we examined the global transcriptome signatures of follicular thyroid carci...... and robust genetic signature for the diagnosis of FA and FC. Endocrine-Related Cancer (2010) 17 691-708...

  15. Arbitrated Quantum Signature protocol using EPR pairs

    Directory of Open Access Journals (Sweden)

    Jun Zhang

    2012-11-01

    Full Text Available Arbitrated signature provides that the signatory signs a message with his private key by quantum cryptography, while the signature receiver verifies the signature with the arbitrator’s assistance. In this work, security analysis was given to the arbitrated quantum signature (AQS and results showed that the receiver Bob and the attacker can forge the signature. Then this paper gives a new quantum one-time pads encryption method, which is suit for the quantum signature. At last, a new AQS protocol using Einstein-Podoisky-Rosen (EPR pairs is proposed. By using of  quantum key distribution (QKD and new quantum one-time pads, the new scheme can resist Shor’s attack. The new scheme has following advantages: (1 The scheme reduces the complexity of implementation and provides a higher efficiency in transmission; (2 Compares with some AQS schemes, the scheme can avoid being disavowed by the receiver; (3 Compares with other AQS schemes, the scheme also guarantees the arbitrator cannot forge the signature and it also ensure the receiver and other attacker cannot forge the signature.

  16. Analysis of signature wrapping attacks and countermeasures

    DEFF Research Database (Denmark)

    Gajek, Sebastian; Jensen, Meiko; Liao, Lijun;

    2009-01-01

    In recent research it turned out that Boolean verification, of digital signatures in the context of WSSecurity, is likely to fail: If parts of a SOAP message, are signed and the signature verification applied to, the whole document returns true, then nevertheless the, document may have been...

  17. Does Social Work Have a Signature Pedagogy?

    Science.gov (United States)

    Earls Larrison, Tara; Korr, Wynne S.

    2013-01-01

    This article contributes to discourse on signature pedagogy by reconceptualizing how our pedagogies are understood and defined for social work education. We critique the view that field education is social work's signature pedagogy and consider what pedagogies are distinct about the teaching and learning of social work. Using Shulman's…

  18. Prediction of soil effects on GPR signatures

    NARCIS (Netherlands)

    Rhebergen, J.B.; Lensen, H.A.; Wijk, C.V. van; Hendrickx, J.M.H.; Dam, R. van; Borchers, B.

    2004-01-01

    In previous work we have shown that GPR signatures are affected by soil texture and soil water content. In this contribution we will use a three dimensional electromagnetic model and a hydrological soil model to explore in more detail the relationships between GPR signatures, soil physical condition

  19. DNA nanotechnology based on i-motif structures.

    Science.gov (United States)

    Dong, Yuanchen; Yang, Zhongqiang; Liu, Dongsheng

    2014-06-17

    CONSPECTUS: Most biological processes happen at the nanometer scale, and understanding the energy transformations and material transportation mechanisms within living organisms has proved challenging. To better understand the secrets of life, researchers have investigated artificial molecular motors and devices over the past decade because such systems can mimic certain biological processes. DNA nanotechnology based on i-motif structures is one system that has played an important role in these investigations. In this Account, we summarize recent advances in functional DNA nanotechnology based on i-motif structures. The i-motif is a DNA quadruplex that occurs as four stretches of cytosine repeat sequences form C·CH(+) base pairs, and their stabilization requires slightly acidic conditions. This unique property has produced the first DNA molecular motor driven by pH changes. The motor is reliable, and studies show that it is capable of millisecond running speeds, comparable to the speed of natural protein motors. With careful design, the output of these types of motors was combined to drive micrometer-sized cantilevers bend. Using established DNA nanostructure assembly and functionalization methods, researchers can easily integrate the motor within other DNA assembled structures and functional units, producing DNA molecular devices with new functions such as suprahydrophobic/suprahydrophilic smart surfaces that switch, intelligent nanopores triggered by pH changes, molecular logic gates, and DNA nanosprings. Recently, researchers have produced motors driven by light and electricity, which have allowed DNA motors to be integrated within silicon-based nanodevices. Moreover, some devices based on i-motif structures have proven useful for investigating processes within living cells. The pH-responsiveness of the i-motif structure also provides a way to control the stepwise assembly of DNA nanostructures. In addition, because of the stability of the i-motif, this

  20. DNA nanotechnology based on i-motif structures.

    Science.gov (United States)

    Dong, Yuanchen; Yang, Zhongqiang; Liu, Dongsheng

    2014-06-17

    CONSPECTUS: Most biological processes happen at the nanometer scale, and understanding the energy transformations and material transportation mechanisms within living organisms has proved challenging. To better understand the secrets of life, researchers have investigated artificial molecular motors and devices over the past decade because such systems can mimic certain biological processes. DNA nanotechnology based on i-motif structures is one system that has played an important role in these investigations. In this Account, we summarize recent advances in functional DNA nanotechnology based on i-motif structures. The i-motif is a DNA quadruplex that occurs as four stretches of cytosine repeat sequences form C·CH(+) base pairs, and their stabilization requires slightly acidic conditions. This unique property has produced the first DNA molecular motor driven by pH changes. The motor is reliable, and studies show that it is capable of millisecond running speeds, comparable to the speed of natural protein motors. With careful design, the output of these types of motors was combined to drive micrometer-sized cantilevers bend. Using established DNA nanostructure assembly and functionalization methods, researchers can easily integrate the motor within other DNA assembled structures and functional units, producing DNA molecular devices with new functions such as suprahydrophobic/suprahydrophilic smart surfaces that switch, intelligent nanopores triggered by pH changes, molecular logic gates, and DNA nanosprings. Recently, researchers have produced motors driven by light and electricity, which have allowed DNA motors to be integrated within silicon-based nanodevices. Moreover, some devices based on i-motif structures have proven useful for investigating processes within living cells. The pH-responsiveness of the i-motif structure also provides a way to control the stepwise assembly of DNA nanostructures. In addition, because of the stability of the i-motif, this

  1. Security Weaknesses in Arbitrated Quantum Signature Protocols

    Science.gov (United States)

    Liu, Feng; Zhang, Kejia; Cao, Tianqing

    2014-01-01

    Arbitrated quantum signature (AQS) is a cryptographic scenario in which the sender (signer), Alice, generates the signature of a message and then a receiver (verifier), Bob, can verify the signature with the help of a trusted arbitrator, Trent. In this paper, we point out there exist some security weaknesses in two AQS protocols. Our analysis shows Alice can successfully disavow any of her signatures by a simple attack in the first protocol. Furthermore, we study the security weaknesses of the second protocol from the aspects of forgery and disavowal. Some potential improvements of this kind of protocols are given. We also design a new method to authenticate a signature or a message, which makes AQS protocols immune to Alice's disavowal attack and Bob's forgery attack effectively.

  2. Real time gamma-ray signature identifier

    Science.gov (United States)

    Rowland, Mark; Gosnell, Tom B.; Ham, Cheryl; Perkins, Dwight; Wong, James

    2012-05-15

    A real time gamma-ray signature/source identification method and system using principal components analysis (PCA) for transforming and substantially reducing one or more comprehensive spectral libraries of nuclear materials types and configurations into a corresponding concise representation/signature(s) representing and indexing each individual predetermined spectrum in principal component (PC) space, wherein an unknown gamma-ray signature may be compared against the representative signature to find a match or at least characterize the unknown signature from among all the entries in the library with a single regression or simple projection into the PC space, so as to substantially reduce processing time and computing resources and enable real-time characterization and/or identification.

  3. Robust Threshold Guillou-Quisquater Signature Scheme

    Institute of Scientific and Technical Information of China (English)

    WANG Hong; ZHANG Zhen-feng; FENG Deng-guo

    2005-01-01

    The deficiencies of the first threshold GuillouQuisquater signature scheme presented by Li-San Liu, ChengKang Chu and Wen-Guey Tzeng are analysised at first, and then a new threshold Guillou-Quisquater signature scheme is presented. The new scheme is unforgeable and robust against any adaptive adversary if the base Guillou-Quisquater signature scheme is unforgeable under the chosen message attack and computing the discrete logarithm modulo a prime is hard.This scheme can also achieve optimal resilience. However,the new scheme does not need the assumption that N is the product of two safe primes. The basic signature scheme underlying the new scheme is exactly Guillou-Quisquater signature scheme, and the additional strong computation assumption introduced by the first threshold Guillou-Quisquater scheme is weaken.

  4. An ECC-Based Blind Signature Scheme

    Directory of Open Access Journals (Sweden)

    Fuh-Gwo Jeng

    2010-08-01

    Full Text Available Cryptography is increasingly applied to the E-commerce world, especially to the untraceable payment system and the electronic voting system. Protocols for these systems strongly require the anonymous digital signature property, and thus a blind signature strategy is the answer to it. Chaum stated that every blind signature protocol should hold two fundamental properties, blindness and intractableness. All blind signature schemes proposed previously almost are based on the integer factorization problems, discrete logarithm problems, or the quadratic residues, which are shown by Lee et al. that none of the schemes is able to meet the two fundamental properties above. Therefore, an ECC-based blind signature scheme that possesses both the above properties is proposed in this paper.

  5. DIGITAL SIGNATURE IN THE WAY OF LAW

    Directory of Open Access Journals (Sweden)

    Ruya Samlı

    2013-01-01

    Full Text Available Signature can be defined as a person’s name or special signs that he/she writes when he/she wants to indicate he/she wrote or confirm that writing. A person signs many times in his/her life. A person’s signature that is used for thousands of times for many things from formal documents to exams has importance for that person. Especially, signing in legal operations is an operation that can build important results. If a person’s signature is imitated by another person, he/she can become beholden, donate his/her whole wealth, commits offences or do some judicial operations. Today, because many operations can be done with digital environments and internet, signature operation that provides identity validation must also be carried to digital environment. In this paper digital signature concept that is approved for this reason and its situation in international areas and Turkish laws are investigated.

  6. Secure Undeniable Threshold Proxy Signature Scheme

    Directory of Open Access Journals (Sweden)

    Sattar J. Aboud

    2014-01-01

    Full Text Available the threshold proxy signature scheme allows the original signer to delegate a signature authority to the proxy group to cooperatively sign message on behalf of an original signer. In this paper, we propose a new scheme which includes the features and benefits of the RSA scheme. Also, we will evaluate the security of undeniable threshold proxy signature scheme with known signers. We find that the existing threshold proxy scheme is insecure against the original signer forgery. In this paper, we show the cryptanalysis of an existed scheme. Additional, we propose the secure, undeniable and known signers threshold proxy signature scheme which answers the drawback of an existed scheme. We also demonstrate that a threshold proxy signature suffers from a conspiracy of an original signer and a secret share dealer, that the scheme is commonly forgeable, and cannot offer undeniable. We claim that the proposed scheme offers the undeniable characteristic.

  7. Sequence-based classification using discriminatory motif feature selection.

    Directory of Open Access Journals (Sweden)

    Hao Xiong

    Full Text Available Most existing methods for sequence-based classification use exhaustive feature generation, employing, for example, all k-mer patterns. The motivation behind such (enumerative approaches is to minimize the potential for overlooking important features. However, there are shortcomings to this strategy. First, practical constraints limit the scope of exhaustive feature generation to patterns of length ≤ k, such that potentially important, longer (> k predictors are not considered. Second, features so generated exhibit strong dependencies, which can complicate understanding of derived classification rules. Third, and most importantly, numerous irrelevant features are created. These concerns can compromise prediction and interpretation. While remedies have been proposed, they tend to be problem-specific and not broadly applicable. Here, we develop a generally applicable methodology, and an attendant software pipeline, that is predicated on discriminatory motif finding. In addition to the traditional training and validation partitions, our framework entails a third level of data partitioning, a discovery partition. A discriminatory motif finder is used on sequences and associated class labels in the discovery partition to yield a (small set of features. These features are then used as inputs to a classifier in the training partition. Finally, performance assessment occurs on the validation partition. Important attributes of our approach are its modularity (any discriminatory motif finder and any classifier can be deployed and its universality (all data, including sequences that are unaligned and/or of unequal length, can be accommodated. We illustrate our approach on two nucleosome occupancy datasets and a protein solubility dataset, previously analyzed using enumerative feature generation. Our method achieves excellent performance results, with and without optimization of classifier tuning parameters. A Python pipeline implementing the approach is

  8. Identification of imine reductase-specific sequence motifs.

    Science.gov (United States)

    Fademrecht, Silvia; Scheller, Philipp N; Nestl, Bettina M; Hauer, Bernhard; Pleiss, Jürgen

    2016-05-01

    Chiral amines are valuable building blocks for the production of a variety of pharmaceuticals, agrochemicals and other specialty chemicals. Only recently, imine reductases (IREDs) were discovered which catalyze the stereoselective reduction of imines to chiral amines. Although several IREDs were biochemically characterized in the last few years, knowledge of the reaction mechanism and the molecular basis of substrate specificity and stereoselectivity is limited. To gain further insights into the sequence-function relationships, the Imine Reductase Engineering Database (www.IRED.BioCatNet.de) was established and a systematic analysis of 530 putative IREDs was performed. A standard numbering scheme based on R-IRED-Sk was introduced to facilitate the identification and communication of structurally equivalent positions in different proteins. A conservation analysis revealed a highly conserved cofactor binding region and a predominantly hydrophobic substrate binding cleft. Two IRED-specific motifs were identified, the cofactor binding motif GLGxMGx5 [ATS]x4 Gx4 [VIL]WNR[TS]x2 [KR] and the active site motif Gx[DE]x[GDA]x[APS]x3 {K}x[ASL]x[LMVIAG]. Our results indicate a preference toward NADPH for all IREDs and explain why, despite their sequence similarity to β-hydroxyacid dehydrogenases (β-HADs), no conversion of β-hydroxyacids has been observed. Superfamily-specific conservations were investigated to explore the molecular basis of their stereopreference. Based on our analysis and previous experimental results on IRED mutants, an exclusive role of standard position 187 for stereoselectivity is excluded. Alternatively, two standard positions 139 and 194 were identified which are superfamily-specifically conserved and differ in R- and S-selective enzymes. Proteins 2016; 84:600-610. © 2016 Wiley Periodicals, Inc. PMID:26857686

  9. Short sequence motifs, overrepresented in mammalian conservednon-coding sequences

    Energy Technology Data Exchange (ETDEWEB)

    Minovitsky, Simon; Stegmaier, Philip; Kel, Alexander; Kondrashov,Alexey S.; Dubchak, Inna

    2007-02-21

    Background: A substantial fraction of non-coding DNAsequences of multicellular eukaryotes is under selective constraint. Inparticular, ~;5 percent of the human genome consists of conservednon-coding sequences (CNSs). CNSs differ from other genomic sequences intheir nucleotide composition and must play important functional roles,which mostly remain obscure.Results: We investigated relative abundancesof short sequence motifs in all human CNSs present in the human/mousewhole-genome alignments vs. three background sets of sequences: (i)weakly conserved or unconserved non-coding sequences (non-CNSs); (ii)near-promoter sequences (located between nucleotides -500 and -1500,relative to a start of transcription); and (iii) random sequences withthe same nucleotide composition as that of CNSs. When compared tonon-CNSs and near-promoter sequences, CNSs possess an excess of AT-richmotifs, often containing runs of identical nucleotides. In contrast, whencompared to random sequences, CNSs contain an excess of GC-rich motifswhich, however, lack CpG dinucleotides. Thus, abundance of short sequencemotifs in human CNSs, taken as a whole, is mostly determined by theiroverall compositional properties and not by overrepresentation of anyspecific short motifs. These properties are: (i) high AT-content of CNSs,(ii) a tendency, probably due to context-dependent mutation, of A's andT's to clump, (iii) presence of short GC-rich regions, and (iv) avoidanceof CpG contexts, due to their hypermutability. Only a small number ofshort motifs, overrepresented in all human CNSs are similar to bindingsites of transcription factors from the FOX family.Conclusion: Human CNSsas a whole appear to be too broad a class of sequences to possess strongfootprints of any short sequence-specific functions. Such footprintsshould be studied at the level of functional subclasses of CNSs, such asthose which flank genes with a particular pattern of expression. Overallproperties of CNSs are affected by

  10. Tricksters Trot to America: Areal Distribution of Folklore Motifs

    Directory of Open Access Journals (Sweden)

    Yuri Berezkin

    2010-12-01

    Full Text Available The folklore Trickster is usually considered a universally known combination of features intrinsic to human nature. However, there are strong anomalies in the areal distribution of such a figure. Sub-Saharan Africa, North America (except for the Arctic, Northeast Asia and South American Chaco not only are the preferred zones of tricksters’ activity but also share some peculiar trickster motifs unknown in most of the other regions. The range of animals which play the role of tricksters is also restricted and not always easily explained, E.g. the Hare and Spider, known in both Africa and North America, are neither “mediators” between life and death (suggested by C. Lévi-Strauss for Coyote nor “really tricky” (“materialistic” hypothesis of M. Harris. The set of trickster motifs and the zoo- or anthropomorphic impersonations of the Trickster are independentvariables. The same episodes are easily linked to different tricksters while every trickster usually attracts episodes characteristic of a particular region. Though the original emergence of Trickster as a mental construct can indeed be rooted in human psychology (and where else?, the distribution of tricksters in folklore is discretionary and depends of many uncertain, i.e. chance, factors. The wide spread or lack of tricksters in certain cultural areas hardly reflect any fundamental differences in the psychology of inhabitants of these regions. The study of trickster motifs, just as of any other folklore motifs, helps us reconstruct possible historic links between populations. The African – North American links remain enigmatic (independent emergence is possible but slight historicallinks cannot be completely excluded but the parallels between (Western and Northeast Siberian – North American tricksters are almost certainly due to former cultural ties across Northern Asia. Another interesting case is the proliferation of tricksters with different zoomorphic and other identities

  11. Present status of quinoxaline motifs: excellent pathfinders in therapeutic medicine.

    Science.gov (United States)

    Ajani, Olayinka Oyewale

    2014-10-01

    Quinoxalines belong to a class of excellent heterocyclic scaffolds owing to their wide biological properties and diverse therapeutic applications in medicinal research. They are complementary in shapes and charges to numerous biomolecules they interact with, thereby resulting in increased binding affinity. The pharmacokinetic properties of drugs bearing quinoxaline cores have shown them to be relatively easy to administer either as intramuscular solutions, oral capsules or rectal suppositories. This work deals with recent advances in the synthesis and pharmacological diversities of quinoxaline motifs which might pave ways for novel drugs development.

  12. Nucleic Acid i-Motif Structures in Analytical Chemistry.

    Science.gov (United States)

    Alba, Joan Josep; Sadurní, Anna; Gargallo, Raimundo

    2016-09-01

    Under the appropriate experimental conditions of pH and temperature, cytosine-rich segments in DNA or RNA sequences may produce a characteristic folded structure known as an i-motif. Besides its potential role in vivo, which is still under investigation, this structure has attracted increasing interest in other fields due to its sharp, fast and reversible pH-driven conformational changes. This "on/off" switch at molecular level is being used in nanotechnology and analytical chemistry to develop nanomachines and sensors, respectively. This paper presents a review of the latest applications of this structure in the field of chemical analysis.

  13. Real Time Motif Classification from Database Using Intelligent Algorithms

    Directory of Open Access Journals (Sweden)

    Paresh Kotak

    2012-12-01

    Full Text Available The amount of raw data being accumulated in the databases is increasing at an inconceivable rate.However, these data-rich databases are poor in providing substantial information. This is where datamining comes into picture. Specifically, data mining is "the process of extracting or mining informationfrom large amount of data". Motif classification has been an active area of research in data mining. Itconsists of assigning a data instance to one of the predefined classes/groups based upon the knowledgegained from previously seen (classified data.

  14. Recurrent signature patterns in HIV-1 B clade envelope glycoproteins associated with either early or chronic infections.

    Directory of Open Access Journals (Sweden)

    S Gnanakaran

    2011-09-01

    Full Text Available Here we have identified HIV-1 B clade Envelope (Env amino acid signatures from early in infection that may be favored at transmission, as well as patterns of recurrent mutation in chronic infection that may reflect common pathways of immune evasion. To accomplish this, we compared thousands of sequences derived by single genome amplification from several hundred individuals that were sampled either early in infection or were chronically infected. Samples were divided at the outset into hypothesis-forming and validation sets, and we used phylogenetically corrected statistical strategies to identify signatures, systematically scanning all of Env. Signatures included single amino acids, glycosylation motifs, and multi-site patterns based on functional or structural groupings of amino acids. We identified signatures near the CCR5 co-receptor-binding region, near the CD4 binding site, and in the signal peptide and cytoplasmic domain, which may influence Env expression and processing. Two signatures patterns associated with transmission were particularly interesting. The first was the most statistically robust signature, located in position 12 in the signal peptide. The second was the loss of an N-linked glycosylation site at positions 413-415; the presence of this site has been recently found to be associated with escape from potent and broad neutralizing antibodies, consistent with enabling a common pathway for immune escape during chronic infection. Its recurrent loss in early infection suggests it may impact fitness at the time of transmission or during early viral expansion. The signature patterns we identified implicate Env expression levels in selection at viral transmission or in early expansion, and suggest that immune evasion patterns that recur in many individuals during chronic infection when antibodies are present can be selected against when the infection is being established prior to the adaptive immune response.

  15. Finding a Leucine in a Haystack: Searching the Proteome for ambigous Leucine-Aspartic Acid motifs

    KAUST Repository

    Arold, Stefan T.

    2016-01-25

    Leucine-aspartic acid (LD) motifs are short helical protein-protein interaction motifs involved in cell motility, survival and communication. LD motif interactions are also implicated in cancer metastasis and are targeted by several viruses. LD motifs are notoriously difficult to detect because sequence pattern searches lead to an excessively high number of false positives. Hence, despite 20 years of research, only six LD motif–containing proteins are known in humans, three of which are close homologues of the paxillin family. To enable the proteome-wide discovery of LD motifs, we developed LD Motif Finder (LDMF), a web tool based on machine learning that combines sequence information with structural predictions to detect LD motifs with high accuracy. LDMF predicted 13 new LD motifs in humans. Using biophysical assays, we experimentally confirmed in vitro interactions for four novel LD motif proteins. Thus, LDMF allows proteome-wide discovery of LD motifs, despite a highly ambiguous sequence pattern. Functional implications will be discussed.

  16. Automated protein motif generation in the structure-based protein function prediction tool ProMOL.

    Science.gov (United States)

    Osipovitch, Mikhail; Lambrecht, Mitchell; Baker, Cameron; Madha, Shariq; Mills, Jeffrey L; Craig, Paul A; Bernstein, Herbert J

    2015-12-01

    ProMOL, a plugin for the PyMOL molecular graphics system, is a structure-based protein function prediction tool. ProMOL includes a set of routines for building motif templates that are used for screening query structures for enzyme active sites. Previously, each motif template was generated manually and required supervision in the optimization of parameters for sensitivity and selectivity. We developed an algorithm and workflow for the automation of motif building and testing routines in ProMOL. The algorithm uses a set of empirically derived parameters for optimization and requires little user intervention. The automated motif generation algorithm was first tested in a performance comparison with a set of manually generated motifs based on identical active sites from the same 112 PDB entries. The two sets of motifs were equally effective in identifying alignments with homologs and in rejecting alignments with unrelated structures. A second set of 296 active site motifs were generated automatically, based on Catalytic Site Atlas entries with literature citations, as an expansion of the library of existing manually generated motif templates. The new motif templates exhibited comparable performance to the existing ones in terms of hit rates against native structures, homologs with the same EC and Pfam designations, and randomly selected unrelated structures with a different EC designation at the first EC digit, as well as in terms of RMSD values obtained from local structural alignments of motifs and query structures. This research is supported by NIH grant GM078077. PMID:26573864

  17. Motif Discovery in Tissue-Specific Regulatory Sequences Using Directed Information

    Directory of Open Access Journals (Sweden)

    James Douglas Engel

    2007-12-01

    Full Text Available Motif discovery for the identification of functional regulatory elements underlying gene expression is a challenging problem. Sequence inspection often leads to discovery of novel motifs (including transcription factor sites with previously uncharacterized function in gene expression. Coupled with the complexity underlying tissue-specific gene expression, there are several motifs that are putatively responsible for expression in a certain cell type. This has important implications in understanding fundamental biological processes such as development and disease progression. In this work, we present an approach to the identification of motifs (not necessarily transcription factor sites and examine its application to some questions in current bioinformatics research. These motifs are seen to discriminate tissue-specific gene promoter or regulatory regions from those that are not tissue-specific. There are two main contributions of this work. Firstly, we propose the use of directed information for such classification constrained motif discovery, and then use the selected features with a support vector machine (SVM classifier to find the tissue specificity of any sequence of interest. Such analysis yields several novel interesting motifs that merit further experimental characterization. Furthermore, this approach leads to a principled framework for the prospective examination of any chosen motif to be discriminatory motif for a group of coexpressed/coregulated genes, thereby integrating sequence and expression perspectives. We hypothesize that the discovery of these motifs would enable the large-scale investigation for the tissue-specific regulatory role of any conserved sequence element identified from genome-wide studies.

  18. Motif Discovery in Tissue-Specific Regulatory Sequences Using Directed Information

    Directory of Open Access Journals (Sweden)

    States David

    2007-01-01

    Full Text Available Motif discovery for the identification of functional regulatory elements underlying gene expression is a challenging problem. Sequence inspection often leads to discovery of novel motifs (including transcription factor sites with previously uncharacterized function in gene expression. Coupled with the complexity underlying tissue-specific gene expression, there are several motifs that are putatively responsible for expression in a certain cell type. This has important implications in understanding fundamental biological processes such as development and disease progression. In this work, we present an approach to the identification of motifs (not necessarily transcription factor sites and examine its application to some questions in current bioinformatics research. These motifs are seen to discriminate tissue-specific gene promoter or regulatory regions from those that are not tissue-specific. There are two main contributions of this work. Firstly, we propose the use of directed information for such classification constrained motif discovery, and then use the selected features with a support vector machine (SVM classifier to find the tissue specificity of any sequence of interest. Such analysis yields several novel interesting motifs that merit further experimental characterization. Furthermore, this approach leads to a principled framework for the prospective examination of any chosen motif to be discriminatory motif for a group of coexpressed/coregulated genes, thereby integrating sequence and expression perspectives. We hypothesize that the discovery of these motifs would enable the large-scale investigation for the tissue-specific regulatory role of any conserved sequence element identified from genome-wide studies.

  19. Maximizing biomarker discovery by minimizing gene signatures

    Directory of Open Access Journals (Sweden)

    Chang Chang

    2011-12-01

    Full Text Available Abstract Background The use of gene signatures can potentially be of considerable value in the field of clinical diagnosis. However, gene signatures defined with different methods can be quite various even when applied the same disease and the same endpoint. Previous studies have shown that the correct selection of subsets of genes from microarray data is key for the accurate classification of disease phenotypes, and a number of methods have been proposed for the purpose. However, these methods refine the subsets by only considering each single feature, and they do not confirm the association between the genes identified in each gene signature and the phenotype of the disease. We proposed an innovative new method termed Minimize Feature's Size (MFS based on multiple level similarity analyses and association between the genes and disease for breast cancer endpoints by comparing classifier models generated from the second phase of MicroArray Quality Control (MAQC-II, trying to develop effective meta-analysis strategies to transform the MAQC-II signatures into a robust and reliable set of biomarker for clinical applications. Results We analyzed the similarity of the multiple gene signatures in an endpoint and between the two endpoints of breast cancer at probe and gene levels, the results indicate that disease-related genes can be preferably selected as the components of gene signature, and that the gene signatures for the two endpoints could be interchangeable. The minimized signatures were built at probe level by using MFS for each endpoint. By applying the approach, we generated a much smaller set of gene signature with the similar predictive power compared with those gene signatures from MAQC-II. Conclusions Our results indicate that gene signatures of both large and small sizes could perform equally well in clinical applications. Besides, consistency and biological significances can be detected among different gene signatures, reflecting the

  20. Transduction motif analysis of gastric cancer based on a human signaling network

    Energy Technology Data Exchange (ETDEWEB)

    Liu, G.; Li, D.Z.; Jiang, C.S.; Wang, W. [Fuzhou General Hospital of Nanjing Command, Department of Gastroenterology, Fuzhou, China, Department of Gastroenterology, Fuzhou General Hospital of Nanjing Command, Fuzhou (China)

    2014-04-04

    To investigate signal regulation models of gastric cancer, databases and literature were used to construct the signaling network in humans. Topological characteristics of the network were analyzed by CytoScape. After marking gastric cancer-related genes extracted from the CancerResource, GeneRIF, and COSMIC databases, the FANMOD software was used for the mining of gastric cancer-related motifs in a network with three vertices. The significant motif difference method was adopted to identify significantly different motifs in the normal and cancer states. Finally, we conducted a series of analyses of the significantly different motifs, including gene ontology, function annotation of genes, and model classification. A human signaling network was constructed, with 1643 nodes and 5089 regulating interactions. The network was configured to have the characteristics of other biological networks. There were 57,942 motifs marked with gastric cancer-related genes out of a total of 69,492 motifs, and 264 motifs were selected as significantly different motifs by calculating the significant motif difference (SMD) scores. Genes in significantly different motifs were mainly enriched in functions associated with cancer genesis, such as regulation of cell death, amino acid phosphorylation of proteins, and intracellular signaling cascades. The top five significantly different motifs were mainly cascade and positive feedback types. Almost all genes in the five motifs were cancer related, including EPOR, MAPK14, BCL2L1, KRT18, PTPN6, CASP3, TGFBR2, AR, and CASP7. The development of cancer might be curbed by inhibiting signal transductions upstream and downstream of the selected motifs.

  1. A motif for reversible nitric oxide interactions in metalloenzymes.

    Science.gov (United States)

    Zhang, Shiyu; Melzer, Marie M; Sen, S Nermin; Çelebi-Ölçüm, Nihan; Warren, Timothy H

    2016-07-01

    Nitric oxide (NO) participates in numerous biological processes, such as signalling in the respiratory system and vasodilation in the cardiovascular system. Many metal-mediated processes involve direct reaction of NO to form a metal-nitrosyl (M-NO), as occurs at the Fe(2+) centres of soluble guanylate cyclase or cytochrome c oxidase. However, some copper electron-transfer proteins that bear a type 1 Cu site (His2Cu-Cys) reversibly bind NO by an unknown motif. Here, we use model complexes of type 1 Cu sites based on tris(pyrazolyl)borate copper thiolates [Cu(II)]-SR to unravel the factors involved in NO reactivity. Addition of NO provides the fully characterized S-nitrosothiol adduct [Cu(I)](κ(1)-N(O)SR), which reversibly loses NO on purging with an inert gas. Computational analysis outlines a low-barrier pathway for the capture and release of NO. These findings suggest a new motif for reversible binding of NO at bioinorganic metal centres that can interconvert NO and RSNO molecular signals at copper sites. PMID:27325092

  2. Graph animals, subgraph sampling and motif search in large networks

    CERN Document Server

    Baskerville, Kim; Paczuski, Maya

    2007-01-01

    We generalize a sampling algorithm for lattice animals (connected clusters on a regular lattice) to a Monte Carlo algorithm for `graph animals', i.e. connected subgraphs in arbitrary networks. As with the algorithm in [N. Kashtan et al., Bioinformatics 20, 1746 (2004)], it provides a weighted sample, but the computation of the weights is much faster (linear in the size of subgraphs, instead of super-exponential). This allows subgraphs with up to ten or more nodes to be sampled with very high statistics, from arbitrarily large networks. Using this together with a heuristic algorithm for rapidly classifying isomorphic graphs, we present results for two protein interaction networks obtained using the TAP high throughput method: one of Escherichia coli with 230 nodes and 695 links, and one for yeast (Saccharomyces cerevisiae) with roughly ten times more nodes and links. We find in both cases that most connected subgraphs are strong motifs (Z-scores >10) or anti-motifs (Z-scores <-10) when the null model is the...

  3. The Origin of Motif Families in Food Webs

    CERN Document Server

    Klaise, Janis

    2016-01-01

    Food webs have been found to exhibit remarkable motif profiles, patterns in the relative prevalences of all possible three-species sub-graphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46 food webs of various kinds, we find that most food webs fall into one of two distinct motif families. The separation between the families is well predicted by a global measure of hierarchical order in directed networks - trophic coherence. We find that trophic coherence is also a good predictor for the extent of omnivory, defined as the tendency of species to feed on multiple trophic levels. We compare our results to a network assembly model that admits tunable trophic coherence via a single free parameter. The model is able to generate food webs in either of the two families by varying this parameter, and correctly classifies almost all the food webs in our database. This establishes a link between global order and local preying patterns in food webs.

  4. The discodermolide hairpin structure flows from conformationally stable modular motifs.

    Science.gov (United States)

    Jogalekar, Ashutosh S; Kriel, Frederik H; Shi, Qi; Cornett, Ben; Cicero, Daniel; Snyder, James P

    2010-01-14

    (+)-Discodermolide (DDM), a polyketide macrolide from marine sponge, is a potent microtubule assembly promoter. Reported solid-state, solution, and protein-bound DDM conformations reveal the unusual result that a common hairpin conformational motif exists in all three microenvironments. No other flexible microtubule binding agent exhibits such constancy of conformation. In the present study, we combine force-field conformational searches with NMR deconvolution in different solvents to compare DDM conformers with those observed in other environments. While several conformational families are perceived, the hairpin form dominates. The stability of this motif is dictated primarily by steric factors arising from repeated modular segments in DDM composed of the C(Me)-CHX-C(Me) fragment. Furthermore, docking protocols were utilized to probe the DDM binding mode in beta-tubulin. A previously suggested pose is substantiated (Pose-1), while an alternative (Pose-2) has been identified. SAR analysis for DDM analogues differentiates the two poses and suggests that Pose-2 is better able to accommodate the biodata.

  5. A motif-independent metric for DNA sequence specificity

    Directory of Open Access Journals (Sweden)

    Pinello Luca

    2011-10-01

    Full Text Available Abstract Background Genome-wide mapping of protein-DNA interactions has been widely used to investigate biological functions of the genome. An important question is to what extent such interactions are regulated at the DNA sequence level. However, current investigation is hampered by the lack of computational methods for systematic evaluating sequence specificity. Results We present a simple, unbiased quantitative measure for DNA sequence specificity called the Motif Independent Measure (MIM. By analyzing both simulated and real experimental data, we found that the MIM measure can be used to detect sequence specificity independent of presence of transcription factor (TF binding motifs. We also found that the level of specificity associated with H3K4me1 target sequences is highly cell-type specific and highest in embryonic stem (ES cells. We predicted H3K4me1 target sequences by using the N- score model and found that the prediction accuracy is indeed high in ES cells.The software to compute the MIM is freely available at: https://github.com/lucapinello/mim. Conclusions Our method provides a unified framework for quantifying DNA sequence specificity and serves as a guide for development of sequence-based prediction models.

  6. Multifractal signatures of infectious diseases.

    Science.gov (United States)

    Holdsworth, Amber M; Kevlahan, Nicholas K-R; Earn, David J D

    2012-09-01

    Incidence of infection time-series data for the childhood diseases measles, chicken pox, rubella and whooping cough are described in the language of multifractals. We explore the potential of using the wavelet transform maximum modulus (WTMM) method to characterize the multiscale structure of the observed time series and of simulated data generated by the stochastic susceptible-exposed-infectious-recovered (SEIR) epidemic model. The singularity spectra of the observed time series suggest that each disease is characterized by a unique multifractal signature, which distinguishes that particular disease from the others. The wavelet scaling functions confirm that the time series of measles, rubella and whooping cough are clearly multifractal, while chicken pox has a more monofractal structure in time. The stochastic SEIR epidemic model is unable to reproduce the qualitative singularity structure of the reported incidence data: it is too smooth and does not appear to have a multifractal singularity structure. The precise reasons for the failure of the SEIR epidemic model to reproduce the correct multiscale structure of the reported incidence data remain unclear. PMID:22442094

  7. Signature geometry and quantum engineering

    Science.gov (United States)

    Samociuk, Stefan

    2013-09-01

    As the operating frequency of electromagnetic based devices increase, physical design geometry is playing an ever more important role. Evidence is considered in support of a relationship between the dimensionality of primitive geometric forms, such as transistors, and corresponding electromagnetic coupling efficiency. The industry of electronics is defined as the construction of devices by the patterning of primitive forms to physical materials. Examples are given to show the evolution of these primitives, down to nano scales, are requiring exacting geometry and three dimensional content. Consideration of microwave monolithic integrated circuits,(MMIC), photonics and metamaterials,(MM), support this trend and also add new requirements of strict geometric periodicity and multiplicity. Signature geometries,(SG), are characterized by distinctive attributes and examples are given. The transcendent form transcode algorithm, (TTA) is introduced as a multi dimensional SG and its use in designing photonic integrated circuits and metamaterials is discussed . A creative commons licensed research database, TRANSFORM, containing TTA geometries in OASIS file formats is described. An experimental methodology for using the database is given. Multidimensional SG and extraction of three dimensional cross sections as primitive forms is discussed as a foundation for quantum engineering and the exploitation of phenomena other than the electromagnetic.

  8. Signature Based Intrusion Detection System Using SNORT

    Directory of Open Access Journals (Sweden)

    Vinod Kumar

    2012-11-01

    Full Text Available Now a day’s Intrusion Detection systems plays very important role in Network security. As the use of internet is growing rapidly the possibility of attack is also increasing in that ratio. People are using signature based IDS’s. Snort is mostly used signature based IDS because of it is open source software. World widely it is used in intrusion detection and prevention domain. Basic analysis and security engine (BASE is also used to see the alerts generated by Snort. In the paper we have implementation the signature based intrusion detection using Snort. Our work will help to novel user to understand the concept of Snort based IDS.

  9. Improved Quantum Signature Scheme with Weak Arbitrator

    Science.gov (United States)

    Su, Qi; Li, Wen-Min

    2013-09-01

    In this paper, we find a man-in-the-middle attack on the quantum signature scheme with a weak arbitrator (Luo et al., Int. J. Theor. Phys., 51:2135, 2012). In that scheme, the authors proposed a quantum signature based on quantum one way function which contains both verifying the signer phase and verifying the signed message phase. However, after our analysis we will show that Eve can adopt different strategies in respective phases to forge the signature without being detected. Then we present an improved scheme to increase the security.

  10. Arbitrated quantum signature with an untrusted arbitrator

    Science.gov (United States)

    Yang, Yu-Guang; Zhou, Zheng; Teng, Yi-Wei; Wen, Qiao-Yan

    2011-02-01

    In an arbitrated signature scheme, all communications involve a so called arbitrator who has access to the contents of the messages. The security of most arbitrated signature schemes depends heavily on the trustworthiness of the arbitrators. In this paper we show how to construct an arbitrated quantum signature protocol of classical messages with an untrusted arbitrator. Its security is analyzed and it is proved to be secure even if the arbitrator is compromised. In addition, the proposed protocol does not require a direct quantum link between any two communicating users, which is an appealing advantage in the implementation of a practical quantum distributed communication network.

  11. DIGITAL SIGNATURE IN THE WAY OF LAW

    OpenAIRE

    Ruya Samlı

    2013-01-01

    Signature can be defined as a person’s name or special signs that he/she writes when he/she wants to indicate he/she wrote or confirm that writing. A person signs many times in his/her life. A person’s signature that is used for thousands of times for many things from formal documents to exams has importance for that person. Especially, signing in legal operations is an operation that can build important results. If a person’s signature is imitated by another person, he/she can be...

  12. Reduction of a Ship's Magnetic Field Signatures

    CERN Document Server

    Holmes, John

    2008-01-01

    Decreasing the magnetic field signature of a naval vessel will reduce its susceptibility to detonating naval influence mines and the probability of a submarine being detected by underwater barriers and maritime patrol aircraft. Both passive and active techniques for reducing the magnetic signatures produced by a vessel's ferromagnetism, roll-induced eddy currents, corrosion-related sources, and stray fields are presented. Mathematical models of simple hull shapes are used to predict the levels of signature reduction that might be achieved through the use of alternate construction materials. Al

  13. Over-represented localized sequence motifs in ribosomal protein gene promoters of basal metazoans.

    Science.gov (United States)

    Perina, Drago; Korolija, Marina; Roller, Maša; Harcet, Matija; Jeličić, Branka; Mikoč, Andreja; Cetković, Helena

    2011-07-01

    Equimolecular presence of ribosomal proteins (RPs) in the cell is needed for ribosome assembly and is achieved by synchronized expression of ribosomal protein genes (RPGs) with promoters of similar strengths. Over-represented motifs of RPG promoter regions are identified as targets for specific transcription factors. Unlike RPs, those motifs are not conserved between mammals, drosophila, and yeast. We analyzed RPGs proximal promoter regions of three basal metazoans with sequenced genomes: sponge, cnidarian, and placozoan and found common features, such as 5'-terminal oligopyrimidine tracts and TATA-boxes. Furthermore, we identified over-represented motifs, some of which displayed the highest similarity to motifs abundant in human RPG promoters and not present in Drosophila or yeast. Our results indicate that humans over-represented motifs, as well as corresponding domains of transcription factors, were established very early in metazoan evolution. The fast evolving nature of RPGs regulatory network leads to formation of other, lineage specific, over-represented motifs. PMID:21457775

  14. Sequence Length Limits for Controlling False Positives in Discovering Nucleotide Sequence Motifs

    Institute of Scientific and Technical Information of China (English)

    CHEN Lei; QiAN Zi-liang

    2008-01-01

    In the study of motif discovery, especially the transcription factor DNA binding sites discovery, a too long input sequence would return non-informative motifs rather than those biological functional motifs. This paper gave theoretical analyses and computational experiments to suggest the length limits of the input sequence. When the sequence length exceeds a certain critical point, the probability of discovering the motif decreases sharply. The work not only gave an explanation on the unsatisfying results of the existed motif discovery problems that the input sequence length might be too long and exceed the point, but also provided an estimation of input sequence length we should accept to get more meaningful and reliable results in motif discovery.

  15. An Improved Proxy Multi-Signature, Multi-Proxy Signature and Multi-Proxy Multi-Signature Scheme

    Directory of Open Access Journals (Sweden)

    Jun Zhang

    2011-08-01

    Full Text Available Zhou’s proxy multi-signature scheme was a safe and effective scheme, but this scheme was not safety enough. In this work, security analysis was given to the scheme and results showed that the scheme was very easy aggressed by the forgery attack. The paper proposed that any attacker can sign some certain unauthorized messages after the attacker knows a valid signature, and any original signer ally with his proxy signer can forge any unauthorized messages. Then, the paper gave two kinds of inside attacks and outside attacks to the scheme correspondingly. Finally this paper proposed a new improved proxy multi-signature, multi-proxy signature and multi-proxy multi-signature schemes which based on the difficulty of the discrete logarithm problem (DLP. With verifying all the signers’ public keys, the improved schemes can resist lots of outsider attack and insider attack. The validity of the new scheme can be verified, and they are secure signature schemes.

  16. Vampirism today : the change of the vampire motif from the gothic novel to today's fantasy literature

    OpenAIRE

    2009-01-01

    This thesis examins the change of the vampire motif throughout time. How have vampires and their clichés changed and why? Starting with a brief examination of the 'classical' litarary vampire, I mainly focus on contemporary fantasy literature by discussing recent works of vampire fiction. The adaptation of the vampire motif in role-playing games will as well be discussed as the effects the vampire film had on the motif.

  17. Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs

    OpenAIRE

    Yoon, S; Goltsev, A. V.; Dorogovtsev, S. N.; Mendes, J. F. F.

    2011-01-01

    We generalize the belief-propagation algorithm to sparse random networks with arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in these networks belongs to a given set of motifs (generalization of the configuration model). These networks can be treated as sparse uncorrelated hypergraphs in which hyperedges represent motifs. Here a hypergraph is a generalization of a graph, where a hyperedge can connect any number of vertices. These uncorrelated hypergraphs are tree-like...

  18. An analysis of the positional distribution of DNA motifs in promoter regions and its biological relevance

    OpenAIRE

    Vinga Susana; Casimiro Ana C; Freitas Ana T; Oliveira Arlindo L

    2008-01-01

    Abstract Background Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior classification of the output still suffers from some limitations, which makes it difficult to assess the biological significance of the motifs found. Previous work has highlighted the existence of positional bias of motifs in the DNA sequences, which might indicate not only that the pattern is important, but als...

  19. NestedMICA as an ab initio protein motif discovery tool

    Directory of Open Access Journals (Sweden)

    Down Thomas A

    2008-01-01

    Full Text Available Abstract Background Discovering overrepresented patterns in amino acid sequences is an important step in protein functional element identification. We adapted and extended NestedMICA, an ab initio motif finder originally developed for finding transcription binding site motifs, to find short protein signals, and compared its performance with another popular protein motif finder, MEME. NestedMICA, an open source protein motif discovery tool written in Java, is driven by a Monte Carlo technique called Nested Sampling. It uses multi-class sequence background models to represent different "uninteresting" parts of sequences that do not contain motifs of interest. In order to assess NestedMICA as a protein motif finder, we have tested it on synthetic datasets produced by spiking instances of known motifs into a randomly selected set of protein sequences. NestedMICA was also tested using a biologically-authentic test set, where we evaluated its performance with respect to varying sequence length. Results Generally NestedMICA recovered most of the short (3–9 amino acid long test protein motifs spiked into a test set of sequences at different frequencies. We showed that it can be used to find multiple motifs at the same time, too. In all the assessment experiments we carried out, its overall motif discovery performance was better than that of MEME. Conclusion NestedMICA proved itself to be a robust and sensitive ab initio protein motif finder, even for relatively short motifs that exist in only a small fraction of sequences. Availability NestedMICA is available under the Lesser GPL open-source license from: http://www.sanger.ac.uk/Software/analysis/nmica/

  20. Isotopic signatures by bulk analyses

    International Nuclear Information System (INIS)

    Los Alamos National Laboratory has developed a series of measurement techniques for identification of nuclear signatures by analyzing bulk samples. Two specific applications for isotopic fingerprinting to identify the origin of anthropogenic radioactivity in bulk samples are presented. The first example is the analyses of environmental samples collected in the US Arctic to determine the impact of dumping of radionuclides in this polar region. Analyses of sediment and biota samples indicate that for the areas sampled the anthropogenic radionuclide content of sediments was predominantly the result of the deposition of global fallout. The anthropogenic radionuclide concentrations in fish, birds and mammals were very low. It can be surmised that marine food chains are presently not significantly affected. The second example is isotopic fingerprinting of water and sediment samples from the Rocky Flats Facility (RFP). The largest source of anthropogenic radioactivity presently affecting surface-waters at RFP is the sediments that are currently residing in the holding ponds. One gram of sediment from a holding pond contains approximately 50 times more plutonium than 1 liter of water from the pond. Essentially 100% of the uranium in Ponds A-1 and A-2 originated as depleted uranium. The largest source of radioactivity in the terminal Ponds A-4, B-5 and C-2 was naturally occurring uranium and its decay product radium. The uranium concentrations in the waters collected from the terminal ponds contained 0.05% or less of the interim standard calculated derived concentration guide for uranium in waters available to the public. All of the radioactivity observed in soil, sediment and water samples collected at RFP was naturally occurring, the result of processes at RFP or the result of global fallout. No extraneous anthropogenic alpha, beta or gamma activities were detected. The plutonium concentrations in Pond C-2 appear to vary seasonally

  1. A motif extraction algorithm based on hashing and modulo-4 arithmetic.

    Science.gov (United States)

    Sheng, Huitao; Mehrotra, Kishan; Mohan, Chilukuri; Raina, Ramesh

    2008-01-01

    We develop an algorithm to identify cis-elements in promoter regions of coregulated genes. This algorithm searches for subsequences of desired length whose frequency of occurrence is relatively high, while accounting for slightly perturbed variants using hash table and modulo arithmetic. Motifs are evaluated using profile matrices and higher-order Markov background model. Simulation results show that our algorithm discovers more motifs present in the test sequences, when compared with two well-known motif-discovery tools (MDScan and AlignACE). The algorithm produces very promising results on real data set; the output of the algorithm contained many known motifs.

  2. Mapping network motif tunability and robustness in the design of synthetic signaling circuits.

    Directory of Open Access Journals (Sweden)

    Sergio Iadevaia

    Full Text Available Cellular networks are highly dynamic in their function, yet evolutionarily conserved in their core network motifs or topologies. Understanding functional tunability and robustness of network motifs to small perturbations in function and structure is vital to our ability to synthesize controllable circuits. In establishing core sets of network motifs, we selected topologies that are overrepresented in mammalian networks, including the linear, feedback, feed-forward, and bifan circuits. Static and dynamic tunability of network motifs were defined as the motif ability to respectively attain steady-state or transient outputs in response to pre-defined input stimuli. Detailed computational analysis suggested that static tunability is insensitive to the circuit topology, since all of the motifs displayed similar ability to attain predefined steady-state outputs in response to constant inputs. Dynamic tunability, in contrast, was tightly dependent on circuit topology, with some motifs performing superiorly in achieving observed time-course outputs. Finally, we mapped dynamic tunability onto motif topologies to determine robustness of motif structures to changes in topology and identify design principles for the rational assembly of robust synthetic networks.

  3. Secure quantum signatures using insecure quantum channels

    Science.gov (United States)

    Amiri, Ryan; Wallden, Petros; Kent, Adrian; Andersson, Erika

    2016-03-01

    Digital signatures are widely used in modern communication to guarantee authenticity and transferability of messages. The security of currently used classical schemes relies on computational assumptions. We present a quantum signature scheme that does not require trusted quantum channels. We prove that it is unconditionally secure against the most general coherent attacks, and show that it requires the transmission of significantly fewer quantum states than previous schemes. We also show that the quantum channel noise threshold for our scheme is less strict than for distilling a secure key using quantum key distribution. This shows that "direct" quantum signature schemes can be preferable to signature schemes relying on secret shared keys generated using quantum key distribution.

  4. Threshold Ring Signature Scheme Based on TPM

    Institute of Scientific and Technical Information of China (English)

    Gong Bei; Jiang Wei; Lin Li; Li Yu; Zhang Xing

    2012-01-01

    The conventional ring signature schemes cannot address the scenario where the rank of members of the ring needs to be distinguished, for example, in electronically commerce application. To solve this problem, we presented a Trusted Platform Module (TPM)-based threshold ring signature schen. Employing a reliable secret Share Distribution Center (SDC), the proposed approach can authenticate the TPM-based identity rank of members of the ring but not track a specific member's identity. A subset including t members with the same identity rank is built. With the signing cooperation of t members of the subset, the ring signature based on Chinese remainder theorem is generated. We proved the anonymity and unforgeability of the proposed scheme and compared it with the threshold ring signature based on Lagrange interpolation polynomial. Our scheme is relatively simpler to calculate.

  5. Probabilistic Model for Dynamic Signature Verification System

    Directory of Open Access Journals (Sweden)

    Chai Tong Yuen

    2011-11-01

    Full Text Available This study has proposed the algorithm for signature verification system using dynamic parameters of the signature: pen pressure, velocity and position. The system is proposed to read, analyze and verify the signatures from the SUSig online database. Firstly, the testing and reference samples will have to be normalized, re-sampled and smoothed through pre-processing stage. In verification stage, the difference between reference and testing signatures will be calculated based on the proposed thresholded standard deviation method. A probabilistic acceptance model has been designed to enhance the performance of the verification system. The proposed algorithm has reported False Rejection Rate (FRR of 14.8% and False Acceptance Rate (FAR of 2.64%. Meanwhile, the classification rate of the system is around 97%.

  6. Signature Region of Interest using Auto cropping

    Directory of Open Access Journals (Sweden)

    Bassam Al-Mahadeen

    2010-03-01

    Full Text Available A new approach for signature region of interest pre-processing was presented. It used new auto cropping preparation on the basis of the image content, where the intensity value of pixel is the source of cropping. This approach provides both the possibility of improving the performance of security systems based on signature images, and also the ability to use only the region of interest of the used image to suit layout design of biometric systems. Underlying the approach is a novel segmentation method which identifies the exact region of foreground of signature for feature extraction usage. Evaluation results of this approach shows encouraging prospects by eliminating the need for false region isolating, reduces the time cost associated with signature false points detection, and addresses enhancement issues. A further contribution of this paper is an automated cropping stage in bio-secure based systems.

  7. Electronic Signatures for Public Procurement across Europe

    Science.gov (United States)

    Ølnes, Jon; Andresen, Anette; Arbia, Stefano; Ernst, Markus; Hagen, Martin; Klein, Stephan; Manca, Giovanni; Rossi, Adriano; Schipplick, Frank; Tatti, Daniele; Wessolowski, Gesa; Windheuser, Jan

    The PEPPOL (Pan-European Public Procurement On-Line) project is a large scale pilot under the CIP programme of the EU, exploring electronic public procurement in a unified European market. An important element is interoperability of electronic signatures across borders, identified today as a major obstacle to cross-border procurement. PEPPOL will address use of signatures in procurement processes, in particular tendering but also post-award processes like orders and invoices. Signature policies, i.e. quality requirements and requirements on information captured in the signing process, will be developed. This as well as technical interoperability of e-signatures across Europe will finally be piloted in demonstrators starting late 2009 or early 2010.

  8. 15 CFR 908.16 - Signature.

    Science.gov (United States)

    2010-01-01

    ... SUBMITTING REPORTS ON WEATHER MODIFICATION ACTIVITIES § 908.16 Signature. All reports filed with the National... or intending to conduct the weather modification activities referred to therein by such...

  9. Electronic Seal Stamping Based on Group Signature

    OpenAIRE

    Girija Srikanth

    2011-01-01

    This paper describes a new electronic official seal stamping based on Group Signature, USB Key. Bill/Contract in E-commerce must be seal stamped to gain tamper proof and non-repudiation. The seal stamping control is designed based on the certificate-based public key. This technique is more efficient for generating and verifying individual/group signatures in terms of computational efforts and communication costs. Web page electronic seal-stamping system is implemented which has been adopted b...

  10. Kinematics of Signature Writing in Healthy Aging*

    OpenAIRE

    Caligiuri, Michael P.; Kim, Chi; Landy, Kelly M.

    2014-01-01

    Forensic document examiners (FDE) called upon to distinguish a genuine from a forged signature of an elderly person are often required to consider the question of age-related deterioration and whether the available exemplars reliably capture the natural effects of aging of the original writer. An understanding of the statistical relationship between advanced age and handwriting movements can reduce the uncertainty that may exist in an examiner’s approach to questioned signatures formed by eld...

  11. Damping signatures in future neutrino oscillation experiments

    OpenAIRE

    Blennow, Mattias; Ohlsson, Tommy; Winter, Walter

    2005-01-01

    We discuss the phenomenology of damping signatures in the neutrino oscillation probabilities, where either the oscillating terms or the probabilities can be damped. This approach is a possibility for tests of damping effects in future neutrino oscillation experiments, where we mainly focus on reactor and long-baseline experiments. We extensively motivate different damping signatures due to small corrections by neutrino decoherence, neutrino decay, oscillations into sterile neutrinos, or other...

  12. Signature-based store checking buffer

    Science.gov (United States)

    Sridharan, Vilas; Gurumurthi, Sudhanva

    2015-06-02

    A system and method for optimizing redundant output verification, are provided. A hardware-based store fingerprint buffer receives multiple instances of output from multiple instances of computation. The store fingerprint buffer generates a signature from the content included in the multiple instances of output. When a barrier is reached, the store fingerprint buffer uses the signature to verify the content is error-free.

  13. Persistence of social signatures in human communication

    OpenAIRE

    Saramäki, Jari; Leicht, E. A.; López, Eduardo; Roberts, Sam G. B.; Reed-Tsochas, Felix; Robin I M Dunbar

    2014-01-01

    We combine cell phone data with survey responses to show that a person’s social signature, as we call the pattern of their interactions with different friends and family members, is remarkably robust. People focus a high proportion of their communication efforts on a small number of individuals, and this behavior persists even when there are changes in the identity of the individuals involved. Although social signatures vary between individuals, a given individual appears to retain a specific...

  14. Motif-Driven Design of Protein-Protein Interfaces.

    Science.gov (United States)

    Silva, Daniel-Adriano; Correia, Bruno E; Procko, Erik

    2016-01-01

    Protein-protein interfaces regulate many critical processes for cellular function. The ability to accurately control and regulate these molecular interactions is of major interest for biomedical and synthetic biology applications, as well as to address fundamental biological questions. In recent years, computational protein design has emerged as a tool for designing novel protein-protein interactions with functional relevance. Although attractive, these computational tools carry a steep learning curve. In order to make some of these methods more accessible, we present detailed descriptions and examples of ROSETTA computational protocols for the design of functional protein binders using seeded protein interface design. In these protocols, a motif of known structure that interacts with the target site is grafted into a scaffold protein, followed by design of the surrounding interaction surface. PMID:27094298

  15. Appearance of the bulk motif in Al clusters

    Science.gov (United States)

    Sun, Jiao; Lu, Wen-Cai; Li, Ze-Sheng; Wang, C. Z.; Ho, K. M.

    2008-07-01

    We have performed an unbiased search for the lowest-energy structures of medium-sized aluminum clusters Aln (n=19-26) using a genetic algorithm (GA) coupled with a tight-binding interatomic potential. Structural candidates obtained from our GA search were further optimized using density functional theory. It is found that the double icosahedron is not the most stable structure for Al19 but serves as the core for Al20 and Al21. The lowest-energy structures of Aln are found to undergo a transition to an aluminum bulk motif above Al23. In particular, the lowest-energy structure of Al26 is almost a fragment of the bulk face-centered-cubic crystal except for the stacking fault at the bottom layer. Anion clusters were also studied.

  16. A cooperative fast annealing coevolutionary algorithm for protein motif extraction

    Institute of Scientific and Technical Information of China (English)

    CHEN Chao; TIAN YuanXin; ZOU XiaoYong; CAI PeiXiang; MO JinYuan

    2007-01-01

    By integrating the cooperative approach with the fast annealing coevolutionary algorithm (FAEA), a so-called cooperative fast annealing coevolutionary algorithm (CFACA) is presented in this paper for the purpose of solving high-dimensional problems. After the partition of the search space in CFACA, each smaller one is then searched by a separate FAEA. The fitness function is evaluated by combining sub-solutions found by each of the FAEAs. It demonstrates that the CFACA outperforms the FAEA in the domain of function optimization, especially in terms of convergence rate. The current algorithm is also applied to a real optimization problem of protein motif extraction. And a satisfactory result has been obtained with the accuracy of prediction achieving 67.0%, which is in agreement with the result in the PROSITE database.

  17. Sequential dynamics in the motif of excitatory coupled elements

    Science.gov (United States)

    Korotkov, Alexander G.; Kazakov, Alexey O.; Osipov, Grigory V.

    2015-11-01

    In this article a new model of motif (small ensemble) of neuron-like elements is proposed. It is built with the use of the generalized Lotka-Volterra model with excitatory couplings. The main motivation for this work comes from the problems of neuroscience where excitatory couplings are proved to be the predominant type of interaction between neurons of the brain. In this paper it is shown that there are two modes depending on the type of coupling between the elements: the mode with a stable heteroclinic cycle and the mode with a stable limit cycle. Our second goal is to examine the chaotic dynamics of the generalized three-dimensional Lotka-Volterra model.

  18. The sword motif 'n Matthew 10:34

    Directory of Open Access Journals (Sweden)

    David C. Sim

    2000-01-01

    Full Text Available 'n Mathew 10:34 Jesus uters a very dificult saying. He claims that he has not come to bring peace, but a sword. The form of this saying does not trace back to the historical Jesus; it is the product of Matthew's redaction of a Q passage which is found 'n a more original form 'n Luke 12:51. What did the evangelist mean when he wrote that Jesus brought a sword? 'n the Hebrew scriptures the sword was acommon symbol for the judgement and punishment of God, and 'n later times it represented a number of themes associated with the eschaton. It is argued 'n this study that Mathew, who was fully immersed 'n the apocalyptic-eschatological traditions of his day, probably used the sword motif 'n Matthew 10:34 to symbolise anumber of important eschatological events.

  19. Study on online community user motif using web usage mining

    Science.gov (United States)

    Alphy, Meera; Sharma, Ajay

    2016-04-01

    The Web usage mining is the application of data mining, which is used to extract useful information from the online community. The World Wide Web contains at least 4.73 billion pages according to Indexed Web and it contains at least 228.52 million pages according Dutch Indexed web on 6th august 2015, Thursday. It’s difficult to get needed data from these billions of web pages in World Wide Web. Here is the importance of web usage mining. Personalizing the search engine helps the web user to identify the most used data in an easy way. It reduces the time consumption; automatic site search and automatic restore the useful sites. This study represents the old techniques to latest techniques used in pattern discovery and analysis in web usage mining from 1996 to 2015. Analyzing user motif helps in the improvement of business, e-commerce, personalisation and improvement of websites.

  20. Assessing the Quality of Bioforensic Signatures

    Energy Technology Data Exchange (ETDEWEB)

    Sego, Landon H.; Holmes, Aimee E.; Gosink, Luke J.; Webb-Robertson, Bobbie-Jo M.; Kreuzer, Helen W.; Anderson, Richard M.; Brothers, Alan J.; Corley, Courtney D.; Tardiff, Mark F.

    2013-06-04

    We present a mathematical framework for assessing the quality of signature systems in terms of fidelity, cost, risk, and utility—a method we refer to as Signature Quality Metrics (SQM). We demonstrate the SQM approach by assessing the quality of a signature system designed to predict the culture medium used to grow a microorganism. The system consists of four chemical assays designed to identify various ingredients that could be used to produce the culture medium. The analytical measurements resulting from any combination of these four assays can be used in a Bayesian network to predict the probabilities that the microorganism was grown using one of eleven culture media. We evaluated fifteen combinations of the signature system by removing one or more of the assays from the Bayes network. We demonstrated that SQM can be used to distinguish between the various combinations in terms of attributes of interest. The approach assisted in clearly identifying assays that were least informative, largely in part because they only could discriminate between very few culture media, and in particular, culture media that are rarely used. There are limitations associated with the data that were used to train and test the signature system. Consequently, our intent is not to draw formal conclusions regarding this particular bioforensic system, but rather to illustrate an analytical approach that could be useful in comparing one signature system to another.

  1. Molecular signatures of prostate stem cells reveal novel signaling pathways and provide insights into prostate cancer.

    Directory of Open Access Journals (Sweden)

    Roy Blum

    Full Text Available BACKGROUND: The global gene expression profiles of adult and fetal murine prostate stem cells were determined to define common and unique regulators whose misexpression might play a role in the development of prostate cancer. METHODOLOGY/PRINCIPAL FINDINGS: A distinctive core of transcriptional regulators common to both fetal and adult primitive prostate cells was identified as well as molecules that are exclusive to each population. Elements common to fetal and adult prostate stem cells include expression profiles of Wnt, Shh and other pathways identified in stem cells of other organs, signatures of the aryl-hydrocarbon receptor, and up-regulation of components of the aldehyde dehydrogenase/retinoic acid receptor axis. There is also a significant lipid metabolism signature, marked by overexpression of lipid metabolizing enzymes and the presence of the binding motif for Srebp1. The fetal stem cell population, characterized by more rapid proliferation and self-renewal, expresses regulators of the cell cycle, such as E2f, Nfy, Tead2 and Ap2, at elevated levels, while adult stem cells show a signature in which TGF-beta has a prominent role. Finally, comparison of the signatures of primitive prostate cells with previously described profiles of human prostate tumors identified stem cell molecules and pathways with deregulated expression in prostate tumors including chromatin modifiers and the oncogene, Erg. CONCLUSIONS/SIGNIFICANCE: Our data indicate that adult prostate stem or progenitor cells may acquire characteristics of self-renewing primitive fetal prostate cells during oncogenesis and suggest that aberrant activation of components of prostate stem cell pathways may contribute to the development of prostate tumors.

  2. Structural fragment clustering reveals novel structural and functional motifs in α-helical transmembrane proteins

    Directory of Open Access Journals (Sweden)

    Vassilev Boris

    2010-04-01

    Full Text Available Abstract Background A large proportion of an organism's genome encodes for membrane proteins. Membrane proteins are important for many cellular processes, and several diseases can be linked to mutations in them. With the tremendous growth of sequence data, there is an increasing need to reliably identify membrane proteins from sequence, to functionally annotate them, and to correctly predict their topology. Results We introduce a technique called structural fragment clustering, which learns sequential motifs from 3D structural fragments. From over 500,000 fragments, we obtain 213 statistically significant, non-redundant, and novel motifs that are highly specific to α-helical transmembrane proteins. From these 213 motifs, 58 of them were assigned to function and checked in the scientific literature for a biological assessment. Seventy percent of the motifs are found in co-factor, ligand, and ion binding sites, 30% at protein interaction interfaces, and 12% bind specific lipids such as glycerol or cardiolipins. The vast majority of motifs (94% appear across evolutionarily unrelated families, highlighting the modularity of functional design in membrane proteins. We describe three novel motifs in detail: (1 a dimer interface motif found in voltage-gated chloride channels, (2 a proton transfer motif found in heme-copper oxidases, and (3 a convergently evolved interface helix motif found in an aspartate symporter, a serine protease, and cytochrome b. Conclusions Our findings suggest that functional modules exist in membrane proteins, and that they occur in completely different evolutionary contexts and cover different binding sites. Structural fragment clustering allows us to link sequence motifs to function through clusters of structural fragments. The sequence motifs can be applied to identify and characterize membrane proteins in novel genomes.

  3. Ship Survivability (part II) Ship Infrared (IR) signatures

    NARCIS (Netherlands)

    Galle, L.F.; Schleijpen, H.M.A.

    1998-01-01

    A low lnfrared (lR) signature is of paramount importance for a warship's survivability, In this paper, basic IR theory will be addressed, next to the simulation of IR Signatures, to give insight to lR signature management. Possible lR Signature Suppression techniques will be presented and elaborated

  4. A Formal Model for the Security of Proxy Signature Schemes

    Institute of Scientific and Technical Information of China (English)

    GU Chun-xiang; ZHU Yue-fei; ZHANG Ya-juan

    2005-01-01

    This paper provides theoretical foundations for the secure proxy signature primitive. We present a formal model for the security of proxy signature schemes, which defines the capabilities of the adversary and the security goals to capture which mean for a proxy signature scheme to be secure. Then, we present an example of proxy signature scheme that can be proven secure in the standard model.

  5. Untraceable partially blind signature based on DLOG problem.

    Science.gov (United States)

    Huang, Zheng; Chen, Ke-fei; Kou, Wei-dong

    2004-01-01

    This paper proposes a new untraceable Partially Blind Signature scheme which is a cross between the traditional signature scheme and the blind signature scheme. In this proposed scheme, the message M that the signer signed can be divided into two parts. The first part can be known to the signer (like that in the traditional signature scheme) while the other part cannot be known to the signer (like that in the blind signature scheme). After having signed M, the signer cannot determine if he has made the signature of M except through the part that he knows. We draw ideas from Brands' "Restricted Blind Signature" to solve the Untraceable Partially Blind Signature problem. Our scheme is a probabilistic signature scheme and the security of our Untraceable Partially Blind Signature scheme relies on the difficulty of computing discrete logarithm. PMID:14663850

  6. Untraceable partially blind signature based on DLOG problem

    Institute of Scientific and Technical Information of China (English)

    HUANG Zheng(黄征); CHEN Ke-fei(陈克非); KOU Wei-dong(寇卫东)

    2004-01-01

    This paper proposes a new untraceable Partially Blind Signature scheme which is a cross between the traditional signature scheme and the blind signature scheme. In this proposed scheme, the message M that the signer signed can be divided into two parts. The first part can be known to the signer (like that in the traditional signature scheme) while the other part cannot be known to the signer (like that in the blind signature scheme). After having signed M, the signer cannot determine if he has made the signature of M except through the part that he knows. We draw ideas from Brands' "Restricted Blind Signature" to solve the Untraceable Partially Blind Signature problem. Our scheme is a probabilistic signature scheme and the security of our Untraceable Partially Blind Signature scheme relies on the difficulty of computing discrete logarithm.

  7. Does Twitter trigger bursts in signature collections?

    Directory of Open Access Journals (Sweden)

    Rui Yamaguchi

    Full Text Available INTRODUCTION: The quantification of social media impacts on societal and political events is a difficult undertaking. The Japanese Society of Oriental Medicine started a signature-collecting campaign to oppose a medical policy of the Government Revitalization Unit to exclude a traditional Japanese medicine, "Kampo," from the public insurance system. The signature count showed a series of aberrant bursts from November 26 to 29, 2009. In the same interval, the number of messages on Twitter including the keywords "Signature" and "Kampo," increased abruptly. Moreover, the number of messages on an Internet forum that discussed the policy and called for signatures showed a train of spikes. METHODS AND FINDINGS: In order to estimate the contributions of social media, we developed a statistical model with state-space modeling framework that distinguishes the contributions of multiple social media in time-series of collected public opinions. We applied the model to the time-series of signature counts of the campaign and quantified contributions of two social media, i.e., Twitter and an Internet forum, by the estimation. We found that a considerable portion (78% of the signatures was affected from either of the social media throughout the campaign and the Twitter effect (26% was smaller than the Forum effect (52% in total, although Twitter probably triggered the initial two bursts of signatures. Comparisons of the estimated profiles of the both effects suggested distinctions between the social media in terms of sustainable impact of messages or tweets. Twitter shows messages on various topics on a time-line; newer messages push out older ones. Twitter may diminish the impact of messages that are tweeted intermittently. CONCLUSIONS: The quantification of social media impacts is beneficial to better understand people's tendency and may promote developing strategies to engage public opinions effectively. Our proposed method is a promising tool to explore

  8. The EDLL motif: a potent plant transcriptional activation domain from AP2/ERF transcription factors.

    Science.gov (United States)

    Tiwari, Shiv B; Belachew, Alemu; Ma, Siu Fong; Young, Melinda; Ade, Jules; Shen, Yu; Marion, Colleen M; Holtan, Hans E; Bailey, Adina; Stone, Jeffrey K; Edwards, Leslie; Wallace, Andreah D; Canales, Roger D; Adam, Luc; Ratcliffe, Oliver J; Repetti, Peter P

    2012-06-01

    In plants, the ERF/EREBP family of transcriptional regulators plays a key role in adaptation to various biotic and abiotic stresses. These proteins contain a conserved AP2 DNA-binding domain and several uncharacterized motifs. Here, we describe a short motif, termed 'EDLL', that is present in AtERF98/TDR1 and other clade members from the same AP2 sub-family. We show that the EDLL motif, which has a unique arrangement of acidic amino acids and hydrophobic leucines, functions as a strong activation domain. The motif is transferable to other proteins, and is active at both proximal and distal positions of target promoters. As such, the EDLL motif is able to partly overcome the repression conferred by the AtHB2 transcription factor, which contains an ERF-associated amphiphilic repression (EAR) motif. We further examined the activation potential of EDLL by analysis of the regulation of flowering time by NF-Y (nuclear factor Y) proteins. Genetic evidence indicates that NF-Y protein complexes potentiate the action of CONSTANS in regulation of flowering in Arabidopsis; we show that the transcriptional activation function of CONSTANS can be substituted by direct fusion of the EDLL activation motif to NF-YB subunits. The EDLL motif represents a potent plant activation domain that can be used as a tool to confer transcriptional activation potential to heterologous DNA-binding proteins.

  9. MOMFER: A Search Engine of Thompson's Motif-Index of Folk Literature

    NARCIS (Netherlands)

    Karsdorp, F.; Meulen, M. van der; Meder, Th.; Bosch, A.P.J. van den

    2015-01-01

    More than fifty years after the first edition of Thompson's seminal Motif-Indexof Folk Literature, we present an online search engine tailored to fully disclose the index digitally. This search engine, called MOMFER, greatly enhances the searchability of the Motif-Index and provides exciting new way

  10. GOmotif: A web server for investigating the biological role of protein sequence motifs

    Directory of Open Access Journals (Sweden)

    He Runtao

    2011-09-01

    Full Text Available Abstract Background Many proteins contain conserved sequence patterns (motifs that contribute to their functionality. The process of experimentally identifying and validating novel protein motifs can be difficult, expensive, and time consuming. A means for helping to identify in advance the possible function of a novel motif is important to test hypotheses concerning the biological relevance of these motifs, thus reducing experimental trial-and-error. Results GOmotif accepts PROSITE and regular expression formatted motifs as input and searches a Gene Ontology annotated protein database using motif search tools. The search returns the set of proteins containing matching motifs and their associated Gene Ontology terms. These results are presented as: 1 a hierarchical, navigable tree separated into the three Gene Ontology biological domains - biological process, cellular component, and molecular function; 2 corresponding pie charts indicating raw and statistically adjusted distributions of the results, and 3 an interactive graphical network view depicting the location of the results in the Gene Ontology. Conclusions GOmotif is a web-based tool designed to assist researchers in investigating the biological role of novel protein motifs. GOmotif can be freely accessed at http://www.gomotif.ca

  11. Genome adaptations of a tripartite motif protein for retroviral defense in cattle and sheep

    Science.gov (United States)

    Tripartite motif (TRIM) genes encode proteins composed of RING, B-box, and coiled coil motif domains. Primate TRIM5' has been shown to be a primary determinant of retroviral host cell range restriction in primates. TRIM5 restriction was originally thought to be a primate-specific defense mechanism...

  12. Dynamic consequences of mutating the typical HPGG motif of apocytochrome b5 revealed by computer simulation

    Institute of Scientific and Technical Information of China (English)

    Ying Wu Lin; Tian Lei Ying; Li Fu Liao

    2009-01-01

    Apecytochrome b5 with a typical heme-binding motif of HPGC,and its variants with mutated motifs,GPGG,GPGH,HVGG,and HPGP,have been subjected to molecular dynamics simulation.Comparison of the dynamic consequences has revealed the crucial role of HPGG in assembling the heme group of cytochrome b5 and in modulating protein structure,property and function.

  13. Distinct recognition modes of FXXLF and LXXLL motifs by the androgen receptor.

    NARCIS (Netherlands)

    H.J. Dubbink (Erik Jan); R. Hersmus (Remko); C.S. Verma (Chandra); H.A.G.M. van der Korput (Hetty); C.A. Berrevoets (Cor); J. van Tol (Judith); A.C.J. Ziel-van der Made (Angelique); A.O. Brinkmann (Albert); A.C. Pike (Ashley); J. Trapman (Jan)

    2004-01-01

    textabstractAmong nuclear receptors, the androgen receptor (AR) is unique in that its ligand-binding domain (LBD) interacts with the FXXLF motif in the N-terminal domain, resembling coactivator LXXLL motifs. We compared AR- and estrogen receptor alpha-LBD interactions of the wild-t

  14. An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.

    Science.gov (United States)

    Yu, Qiang; Huo, Hongwei; Vitter, Jeffrey Scott; Huan, Jun; Nekrich, Yakov

    2015-01-01

    In recent years, there has been an increasing interest in planted (l, d) motif search (PMS) with applications to discovering significant segments in biological sequences. However, there has been little discussion about PMS over large alphabets. This paper focuses on motif stem search (MSS), which is recently introduced to search motifs on large-alphabet inputs. A motif stem is an l-length string with some wildcards. The goal of the MSS problem is to find a set of stems that represents a superset of all (l , d) motifs present in the input sequences, and the superset is expected to be as small as possible. The three main contributions of this paper are as follows: (1) We build motif stem representation more precisely by using regular expressions. (2) We give a method for generating all possible motif stems without redundant wildcards. (3) We propose an efficient exact algorithm, called StemFinder, for solving the MSS problem. Compared with the previous MSS algorithms, StemFinder runs much faster and reports fewer stems which represent a smaller superset of all (l, d) motifs. StemFinder is freely available at http://sites.google.com/site/feqond/stemfinder. PMID:26357225

  15. A Fast Cluster Motif Finding Algorithm for ChIP-Seq Data Sets.

    Science.gov (United States)

    Zhang, Yipu; Wang, Ping

    2015-01-01

    New high-throughput technique ChIP-seq, coupling chromatin immunoprecipitation experiment with high-throughput sequencing technologies, has extended the identification of binding locations of a transcription factor to the genome-wide regions. However, the most existing motif discovery algorithms are time-consuming and limited to identify binding motifs in ChIP-seq data which normally has the significant characteristics of large scale data. In order to improve the efficiency, we propose a fast cluster motif finding algorithm, named as FCmotif, to identify the (l,  d) motifs in large scale ChIP-seq data set. It is inspired by the emerging substrings mining strategy to find the enriched substrings and then searching the neighborhood instances to construct PWM and cluster motifs in different length. FCmotif is not following the OOPS model constraint and can find long motifs. The effectiveness of proposed algorithm has been proved by experiments on the ChIP-seq data sets from mouse ES cells. The whole detection of the real binding motifs and processing of the full size data of several megabytes finished in a few minutes. The experimental results show that FCmotif has advantageous to deal with the (l,  d) motif finding in the ChIP-seq data; meanwhile it also demonstrates better performance than other current widely-used algorithms such as MEME, Weeder, ChIPMunk, and DREME. PMID:26236718

  16. An Identity-Based Strong Designated Verifier Proxy Signature Scheme

    Institute of Scientific and Technical Information of China (English)

    WANG Qin; CAO Zhenfu

    2006-01-01

    In a strong designated verifier proxy signature scheme, a proxy signer can generate proxy signature on behalf of an original signer, but only the designated verifier can verify the validity of the proxy signature. In this paper, we first define the security requirements for strong designated verifier proxy signature schemes. And then we construct an identity-based strong designated verifier proxy signature scheme. We argue that the proposed scheme satisfies all of the security requirements.

  17. Characteristics of Constrained Handwritten Signatures: An Experimental Investigation

    OpenAIRE

    Donato, Impedovo; Pirlo, Giuseppe; Rizzi, Fabrizio

    2015-01-01

    Handwritten signatures are considered one of the most useful biometric traits for personal verification. In the networked society, in which a multitude of different devices can be used for signature acquisition, specific research is still needed to determine the extent to which features of an input signature depend on the characteristics of the signature apposition process. In this paper an experimental investigation was carried out on constrained signatures, which were acquired using writing...

  18. New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures

    CERN Document Server

    Vergnaud, Damien

    2008-01-01

    The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly verifiable digital signatures but have an additional functionality which allows any holder of a signature to designate the signature to any desired verifier. This designated verifier can check that the message was indeed signed, but is unable to convince anyone else of this fact. We propose new efficient constructions for pairing-based short signatures. Our first scheme is based on Boneh-Boyen signatures and its security can be analyzed in the standard security model. We prove its resistance to forgery assuming the hardness of the so-called strong Diffie-Hellman problem, under the knowledge-of-exponent assumption. The second scheme is compatible with the Boneh-Lynn-Shacham signatures and is proven unforgeable, in the random oracle model, under the assumption that the computational bilinear Diffie-Hellman problem is untractable. Both s...

  19. Seed storage protein gene promoters contain conserved DNA motifs in Brassicaceae, Fabaceae and Poaceae

    Directory of Open Access Journals (Sweden)

    Fauteux François

    2009-10-01

    Full Text Available Abstract Background Accurate computational identification of cis-regulatory motifs is difficult, particularly in eukaryotic promoters, which typically contain multiple short and degenerate DNA sequences bound by several interacting factors. Enrichment in combinations of rare motifs in the promoter sequence of functionally or evolutionarily related genes among several species is an indicator of conserved transcriptional regulatory mechanisms. This provides a basis for the computational identification of cis-regulatory motifs. Results We have used a discriminative seeding DNA motif discovery algorithm for an in-depth analysis of 54 seed storage protein (SSP gene promoters from three plant families, namely Brassicaceae (mustards, Fabaceae (legumes and Poaceae (grasses using backgrounds based on complete sets of promoters from a representative species in each family, namely Arabidopsis (Arabidopsis thaliana (L. Heynh., soybean (Glycine max (L. Merr. and rice (Oryza sativa L. respectively. We have identified three conserved motifs (two RY-like and one ACGT-like in Brassicaceae and Fabaceae SSP gene promoters that are similar to experimentally characterized seed-specific cis-regulatory elements. Fabaceae SSP gene promoter sequences are also enriched in a novel, seed-specific E2Fb-like motif. Conserved motifs identified in Poaceae SSP gene promoters include a GCN4-like motif, two prolamin-box-like motifs and an Skn-1-like motif. Evidence of the presence of a variant of the TATA-box is found in the SSP gene promoters from the three plant families. Motifs discovered in SSP gene promoters were used to score whole-genome sets of promoters from Arabidopsis, soybean and rice. The highest-scoring promoters are associated with genes coding for different subunits or precursors of seed storage proteins. Conclusion Seed storage protein gene promoter motifs are conserved in diverse species, and different plant families are characterized by a distinct combination

  20. MOTIFSIM: A web tool for detecting similarity in multiple DNA motif datasets.

    Science.gov (United States)

    Tran, Ngoc Tam L; Huang, Chun-Hsi

    2015-07-01

    Currently, there are a number of motif detection tools available that possess unique functionality. These tools often report different motifs, and therefore use of multiple tools is generally advised since common motifs reported by multiple tools are more likely to be biologically significant. However, results produced by these different tools need to be compared and existing similarity detection tools only allow comparison between two data sets. Here, we describe a motif similarity detection tool (MOTIFSIM) possessing a web-based, user-friendly interface that is capable of detecting similarity from multiple DNA motif data sets concurrently. Results can either be viewed online or downloaded. Users may also download and run MOTIFSIM as a command-line tool in stand-alone mode. The web tool, along with its command-line version, user manuals, and source codes, are freely available at http://biogrid-head.engr.uconn.edu/motifsim/. PMID:26156781

  1. RSAT::Plants: Motif Discovery Within Clusters of Upstream Sequences in Plant Genomes.

    Science.gov (United States)

    Contreras-Moreira, Bruno; Castro-Mondragon, Jaime A; Rioualen, Claire; Cantalapiedra, Carlos P; van Helden, Jacques

    2016-01-01

    The plant-dedicated mirror of the Regulatory Sequence Analysis Tools (RSAT, http://plants.rsat.eu ) offers specialized options for researchers dealing with plant transcriptional regulation. The website contains whole-sequenced genomes from species regularly updated from Ensembl Plants and other sources (currently 40), and supports an array of tasks frequently required for the analysis of regulatory sequences, such as retrieving upstream sequences, motif discovery, motif comparison, and pattern matching. RSAT::Plants also integrates the footprintDB collection of DNA motifs. This protocol explains step-by-step how to discover DNA motifs in regulatory regions of clusters of co-expressed genes in plants. It also explains how to empirically control the significance of the result, and how to associate the discovered motifs with putative binding factors. PMID:27557774

  2. Selection for the G4 DNA motif at the 5' end of human genes.

    Science.gov (United States)

    Eddy, Johanna; Maizels, Nancy

    2009-04-01

    Formation of G4 DNA may occur in the course of replication and transcription, and contribute to genomic instability. We have quantitated abundance of G4 motifs and potential for G4 DNA formation of the nontemplate strand of 5' exons and introns of transcripts of human genes. We find that, for all human genes, G4 motifs are enriched in 5' regions of transcripts relative to downstream regions; and in 5' regulatory regions relative to coding regions. Notably, although tumor suppressor genes are depleted and proto-oncogenes enriched in G4 motifs, abundance of G4 motifs in the 5' regions of transcripts of genes in these categories does not differ. These results support the hypothesis that G4 motifs are under selection in the human genome. They further show that for tumor suppressor genes and proto-oncogenes, independent selection determines potential for G4 DNA formation of 5' regulatory regions of transcripts and downstream coding regions.

  3. Aliasing Errours in Parallel Signature Analyzers

    Institute of Scientific and Technical Information of China (English)

    闵应骅; YashwantK.Malaiya

    1990-01-01

    A Linear Feedback Shift Register(LFSR)can be used to compress test response data as a Signature Analyzer(SA).Parallel Signature Analyzers(PSAs)implemented as multiple input LFSRs are faster and require less hardware overhead than Serial Signature Analyzers(SSAs) for compacting test response data for Built-In Self-Test(BIST)in IC of boare-testing environments.However,the SAs are prone to aliasing errors because of some specific types of error patterns.An alias is a faulty output signature that is identical to the fault-free signature.A penetrating analysis of detecting capability of SAs depends strongly on mathematical manipulations,instead of being aware of some special cases of examples.In addition,the analysis should not be restricted to a particular structure of LFSR,but be appropriate for various structures of LFSRs.This paper presents necessary and sufficient conditions for aliasing errors based on a complete mathematical description of various types of SAs.An LFSR reconfiguration scheme is suggested which will prevent any aliasing double errors.Such a prevention cannot be obtained by any extension of an LFSR.

  4. The signature package on Witt spaces

    CERN Document Server

    Albin, Pierre; Mazzeo, Rafe; Piazza, Paolo

    2011-01-01

    In this paper we prove a variety of results about the signature operator on Witt spaces. First, we give a parametrix construction for the signature operator on any compact, oriented, stratified pseudomanifold X which satisfies the Witt condition. This construction, which is inductive over the `depth' of the singularity, is then used to show that the signature operator is essentially self-adjoint and has discrete spectrum of finite multiplicity, so that its index -- the analytic signature of X -- is well-defined. This provides an alternate approach to some well-known results due to Cheeger. We then prove some new results. By coupling this parametrix construction to a C*_r\\Gamma-Mishchenko bundle associated to any Galois covering of X with covering group \\Gamma, we prove analogues of the same analytic results, from which it follows that one may define an analytic signature index class as an element of the K-theory of C*_r\\Gamma. We go on to establish in this setting and for this class the full range of conclusi...

  5. The Land of the Dead – International Motifs in the Oldest Work of Japanese Literature

    Directory of Open Access Journals (Sweden)

    Danijela Vasić

    2010-02-01

    Full Text Available Il existe dans le Kojiki (712, la plus ancienne œuvre littéraire du Japon, une abondance de motifs que l’on peut retrouver dans les cultures de nombreux peuples dans le monde entier. Cet article traite des motifs internationaux tissés dans deux mythes du premier tome, formant une image poétique du Pays des morts, la partie souterraine d’une structure cosmique tripartite. Sont abordés, entre autres, le motif largement connu de Perséphone, le motif orphique ou encore le motif de la fuite du Pays des morts.In the Kojiki (712, the oldest literary work of Japan, there is a plethora of motifs which could be found in the cultures of many peoples all over the world. This paper deals with the international motifs interwoven in two myths from the first volume, forming a poetic picture of the Land of the Dead, the underworld part of the trichotomic cosmic structure. Among other things, we find the widely known Persephone motif, the Orphic motif or the motif of the successful escape from the Land of the Dead.En Kojiki (712, la obra literaria más antigua de Japón, abundan motivos que pueden encontrarse en numerosas culturas de todo el mundo. Este artículo analiza los motivos internacionales entretejidos en dos mitos del primer volumen, los cuales forman una imagen poética del País de los Muertos, la sección subterránea de una estructura cósmica tripartita. Se abordan, entre otros, el famoso motivo de Perséfone, el motivo órfico de la huída exitosa del País de los Muertos.

  6. Bioinformatics Study of Cancer-Related Mutations within p53 Phosphorylation Site Motifs

    Directory of Open Access Journals (Sweden)

    Xiaona Ji

    2014-07-01

    Full Text Available p53 protein has about thirty phosphorylation sites located at the N- and C-termini and in the core domain. The phosphorylation sites are relatively less mutated than other residues in p53. To understand why and how p53 phosphorylation sites are rarely mutated in human cancer, using a bioinformatics approaches, we examined the phosphorylation site and its nearby flanking residues, focusing on the consensus phosphorylation motif pattern, amino-acid correlations within the phosphorylation motifs, the propensity of structural disorder of the phosphorylation motifs, and cancer mutations observed within the phosphorylation motifs. Many p53 phosphorylation sites are targets for several kinases. The phosphorylation sites match 17 consensus sequence motifs out of the 29 classified. In addition to proline, which is common in kinase specificity-determining sites, we found high propensity of acidic residues to be adjacent to phosphorylation sites. Analysis of human cancer mutations in the phosphorylation motifs revealed that motifs with adjacent acidic residues generally have fewer mutations, in contrast to phosphorylation sites near proline residues. p53 phosphorylation motifs are mostly disordered. However, human cancer mutations within phosphorylation motifs tend to decrease the disorder propensity. Our results suggest that combination of acidic residues Asp and Glu with phosphorylation sites provide charge redundancy which may safe guard against loss-of-function mutations, and that the natively disordered nature of p53 phosphorylation motifs may help reduce mutational damage. Our results further suggest that engineering acidic amino acids adjacent to potential phosphorylation sites could be a p53 gene therapy strategy.

  7. An examination of quantitative methods for Forensic Signature Analysis and the admissibility of signature verification system as legal evidence.

    OpenAIRE

    Chatzisterkotis, Thomas

    2015-01-01

    The experiments described in this thesis deal with handwriting characteristics which are involved in the production of forged and genuine signatures and complexity of signatures. The objectives of this study were (1) to provide sufficient details on which of the signature characteristics are easier to forge, (2) to investigate the capabilities of the signature complexity formula given by Found et al. based on a different signature database provided by University of Kent. This database includes ...

  8. One motif to bind them: A small-XXX-small motif affects transmembrane domain 1 oligomerization, function, localization, and cross-talk between two yeast GPCRs.

    Science.gov (United States)

    Lock, Antonia; Forfar, Rachel; Weston, Cathryn; Bowsher, Leo; Upton, Graham J G; Reynolds, Christopher A; Ladds, Graham; Dixon, Ann M

    2014-12-01

    G protein-coupled receptors (GPCRs) are the largest family of cell-surface receptors in mammals and facilitate a range of physiological responses triggered by a variety of ligands. GPCRs were thought to function as monomers, however it is now accepted that GPCR homo- and hetero-oligomers also exist and influence receptor properties. The Schizosaccharomyces pombe GPCR Mam2 is a pheromone-sensing receptor involved in mating and has previously been shown to form oligomers in vivo. The first transmembrane domain (TMD) of Mam2 contains a small-XXX-small motif, overrepresented in membrane proteins and well-known for promoting helix-helix interactions. An ortholog of Mam2 in Saccharomyces cerevisiae, Ste2, contains an analogous small-XXX-small motif which has been shown to contribute to receptor homo-oligomerization, localization and function. Here we have used experimental and computational techniques to characterize the role of the small-XXX-small motif in function and assembly of Mam2 for the first time. We find that disruption of the motif via mutagenesis leads to reduction of Mam2 TMD1 homo-oligomerization and pheromone-responsive cellular signaling of the full-length protein. It also impairs correct targeting to the plasma membrane. Mutation of the analogous motif in Ste2 yielded similar results, suggesting a conserved mechanism for assembly. Using co-expression of the two fungal receptors in conjunction with computational models, we demonstrate a functional change in G protein specificity and propose that this is brought about through hetero-dimeric interactions of Mam2 with Ste2 via the complementary small-XXX-small motifs. This highlights the potential of these motifs to affect a range of properties that can be investigated in other GPCRs.

  9. Geometry of Killing spinors in neutral signature

    CERN Document Server

    Klemm, Dietmar

    2015-01-01

    We classify the supersymmetric solutions of minimal $N=2$ gauged supergravity in four dimensions with neutral signature. They are distinguished according to the sign of the cosmological constant and whether the vector field constructed as a bilinear of the Killing spinor is null or non-null. In neutral signature the bilinear vector field can be spacelike, which is a new feature not arising in Lorentzian signature. In the $\\Lambda0$ non-null case, the manifold is a fibration over a Lorentzian Gauduchon-Tod base space. Finally, in the $\\Lambda>0$ null class, the metric is contained in the Kundt family, and it turns out that the holonomy is reduced to ${\\rm Sim}(1)\\times{\\rm Sim}(1)$. There appear no self-dual solutions in the null class for either sign of the cosmological constant.

  10. Cryptanalysis of the arbitrated quantum signature protocols

    Science.gov (United States)

    Gao, Fei; Qin, Su-Juan; Guo, Fen-Zhuo; Wen, Qiao-Yan

    2011-08-01

    As a new model for signing quantum messages, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show that in these protocols the receiver, Bob, can realize existential forgery of the sender's signature under known message attack. Bob can even achieve universal forgery when the protocols are used to sign a classical message. Furthermore, the sender, Alice, can successfully disavow any of her signatures by simple attack. The attack strategies are described in detail and some discussions about the potential improvements of the protocols are given. Finally we also present several interesting topics on AQS protocols that can be studied in future.

  11. Cryptanalysis of the arbitrated quantum signature protocols

    CERN Document Server

    Gao, Fei; Guo, Fen-Zhuo; Wen, Qiao-Yan

    2011-01-01

    As a new model for signing quantum message, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show that in these protocols the receiver Bob can realize existential forgery of the sender's signature under known message attack. Bob can even achieve universal forgery when the protocols are used to sign a classical message. Furthermore, the sender Alice can successfully disavow any of her signatures by simple attack. The attack strategies are described in detail and some discussions about the potential improvements of the protocols are given. Finally we also present several interesting topics in future study on AQS protocols.

  12. A Methodology for Calculating Radiation Signatures

    Energy Technology Data Exchange (ETDEWEB)

    Klasky, Marc Louis [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Wilcox, Trevor [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Bathke, Charles G. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); James, Michael R. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-05-01

    A rigorous formalism is presented for calculating radiation signatures from both Special Nuclear Material (SNM) as well as radiological sources. The use of MCNP6 in conjunction with CINDER/ORIGEN is described to allow for the determination of both neutron and photon leakages from objects of interest. In addition, a description of the use of MCNP6 to properly model the background neutron and photon sources is also presented. Examinations of the physics issues encountered in the modeling are investigated so as to allow for guidance in the user discerning the relevant physics to incorporate into general radiation signature calculations. Furthermore, examples are provided to assist in delineating the pertinent physics that must be accounted for. Finally, examples of detector modeling utilizing MCNP are provided along with a discussion on the generation of Receiver Operating Curves, which are the suggested means by which to determine detectability radiation signatures emanating from objects.

  13. Explosives Detection: Exploitation of the Physical Signatures

    Science.gov (United States)

    Atkinson, David

    2010-10-01

    Explosives based terrorism is an ongoing threat that is evolving with respect to implementation, configuration and materials used. There are a variety of devices designed to detect explosive devices, however, each technology has limitations and operational constraints. A full understanding of the signatures available for detection coupled with the array of detection choices can be used to develop a conceptual model of an explosives screening operation. Physics based sensors provide a robust approach to explosives detection, typically through the identification of anomalies, and are currently used for screening in airports around the world. The next generation of detectors for explosives detection will need to be more sensitive and selective, as well as integrate seamlessly with devices focused on chemical signatures. An appreciation for the details of the physical signature exploitation in cluttered environments with time, space, and privacy constraints is necessary for effective explosives screening of people, luggage, cargo, and vehicles.

  14. Fluorescent taggants with temporally coded signatures.

    Science.gov (United States)

    Wang, Siyang; Vyas, Raul; Dwyer, Chris

    2016-07-11

    In this paper, resonance energy transfer (RET) networks between chromophores are used to implement fluorescent taggants with temporally coded signatures. Because the temporal signature of such a fluorescent taggant is a phase-type distribution defined by the geometry of its RET network, the taggant design is not constrained by resolvable dyes and has a significantly larger coding capacity than spectrally or lifetime coded fluorescent taggants. Meanwhile, the detection process becomes highly efficient when the signatures are coded in the time domain. The taggant identification method is based on the multinomial distribution of detected photons and Maximum Likelihood Estimation, which guarantees high accuracy even with only a few hundred photons and also applies to a mixture of taggants in multiplex detection. Therefore, these temporally coded fluorescent taggants have great potential for both in situ and Lidar applications. PMID:27410827

  15. Temporal shape analysis via the spectral signature.

    Science.gov (United States)

    Bernardis, Elena; Konukoglu, Ender; Ou, Yangming; Metaxas, Dimitris N; Desjardins, Benoit; Pohl, Kilian M

    2012-01-01

    In this paper, we adapt spectral signatures for capturing morphological changes over time. Advanced techniques for capturing temporal shape changes frequently rely on first registering the sequence of shapes and then analyzing the corresponding set of high dimensional deformation maps. Instead, we propose a simple encoding motivated by the observation that small shape deformations lead to minor refinements in the spectral signature composed of the eigenvalues of the Laplace operator. The proposed encoding does not require registration, since spectral signatures are invariant to pose changes. We apply our representation to the shapes of the ventricles extracted from 22 cine MR scans of healthy controls and Tetralogy of Fallot patients. We then measure the accuracy score of our encoding by training a linear classifier, which outperforms the same classifier based on volumetric measurements. PMID:23286031

  16. Quantum mechanical stabilization of Minkowski signature wormholes

    Energy Technology Data Exchange (ETDEWEB)

    Visser, M.

    1989-05-19

    When one attempts to construct classical wormholes in Minkowski signature Lorentzian spacetimes violations of both the weak energy hypothesis and averaged weak energy hypothesis are encountered. Since the weak energy hypothesis is experimentally known to be violated quantum mechanically, this suggests that a quantum mechanical analysis of Minkowski signature wormholes is in order. In this note I perform a minisuperspace analysis of a simple class of Minkowski signature wormholes. By solving the Wheeler-de Witt equation for pure Einstein gravity on this minisuperspace the quantum mechanical wave function of the wormhole is obtained in closed form. The wormhole is shown to be quantum mechanically stabilized with an average radius of order the Planck length. 8 refs.

  17. Trace element ink spiking for signature authentication

    International Nuclear Information System (INIS)

    Signature authentication is a critical question in forensic document examination. Last years the evolution of personal computers made signature copying a quite easy task, so the development of new ways for signature authentication is crucial. In the present work a commercial ink was spiked with many trace elements in various concentrations. Inorganic and organometallic ink soluble compounds were used as spiking agents, whilst ink retained its initial properties. The spiked inks were used for paper writing and the documents were analyzed by a non destructive method, the energy dispersive X-ray fluorescence. The thin target model was proved right for quantitative analysis and a very good linear relationship of the intensity (X-ray signal) against concentration was estimated for all used elements. Intensity ratios between different elements in the same ink gave very stable results, independent on the writing alterations. The impact of time both to written document and prepared inks was also investigated. (author)

  18. Peripheral blood signatures of lead exposure.

    Directory of Open Access Journals (Sweden)

    Heather G LaBreche

    Full Text Available BACKGROUND: Current evidence indicates that even low-level lead (Pb exposure can have detrimental effects, especially in children. We tested the hypothesis that Pb exposure alters gene expression patterns in peripheral blood cells and that these changes reflect dose-specific alterations in the activity of particular pathways. METHODOLOGY/PRINCIPAL FINDING: Using Affymetrix Mouse Genome 430 2.0 arrays, we examined gene expression changes in the peripheral blood of female Balb/c mice following exposure to per os lead acetate trihydrate or plain drinking water for two weeks and after a two-week recovery period. Data sets were RMA-normalized and dose-specific signatures were generated using established methods of supervised classification and binary regression. Pathway activity was analyzed using the ScoreSignatures module from GenePattern. CONCLUSIONS/SIGNIFICANCE: The low-level Pb signature was 93% sensitive and 100% specific in classifying samples a leave-one-out crossvalidation. The high-level Pb signature demonstrated 100% sensitivity and specificity in the leave-one-out crossvalidation. These two signatures exhibited dose-specificity in their ability to predict Pb exposure and had little overlap in terms of constituent genes. The signatures also seemed to reflect current levels of Pb exposure rather than past exposure. Finally, the two doses showed differential activation of cellular pathways. Low-level Pb exposure increased activity of the interferon-gamma pathway, whereas high-level Pb exposure increased activity of the E2F1 pathway.

  19. The bridge: suggestions about the meaning of a pictorial motif

    Directory of Open Access Journals (Sweden)

    Omar Calabrese

    2011-12-01

    Full Text Available Developing research begun at the Warburg Institute in 1983, this paper reflects on the construction of meaning in a work of art, through the analysis of the bridge’s function in painting. It tries to reply to some objections the author received there from Gombrich, about the chance of finding a stable content in the configuration of the bridge. Hence, the study reconsiders the concept of ‘motif’ applied to this structure. In a semiotic perspective a motif is partially independent as regards to a single textual organization, because it has a mobile and migrant feature. However, it is also partially flexible as it depends upon the same organization. The inquiry shows that bridge’s internal structure corresponds to the category of a ‘junction’, with two opposite items, ‘conjunction’ and ‘disjunction’. The development of this theoretical object can be carried out also by figures that are not ‘bridges’, in the natural sense of the word. Furthermore, its meaning does not depend upon the number of examples we can find but only upon their relevance for constructing a ‘grammar of cases’. Differently from the traditional iconographical approach, but also from panofskian iconology, the analysis moves not only towards the simple or complex content of a figure but also towards its description.

  20. Network motifs that stabilize the hybrid epithelial/mesenchymal phenotype

    Science.gov (United States)

    Jolly, Mohit Kumar; Jia, Dongya; Tripathi, Satyendra; Hanash, Samir; Mani, Sendurai; Ben-Jacob, Eshel; Levine, Herbert

    Epithelial to Mesenchymal Transition (EMT) and its reverse - MET - are hallmarks of cancer metastasis. While transitioning between E and M phenotypes, cells can also attain a hybrid epithelial/mesenchymal (E/M) phenotype that enables collective cell migration as a cluster of Circulating Tumor Cells (CTCs). These clusters can form 50-times more tumors than individually migrating CTCs, underlining their importance in metastasis. However, this hybrid E/M phenotype has been hypothesized to be only a transient one that is attained en route EMT. Here, via mathematically modeling, we identify certain `phenotypic stability factors' that couple with the core three-way decision-making circuit (miR-200/ZEB) and can maintain or stabilize the hybrid E/M phenotype. Further, we show experimentally that this phenotype can be maintained stably at a single-cell level, and knockdown of these factors impairs collective cell migration. We also show that these factors enable the association of hybrid E/M with high stemness or tumor-initiating potential. Finally, based on these factors, we deduce specific network motifs that can maintain the E/M phenotype. Our framework can be used to elucidate the effect of other players in regulating cellular plasticity during metastasis. This work was supported by NSF PHY-1427654 (Center for Theoretical Biological Physics) and the CPRIT Scholar in Cancer Research of the State of Texas at Rice University.

  1. Complexe de Poids, Dualit\\'e et Motifs de Beilinson

    CERN Document Server

    Hébert, David

    2010-01-01

    In the article [GS96], Gillet and Soul\\'e define a weight complex on the category of Voevodsky motives over a field of characteristic 0. In [Bon07], Bondarko generalizes this construction for any f-category with a bounded weight structure, as is the case for Beilinson motives (following Cisinski-D\\'eglise ; [CD09]). The first purpose of this note is to generalize [GS96, thm. 2] in the world of Beilinson motives. This done, we will naturally be led to define the motivic Euler characteristic dual to that considered by Bondarko in [Bon10]. This fact will motivate the second line of this note : proving that the duality operation exchanges the weight as is the case for t-structure ([BBD, 5.1.14.(iii)]). ----- Dans l'article [GS96], Gillet et Soul\\'e d\\'efinissent un complexe de poids sur la cat\\'egorie des motifs de Voevodsky d\\'efinie sur un corps de caract\\'eristique 0. Dans [Bon07], Bondarko g\\'en\\'eralise cette construction pour toute f-cat\\'egorie munie d'une structure de poids born\\'ee, comme c'est le cas po...

  2. Sulfur-induced structural motifs on copper and gold surfaces

    Science.gov (United States)

    Walen, Holly

    The interaction of sulfur with copper and gold surfaces plays a fundamental role in important phenomena that include coarsening of surface nanostructures, and self-assembly of alkanethiols. Here, we identify and analyze unique sulfur-induced structural motifs observed on the low-index surfaces of these two metals. We seek out these structures in an effort to better understand the fundamental interactions between these metals and sulfur that lends to the stability and favorability of metal-sulfur complexes vs. chemisorbed atomic sulfur. We choose very specific conditions: very low temperature (5 K), and very low sulfur coverage (≤ 0.1 monolayer). In this region of temperature-coverage space, which has not been examined previously for these adsorbate-metal systems, the effects of individual interactions between metals and sulfur are most apparent and can be assessed extensively with the aid of theory and modeling. Furthermore, at this temperature diffusion is minimal and relatively-mobile species can be isolated, and at low coverage the structures observed are not consumed by an extended reconstruction. The primary experimental technique is scanning tunneling microscopy (STM). The experimental observations presented here---made under identical conditions---together with extensive DFT analyses, allow comparisons and insights into factors that favor the existence of metal-sulfur complexes, vs. chemisorbed atomic sulfur, on metal terraces. We believe this data will be instrumental in better understanding the complex phenomena occurring between the surfaces of coinage metals and sulfur.

  3. VAMP subfamilies identified by specific R-SNARE motifs.

    Science.gov (United States)

    Rossi, Valeria; Picco, Raffaella; Vacca, Marcella; D'Esposito, Maurizio; D'Urso, Michele; Galli, Thierry; Filippini, Francesco

    2004-05-01

    In eukaryotes, interactions among the alpha-helical coiled-coil domains (CCDs) of soluble N-ethylmaleimide-sensitive factor attachment protein receptors (SNAREs) play a pivotal role in mediating the fusion among vesicles and target membranes. Surface residues of such CCDs are major candidates to regulate the specificity of membrane fusion, as they may alter local charge at the interaction layers and surface of the fusion complex, possibly modulating its formation and/or the binding of non-SNARE regulatory factors. Based on alternate patterns in surface residues, we have identified two motifs which group vesicular SNAREs in two novel subfamilies: RG-SNAREs and RD-SNAREs. The RG-SNARE CCD is common to all members of the widely conserved family of long VAMPs or longins and to yeast and non-neuronal VAMPs, possibly mediating "basic" fusion mechanisms; instead, only synaptobrevins from Bilateria share an RD-SNARE CCD, which is likely to mediate interactions to specific, yet unknown, regulatory factors and/or be the landmark of rapid fusion reactions like that mediating the release of neurotransmitters.

  4. Tyrosine motifs are required for prestin basolateral membrane targeting

    Directory of Open Access Journals (Sweden)

    Yifan Zhang

    2015-01-01

    Full Text Available Prestin is targeted to the lateral wall of outer hair cells (OHCs where its electromotility is critical for cochlear amplification. Using MDCK cells as a model system for polarized epithelial sorting, we demonstrate that prestin uses tyrosine residues, in a YXXΦ motif, to target the basolateral surface. Both Y520 and Y667 are important for basolateral targeting of prestin. Mutation of these residues to glutamine or alanine resulted in retention within the Golgi and delayed egress from the Golgi in Y667Q. Basolateral targeting is restored upon mutation to phenylalanine suggesting the importance of a phenol ring in the tyrosine side chain. We also demonstrate that prestin targeting to the basolateral surface is dependent on AP1B (μ1B, and that prestin uses transferrin containing early endosomes in its passage from the Golgi to the basolateral plasma membrane. The presence of AP1B (μ1B in OHCs, and parallels between prestin targeting to the basolateral surface of OHCs and polarized epithelial cells suggest that outer hair cells resemble polarized epithelia rather than neurons in this important phenotypic measure.

  5. State of the Art: Signature Biometrics Verification

    Directory of Open Access Journals (Sweden)

    Nourddine Guersi

    2010-04-01

    Full Text Available This paper presents a comparative analysis of the performance of three estimation algorithms: Expectation Maximization (EM, Greedy EM Algorithm (GEM and Figueiredo-Jain Algorithm (FJ - based on the Gaussian mixture models (GMMs for signature biometrics verification. The simulation results have shown significant performance achievements. The test performance of EER=5.49 % for "EM", EER=5.04 % for "GEM" and EER=5.00 % for "FJ", shows that the behavioral information scheme of signature biometrics is robust and has a discriminating power, which can be explored for identity authentication.

  6. Reflectance signature on sunlit crown of conifers

    Institute of Scientific and Technical Information of China (English)

    王锦地; 李小文; 项月琴

    1997-01-01

    Based on the field measurements of the reflected radiation distribution on sunlit crown surface and crown structure, the analytical approximation model of path-scattering of light in a homogeneous layer is applied to the calculation of the reflectance signature of sunlit crown. The reflectance on the sunlit crown surface is considered as the weighted sum of the direct-to-hemisphere reflectance and the hemisphere-to-hemisphere reflectance. The validation results show that the calculated reflectance signature fits the field measurement very well This paper presents details of the validation and the feasibility of the model application to nonuniform medium, such as tree crown canopies.

  7. Security problem on arbitrated quantum signature schemes

    Science.gov (United States)

    Choi, Jeong Woon; Chang, Ku-Young; Hong, Dowon

    2011-12-01

    Many arbitrated quantum signature schemes implemented with the help of a trusted third party have been developed up to now. In order to guarantee unconditional security, most of them take advantage of the optimal quantum one-time encryption based on Pauli operators. However, in this paper we point out that the previous schemes provide security only against a total break attack and show in fact that there exists an existential forgery attack that can validly modify the transmitted pair of message and signature. In addition, we also provide a simple method to recover security against the proposed attack.

  8. Security problem on arbitrated quantum signature schemes

    CERN Document Server

    Choi, Jeong Woon; Hong, Dowon

    2011-01-01

    Until now, there have been developed many arbitrated quantum signature schemes implemented with a help of a trusted third party. In order to guarantee the unconditional security, most of them take advantage of the optimal quantum one-time encryption method based on Pauli operators. However, we in this paper point out that the previous schemes only provides a security against total break and actually show that there exists a simple existential forgery attack to validly modify the transmitted pair of message and signature. In addition, we also provide a simple method to recover the security against the proposed attack.

  9. Self-Similarity Limits of Genomic Signatures

    CERN Document Server

    Wu, Z B

    2002-01-01

    It is shown that metric representation of DNA sequences is one-to-one. By using the metric representation method, suppression of nucleotide strings in the DNA sequences is determined. For a DNA sequence, an optimal string length to display genomic signature in chaos game representation is obtained by eliminating effects of the finite sequence. The optical string length is further shown as a self- similarity limit in computing information dimension. By using the method, self-similarity limits of bacteria complete genomic signatures are further determined.

  10. Electronic Seal Stamping Based on Group Signature

    Directory of Open Access Journals (Sweden)

    Girija Srikanth

    2011-05-01

    Full Text Available This paper describes a new electronic official seal stamping based on Group Signature, USB Key. Bill/Contract in E-commerce must be seal stamped to gain tamper proof and non-repudiation. The seal stamping control is designed based on the certificate-based public key. This technique is more efficient for generating and verifying individual/group signatures in terms of computational efforts and communication costs. Web page electronic seal-stamping system is implemented which has been adopted by CNBAB platform since Mar., 2008

  11. LHC Signatures Of Scalar Dark Energy

    CERN Document Server

    Brax, Philippe; Englert, Christoph; Spannowsky, Michael

    2016-01-01

    Scalar dark energy fields that couple to the Standard Model can give rise to observable signatures at the LHC. In this work we show that $t\\bar t+$missing energy and mono-jet searches are suitable probes in the limit where the dark energy scalar is stable on collider distances. We discuss the prospects of distinguishing the dark energy character of new physics signals from dark matter signatures and the possibility of probing the self-interactions of the dark energy sector.

  12. Threshold Signature Scheme Based on Discrete Logarithm and Quadratic Residue

    Institute of Scientific and Technical Information of China (English)

    FEI Ru-chun; WANG Li-na

    2004-01-01

    Digital signature scheme is a very important research field in computer security and modern cryptography.A(k,n) threshold digital signature scheme is proposed by integrating digital signature scheme with Shamir secret sharing scheme.It can realize group-oriented digital signature, and its security is based on the difficulty in computing discrete logarithm and quadratic residue on some special conditions.In this scheme, effective digital signature can not be generated by any k-1 or fewer legal users, or only by signature executive.In addition, this scheme can identify any legal user who presents incorrect partial digital signature to disrupt correct signature, or any illegal user who forges digital signature.A method of extending this scheme to an Abelian group such as elliptical curve group is also discussed.The extended scheme can provide rapider computing speed and stronger security in the case of using shorter key.

  13. FR3D: finding local and composite recurrent structural motifs in RNA 3D structures.

    Science.gov (United States)

    Sarver, Michael; Zirbel, Craig L; Stombaugh, Jesse; Mokdad, Ali; Leontis, Neocles B

    2008-01-01

    New methods are described for finding recurrent three-dimensional (3D) motifs in RNA atomic-resolution structures. Recurrent RNA 3D motifs are sets of RNA nucleotides with similar spatial arrangements. They can be local or composite. Local motifs comprise nucleotides that occur in the same hairpin or internal loop. Composite motifs comprise nucleotides belonging to three or more different RNA strand segments or molecules. We use a base-centered approach to construct efficient, yet exhaustive search procedures using geometric, symbolic, or mixed representations of RNA structure that we implement in a suite of MATLAB programs, "Find RNA 3D" (FR3D). The first modules of FR3D preprocess structure files to classify base-pair and -stacking interactions. Each base is represented geometrically by the position of its glycosidic nitrogen in 3D space and by the rotation matrix that describes its orientation with respect to a common frame. Base-pairing and base-stacking interactions are calculated from the base geometries and are represented symbolically according to the Leontis/Westhof basepairing classification, extended to include base-stacking. These data are stored and used to organize motif searches. For geometric searches, the user supplies the 3D structure of a query motif which FR3D uses to find and score geometrically similar candidate motifs, without regard to the sequential position of their nucleotides in the RNA chain or the identity of their bases. To score and rank candidate motifs, FR3D calculates a geometric discrepancy by rigidly rotating candidates to align optimally with the query motif and then comparing the relative orientations of the corresponding bases in the query and candidate motifs. Given the growing size of the RNA structure database, it is impossible to explicitly compute the discrepancy for all conceivable candidate motifs, even for motifs with less than ten nucleotides. The screening algorithm that we describe finds all candidate motifs whose

  14. RNA 3D Structural Motifs: Definition, Identification, Annotation, and Database Searching

    Science.gov (United States)

    Nasalean, Lorena; Stombaugh, Jesse; Zirbel, Craig L.; Leontis, Neocles B.

    Structured RNA molecules resemble proteins in the hierarchical organization of their global structures, folding and broad range of functions. Structured RNAs are composed of recurrent modular motifs that play specific functional roles. Some motifs direct the folding of the RNA or stabilize the folded structure through tertiary interactions. Others bind ligands or proteins or catalyze chemical reactions. Therefore, it is desirable, starting from the RNA sequence, to be able to predict the locations of recurrent motifs in RNA molecules. Conversely, the potential occurrence of one or more known 3D RNA motifs may indicate that a genomic sequence codes for a structured RNA molecule. To identify known RNA structural motifs in new RNA sequences, precise structure-based definitions are needed that specify the core nucleotides of each motif and their conserved interactions. By comparing instances of each recurrent motif and applying base pair isosteriCity relations, one can identify neutral mutations that preserve its structure and function in the contexts in which it occurs.

  15. Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction

    Science.gov (United States)

    Yeger-Lotem, Esti; Sattath, Shmuel; Kashtan, Nadav; Itzkovitz, Shalev; Milo, Ron; Pinter, Ron Y.; Alon, Uri; Margalit, Hanah

    2004-04-01

    Genes and proteins generate molecular circuitry that enables the cell to process information and respond to stimuli. A major challenge is to identify characteristic patterns in this network of interactions that may shed light on basic cellular mechanisms. Previous studies have analyzed aspects of this network, concentrating on either transcription-regulation or protein-protein interactions. Here we search for composite network motifs: characteristic network patterns consisting of both transcription-regulation and protein-protein interactions that recur significantly more often than in random networks. To this end we developed algorithms for detecting motifs in networks with two or more types of interactions and applied them to an integrated data set of protein-protein interactions and transcription regulation in Saccharomyces cerevisiae. We found a two-protein mixed-feedback loop motif, five types of three-protein motifs exhibiting coregulation and complex formation, and many motifs involving four proteins. Virtually all four-protein motifs consisted of combinations of smaller motifs. This study presents a basic framework for detecting the building blocks of networks with multiple types of interactions.

  16. Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks

    Energy Technology Data Exchange (ETDEWEB)

    Jin, R; McCallen, S; Almaas, E

    2007-05-28

    Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of complex networks have mainly focused on their network topology. However, in many real world applications, the edges and vertices have associated attributes that are frequently represented as vertex or edge weights. Furthermore, these weights are often not static, instead changing with time and forming a time series. Hence, to fully understand the dynamics of the complex network, we have to consider both network topology and related time series data. In this work, we propose a motif mining approach to identify trend motifs for such purposes. Simply stated, a trend motif describes a recurring subgraph where each of its vertices or edges displays similar dynamics over a userdefined period. Given this, each trend motif occurrence can help reveal significant events in a complex system; frequent trend motifs may aid in uncovering dynamic rules of change for the system, and the distribution of trend motifs may characterize the global dynamics of the system. Here, we have developed efficient mining algorithms to extract trend motifs. Our experimental validation using three disparate empirical datasets, ranging from the stock market, world trade, to a protein interaction network, has demonstrated the efficiency and effectiveness of our approach.

  17. A Novel Protein Interaction between Nucleotide Binding Domain of Hsp70 and p53 Motif

    Directory of Open Access Journals (Sweden)

    Asita Elengoe

    2015-01-01

    Full Text Available Currently, protein interaction of Homo sapiens nucleotide binding domain (NBD of heat shock 70 kDa protein (PDB: 1HJO with p53 motif remains to be elucidated. The NBD-p53 motif complex enhances the p53 stabilization, thereby increasing the tumor suppression activity in cancer treatment. Therefore, we identified the interaction between NBD and p53 using STRING version 9.1 program. Then, we modeled the three-dimensional structure of p53 motif through homology modeling and determined the binding affinity and stability of NBD-p53 motif complex structure via molecular docking and dynamics (MD simulation. Human DNA binding domain of p53 motif (SCMGGMNR retrieved from UniProt (UniProtKB: P04637 was docked with the NBD protein, using the Autodock version 4.2 program. The binding energy and intermolecular energy for the NBD-p53 motif complex were −0.44 Kcal/mol and −9.90 Kcal/mol, respectively. Moreover, RMSD, RMSF, hydrogen bonds, salt bridge, and secondary structure analyses revealed that the NBD protein had a strong bond with p53 motif and the protein-ligand complex was stable. Thus, the current data would be highly encouraging for designing Hsp70 structure based drug in cancer therapy.

  18. MODA: an efficient algorithm for network motif discovery in biological networks.

    Science.gov (United States)

    Omidi, Saeed; Schreiber, Falk; Masoudi-Nejad, Ali

    2009-10-01

    In recent years, interest has been growing in the study of complex networks. Since Erdös and Rényi (1960) proposed their random graph model about 50 years ago, many researchers have investigated and shaped this field. Many indicators have been proposed to assess the global features of networks. Recently, an active research area has developed in studying local features named motifs as the building blocks of networks. Unfortunately, network motif discovery is a computationally hard problem and finding rather large motifs (larger than 8 nodes) by means of current algorithms is impractical as it demands too much computational effort. In this paper, we present a new algorithm (MODA) that incorporates techniques such as a pattern growth approach for extracting larger motifs efficiently. We have tested our algorithm and found it able to identify larger motifs with more than 8 nodes more efficiently than most of the current state-of-the-art motif discovery algorithms. While most of the algorithms rely on induced subgraphs as motifs of the networks, MODA is able to extract both induced and non-induced subgraphs simultaneously. The MODA source code is freely available at: http://LBB.ut.ac.ir/Download/LBBsoft/MODA/ PMID:20154426

  19. MODA: an efficient algorithm for network motif discovery in biological networks.

    Science.gov (United States)

    Omidi, Saeed; Schreiber, Falk; Masoudi-Nejad, Ali

    2009-10-01

    In recent years, interest has been growing in the study of complex networks. Since Erdös and Rényi (1960) proposed their random graph model about 50 years ago, many researchers have investigated and shaped this field. Many indicators have been proposed to assess the global features of networks. Recently, an active research area has developed in studying local features named motifs as the building blocks of networks. Unfortunately, network motif discovery is a computationally hard problem and finding rather large motifs (larger than 8 nodes) by means of current algorithms is impractical as it demands too much computational effort. In this paper, we present a new algorithm (MODA) that incorporates techniques such as a pattern growth approach for extracting larger motifs efficiently. We have tested our algorithm and found it able to identify larger motifs with more than 8 nodes more efficiently than most of the current state-of-the-art motif discovery algorithms. While most of the algorithms rely on induced subgraphs as motifs of the networks, MODA is able to extract both induced and non-induced subgraphs simultaneously. The MODA source code is freely available at: http://LBB.ut.ac.ir/Download/LBBsoft/MODA/

  20. Recurrent motifs as resonant attractor states in the narrative field: a testable model of archetype.

    Science.gov (United States)

    Goodwyn, Erik

    2013-06-01

    At the most basic level, archetypes represented Jung's attempt to explain the phenomenon of recurrent myths and folktale motifs (Jung 1956, 1959, para. 99). But the archetype remains controversial as an explanation of recurrent motifs, as the existence of recurrent motifs does not prove that archetypes exist. Thus, the challenge for contemporary archetype theory is not merely to demonstrate that recurrent motifs exist, since that is not disputed, but to demonstrate that archetypes exist and cause recurrent motifs. The present paper proposes a new model which is unlike others in that it postulates how the archetype creates resonant motifs. This model necessarily clarifies and adapts some of Jung's seminal ideas on archetype in order to provide a working framework grounded in contemporary practice and methodologies. For the first time, a model of archetype is proposed that can be validated on empirical, rather than theoretical grounds. This is achieved by linking the archetype to the hard data of recurrent motifs rather than academic trends in other fields.

  1. Recurrent motifs as resonant attractor states in the narrative field: a testable model of archetype.

    Science.gov (United States)

    Goodwyn, Erik

    2013-06-01

    At the most basic level, archetypes represented Jung's attempt to explain the phenomenon of recurrent myths and folktale motifs (Jung 1956, 1959, para. 99). But the archetype remains controversial as an explanation of recurrent motifs, as the existence of recurrent motifs does not prove that archetypes exist. Thus, the challenge for contemporary archetype theory is not merely to demonstrate that recurrent motifs exist, since that is not disputed, but to demonstrate that archetypes exist and cause recurrent motifs. The present paper proposes a new model which is unlike others in that it postulates how the archetype creates resonant motifs. This model necessarily clarifies and adapts some of Jung's seminal ideas on archetype in order to provide a working framework grounded in contemporary practice and methodologies. For the first time, a model of archetype is proposed that can be validated on empirical, rather than theoretical grounds. This is achieved by linking the archetype to the hard data of recurrent motifs rather than academic trends in other fields. PMID:23750942

  2. Fission yeast hotspot sequence motifs are also active in budding yeast.

    Directory of Open Access Journals (Sweden)

    Walter W Steiner

    Full Text Available In most organisms, including humans, meiotic recombination occurs preferentially at a limited number of sites in the genome known as hotspots. There has been substantial progress recently in elucidating the factors determining the location of meiotic recombination hotspots, and it is becoming clear that simple sequence motifs play a significant role. In S. pombe, there are at least five unique sequence motifs that have been shown to produce hotspots of recombination, and it is likely that there are more. In S. cerevisiae, simple sequence motifs have also been shown to produce hotspots or show significant correlations with hotspots. Some of the hotspot motifs in both yeasts are known or suspected to bind transcription factors (TFs, which are required for the activity of those hotspots. Here we show that four of the five hotspot motifs identified in S. pombe also create hotspots in the distantly related budding yeast S. cerevisiae. For one of these hotspots, M26 (also called CRE, we identify TFs, Cst6 and Sko1, that activate and inhibit the hotspot, respectively. In addition, two of the hotspot motifs show significant correlations with naturally occurring hotspots. The conservation of these hotspots between the distantly related fission and budding yeasts suggests that these sequence motifs, and others yet to be discovered, may function widely as hotspots in many diverse organisms.

  3. Comparative Analysis of Regulatory Motif Discovery Tools for Transcription Factor Binding Sites

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In the post-genomic era, identification of specific regulatory motifs or transcription factor binding sites (TFBSs) in non-coding DNA sequences, which is essential to elucidate transcriptional regulatory networks, has emerged as an obstacle that frustrates many researchers. Consequently, numerous motif discovery tools and correlated databases have been applied to solving this problem. However, these existing methods, based on different computational algorithms, show diverse motif prediction efficiency in non-coding DNA sequences. Therefore, understanding the similarities and differences of computational algorithms and enriching the motif discovery literatures are important for users to choose the most appropriate one among the online available tools. Moreover, there still lacks credible criterion to assess motif discovery tools and instructions for researchers to choose the best according to their own projects. Thus integration of the related resources might be a good approach to improve accuracy of the application. Recent studies integrate regulatory motif discovery tools with experimental methods to offer a complementary approach for researchers, and also provide a much-needed model for current researches on transcriptional regulatory networks. Here we present a comparative analysis of regulatory motif discovery tools for TFBSs.

  4. Quantum multi-signature protocol based on teleportation

    Energy Technology Data Exchange (ETDEWEB)

    Wen Xiao-jun; Liu Yun; Sun Yu [Beijing Jiaotong Univ., Beijing (China). School of Electronic Information Engineering

    2007-03-15

    In this paper, a protocol which can be used in multi-user quantum signature is proposed. The scheme of signature and verification is based on the correlation of Greenberger-Horne-Zeilinger (GHZ) states and the controlled quantum teleportation. Different from the digital signatures, which are based on computational complexity, the proposed protocol has perfect security in the noiseless quantum channels. Compared to previous quantum signature schemes, this protocol can verify the signature independent of an arbitrator as well as realize multi-user signature together. (orig.)

  5. Feasibility analysis of two identity- based proxy ring signature schemes

    Institute of Scientific and Technical Information of China (English)

    Wang Huaqun; Zhang Lijun; Zhao Junxi

    2007-01-01

    Recently , proxy ring signature schemes have been shown to be useful in various applications , such as electronic polling, electronic payment, etc. Although many proxy ring signature schemes have been proposed, there are only two identity- based proxy ring signature schemes have been proposed until now, I.e., Cheng's scheme and Lang's scheme. It's unlucky that the two identity- based proxy ring signature schemes are unfeasible . This paper points out the reasons why the two identity- based proxy ring signature schemes are unfeasible. In order to design feasible and efficient identity-based proxy ring signature schemes from bilinear pairings , we have to search for other methods .

  6. A New Batch Verifying Scheme for Identifying Illegal Signatures

    Institute of Scientific and Technical Information of China (English)

    Adrian Atanasiu

    2013-01-01

    The concept of batch verifying multiple digital signatures is to find a method by which multiple digital signatures can be verified simultaneously in a lower time complexity than separately verifying all the signatures.In this article,we analyze the complexity of the batch verifying schemes defined by Li,Hwang and Chen in 2010,and propose a new batch verifying multiple digital signature scheme,in two variants:one for RSA-by completing the Harn's schema with an identifying illegal signatures algorithm,and the other adapted for a modified Elliptic Curve Digital Signature Algorithm protocol.

  7. A New ID-Based Proxy Blind Signature Scheme

    Institute of Scientific and Technical Information of China (English)

    LANG Wei-min; YANG Zong-kai; CHENG Wen-qing; TAN Yun-meng

    2005-01-01

    An identity-based proxy blind signature scheme from bilinear pairings is introduced, which combines the advantages of proxy signature and blind signature. Furthermore, our scheme can prevent the original signer from generating the proxy blind signature, thus the profits of the proxy signer are guaranteed. We introduce bilinear pairings to minimize computational overhead and to improve the related performance of our scheme. In addition, the proxy blind signature presented is non-repudiable and it fulfills perfectly the security requirements of a proxy blind signature.

  8. Identification of a putative nuclear export signal motif in human NANOG homeobox domain

    International Nuclear Information System (INIS)

    Highlights: ► We found the putative nuclear export signal motif within human NANOG homeodomain. ► Leucine-rich residues are important for human NANOG homeodomain nuclear export. ► CRM1-specific inhibitor LMB blocked the potent human NANOG NES-mediated nuclear export. -- Abstract: NANOG is a homeobox-containing transcription factor that plays an important role in pluripotent stem cells and tumorigenic cells. To understand how nuclear localization of human NANOG is regulated, the NANOG sequence was examined and a leucine-rich nuclear export signal (NES) motif (125MQELSNILNL134) was found in the homeodomain (HD). To functionally validate the putative NES motif, deletion and site-directed mutants were fused to an EGFP expression vector and transfected into COS-7 cells, and the localization of the proteins was examined. While hNANOG HD exclusively localized to the nucleus, a mutant with both NLSs deleted and only the putative NES motif contained (hNANOG HD-ΔNLSs) was predominantly cytoplasmic, as observed by nucleo/cytoplasmic fractionation and Western blot analysis as well as confocal microscopy. Furthermore, site-directed mutagenesis of the putative NES motif in a partial hNANOG HD only containing either one of the two NLS motifs led to localization in the nucleus, suggesting that the NES motif may play a functional role in nuclear export. Furthermore, CRM1-specific nuclear export inhibitor LMB blocked the hNANOG potent NES-mediated export, suggesting that the leucine-rich motif may function in CRM1-mediated nuclear export of hNANOG. Collectively, a NES motif is present in the hNANOG HD and may be functionally involved in CRM1-mediated nuclear export pathway.

  9. Minimal motif peptide structure of metzincin clan zinc peptidases in micelles.

    Science.gov (United States)

    Onoda, Akira; Suzuki, Takako; Ishizuka, Hiroaki; Sugiyama, Rumiko; Ariyasu, Shinya; Yamamura, Takeshi

    2009-12-01

    It is well known that the functions of metalloproteins generally originate from their metal-binding motifs. However, the intrinsic nature of individual motifs remains unknown, particularly the details about metal-binding effects on the folding of motifs; the converse is also unknown, although there is no doubt that the motif is the core of the reactivity for each metalloprotein. In this study, we focused our attention on the zinc-binding motif of the metzincin clan family, HEXXHXXGXXH; this family contains the general zinc-binding sequence His-Glu-Xaa-Xaa-His (HEXXH) and the extended GXXH region. We adopted the motif sequence of stromelysin-1 and investigated the folding properties of the Trp-labeled peptides WAHEIAHSLGLFHA (STR-W1), AWHEIAHSLGLFHA (STR-W2), AHEIAHSLGWFHA (STR-W11), and AHEIAHSLGLFHWA (STR-W14) in the presence and absence of zinc ions in hydrophobic micellar environments by circular dichroism (CD) measurements. We accessed successful incorporation of these zinc peptides into micelles using quenching of Trp fluorescence. Results of CD studies indicated that two of the Trp-incorporated peptides, STR-W1 and STR-W14, exhibited helical folding in the hydrophobic region of cetyltrimethylammonium chloride micelle. The NMR structural analysis of the apo STR-W14 revealed that the conformation in the C-terminus GXXH region significantly differred between the apo state in the micelle and the reported Zn-bound state of stromelysin-1 in crystal structures. The structural analyses of the qualitative Zn-binding properties of this motif peptide provide an interesting Zn-binding mechanism: the minimum consensus motif in the metzincin clan, a basic zinc-binding motif with an extended GXXH region, has the potential to serve as a preorganized Zn binding scaffold in a hydrophobic environment.

  10. Miz-1 activates gene expression via a novel consensus DNA binding motif.

    Science.gov (United States)

    Barrilleaux, Bonnie L; Burow, Dana; Lockwood, Sarah H; Yu, Abigail; Segal, David J; Knoepfler, Paul S

    2014-01-01

    The transcription factor Miz-1 can either activate or repress gene expression in concert with binding partners including the Myc oncoprotein. The genomic binding of Miz-1 includes both core promoters and more distal sites, but the preferred DNA binding motif of Miz-1 has been unclear. We used a high-throughput in vitro technique, Bind-n-Seq, to identify two Miz-1 consensus DNA binding motif sequences--ATCGGTAATC and ATCGAT (Mizm1 and Mizm2)--bound by full-length Miz-1 and its zinc finger domain, respectively. We validated these sequences directly as high affinity Miz-1 binding motifs. Competition assays using mutant probes indicated that the binding affinity of Miz-1 for Mizm1 and Mizm2 is highly sequence-specific. Miz-1 strongly activates gene expression through the motifs in a Myc-independent manner. MEME-ChIP analysis of Miz-1 ChIP-seq data in two different cell types reveals a long motif with a central core sequence highly similar to the Mizm1 motif identified by Bind-n-Seq, validating the in vivo relevance of the findings. Miz-1 ChIP-seq peaks containing the long motif are predominantly located outside of proximal promoter regions, in contrast to peaks without the motif, which are highly concentrated within 1.5 kb of the nearest transcription start site. Overall, our results indicate that Miz-1 may be directed in vivo to the novel motif sequences we have identified, where it can recruit its specific binding partners to control gene expression and ultimately regulate cell fate. PMID:24983942

  11. Miz-1 activates gene expression via a novel consensus DNA binding motif.

    Directory of Open Access Journals (Sweden)

    Bonnie L Barrilleaux

    Full Text Available The transcription factor Miz-1 can either activate or repress gene expression in concert with binding partners including the Myc oncoprotein. The genomic binding of Miz-1 includes both core promoters and more distal sites, but the preferred DNA binding motif of Miz-1 has been unclear. We used a high-throughput in vitro technique, Bind-n-Seq, to identify two Miz-1 consensus DNA binding motif sequences--ATCGGTAATC and ATCGAT (Mizm1 and Mizm2--bound by full-length Miz-1 and its zinc finger domain, respectively. We validated these sequences directly as high affinity Miz-1 binding motifs. Competition assays using mutant probes indicated that the binding affinity of Miz-1 for Mizm1 and Mizm2 is highly sequence-specific. Miz-1 strongly activates gene expression through the motifs in a Myc-independent manner. MEME-ChIP analysis of Miz-1 ChIP-seq data in two different cell types reveals a long motif with a central core sequence highly similar to the Mizm1 motif identified by Bind-n-Seq, validating the in vivo relevance of the findings. Miz-1 ChIP-seq peaks containing the long motif are predominantly located outside of proximal promoter regions, in contrast to peaks without the motif, which are highly concentrated within 1.5 kb of the nearest transcription start site. Overall, our results indicate that Miz-1 may be directed in vivo to the novel motif sequences we have identified, where it can recruit its specific binding partners to control gene expression and ultimately regulate cell fate.

  12. Salt-bridge Swapping in the EXXERFXYY Motif of Proton Coupled Oligopeptide Transporters

    DEFF Research Database (Denmark)

    Aduri, Nanda G; Prabhala, Bala K; Ernst, Heidi A;

    2015-01-01

    to as E1XXE2R), located on Helix I, in interactions with the proton. In this study we investigated the intracellular substrate accumulation by motif variants with all possible combinations of glutamate residues changed to glutamine and arginine changed to a tyrosine; the latter being a natural variant......-motif salt bridge, i.e. R-E2 to R-E1, which is consistent with previous structural studies. Molecular dynamics simulations of the motif variants E1XXE2R and E1XXQ2R support this mechanism. The simulations showed that upon changing conformation, arginine pushes Helix V, through interactions with the highly...

  13. Analysis of the characteristic sequence of intein and revi-sion of its motifs

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Since the first intein (Sce VMA) was found in Saccharomydes cerevisiae ATPases gene in 1990, more and more inteins were identified. It is necessary to analyze the new inteins to understand the sequence charateristics of inteins. By searching protein and nucleic acid database systematically, 101 inteins were found, of which 69 inteins contain homing endonuclease motifs. We only analyze the 69 inteins since most inteins are the classic inteins with homing endonuclease motifs. We found that the distribution of these inteins is particular among species and protein. By multiple sequence alignment, some new sequence characteristics were found and the motifs described previously were revised.

  14. FTZ-Factor1 and Fushi tarazu interact via conserved nuclear receptor and coactivator motifs

    OpenAIRE

    Schwartz, Carol J.E.; Sampson, Heidi M.; Hlousek, Daniela; Percival-Smith, Anthony; Copeland, John W.R.; Simmonds, Andrew J.; Krause, Henry M.

    2001-01-01

    To activate transcription, most nuclear receptor proteins require coactivators that bind to their ligand-binding domains (LBDs). The Drosophila FTZ-Factor1 (FTZ-F1) protein is a conserved member of the nuclear receptor superfamily, but was previously thought to lack an AF2 motif, a motif that is required for ligand and coactivator binding. Here we show that FTZ-F1 does have an AF2 motif and that it is required to bind a coactivator, the homeodomain-containing protein Fushi tarazu (FTZ). We al...

  15. Identifying Function, Agent, and Setting Motifs in Some Early Spanish "libros de caballerías"

    OpenAIRE

    NEUMAYER, KRISTIN

    2012-01-01

    The essay presents the methodology of a doctoral thesis (2008, University of Wisconsin-Madison) which classifies plot motifs in some sixteenth-century Castilian books of chivalry. Therein, two critical approaches to the texts are noted: motif studies, which analyze narrative components, and structural studies, which examine whole plotlines. Based on V. Propp’s Morphology of the Folktale, the motif is defined as a unit of plot structure. Propp’s thirty-one functions and seven tale-roles are th...

  16. Evaluation of subgraph searching algorithms for detecting network motifs in biological networks

    Institute of Scientific and Technical Information of China (English)

    Jialu HU; Lin GAO; Guimin QIN

    2009-01-01

    Despite several algorithms for searching sub-graphs in motif detection presented in the literature, no ef-fort has been done for characterizing their performance till now. This paper presents a methodology to evaluate the performance of three algorithms: edge sampling algorithm (ESA), enumerate subgraphs (ESU) and randomly enumer-ate subgraphs (RAND-ESU). A series of experiments are performed to test sampling speed and sampling quality. The results show that RAND-ESU is more efficient and has less computational cost than other algorithms for large-size mo-tif detection, and ESU has its own advantage in small-size motif detection.

  17. Stochastic Resonance in Neuronal Network Motifs with Ornstein-Uhlenbeck Colored Noise

    Directory of Open Access Journals (Sweden)

    Xuyang Lou

    2014-01-01

    Full Text Available We consider here the effect of the Ornstein-Uhlenbeck colored noise on the stochastic resonance of the feed-forward-loop (FFL network motif. The FFL motif is modeled through the FitzHugh-Nagumo neuron model as well as the chemical coupling. Our results show that the noise intensity and the correlation time of the noise process serve as the control parameters, which have great impacts on the stochastic dynamics of the FFL motif. We find that, with a proper choice of noise intensities and the correlation time of the noise process, the signal-to-noise ratio (SNR can display more than one peak.

  18. Fully polarimetric analysis of weather radar signatures

    OpenAIRE

    Galletti, Michele; Bebbington, David; Chandra, Madhukar; Börner, Thomas

    2008-01-01

    In this work the concept of depolarization response, namely the degree of polarization as a function of transmit polarization state, is investigated. Application examples are shown in the field of radar meteorology, namely for hydrometeor identification with fully polarimetric weather radar signatures. Data are from POLDIRAD, DLR research weather radar.

  19. Signatures of black holes at the LHC

    OpenAIRE

    Cavaglia, Marco; Godang, Romulus; Cremaldi, Lucien M.; Summers, Donald J.

    2007-01-01

    Signatures of black hole events at CERN's Large Hadron Collider are discussed. Event simulations are carried out with the Fortran Monte Carlo generator CATFISH. Inelasticity effects, exact field emissivities, color and charge conservation, corrections to semiclassical black hole evaporation, gravitational energy loss at formation and possibility of a black hole remnant are included in the analysis.

  20. The Pedagogic Signature of Special Needs Education

    Science.gov (United States)

    Weiß, Sabine; Kollmannsberger, Markus; Lerche, Thomas; Oubaid, Viktor; Kiel, Ewald

    2014-01-01

    The goal of the following study is to identify a pedagogic signature, according to LS Shulman, for working with students who have special educational needs. Special educational needs are defined as significant limitations in personal development and learning which require particular educational measures beyond regular education. The development of…

  1. Observational signatures of self-destructive civilizations

    Science.gov (United States)

    Stevens, Adam; Forgan, Duncan; James, Jack O'malley

    2016-10-01

    We address the possibility that intelligent civilizations that destroy themselves could present signatures observable by humanity. Placing limits on the number of self-destroyed civilizations in the Milky Way has strong implications for the final three terms in Drake's Equation, and would allow us to identify which classes of solution to Fermi's Paradox fit with the evidence (or lack thereof). Using the Earth as an example, we consider a variety of scenarios in which humans could extinguish their own technological civilization. Each scenario presents some form of observable signature that could be probed by astronomical campaigns to detect and characterize extrasolar planetary systems. Some observables are unlikely to be detected at interstellar distances, but some scenarios are likely to produce significant changes in atmospheric composition that could be detected serendipitously with next-generation telescopes. In some cases, the timing of the observation would prove crucial to detection, as the decay of signatures is rapid compared with humanity's communication lifetime. In others, the signatures persist on far longer timescales.

  2. Arbitrated quantum signature scheme with message recovery

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Hwayean; Hong, Changho; Kim, Hyunsang; Lim, Jongin; Yang, Hyung Jin

    2004-02-16

    Two quantum signature schemes with message recovery relying on the availability of an arbitrator are proposed. One scheme uses a public board and the other does not. However both schemes provide confidentiality of the message and a higher efficiency in transmission.

  3. Quantum Signature Scheme with Weak Arbitrator

    Science.gov (United States)

    Luo, Ming-Xing; Chen, Xiu-Bo; Yun, Deng; Yang, Yi-Xian

    2012-07-01

    In this paper, we propose one quantum signature scheme with a weak arbitrator to sign classical messages. This scheme can preserve the merits in the original arbitrated scheme with some entanglement resources, and provide a higher efficiency in transmission and reduction the complexity of implementation. The arbitrator is costless and only involved in the disagreement case.

  4. An Arbitrated Quantum Signature with Bell States

    Science.gov (United States)

    Liu, Feng; Qin, Su-Juan; Huang, Wei

    2014-05-01

    Entanglement is the main resource in quantum communication. The main aims of the arbitrated quantum signature (AQS) scheme are to present an application of the entanglement in cryptology and to prove the possibility of the quantum signature. More specifically, the main function of quantum entangled states in the existing AQS schemes is to assist the signatory to transfer quantum states to the receiver. However, teleportation and the Leung quantum one-time pad (L-QOTP) algorithm are not enough to design a secure AQS scheme. For example, Pauli operations commute or anticommute with each other, which makes the implementation of attacks easily from the aspects of forgery and disavowal. To conquer this shortcoming, we construct an improved AQS scheme using a new QOTP algorithm. This scheme has three advantages: it randomly uses the Hadamard operation in the new QOTP to resist attacks by using the anticommutativity of nontrivial Pauli operators and it preserves almost all merits in the existing AQS schemes; even in the process of handling disputes, no party has chance to change the message and its signature without being discovered; the receiver can verify the integrity of the signature and discover the disavow of the signatory even in the last step of verification.

  5. SUSY with ATLAS Leptonic Signatures, Coannihilation Region

    CERN Document Server

    Comune, G

    2004-01-01

    In this work we present an initial study on how leptonic signatures can be used at ATLAS to constrain SUSY particle masses combinations for the first time in the so called "coannihilation region''. The analysis is carried out in the framework of mSUGRA constrained SUSY model using fast detector simulation and reconstruction exploiting an invariant mass endpoint technique.

  6. Nucleon-decay like signatures of Hylogenesis

    CERN Document Server

    Demidov, S V

    2015-01-01

    We consider nucleon-decay like signatures of the hylogenesis, a variant of antibaryonic dark matter model. For the interaction between visible and dark matter sectors through the neutron portal, we calculate rates of dark matter scatterings off neutron which mimic neutron-decay processes $n\\to \

  7. Exploring Signature Pedagogies in Undergraduate Leadership Education

    Science.gov (United States)

    Jenkins, Daniel M.

    2012-01-01

    This research explores the instructional strategies most frequently used by leadership educators who teach academic credit-bearing undergraduate leadership studies courses through a national survey and identifies signature pedagogies within the leadership discipline. Findings from this study suggest that class discussion--whether in the form of…

  8. CERN Member States signatures at LEP inauguration

    CERN Multimedia

    1989-01-01

    The signatures of the dignitaries who represented CERN's Member States on the occasion of the Inauguration of LEP on 13 November 1989. The Large Electron-Positron (LEP) collider was inaugurated in the presence of some 1500 guests, including Heads of State and Ministers from all of CERN's 14 Member States.

  9. New particles and their experimental signatures

    International Nuclear Information System (INIS)

    This report summarizes work done by our theoretical working group on exotic particles before, during and since the Lausanne meeting. We discuss the motivations, rates and experimental signatures for new physics and new particles in the 1 TeV mass range. (orig./HSI)

  10. Application of a case–control study design to investigate genotypic signatures of HIV-1 transmission

    Directory of Open Access Journals (Sweden)

    Mota Talia M

    2012-06-01

    Full Text Available Abstract Background The characterization of HIV-1 transmission strains may inform the design of an effective vaccine. Shorter variable loops with fewer predicted glycosites have been suggested as signatures enriched in envelope sequences derived during acute HIV-1 infection. Specifically, a transmission-linked lack of glycosites within the V1 and V2 loops of gp120 provides greater access to an α4β7 binding motif, which promotes the establishment of infection. Also, a histidine at position 12 in the leader sequence of Env has been described as a transmission signature that is selected against during chronic infection. The purpose of this study is to measure the association of the presence of an α4β7 binding motif, the number of N-linked glycosites, the length of the variable loops, and the prevalence of histidine at position 12 with HIV-1 transmission. A case–control study design was used to measure the prevalence of these variables between subtype B and C transmission sequences and frequency-matched randomly-selected sequences derived from chronically infected controls. Results Subtype B transmission strains had shorter V3 regions than chronic strains (p = 0.031; subtype C transmission strains had shorter V1 loops than chronic strains (p = 0.047; subtype B transmission strains had more V3 loop glycosites (p = 0.024 than chronic strains. Further investigation showed that these statistically significant results were unlikely to be biologically meaningful. Also, there was no difference observed in the prevalence of a histidine at position 12 among transmission strains and controls of either subtype. Conclusions Although a genetic bottleneck is observed after HIV-1 transmission, our results indicate that summary characteristics of Env hypothesised to be important in transmission are not divergent between transmission and chronic strains of either subtype. The success of a transmission strain to initiate infection may be a random

  11. The ADAMTS (A Disintegrin and Metalloproteinase with Thrombospondin motifs) family.

    Science.gov (United States)

    Kelwick, Richard; Desanlis, Ines; Wheeler, Grant N; Edwards, Dylan R

    2015-01-01

    The ADAMTS (A Disintegrin and Metalloproteinase with Thrombospondin motifs) enzymes are secreted, multi-domain matrix-associated zinc metalloendopeptidases that have diverse roles in tissue morphogenesis and patho-physiological remodeling, in inflammation and in vascular biology. The human family includes 19 members that can be sub-grouped on the basis of their known substrates, namely the aggrecanases or proteoglycanases (ADAMTS1, 4, 5, 8, 9, 15 and 20), the procollagen N-propeptidases (ADAMTS2, 3 and 14), the cartilage oligomeric matrix protein-cleaving enzymes (ADAMTS7 and 12), the von-Willebrand Factor proteinase (ADAMTS13) and a group of orphan enzymes (ADAMTS6, 10, 16, 17, 18 and 19). Control of the structure and function of the extracellular matrix (ECM) is a central theme of the biology of the ADAMTS, as exemplified by the actions of the procollagen-N-propeptidases in collagen fibril assembly and of the aggrecanases in the cleavage or modification of ECM proteoglycans. Defects in certain family members give rise to inherited genetic disorders, while the aberrant expression or function of others is associated with arthritis, cancer and cardiovascular disease. In particular, ADAMTS4 and 5 have emerged as therapeutic targets in arthritis. Multiple ADAMTSs from different sub-groupings exert either positive or negative effects on tumorigenesis and metastasis, with both metalloproteinase-dependent and -independent actions known to occur. The basic ADAMTS structure comprises a metalloproteinase catalytic domain and a carboxy-terminal ancillary domain, the latter determining substrate specificity and the localization of the protease and its interaction partners; ancillary domains probably also have independent biological functions. Focusing primarily on the aggrecanases and proteoglycanases, this review provides a perspective on the evolution of the ADAMTS family, their links with developmental and disease mechanisms, and key questions for the future. PMID:26025392

  12. Elongated polyproline motifs facilitate enamel evolution through matrix subunit compaction.

    Directory of Open Access Journals (Sweden)

    Tianquan Jin

    2009-12-01

    Full Text Available Vertebrate body designs rely on hydroxyapatite as the principal mineral component of relatively light-weight, articulated endoskeletons and sophisticated tooth-bearing jaws, facilitating rapid movement and efficient predation. Biological mineralization and skeletal growth are frequently accomplished through proteins containing polyproline repeat elements. Through their well-defined yet mobile and flexible structure polyproline-rich proteins control mineral shape and contribute many other biological functions including Alzheimer's amyloid aggregation and prolamine plant storage. In the present study we have hypothesized that polyproline repeat proteins exert their control over biological events such as mineral growth, plaque aggregation, or viscous adhesion by altering the length of their central repeat domain, resulting in dramatic changes in supramolecular assembly dimensions. In order to test our hypothesis, we have used the vertebrate mineralization protein amelogenin as an exemplar and determined the biological effect of the four-fold increased polyproline tandem repeat length in the amphibian/mammalian transition. To study the effect of polyproline repeat length on matrix assembly, protein structure, and apatite crystal growth, we have measured supramolecular assembly dimensions in various vertebrates using atomic force microscopy, tested the effect of protein assemblies on crystal growth by electron microscopy, generated a transgenic mouse model to examine the effect of an abbreviated polyproline sequence on crystal growth, and determined the structure of polyproline repeat elements using 3D NMR. Our study shows that an increase in PXX/PXQ tandem repeat motif length results (i in a compaction of protein matrix subunit dimensions, (ii reduced conformational variability, (iii an increase in polyproline II helices, and (iv promotion of apatite crystal length. Together, these findings establish a direct relationship between polyproline tandem

  13. The GTP binding motif: variations on a theme.

    Science.gov (United States)

    Kjeldgaard, M; Nyborg, J; Clark, B F

    1996-10-01

    GTP binding proteins (G-proteins) have wide-ranging functions in biology, being involved in cell proliferation, signal transduction, protein synthesis, and protein targeting. Common to their functioning is that they are active in the GTP-bound form and inactive in the GDP-bound form. The protein synthesis elongation factor EF-Tu was the first G-protein whose nucleotide binding domain was solved structurally by X-ray crystallography to yield a structural definition of the GDP-bound form, but a still increasing number of new structures of G-proteins are appearing in the literature, in both GDP and GTP bound forms. A common structural core for nucleotide binding is present in all these structures, and this core has long been known to include common consensus sequence elements involved in binding of the nucleotide. Nevertheless, subtle changes in the common sequences reflect functional differences. Therefore, it becomes increasingly important to focus on how these differences are reflected in the structures, and how these structural differences are related to function. The aim of this review is to describe to what extent this structural motif for GDP/GTP binding is common to other known structures of this class of proteins. We first describe the common structural core of the G-proteins. Next, examples are based on information available on the Ras protein superfamily, the targeting protein ARF, elongation factors EF-Tu and EF-G, and the heterotrimeric G-proteins. Finally, we discuss the important structures of complexes between GTP binding proteins and their substrates that have appeared in the literature recently.

  14. Observational signatures of binary supermassive black holes

    Energy Technology Data Exchange (ETDEWEB)

    Roedig, Constanze; Krolik, Julian H. [Department of Physics and Astronomy, Johns Hopkins University, Baltimore, MD 21218 (United States); Miller, M. Coleman [Department of Astronomy and Joint Space-Science Institute, University of Maryland, College Park, MD 20742 (United States)

    2014-04-20

    Observations indicate that most massive galaxies contain a supermassive black hole, and theoretical studies suggest that when such galaxies have a major merger, the central black holes will form a binary and eventually coalesce. Here we discuss two spectral signatures of such binaries that may help distinguish them from ordinary active galactic nuclei. These signatures are expected when the mass ratio between the holes is not extreme and the system is fed by a circumbinary disk. One such signature is a notch in the thermal continuum that has been predicted by other authors; we point out that it should be accompanied by a spectral revival at shorter wavelengths and also discuss its dependence on binary properties such as mass, mass ratio, and separation. In particular, we note that the wavelength λ {sub n} at which the notch occurs depends on these three parameters in such a way as to make the number of systems displaying these notches ∝λ{sub n}{sup 16/3}; longer wavelength searches are therefore strongly favored. A second signature, first discussed here, is hard X-ray emission with a Wien-like spectrum at a characteristic temperature ∼100 keV produced by Compton cooling of the shock generated when streams from the circumbinary disk hit the accretion disks around the individual black holes. We investigate the observability of both signatures. The hard X-ray signal may be particularly valuable as it can provide an indicator of black hole merger a few decades in advance of the event.

  15. Identification of putative regulatory motifs in the upstream regions of co-expressed functional groups of genes in Plasmodium falciparum

    Directory of Open Access Journals (Sweden)

    Joshi NV

    2009-01-01

    Full Text Available Abstract Background Regulation of gene expression in Plasmodium falciparum (Pf remains poorly understood. While over half the genes are estimated to be regulated at the transcriptional level, few regulatory motifs and transcription regulators have been found. Results The study seeks to identify putative regulatory motifs in the upstream regions of 13 functional groups of genes expressed in the intraerythrocytic developmental cycle of Pf. Three motif-discovery programs were used for the purpose, and motifs were searched for only on the gene coding strand. Four motifs – the 'G-rich', the 'C-rich', the 'TGTG' and the 'CACA' motifs – were identified, and zero to all four of these occur in the 13 sets of upstream regions. The 'CACA motif' was absent in functional groups expressed during the ring to early trophozoite transition. For functional groups expressed in each transition, the motifs tended to be similar. Upstream motifs in some functional groups showed 'positional conservation' by occurring at similar positions relative to the translational start site (TLS; this increases their significance as regulatory motifs. In the ribonucleotide synthesis, mitochondrial, proteasome and organellar translation machinery genes, G-rich, C-rich, CACA and TGTG motifs, respectively, occur with striking positional conservation. In the organellar translation machinery group, G-rich motifs occur close to the TLS. The same motifs were sometimes identified for multiple functional groups; differences in location and abundance of the motifs appear to ensure different modes of action. Conclusion The identification of positionally conserved over-represented upstream motifs throws light on putative regulatory elements for transcription in Pf.

  16. A New Proxy Blind Signature Scheme based on ECDLP

    Directory of Open Access Journals (Sweden)

    Daniyal M Alghazzawi

    2011-05-01

    Full Text Available A proxy blind signature scheme is a special form of blind signature which allows a designated person called proxy signer to sign on behalf of two or more original signers without knowing the content of the message or document. It combines the advantages of proxy signature, blind signature and multi-signature scheme and satisfies the security properties of both proxy and blind signature scheme. Most of the exiting proxy blind signature schemes were developed based on the mathematical hard problems integer factorization (IFP and simple discrete logarithm (DLP which take sub-exponential time to solve. This paper describes an secure simple proxy blind signature scheme based on Elliptic Curve Discrete Logarithm Problem (ECDLP takes fully-exponential time. This can be implemented in low power and small processor mobile devices such as smart card, PDA etc. Here also we describes implementation issues of various scalar multiplication for ECDLP.

  17. A new threshold proxy signature scheme from bilinear pairings

    Institute of Scientific and Technical Information of China (English)

    QIAN Haifeng; CAO Zhenfu; XUE Qingshui

    2004-01-01

    Based on the GDH signature (short signature scheme) a probabilistic signature scheme is proposed in this paper with security proof. Then a new threshold proxy signature from bilinear pairings is proposed as well by using the new probabilistic signature scheme and the properties of the Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy to solve). Our constructions are based on the recently proposed GDH signature scheme of Bonel et al.'s article. Bilinear pairings could be built from Weil pairing or Tate pairing. So most our constructions would be simpler, but still with high security. The proposed threshold proxy signature is the first one which is built from bilinear pairings. At the end of this paper security and performance of the threshold proxy signature scheme is also analyzed.

  18. OFFLINE HANDWRITTEN SIGNATURE IDENTIFICATION USING ADAPTIVE WINDOW POSITIONING TECHNIQUES

    Directory of Open Access Journals (Sweden)

    Ghazali Sulong

    2014-10-01

    Full Text Available The paper presents to address this challenge, we have proposed the use of Adaptive Window Positioning technique which focuses on not just the meaning of the handwritten signature but also on the individuality of the writer. This innovative technique divides the handwritten signature into 13 small windows of size nxn (13x13. This size should be large enough to contain ample information about the style of the author and small enough to ensure a good identification performance. The process was tested with a GPDS datasetcontaining 4870 signature samples from 90 different writers by comparing the robust features of the test signature with that of the user’s signature using an appropriate classifier. Experimental results reveal that adaptive window positioning technique proved to be the efficient and reliable method for accurate signature feature extraction for the identification of offline handwritten signatures .The contribution of this technique can be used to detect signatures signed under emotional duress.

  19. Rice bZIP protein, REB, interacts with GCN4 motif in promoter of Waxy gene

    Institute of Scientific and Technical Information of China (English)

    CHENG; Shijun; (程世军); WANG; Zongyang(王宗阳); HONG; Mengmin(洪孟民)

    2002-01-01

    A bifactorial endosperm box (EB), which contains an endosperm motif (EM) and a GCN4 motif, was found in rice Wx promoter. EB was found in 5′ upstream region of many seed storage protein genes accounting for these genes expression exclusive in endosperm among various cereals. Many reports demonstrated that the bZIP transcription activators isolated from wheat, barley and maize, etc. regulate the gene expression through binding to the GCN4 motif. In this research, we showed that GCN4 sequence could be recognized by nuclear proteins extracted from immature rice seeds. Furthermore, a rice bZIP protein, REB was isolated by using PCR method and REB fusion protein was expressed in E. coli. The results of gel shift analysis showed that REB could recognize and bind to the GCN4 motif in the Wx gene in addition to binding to the target sequence in the promoter of α-globulin.

  20. Strategic Lean Organizational Design: Towards Lean World-Small World Configurations through Discrete Dynamic Organizational Motifs

    Directory of Open Access Journals (Sweden)

    Javier Villalba-Diez

    2016-01-01

    Full Text Available Organizations face strong international competition in the global market arena in achieving strategic goals such as high quality of product or service at lower cost while increasing their ability to respond quickly to requirements of the market. These challenges concern strategically designing organizations that can meet global challenges and specialize locally to meet performance constraints. After introducing the concept of organizational functional and structural motifs as small organizational building block, our findings suggest the hypothesis that a strategic organizational design (SOD approach to meet these challenges involves maximizing the number and diversity of functional motifs, while minimizing the repertoire of structural motifs. By detecting characteristic structural motifs, we provide organizational leaders with specific Lean SOD solutions with which to meet local and global challenges simultaneously. As a matter of application, we show the implementation of such an SOD approach in nine US hospitals that form one large health care holding.

  1. Correlating overrepresented upstream motifs to gene expression a computational approach to regulatory element discovery in eukaryotes

    CERN Document Server

    Caselle, M; Provero, P

    2002-01-01

    Gene regulation in eukaryotes is mainly effected through transcription factors binding to rather short recognition motifs generally located upstream of the coding region. We present a novel computational method to identify regulatory elements in the upstream region of eukaryotic genes. The genes are grouped in sets sharing an overrepresented short motif in their upstream sequence. For each set, the average expression level from a microarray experiment is determined: If this level is significantly higher or lower than the average taken over the whole genome, then the overerpresented motif shared by the genes in the set is likely to play a role in their regulation. The method was tested by applying it to the genome of Saccharomyces cerevisiae, using the publicly available results of a DNA microarray experiment, in which expression levels for virtually all the genes were measured during the diauxic shift from fermentation to respiration. Several known motifs were correctly identified, and a new candidate regulat...

  2. Enhancing the Security of He-Kiesler Signature Schemes

    Institute of Scientific and Technical Information of China (English)

    李春辉; 陈一宏

    2003-01-01

    Although the He-Kiesler signature is said to be proposed based on the discrete logarithm problem and the factorization problem, it has been proved that the signature is not as secure as it was stated to be. A new signature scheme is here proposed based on the discrete logarithm problem and the factorization problem to enhance the security of the He-Kiesler signature.

  3. A PROVABLY SECURE PROXY SIGNATURE SCHEME FROM BILINEAR PAIRINGS

    Institute of Scientific and Technical Information of China (English)

    Wang Aiqin; Li Jiguo; Wang Zhijian

    2010-01-01

    A proxy signature allows an entity,called original signer,to delegate its signing power to another entity,called proxy signer,to sign messages on its behalf. Proxy signatures have many practical applications and are very important cryptographic protocol. In this paper,we propose an efficient proxy signature scheme from bilinear pairings. We prove it secure in the random oracle model and analyze computation cost of our scheme. Our scheme satisfies all the properties required for proxy signatures.

  4. Verifiable (t, n) Threshold Signature Scheme Based on Elliptic Curve

    Institute of Scientific and Technical Information of China (English)

    WANG Hua-qun; ZHAO Jun-xi; ZHANG Li-jun

    2005-01-01

    Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field,we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (elliptic curve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security.

  5. Effect of the DEF motif on phosphorylation of peptide substrates by ERK

    OpenAIRE

    Fernandes, Neychelle; Allbritton, Nancy L.

    2009-01-01

    MAP kinase ERK maintains specificity by binding to docking sites such as the DEF domain or D domain. It was previously shown that appending peptides derived from D domains to a substrate peptide increased apparent efficiency of peptide phosphorylation while preserving its apparent specificity for ERK. Here we determine the effect of the DEF motif on efficiency and specificity of peptide phosphorylation by ERK. The DEF motif modulated the apparent affinity of the peptide for ERK while the subs...

  6. A Nucleotide Binding Motif in Hepatitis C Virus (HCV) NS4B Mediates HCV RNA Replication

    OpenAIRE

    Einav, Shirit; Elazar, Menashe; Danieli, Tsafi; Glenn, Jeffrey S.

    2004-01-01

    Hepatitis C virus (HCV) is a major cause of viral hepatitis. There is no effective therapy for most patients. We have identified a nucleotide binding motif (NBM) in one of the virus's nonstructural proteins, NS4B. This structural motif binds and hydrolyzes GTP and is conserved across HCV isolates. Genetically disrupting the NBM impairs GTP binding and hydrolysis and dramatically inhibits HCV RNA replication. These results have exciting implications for the HCV life cycle and novel antiviral s...

  7. An artificial intelligence approach to motif discovery in protein sequences: application to steriod dehydrogenases.

    Science.gov (United States)

    Bailey, T L; Baker, M E; Elkan, C P

    1997-05-01

    MEME (Multiple Expectation-maximization for Motif Elicitation) is a unique new software tool that uses artificial intelligence techniques to discover motifs shared by a set of protein sequences in a fully automated manner. This paper is the first detailed study of the use of MEME to analyse a large, biologically relevant set of sequences, and to evaluate the sensitivity and accuracy of MEME in identifying structurally important motifs. For this purpose, we chose the short-chain alcohol dehydrogenase superfamily because it is large and phylogenetically diverse, providing a test of how well MEME can work on sequences with low amino acid similarity. Moreover, this dataset contains enzymes of biological importance, and because several enzymes have known X-ray crystallographic structures, we can test the usefulness of MEME for structural analysis. The first six motifs from MEME map onto structurally important alpha-helices and beta-strands on Streptomyces hydrogenans 20beta-hydroxysteroid dehydrogenase. We also describe MAST (Motif Alignment Search Tool), which conveniently uses output from MEME for searching databases such as SWISS-PROT and Genpept. MAST provides statistical measures that permit a rigorous evaluation of the significance of database searches with individual motifs or groups of motifs. A database search of Genpept90 by MAST with the log-odds matrix of the first six motifs obtained from MEME yields a bimodal output, demonstrating the selectivity of MAST. We show for the first time, using primary sequence analysis, that bacterial sugar epimerases are homologs of short-chain dehydrogenases. MEME and MAST will be increasingly useful as genome sequencing provides large datasets of phylogenetically divergent sequences of biomedical interest. PMID:9366496

  8. The Phe-Phe Motif for Peptide Self-Assembly in Nanomedicine

    OpenAIRE

    Silvia Marchesan; Vargiu, Attilio V.; Katie E. Styan

    2015-01-01

    Since its discovery, the Phe-Phe motif has gained in popularity as a minimalist building block to drive the self-assembly of short peptides and their analogues into nanostructures and hydrogels. Molecules based on the Phe-Phe motif have found a range of applications in nanomedicine, from drug delivery and biomaterials to new therapeutic paradigms. Here we discuss the various production methods for this class of compounds, and the characterization, nanomorphologies, and application of their se...

  9. The Verrucomicrobia LexA-binding Motif: Insights into the Evolutionary Dynamics of the SOS Response

    Directory of Open Access Journals (Sweden)

    Ivan Erill

    2016-07-01

    Full Text Available The SOS response is the primary bacterial mechanism to address DNA damage, coordinating multiple cellular processes that include DNA repair, cell division and translesion synthesis. In contrast to other regulatory systems, the composition of the SOS genetic network and the binding motif of its transcriptional repressor, LexA, have been shown to vary greatly across bacterial clades, making it an ideal system to study the co-evolution of transcription factors and their regulons. Leveraging comparative genomics approaches and prior knowledge on the core SOS regulon, here we define the binding motif of the Verrucomicrobia, a recently described phylum of emerging interest due to its association with eukaryotic hosts. Site directed mutagenesis of the Verrucomicrobium spinosum recA promoter confirms that LexA binds a 14 bp palindromic motif with consensus sequence TGTTC-N4-GAACA. Computational analyses suggest that recognition of this novel motif is determined primarily by changes in base-contacting residues of the third alpha helix of the LexA helix-turn-helix DNA binding motif. In conjunction with comparative genomics analysis of the LexA regulon in the Verrucomicrobia phylum, electrophoretic shift assays reveal that LexA binds to operators in the promoter region of DNA repair genes and a mutagenesis cassette in this organism, and identify previously unreported components of the SOS response. The identification of tandem LexA-binding sites generating instances of other LexA-binding motifs in the lexA gene promoter of Verrucomicrobia species leads us to postulate a novel mechanism for LexA-binding motif evolution. This model, based on gene duplication, successfully addresses outstanding questions in the intricate co-evolution of the LexA protein, its binding motif and the regulatory network it controls.

  10. The Verrucomicrobia LexA-Binding Motif: Insights into the Evolutionary Dynamics of the SOS Response.

    Science.gov (United States)

    Erill, Ivan; Campoy, Susana; Kılıç, Sefa; Barbé, Jordi

    2016-01-01

    The SOS response is the primary bacterial mechanism to address DNA damage, coordinating multiple cellular processes that include DNA repair, cell division, and translesion synthesis. In contrast to other regulatory systems, the composition of the SOS genetic network and the binding motif of its transcriptional repressor, LexA, have been shown to vary greatly across bacterial clades, making it an ideal system to study the co-evolution of transcription factors and their regulons. Leveraging comparative genomics approaches and prior knowledge on the core SOS regulon, here we define the binding motif of the Verrucomicrobia, a recently described phylum of emerging interest due to its association with eukaryotic hosts. Site directed mutagenesis of the Verrucomicrobium spinosum recA promoter confirms that LexA binds a 14 bp palindromic motif with consensus sequence TGTTC-N4-GAACA. Computational analyses suggest that recognition of this novel motif is determined primarily by changes in base-contacting residues of the third alpha helix of the LexA helix-turn-helix DNA binding motif. In conjunction with comparative genomics analysis of the LexA regulon in the Verrucomicrobia phylum, electrophoretic shift assays reveal that LexA binds to operators in the promoter region of DNA repair genes and a mutagenesis cassette in this organism, and identify previously unreported components of the SOS response. The identification of tandem LexA-binding sites generating instances of other LexA-binding motifs in the lexA gene promoter of Verrucomicrobia species leads us to postulate a novel mechanism for LexA-binding motif evolution. This model, based on gene duplication, successfully addresses outstanding questions in the intricate co-evolution of the LexA protein, its binding motif and the regulatory network it controls.

  11. Decorative motifs in the interior of the town house of the 19th century in Macedonia

    OpenAIRE

    Namicev, Petar; Namiceva, Ekaterina

    2015-01-01

    An integral part of the decoration of the house in Macedonia in the 19th century is, the application of certain stylized motifs in shaping the interior. Based upon the specific material (wood, plaster) gets a certain typology of decorative elements, with partial or full use of the wood or plaster in their representation in the interior. According to the style of decorative motifs include geometric processing, vegetable and zoomorphic decoration. Vegetabe and geometric decoration representing ...

  12. The Verrucomicrobia LexA-Binding Motif: Insights into the Evolutionary Dynamics of the SOS Response.

    Science.gov (United States)

    Erill, Ivan; Campoy, Susana; Kılıç, Sefa; Barbé, Jordi

    2016-01-01

    The SOS response is the primary bacterial mechanism to address DNA damage, coordinating multiple cellular processes that include DNA repair, cell division, and translesion synthesis. In contrast to other regulatory systems, the composition of the SOS genetic network and the binding motif of its transcriptional repressor, LexA, have been shown to vary greatly across bacterial clades, making it an ideal system to study the co-evolution of transcription factors and their regulons. Leveraging comparative genomics approaches and prior knowledge on the core SOS regulon, here we define the binding motif of the Verrucomicrobia, a recently described phylum of emerging interest due to its association with eukaryotic hosts. Site directed mutagenesis of the Verrucomicrobium spinosum recA promoter confirms that LexA binds a 14 bp palindromic motif with consensus sequence TGTTC-N4-GAACA. Computational analyses suggest that recognition of this novel motif is determined primarily by changes in base-contacting residues of the third alpha helix of the LexA helix-turn-helix DNA binding motif. In conjunction with comparative genomics analysis of the LexA regulon in the Verrucomicrobia phylum, electrophoretic shift assays reveal that LexA binds to operators in the promoter region of DNA repair genes and a mutagenesis cassette in this organism, and identify previously unreported components of the SOS response. The identification of tandem LexA-binding sites generating instances of other LexA-binding motifs in the lexA gene promoter of Verrucomicrobia species leads us to postulate a novel mechanism for LexA-binding motif evolution. This model, based on gene duplication, successfully addresses outstanding questions in the intricate co-evolution of the LexA protein, its binding motif and the regulatory network it controls. PMID:27489856

  13. Waddling Random Walk: Fast and Accurate Sampling of Motif Statistics in Large Graphs

    OpenAIRE

    Han, Guyue; Sethu, Harish

    2016-01-01

    The relative frequency of small subgraphs within a large graph, such as one representing an online social network, is of high interest to sociologists, computer scientists and marketeers alike. However, the computation of these network motif statistics via naive enumeration is infeasible for either its prohibitive computational costs or access restrictions on the full graph data. Methods to estimate the motif statistics based on random walks by sampling only a small fraction of the subgraphs ...

  14. A Nucleotide Binding Motif in Hepatitis C Virus (HCV) NS4B Mediates HCV RNA Replication

    Science.gov (United States)

    Einav, Shirit; Elazar, Menashe; Danieli, Tsafi; Glenn, Jeffrey S.

    2004-01-01

    Hepatitis C virus (HCV) is a major cause of viral hepatitis. There is no effective therapy for most patients. We have identified a nucleotide binding motif (NBM) in one of the virus's nonstructural proteins, NS4B. This structural motif binds and hydrolyzes GTP and is conserved across HCV isolates. Genetically disrupting the NBM impairs GTP binding and hydrolysis and dramatically inhibits HCV RNA replication. These results have exciting implications for the HCV life cycle and novel antiviral strategies. PMID:15452248

  15. CytoKavosh: a cytoscape plug-in for finding network motifs in large biological networks.

    Science.gov (United States)

    Masoudi-Nejad, Ali; Ansariola, Mitra; Kashani, Zahra Razaghi Moghadam; Salehzadeh-Yazdi, Ali; Khakabimamaghani, Sahand

    2012-01-01

    Network motifs are small connected sub-graphs that have recently gathered much attention to discover structural behaviors of large and complex networks. Finding motifs with any size is one of the most important problems in complex and large networks. It needs fast and reliable algorithms and tools for achieving this purpose. CytoKavosh is one of the best choices for finding motifs with any given size in any complex network. It relies on a fast algorithm, Kavosh, which makes it faster than other existing tools. Kavosh algorithm applies some well known algorithmic features and includes tricky aspects, which make it an efficient algorithm in this field. CytoKavosh is a Cytoscape plug-in which supports us in finding motifs of given size in a network that is formerly loaded into the Cytoscape work-space (directed or undirected). High performance of CytoKavosh is achieved by dynamically linking highly optimized functions of Kavosh's C++ to the Cytoscape Java program, which makes this plug-in suitable for analyzing large biological networks. Some significant attributes of CytoKavosh is efficiency in time usage and memory and having no limitation related to the implementation in motif size. CytoKavosh is implemented in a visual environment Cytoscape that is convenient for the users to interact and create visual options to analyze the structural behavior of a network. This plug-in can work on any given network and is very simple to use and generates graphical results of discovered motifs with any required details. There is no specific Cytoscape plug-in, specific for finding the network motifs, based on original concept. So, we have introduced for the first time, CytoKavosh as the first plug-in, and we hope that this plug-in can be improved to cover other options to make it the best motif-analyzing tool.

  16. CytoKavosh: a cytoscape plug-in for finding network motifs in large biological networks.

    Directory of Open Access Journals (Sweden)

    Ali Masoudi-Nejad

    Full Text Available Network motifs are small connected sub-graphs that have recently gathered much attention to discover structural behaviors of large and complex networks. Finding motifs with any size is one of the most important problems in complex and large networks. It needs fast and reliable algorithms and tools for achieving this purpose. CytoKavosh is one of the best choices for finding motifs with any given size in any complex network. It relies on a fast algorithm, Kavosh, which makes it faster than other existing tools. Kavosh algorithm applies some well known algorithmic features and includes tricky aspects, which make it an efficient algorithm in this field. CytoKavosh is a Cytoscape plug-in which supports us in finding motifs of given size in a network that is formerly loaded into the Cytoscape work-space (directed or undirected. High performance of CytoKavosh is achieved by dynamically linking highly optimized functions of Kavosh's C++ to the Cytoscape Java program, which makes this plug-in suitable for analyzing large biological networks. Some significant attributes of CytoKavosh is efficiency in time usage and memory and having no limitation related to the implementation in motif size. CytoKavosh is implemented in a visual environment Cytoscape that is convenient for the users to interact and create visual options to analyze the structural behavior of a network. This plug-in can work on any given network and is very simple to use and generates graphical results of discovered motifs with any required details. There is no specific Cytoscape plug-in, specific for finding the network motifs, based on original concept. So, we have introduced for the first time, CytoKavosh as the first plug-in, and we hope that this plug-in can be improved to cover other options to make it the best motif-analyzing tool.

  17. Acoustic Signature Monitoring and Management of Naval Platforms

    NARCIS (Netherlands)

    Basten, T.G.H.; Jong, C.A.F. de; Graafland, F.; Hof, J. van 't

    2015-01-01

    Acoustic signatures make naval platforms susceptible to detection by threat sensors. The variable operational conditions and lifespan of a platform cause variations in the acoustic signature. To deal with these variations, a real time signature monitoring capability is being developed, with advisory

  18. A Recursive Definition of the Holographic Standard Signature

    OpenAIRE

    Bradley, William F.

    2009-01-01

    We provide a recursive description of the signatures realizable on the standard basis by a holographic algorithm. The description allows us to prove tight bounds on the size of planar matchgates and efficiently test for standard signatures. Over finite fields, it allows us to count the number of n-bit standard signatures and calculate their expected sparsity.

  19. Infrared ship signature prediction, model validation and sky radiance

    NARCIS (Netherlands)

    Neele, F.P.

    2005-01-01

    The increased interest during the last decade in the infrared signature of (new) ships results in a clear need of validated infrared signature prediction codes. This paper presents the results of comparing an in-house developed signature prediction code with measurements made in the 3-5 μm band in b

  20. 76 FR 411 - Regulatory Guidance Concerning Electronic Signatures and Documents

    Science.gov (United States)

    2011-01-04

    ... June 30, 2000. E SIGN was designed to promote the use of electronic contract formation, signatures and... traditional paper or electronic form: (a) Contracts, (b) signatures, and (c) other legally-required documents... Federal Motor Carrier Safety Administration Regulatory Guidance Concerning Electronic Signatures...

  1. Radar micro-doppler signatures processing and applications

    CERN Document Server

    Chen, Victor C; Miceli, William J

    2014-01-01

    Radar Micro-Doppler Signatures: Processing and applications concentrates on the processing and application of radar micro-Doppler signatures in real world situations, providing readers with a good working knowledge on a variety of applications of radar micro-Doppler signatures.

  2. Creation of Hybrid Nanorods From Sequences of Natural Trimeric Fibrous Proteins Using the Fibritin Trimerization Motif

    Science.gov (United States)

    Papanikolopoulou, Katerina; van Raaij, Mark J.; Mitraki, Anna

    Stable, artificial fibrous proteins that can be functionalized open new avenues in fields such as bionanomaterials design and fiber engineering. An important source of inspiration for the creation of such proteins are natural fibrous proteins such as collagen, elastin, insect silks, and fibers from phages and viruses. The fibrous parts of this last class of proteins usually adopt trimeric, β-stranded structural folds and are appended to globular, receptor-binding domains. It has been recently shown that the globular domains are essential for correct folding and trimerization and can be successfully substituted by a very small (27-amino acid) trimerization motif from phage T4 fibritin. The hybrid proteins are correctly folded nanorods that can withstand extreme conditions. When the fibrous part derives from the adenovirus fiber shaft, different tissue-targeting specificities can be engineered into the hybrid proteins, which therefore can be used as gene therapy vectors. The integration of such stable nanorods in devices is also a big challenge in the field of biomechanical design. The fibritin foldon domain is a versatile trimerization motif and can be combined with a variety of fibrous motifs, such as coiled-coil, collagenous, and triple β-stranded motifs, provided the appropriate linkers are used. The combination of different motifs within the same fibrous molecule to create stable rods with multiple functions can even be envisioned. We provide a comprehensive overview of the experimental procedures used for designing, creating, and characterizing hybrid fibrous nanorods using the fibritin trimerization motif.

  3. Pipeline for the Analysis of ChIP-seq Data and New Motif Ranking Procedure

    KAUST Repository

    Ashoor, Haitham

    2011-06-01

    This thesis presents a computational methodology for ab-initio identification of transcription factor binding sites based on ChIP-seq data. This method consists of three main steps, namely ChIP-seq data processing, motif discovery and models selection. A novel method for ranking the models of motifs identified in this process is proposed. This method combines multiple factors in order to rank the provided candidate motifs. It combines the model coverage of the ChIP-seq fragments that contain motifs from which that model is built, the suitable background data made up of shuffled ChIP-seq fragments, and the p-value that resulted from evaluating the model on actual and background data. Two ChIP-seq datasets retrieved from ENCODE project are used to evaluate and demonstrate the ability of the method to predict correct TFBSs with high precision. The first dataset relates to neuron-restrictive silencer factor, NRSF, while the second one corresponds to growth-associated binding protein, GABP. The pipeline system shows high precision prediction for both datasets, as in both cases the top ranked motif closely resembles the known motifs for the respective transcription factors.

  4. Functional characterization of transcription factor motifs using cross-species comparison across large evolutionary distances.

    Science.gov (United States)

    Kim, Jaebum; Cunningham, Ryan; James, Brian; Wyder, Stefan; Gibson, Joshua D; Niehuis, Oliver; Zdobnov, Evgeny M; Robertson, Hugh M; Robinson, Gene E; Werren, John H; Sinha, Saurabh

    2010-01-01

    We address the problem of finding statistically significant associations between cis-regulatory motifs and functional gene sets, in order to understand the biological roles of transcription factors. We develop a computational framework for this task, whose features include a new statistical score for motif scanning, the use of different scores for predicting targets of different motifs, and new ways to deal with redundancies among significant motif-function associations. This framework is applied to the recently sequenced genome of the jewel wasp, Nasonia vitripennis, making use of the existing knowledge of motifs and gene annotations in another insect genome, that of the fruitfly. The framework uses cross-species comparison to improve the specificity of its predictions, and does so without relying upon non-coding sequence alignment. It is therefore well suited for comparative genomics across large evolutionary divergences, where existing alignment-based methods are not applicable. We also apply the framework to find motifs associated with socially regulated gene sets in the honeybee, Apis mellifera, using comparisons with Nasonia, a solitary species, to identify honeybee-specific associations. PMID:20126523

  5. Functional characterization of transcription factor motifs using cross-species comparison across large evolutionary distances.

    Directory of Open Access Journals (Sweden)

    Jaebum Kim

    2010-01-01

    Full Text Available We address the problem of finding statistically significant associations between cis-regulatory motifs and functional gene sets, in order to understand the biological roles of transcription factors. We develop a computational framework for this task, whose features include a new statistical score for motif scanning, the use of different scores for predicting targets of different motifs, and new ways to deal with redundancies among significant motif-function associations. This framework is applied to the recently sequenced genome of the jewel wasp, Nasonia vitripennis, making use of the existing knowledge of motifs and gene annotations in another insect genome, that of the fruitfly. The framework uses cross-species comparison to improve the specificity of its predictions, and does so without relying upon non-coding sequence alignment. It is therefore well suited for comparative genomics across large evolutionary divergences, where existing alignment-based methods are not applicable. We also apply the framework to find motifs associated with socially regulated gene sets in the honeybee, Apis mellifera, using comparisons with Nasonia, a solitary species, to identify honeybee-specific associations.

  6. Discriminative motif discovery via simulated evolution and random under-sampling.

    Directory of Open Access Journals (Sweden)

    Tao Song

    Full Text Available Conserved motifs in biological sequences are closely related to their structure and functions. Recently, discriminative motif discovery methods have attracted more and more attention. However, little attention has been devoted to the data imbalance problem, which is one of the main reasons affecting the performance of the discriminative models. In this article, a simulated evolution method is applied to solve the multi-class imbalance problem at the stage of data preprocessing, and at the stage of Hidden Markov Models (HMMs training, a random under-sampling method is introduced for the imbalance between the positive and negative datasets. It is shown that, in the task of discovering targeting motifs of nine subcellular compartments, the motifs found by our method are more conserved than the methods without considering data imbalance problem and recover the most known targeting motifs from Minimotif Miner and InterPro. Meanwhile, we use the found motifs to predict protein subcellular localization and achieve higher prediction precision and recall for the minority classes.

  7. Identification of disease-specific motifs in the antibody specificity repertoire via next-generation sequencing.

    Science.gov (United States)

    Pantazes, Robert J; Reifert, Jack; Bozekowski, Joel; Ibsen, Kelly N; Murray, Joseph A; Daugherty, Patrick S

    2016-01-01

    Disease-specific antibodies can serve as highly effective biomarkers but have been identified for only a relatively small number of autoimmune diseases. A method was developed to identify disease-specific binding motifs through integration of bacterial display peptide library screening, next-generation sequencing (NGS) and computational analysis. Antibody specificity repertoires were determined by identifying bound peptide library members for each specimen using cell sorting and performing NGS. A computational algorithm, termed Identifying Motifs Using Next- generation sequencing Experiments (IMUNE), was developed and applied to discover disease- and healthy control-specific motifs. IMUNE performs comprehensive pattern searches, identifies patterns statistically enriched in the disease or control groups and clusters the patterns to generate motifs. Using celiac disease sera as a discovery set, IMUNE identified a consensus motif (QPEQPF[PS]E) with high diagnostic sensitivity and specificity in a validation sera set, in addition to novel motifs. Peptide display and sequencing (Display-Seq) coupled with IMUNE analysis may thus be useful to characterize antibody repertoires and identify disease-specific antibody epitopes and biomarkers. PMID:27481573

  8. Identification of disease-specific motifs in the antibody specificity repertoire via next-generation sequencing

    Science.gov (United States)

    Pantazes, Robert J.; Reifert, Jack; Bozekowski, Joel; Ibsen, Kelly N.; Murray, Joseph A.; Daugherty, Patrick S.

    2016-01-01

    Disease-specific antibodies can serve as highly effective biomarkers but have been identified for only a relatively small number of autoimmune diseases. A method was developed to identify disease-specific binding motifs through integration of bacterial display peptide library screening, next-generation sequencing (NGS) and computational analysis. Antibody specificity repertoires were determined by identifying bound peptide library members for each specimen using cell sorting and performing NGS. A computational algorithm, termed Identifying Motifs Using Next- generation sequencing Experiments (IMUNE), was developed and applied to discover disease- and healthy control-specific motifs. IMUNE performs comprehensive pattern searches, identifies patterns statistically enriched in the disease or control groups and clusters the patterns to generate motifs. Using celiac disease sera as a discovery set, IMUNE identified a consensus motif (QPEQPF[PS]E) with high diagnostic sensitivity and specificity in a validation sera set, in addition to novel motifs. Peptide display and sequencing (Display-Seq) coupled with IMUNE analysis may thus be useful to characterize antibody repertoires and identify disease-specific antibody epitopes and biomarkers. PMID:27481573

  9. GPUmotif: an ultra-fast and energy-efficient motif analysis program using graphics processing units.

    Directory of Open Access Journals (Sweden)

    Pooya Zandevakili

    Full Text Available Computational detection of TF binding patterns has become an indispensable tool in functional genomics research. With the rapid advance of new sequencing technologies, large amounts of protein-DNA interaction data have been produced. Analyzing this data can provide substantial insight into the mechanisms of transcriptional regulation. However, the massive amount of sequence data presents daunting challenges. In our previous work, we have developed a novel algorithm called Hybrid Motif Sampler (HMS that enables more scalable and accurate motif analysis. Despite much improvement, HMS is still time-consuming due to the requirement to calculate matching probabilities position-by-position. Using the NVIDIA CUDA toolkit, we developed a graphics processing unit (GPU-accelerated motif analysis program named GPUmotif. We proposed a "fragmentation" technique to hide data transfer time between memories. Performance comparison studies showed that commonly-used model-based motif scan and de novo motif finding procedures such as HMS can be dramatically accelerated when running GPUmotif on NVIDIA graphics cards. As a result, energy consumption can also be greatly reduced when running motif analysis using GPUmotif. The GPUmotif program is freely available at http://sourceforge.net/projects/gpumotif/

  10. A robust elicitation algorithm for discovering DNA motifs using fuzzy self-organizing maps.

    Science.gov (United States)

    Wang, Dianhui; Tapan, Sarwar

    2013-10-01

    It is important to identify DNA motifs in promoter regions to understand the mechanism of gene regulation. Computational approaches for finding DNA motifs are well recognized as useful tools to biologists, which greatly help in saving experimental time and cost in wet laboratories. Self-organizing maps (SOMs), as a powerful clustering tool, have demonstrated good potential for problem solving. However, the current SOM-based motif discovery algorithms unfairly treat data samples lying around the cluster boundaries by assigning them to one of the nodes, which may result in unreliable system performance. This paper aims to develop a robust framework for discovering DNA motifs, where fuzzy SOMs, with an integration of fuzzy c-means membership functions and a standard batch-learning scheme, are employed to extract putative motifs with varying length in a recursive manner. Experimental results on eight real datasets show that our proposed algorithm outperforms the other searching tools such as SOMBRERO, SOMEA, MEME, AlignACE, and WEEDER in terms of the F-measure and algorithm reliability. It is observed that a remarkable 24.6% improvement can be achieved compared to the state-of-the-art SOMBRERO. Furthermore, our algorithm can produce a 20% and 6.6% improvement over SOMBRERO and SOMEA, respectively, in finding multiple motifs on five artificial datasets. PMID:24808603

  11. An Efficient Forward Secure Signature Scheme

    Institute of Scientific and Technical Information of China (English)

    YU Jia; KONG Fan-yu; LI Da-xing

    2006-01-01

    A new efficient forward secure signature scheme based on bilinear pairings is presented in this paper.Each complexity of key generation, key update, signing and verifying algorithms in this scheme is O(1) in terms of the total number of time periods T. Because a new structure in node secret key storage and a unique strategy in key update are employed, the signing and verifying costs don't grow when T increases. At the same time, the key generation and key update algorithms are efficiently constructed thanks to using the pre-order traversal technique of binary trees. Compared with other schemes based on bilinear pairings, the signature size in this scheme is very short, which doesn't change with T increasing. The scheme is forward secure in random oracle model assuming CDH problem is hard.

  12. Cryptanalysis to a Certificateless Threshold Signature Scheme

    Directory of Open Access Journals (Sweden)

    Wenjie Yang

    2012-10-01

    Full Text Available Certificateless public key cryptography is a new paradigm with two interesting features. On one hand, it keeps the certificate free property of identity-based public key cryptography (ID-PKC, while on the other hand, it gets rid of the inherent key escrow problem of ID-PKC. These two distinctive features make certificateless threshold signature schemes more applicable in practice as it removes the cost of transmitting and verifying the public key certificates of the participants who are involved in signing, and yet without the fear of key escrow. In this paper, we analyze the security of an existing certificateless threshold signature (CLTHS scheme recently proposed by Zhong et al.[26]. We show it is insure by demonstrating its three security drawbacks. Especially, we present a kind of public key replacement attack against it. Our attack reveals that it is subject to universal forgeries of type I adversaries

  13. Preparing for a (RSA Digital Signature

    Directory of Open Access Journals (Sweden)

    Dragan Vidakovic

    2013-03-01

    Full Text Available Many people know the general story about RSA and large (probably prime numbers, without having an idea of how to perform arithmetic operations with the numbers of thousands of bits. Even if they want to develop their own tool for a digital signature, they give up because they think that special hardware-software offers are required for that. In this paper we want to show that even by using a very simple console application, the tools for signature can be developed. Those tools are not as powerful and functional as the products of renowned companies, but they are sufficient to stimulate the interest in cryptography (and the coding of known algorithms is the best way for that, and that is our overriding and permanent goal[3].

  14. Observational Signatures of Self-Destructive Civilisations

    CERN Document Server

    Stevens, Adam; O'Malley-James, Jack

    2015-01-01

    We address the possibility that intelligent civilisations that destroy themselves could present signatures observable by humanity. Placing limits on the number of self-destroyed civilisations in the Milky Way has strong implications for the final three terms in Drake's Equation, and would allow us to identify which classes of solution to Fermi's Paradox fit with the evidence (or lack thereof). Using the Earth as an example, we consider a variety of scenarios in which humans could extinguish their own technological civilisation. Each scenario presents some form of observable signature that could be probed by astronomical campaigns to detect and characterise extrasolar planetary systems. Some observables are unlikely to be detected at interstellar distances, but some scenarios are likely to produce significant changes in atmospheric composition that could be detected serendipitously with next-generation telescopes. In some cases, the timing of the observation would prove crucial to detection, as the decay of si...

  15. Photostatistics Reconstruction via Loop Detector Signatures

    CERN Document Server

    Webb, J G; 10.1364/OE.17.011799

    2009-01-01

    Photon-number resolving detectors are a fundamental building-block of optical quantum information processing protocols. A loop detector, combined with appropriate statistical processing, can be used to convert a binary on/off photon counter into a photon-number-resolving detector. Here we describe the idea of a signature of photon-counts, which may be used to more robustly reconstruct the photon number distribution of a quantum state. The methodology is applied experimentally in a 9-port loop detector operating at a telecommunications wavelength and compared directly to the approach whereby only the number of photon-counts is used to reconstruct the input distribution. The signature approach is shown to be more robust against calibration errors, exhibit reduced statistical uncertainty, and reduced reliance on a-priori assumptions about the input state.

  16. Universally Composable Proactive Threshold RSA Signature

    Institute of Scientific and Technical Information of China (English)

    HONG Xuan; CHEN Ke-fei; LONG Yu

    2008-01-01

    Recently some efforts were made towards capturing the security requirements within the composable security framework.This modeling has some significant advantages in designing and analyzing complex systems.The threshold signature was discussed and a definition was given based on the universal composability framework,which is proved to be equivalent to the standard security definition.Furthermore,a simple,efficient and proactive threshold RSA signature protocol was presented.It is proved to be correct,consistent and unforgeable relative to the environment that at most t-1 parties are corrupted in each proactive stage.It is also secure under the universal composability framework.It is a UC based security and is proved to be equivalent to the standard security.

  17. Signatures of star formation by cold collapse

    CERN Document Server

    Kuznetsova, Aleksandra; Ballesteros-Paredes, Javier

    2015-01-01

    Sub-virial gravitational collapse is one mechanism by which star clusters may form. Here we investigate whether this mechanism can be inferred from observations of young clusters. To address this question, we have computed SPH simulations of the initial formation and evolution of a dynamically young star cluster through cold (sub-virial) collapse, starting with an ellipsoidal, turbulently seeded distribution of gas, and forming sink particles representing (proto)stars. While the initial density distributions of the clouds do not have large initial mass concentrations, gravitational focusing due to the global morphology leads to cluster formation. We use the resulting structures to extract observable morphological and kinematic signatures for the case of sub-virial collapse. We find that the signatures of the initial conditions can be erased rapidly as the gas and stars collapse, suggesting that kinematic observations need to be made either early in cluster formation and/or at larger scales, away from the grow...

  18. Signatures versus histograms: Definitions, distances and algorithms

    OpenAIRE

    Serratosa, Francesc; Sanfeliu, Alberto

    2006-01-01

    The aim of this paper is to present a new method to compare histograms. The main advantage is that there is an important time-complexity reduction respect the methods presented before. This reduction is statistically and analytically demonstrated in the paper. The distances between histograms that we present are defined on a structure called signature, which is a lossless representation of histograms. Moreover, the type of the elements of the sets that the histograms represent are ordinal, no...

  19. Definite signature conformal holonomy: a complete classification

    OpenAIRE

    Armstrong, Stuart

    2005-01-01

    This paper aims to classify the holonomy of the conformal Tractor connection, and relate these holonomies to the geometry of the underlying manifold. The conformally Einstein case is dealt with through the construction of metric cones, whose Riemmanian holonomy is the same as the Tractor holonomy of the underlying manifold. Direct calculations in the Ricci-flat case and an important decomposition theorem complete the classification for definitive signature.

  20. Cosmological signatures of time-asymmetric gravity

    OpenAIRE

    Cortês, Marina; Liddle, Andrew R; Smolin, Lee

    2016-01-01

    We develop the model proposed by Cort\\^es, Gomes & Smolin, to predict cosmological signatures of time-asymmetric extensions of general relativity they proposed recently. Within this class of models the equation of motion of chiral fermions is modified by a torsion term. This term leads to a dispersion law for neutrinos that associates a new time-varying energy with each particle. We find a new neutrino contribution to the Friedmann equation resulting from the torsion term in the Ashtekar conn...