WorldWideScience

Sample records for ribosomal decoding promoted

  1. Mutational analysis of S12 protein and implications for the accuracy of decoding by the ribosome.

    Science.gov (United States)

    Sharma, Divya; Cukras, Anthony R; Rogers, Elizabeth J; Southworth, Daniel R; Green, Rachel

    2007-12-07

    The fidelity of aminoacyl-tRNA selection by the ribosome depends on a conformational switch in the decoding center of the small ribosomal subunit induced by cognate but not by near-cognate aminoacyl-tRNA. The aminoglycosides paromomycin and streptomycin bind to the decoding center and induce related structural rearrangements that explain their observed effects on miscoding. Structural and biochemical studies have identified ribosomal protein S12 (as well as specific nucleotides in 16S ribosomal RNA) as a critical molecular contributor in distinguishing between cognate and near-cognate tRNA species as well as in promoting more global rearrangements in the small subunit, referred to as "closure." Here we use a mutational approach to define contributions made by two highly conserved loops in S12 to the process of tRNA selection. Most S12 variant ribosomes tested display increased levels of fidelity (a "restrictive" phenotype). Interestingly, several variants, K42A and R53A, were substantially resistant to the miscoding effects of paromomycin. Further characterization of the compromised paromomycin response identified a probable second, fidelity-modulating binding site for paromomycin in the 16S ribosomal RNA that facilitates closure of the small subunit and compensates for defects associated with the S12 mutations.

  2. Competence in Streptococcus pneumoniae is regulated by the rate of ribosomal decoding errors.

    Science.gov (United States)

    Stevens, Kathleen E; Chang, Diana; Zwack, Erin E; Sebert, Michael E

    2011-01-01

    Competence for genetic transformation in Streptococcus pneumoniae develops in response to accumulation of a secreted peptide pheromone and was one of the initial examples of bacterial quorum sensing. Activation of this signaling system induces not only expression of the proteins required for transformation but also the production of cellular chaperones and proteases. We have shown here that activity of this pathway is sensitively responsive to changes in the accuracy of protein synthesis that are triggered by either mutations in ribosomal proteins or exposure to antibiotics. Increasing the error rate during ribosomal decoding promoted competence, while reducing the error rate below the baseline level repressed the development of both spontaneous and antibiotic-induced competence. This pattern of regulation was promoted by the bacterial HtrA serine protease. Analysis of strains with the htrA (S234A) catalytic site mutation showed that the proteolytic activity of HtrA selectively repressed competence when translational fidelity was high but not when accuracy was low. These findings redefine the pneumococcal competence pathway as a response to errors during protein synthesis. This response has the capacity to address the immediate challenge of misfolded proteins through production of chaperones and proteases and may also be able to address, through genetic exchange, upstream coding errors that cause intrinsic protein folding defects. The competence pathway may thereby represent a strategy for dealing with lesions that impair proper protein coding and for maintaining the coding integrity of the genome. The signaling pathway that governs competence in the human respiratory tract pathogen Streptococcus pneumoniae regulates both genetic transformation and the production of cellular chaperones and proteases. The current study shows that this pathway is sensitively controlled in response to changes in the accuracy of protein synthesis. Increasing the error rate during

  3. The architecture of mammalian ribosomal protein promoters

    Directory of Open Access Journals (Sweden)

    Perry Robert P

    2005-02-01

    Full Text Available Abstract Background Mammalian ribosomes contain 79 different proteins encoded by widely scattered single copy genes. Coordinate expression of these genes at transcriptional and post-transcriptional levels is required to ensure a roughly equimolar accumulation of ribosomal proteins. To date, detailed studies of only a very few ribosomal protein (rp promoters have been made. To elucidate the general features of rp promoter architecture, I made a detailed sequence comparison of the promoter regions of the entire set of orthologous human and mouse rp genes. Results A striking evolutionarily conserved feature of most rp genes is the separation by an intron of the sequences involved in transcriptional and translational regulation from the sequences with protein encoding function. Another conserved feature is the polypyrimidine initiator, which conforms to the consensus (Y2C+1TY(T2(Y3. At least 60 % of the rp promoters contain a largely conserved TATA box or A/T-rich motif, which should theoretically have TBP-binding capability. A remarkably high proportion of the promoters contain conserved binding sites for transcription factors that were previously implicated in rp gene expression, namely upstream GABP and Sp1 sites and downstream YY1 sites. Over 80 % of human and mouse rp genes contain a transposable element residue within 900 bp of 5' flanking sequence; very little sequence identity between human and mouse orthologues was evident more than 200 bp upstream of the transcriptional start point. Conclusions This analysis has provided some valuable insights into the general architecture of mammalian rp promoters and has identified parameters that might coordinately regulate the transcriptional activity of certain subsets of rp genes.

  4. Structure of Vibrio cholerae ribosome hibernation promoting factor

    International Nuclear Information System (INIS)

    De Bari, Heather; Berry, Edward A.

    2013-01-01

    The X-ray crystal structure of ribosome hibernation promoting factor from V. cholerae has been determined at 2.0 Å resolution. The crystal was phased by two-wavelength MAD using cocrystallized cobalt. The X-ray crystal structure of ribosome hibernation promoting factor (HPF) from Vibrio cholerae is presented at 2.0 Å resolution. The crystal was phased by two-wavelength MAD using cocrystallized cobalt. The asymmetric unit contained two molecules of HPF linked by four Co atoms. The metal-binding sites observed in the crystal are probably not related to biological function. The structure of HPF has a typical β–α–β–β–β–α fold consistent with previous structures of YfiA and HPF from Escherichia coli. Comparison of the new structure with that of HPF from E. coli bound to the Thermus thermophilus ribosome [Polikanov et al. (2012 ▶), Science, 336, 915–918] shows that no significant structural changes are induced in HPF by binding

  5. Mean of the typical decoding rates: a new translation efficiency index based on the analysis of ribosome profiling data.

    Science.gov (United States)

    Dana, Alexandra; Tuller, Tamir

    2014-12-01

    Gene translation modeling and prediction is a fundamental problem that has numerous biomedical implementations. In this work we present a novel, user-friendly tool/index for calculating the mean of the typical decoding rates that enables predicting translation elongation efficiency of protein coding genes for different tissue types, developmental stages, and experimental conditions. The suggested translation efficiency index is based on the analysis of the organism's ribosome profiling data. This index could be used for example to predict changes in translation elongation efficiency of lowly expressed genes that usually have relatively low and/or biased ribosomal densities and protein levels measurements, or can be used for example for predicting translation efficiency of new genetically engineered genes. We demonstrate the usability of this index via the analysis of six organisms in different tissues and developmental stages. Distributable cross platform application and guideline are available for download at: http://www.cs.tau.ac.il/~tamirtul/MTDR/MTDR_Install.html. Copyright © 2015 Dana and Tuller.

  6. Characteristic differences between the promoters of intron-containing and intronless ribosomal protein genes in yeast

    Directory of Open Access Journals (Sweden)

    Vingron Martin

    2008-10-01

    Full Text Available Abstract Background More than two thirds of the highly expressed ribosomal protein (RP genes in Saccharomyces cerevisiae contain introns, which is in sharp contrast to the genome-wide five percent intron-containing genes. It is well established that introns carry regulatory sequences and that the transcription of RP genes is extensively and coordinately regulated. Here we test the hypotheses that introns are innately associated with heavily transcribed genes and that introns of RP genes contribute regulatory TF binding sequences. Moreover, we investigate whether promoter features are significantly different between intron-containing and intronless RP genes. Results We find that directly measured transcription rates tend to be lower for intron-containing compared to intronless RP genes. We do not observe any specifically enriched sequence motifs in the introns of RP genes other than those of the branch point and the two splice sites. Comparing the promoters of intron-containing and intronless RP genes, we detect differences in number and position of Rap1-binding and IFHL motifs. Moreover, the analysis of the length distribution and the folding free energies suggest that, at least in a sub-population of RP genes, the 5' untranslated sequences are optimized for regulatory function. Conclusion Our results argue against the direct involvement of introns in the regulation of transcription of highly expressed genes. Moreover, systematic differences in motif distributions suggest that RP transcription factors may act differently on intron-containing and intronless gene promoters. Thus, our findings contribute to the decoding of the RP promoter architecture and may fuel the discussion on the evolution of introns.

  7. Ribosomal mutations promote the evolution of antibiotic resistance in a multidrug environment.

    Science.gov (United States)

    Gomez, James E; Kaufmann-Malaga, Benjamin B; Wivagg, Carl N; Kim, Peter B; Silvis, Melanie R; Renedo, Nikolai; Ioerger, Thomas R; Ahmad, Rushdy; Livny, Jonathan; Fishbein, Skye; Sacchettini, James C; Carr, Steven A; Hung, Deborah T

    2017-02-21

    Antibiotic resistance arising via chromosomal mutations is typically specific to a particular antibiotic or class of antibiotics. We have identified mutations in genes encoding ribosomal components in Mycobacterium smegmatis that confer resistance to several structurally and mechanistically unrelated classes of antibiotics and enhance survival following heat shock and membrane stress. These mutations affect ribosome assembly and cause large-scale transcriptomic and proteomic changes, including the downregulation of the catalase KatG, an activating enzyme required for isoniazid sensitivity, and upregulation of WhiB7, a transcription factor involved in innate antibiotic resistance. Importantly, while these ribosomal mutations have a fitness cost in antibiotic-free medium, in a multidrug environment they promote the evolution of high-level, target-based resistance. Further, suppressor mutations can then be easily acquired to restore wild-type growth. Thus, ribosomal mutations can serve as stepping-stones in an evolutionary path leading to the emergence of high-level, multidrug resistance.

  8. Promoter-wide hypermethylation of the ribosomal RNA gene promoter in the suicide brain.

    Directory of Open Access Journals (Sweden)

    Patrick O McGowan

    Full Text Available BACKGROUND: Alterations in gene expression in the suicide brain have been reported and for several genes DNA methylation as an epigenetic regulator is thought to play a role. rRNA genes, that encode ribosomal RNA, are the backbone of the protein synthesis machinery and levels of rRNA gene promoter methylation determine rRNA transcription. METHODOLOGY/PRINCIPAL FINDINGS: We test here by sodium bisulfite mapping of the rRNA promoter and quantitative real-time PCR of rRNA expression the hypothesis that epigenetic differences in critical loci in the brain are involved in the pathophysiology of suicide. Suicide subjects in this study were selected for a history of early childhood neglect/abuse, which is associated with decreased hippocampal volume and cognitive impairments. rRNA was significantly hypermethylated throughout the promoter and 5' regulatory region in the brain of suicide subjects, consistent with reduced rRNA expression in the hippocampus. This difference in rRNA methylation was not evident in the cerebellum and occurred in the absence of genome-wide changes in methylation, as assessed by nearest neighbor. CONCLUSIONS/SIGNIFICANCE: This is the first study to show aberrant regulation of the protein synthesis machinery in the suicide brain. The data implicate the epigenetic modulation of rRNA in the pathophysiology of suicide.

  9. Integrating ribosomal promoter vectors that offer a choice of constitutive expression profiles in Leishmania donovani.

    Science.gov (United States)

    Soysa, Radika; Tran, Khoa D; Ullman, Buddy; Yates, Phillip A

    2015-12-01

    We have designed a novel series of integrating ribosomal RNA promoter vectors with five incrementally different constitutive expression profiles, covering a 250-fold range. Differential expression was achieved by placing different combinations of synthetic or leishmanial DNA sequences upstream and downstream of the transgene coding sequence in order to modulate pre-mRNA processing efficiency and mRNA stability, respectively. All of the vectors have extensive multiple cloning sites, and versions are available for producing N- or C- terminal GFP fusions at each of the possible relative expression levels. In addition, the modular configuration of the vectors allows drug resistance cassettes and other components to be readily exchanged. In toto, these vectors should be useful additions to the toolkit available for molecular and genetic studies of Leishmania donovani. Copyright © 2016 Elsevier B.V. All rights reserved.

  10. Ribosomal elongation factor 4 promotes cell death associated with lethal stress.

    Science.gov (United States)

    Li, Liping; Hong, Yuzhi; Luan, Gan; Mosel, Michael; Malik, Muhammad; Drlica, Karl; Zhao, Xilin

    2014-12-09

    Ribosomal elongation factor 4 (EF4) is highly conserved among bacteria, mitochondria, and chloroplasts. However, the EF4-encoding gene, lepA, is nonessential and its deficiency shows no growth or fitness defect. In purified systems, EF4 back-translocates stalled, posttranslational ribosomes for efficient protein synthesis; consequently, EF4 has a protective role during moderate stress. We were surprised to find that EF4 also has a detrimental role during severe stress: deletion of lepA increased Escherichia coli survival following treatment with several antimicrobials. EF4 contributed to stress-mediated lethality through reactive oxygen species (ROS) because (i) the protective effect of a ΔlepA mutation against lethal antimicrobials was eliminated by anaerobic growth or by agents that block hydroxyl radical accumulation and (ii) the ΔlepA mutation decreased ROS levels stimulated by antimicrobial stress. Epistasis experiments showed that EF4 functions in the same genetic pathway as the MazF toxin, a stress response factor implicated in ROS-mediated cell death. The detrimental action of EF4 required transfer-messenger RNA (tmRNA, which tags truncated proteins for degradation and is known to be inhibited by EF4) and the ClpP protease. Inhibition of a protective, tmRNA/ClpP-mediated degradative activity would allow truncated proteins to indirectly perturb the respiratory chain and thereby provide a potential link between EF4 and ROS. The connection among EF4, MazF, tmRNA, and ROS expands a pathway leading from harsh stress to bacterial self-destruction. The destructive aspect of EF4 plus the protective properties described previously make EF4 a bifunctional factor in a stress response that promotes survival or death, depending on the severity of stress. Translation elongation factor 4 (EF4) is one of the most conserved proteins in nature, but it is dispensable. Lack of strong phenotypes for its genetic knockout has made EF4 an enigma. Recent biochemical work has

  11. Screening a yeast promoter library leads to the isolation of the RP29/L32 and SNR17B/RPL37A divergent promoters and the discovery of a gene encoding ribosomal protein L37.

    Science.gov (United States)

    Santangelo, G M; Tornow, J; McLaughlin, C S; Moldave, K

    1991-08-30

    Two promoters (A7 and A23), isolated at random from the Saccharomyces cerevisiae genome by virtue of their capacity to activate transcription, are identical to known intergenic bidirectional promoters. Sequence analysis of the genomic DNA adjacent to the A7 promoter identified a split gene encoding ribosomal (r) protein L37, which is homologous to the tRNA-binding r-proteins, L35a (from human and rat) and L32 (from frogs).

  12. The SmpB C-terminal tail helps tmRNA to recognize and enter stalled ribosomes

    Directory of Open Access Journals (Sweden)

    Mickey R. Miller

    2014-09-01

    Full Text Available In bacteria, transfer-messenger RNA (tmRNA and SmpB comprise the most common and effective system for rescuing stalled ribosomes. Ribosomes stall on mRNA transcripts lacking stop codons and are rescued as the defective mRNA is swapped for the tmRNA template in a process known as trans-translation. The tmRNA–SmpB complex is recruited to the ribosome independent of a codon–anticodon interaction. Given that the ribosome uses robust discriminatory mechanisms to select against non-cognate tRNAs during canonical decoding, it has been hard to explain how this can happen. Recent structural and biochemical studies show that SmpB licenses tmRNA entry through its interactions with the decoding center and mRNA channel. In particular, the C-terminal tail of SmpB promotes both EFTu activation and accommodation of tmRNA, the former through interactions with 16S rRNA nucleotide G530 and the latter through interactions with the mRNA channel downstream of the A site. Here we present a detailed model of the earliest steps in trans-translation, and in light of these mechanistic considerations, revisit the question of how tmRNA preferentially reacts with stalled, non-translating ribosomes.

  13. Specific dose-dependent damage of Lieberkuehn crypts promoted by large doses of type 2 ribosome-inactivating protein nigrin b intravenous injection to mice

    International Nuclear Information System (INIS)

    Gayoso, M.J.; Munoz, R.; Arias, Y.; Villar, R.; Rojo, M.A.; Jimenez, P.; Ferreras, J.M.; Aranguez, I.; Girbes, T.

    2005-01-01

    Nigrin b is a non-toxic type 2 ribosome-inactivating protein as active as ricin at ribosomal level but 10 5 and 5 x 10 3 times less toxic for animal cell cultures and mice, respectively, than ricin. The purpose of the present study was to analyze the effects of intravenous injection of large amounts of nigrin b to the mouse. Injection through the tail vein of 16 mg/kg body weight killed all mice studied before 2 days. Analysis of several major tissues by light microscopy did not reveal gross nigrin b-promoted changes, except in the intestines which appeared highly damaged. As a consequence of the injury, the villi and crypt structures of the small intestine disappeared, leading to profuse bleeding and death. In contrast, intravenous injection of 5 mg/kg body weight was not lethal to mice but did trigger reversible toxic effects. In both cases, lethal and sub-lethal doses, the target of nigrin b appeared to be the highly proliferating stem cells of the intestinal crypts, which had undergone apoptotic changes. In contrast to nigrin b, the injection of 3 μg/kg of ricin kills all mice in 5 days but does not trigger apoptosis in the crypts. Therefore, the effect seen with sub-lethal nigrin b concentrations seems to be specific. Nigrin b killed COLO 320 human colon adenocarcinoma cells with an IC 50 of 3.1 x 10 -8 M and the effect was parallel to the extent of DNA fragmentation of these cells. Accordingly, despite the low general toxicity exerted by nigrin b as compared with ricin, intravenous injection of large amounts of nigrin b is able to kill mouse intestinal stem cells without threatening the lives of the animals, thereby opening a door for its use for the targeting of intestinal stem cells

  14. Analysis of clustered point mutations in the human ribosomal RNA gene promoter by transient expression in vivo

    International Nuclear Information System (INIS)

    Jones, M.H.; Learned, R.M.; Tjian, R.

    1988-01-01

    The authors have mapped the cis regulatory elements required in vivo for initiation at the human rRNA promoter by RNA polymerase I. Transient expression in COS-7 cells was used to evaluate the transcription phenotype of clustered base substitution mutations in the human rRNA promoter. The promoter consists of two major elements: a large upstream region, composed of several domains, that lies between nucleotides -234 and -107 relative to the transcription initiation site and affects transcription up to 100-fold and a core element that lies between nucleotides -45 and +20 and affects transcription up to 1000-fold. The upstream regions is able to retain partial function when positioned within 100-160 nucleotides of the transcription initiation site, but it cannot stimulate transcription from distances of ≥ 600 nucleotides. In addition, they demonstrate, using mouse-human hybrid rRNA promoters, that the sequences responsible for human species-specific transcription in vivo appear to reside in both the core and upstream elements, and sequences from the mouse rRNA promoter cannot be substituted for them

  15. Iterative List Decoding

    DEFF Research Database (Denmark)

    Justesen, Jørn; Høholdt, Tom; Hjaltason, Johan

    2005-01-01

    We analyze the relation between iterative decoding and the extended parity check matrix. By considering a modified version of bit flipping, which produces a list of decoded words, we derive several relations between decodable error patterns and the parameters of the code. By developing a tree...... of codewords at minimal distance from the received vector, we also obtain new information about the code....

  16. Ribosomal protein-Mdm2-p53 pathway coordinates nutrient stress with lipid metabolism by regulating MCD and promoting fatty acid oxidation.

    Science.gov (United States)

    Liu, Yong; He, Yizhou; Jin, Aiwen; Tikunov, Andrey P; Zhou, Lishi; Tollini, Laura A; Leslie, Patrick; Kim, Tae-Hyung; Li, Lei O; Coleman, Rosalind A; Gu, Zhennan; Chen, Yong Q; Macdonald, Jeffrey M; Graves, Lee M; Zhang, Yanping

    2014-06-10

    The tumor suppressor p53 has recently been shown to regulate energy metabolism through multiple mechanisms. However, the in vivo signaling pathways related to p53-mediated metabolic regulation remain largely uncharacterized. By using mice bearing a single amino acid substitution at cysteine residue 305 of mouse double minute 2 (Mdm2(C305F)), which renders Mdm2 deficient in binding ribosomal proteins (RPs) RPL11 and RPL5, we show that the RP-Mdm2-p53 signaling pathway is critical for sensing nutrient deprivation and maintaining liver lipid homeostasis. Although the Mdm2(C305F) mutation does not significantly affect growth and development in mice, this mutation promotes fat accumulation under normal feeding conditions and hepatosteatosis under acute fasting conditions. We show that nutrient deprivation inhibits rRNA biosynthesis, increases RP-Mdm2 interaction, and induces p53-mediated transactivation of malonyl-CoA decarboxylase (MCD), which catalyzes the degradation of malonyl-CoA to acetyl-CoA, thus modulating lipid partitioning. Fasted Mdm2(C305F) mice demonstrate attenuated MCD induction and enhanced malonyl-CoA accumulation in addition to decreased oxidative respiration and increased fatty acid accumulation in the liver. Thus, the RP-Mdm2-p53 pathway appears to function as an endogenous sensor responsible for stimulating fatty acid oxidation in response to nutrient depletion.

  17. HuR and Ago2 Bind the Internal Ribosome Entry Site of Enterovirus 71 and Promote Virus Translation and Replication.

    Directory of Open Access Journals (Sweden)

    Jing-Yi Lin

    Full Text Available EV71 (enterovirus 71 RNA contains an internal ribosomal entry site (IRES that directs cap-independent initiation of translation. IRES-dependent translation requires the host's translation initiation factors and IRES-associated trans-acting factors (ITAFs. We reported recently that mRNA decay factor AUF1 is a negative-acting ITAF that binds IRES stem-loop II. We also reported that the small RNA-processing enzyme Dicer produces at least four small RNAs (vsRNAs from the EV71 IRES. One of these, vsRNA1, derived from IRES stem-loop II, reduces IRES activity and virus replication. Since its mechanism of action is unknown, we hypothesized that it might control association of ITAFs with the IRES. Here, we identified the mRNA stability factor HuR and the RISC subunit Argonaute 2 (Ago2 as two ITAFs that bind stem-loop II. In contrast to AUF1, HuR and Ago2 promote EV71 IRES activity and virus replication. In vitro RNA-binding assays revealed that vsRNA1 can alter association of Ago2, HuR, and AUF1 with stem-loop II. This presents a possible mechanism by which vsRNA1 could control viral translation and replication.

  18. The Complete Structure of the Mycobacterium smegmatis 70S Ribosome

    Directory of Open Access Journals (Sweden)

    Jendrik Hentschel

    2017-07-01

    Full Text Available The ribosome carries out the synthesis of proteins in every living cell. It consequently represents a frontline target in anti-microbial therapy. Tuberculosis ranks among the leading causes of death worldwide, due in large part to the combination of difficult-to-treat latency and antibiotic resistance. Here, we present the 3.3-Å cryo-EM structure of the 70S ribosome of Mycobacterium smegmatis, a close relative to the human pathogen Mycobacterium tuberculosis. The structure reveals two additional ribosomal proteins and localizes them to the vicinity of drug-target sites in both the catalytic center and the decoding site of the ribosome. Furthermore, we visualized actinobacterium-specific rRNA and protein expansions that extensively remodel the ribosomal surface with implications for polysome organization. Our results provide a foundation for understanding the idiosyncrasies of mycobacterial translation and reveal atomic details of the structure that will facilitate the design of anti-tubercular therapeutics.

  19. Stimulation of ribosomal RNA gene promoter by transcription factor Sp1 involves active DNA demethylation by Gadd45-NER pathway.

    Science.gov (United States)

    Rajput, Pallavi; Pandey, Vijaya; Kumar, Vijay

    2016-08-01

    The well-studied Pol II transcription factor Sp1 has not been investigated for its regulatory role in rDNA transcription. Here, we show that Sp1 bound to specific sites on rDNA and localized into the nucleoli during the G1 phase of cell cycle to activate rDNA transcription. It facilitated the recruitment of Pol I pre-initiation complex and impeded the binding of nucleolar remodeling complex (NoRC) to rDNA resulting in the formation of euchromatin active state. More importantly, Sp1 also orchestrated the site-specific binding of Gadd45a-nucleotide excision repair (NER) complex resulting in active demethylation and transcriptional activation of rDNA. Interestingly, knockdown of Sp1 impaired rDNA transcription due to reduced engagement of the Gadd45a-NER complex and hypermethylation of rDNA. Thus, the present study unveils a novel role of Sp1 in rDNA transcription involving promoter demethylation. Copyright © 2016 Elsevier B.V. All rights reserved.

  20. Forced Sequence Sequential Decoding

    DEFF Research Database (Denmark)

    Jensen, Ole Riis

    In this thesis we describe a new concatenated decoding scheme based on iterations between an inner sequentially decoded convolutional code of rate R=1/4 and memory M=23, and block interleaved outer Reed-Solomon codes with non-uniform profile. With this scheme decoding with good performance...... is possible as low as Eb/No=0.6 dB, which is about 1.7 dB below the signal-to-noise ratio that marks the cut-off rate for the convolutional code. This is possible since the iteration process provides the sequential decoders with side information that allows a smaller average load and minimizes the probability...... of computational overflow. Analytical results for the probability that the first Reed-Solomon word is decoded after C computations are presented. This is supported by simulation results that are also extended to other parameters....

  1. Yeast eIF4B binds to the head of the 40S ribosomal subunit and promotes mRNA recruitment through its N-terminal and internal repeat domains.

    Science.gov (United States)

    Walker, Sarah E; Zhou, Fujun; Mitchell, Sarah F; Larson, Victoria S; Valasek, Leos; Hinnebusch, Alan G; Lorsch, Jon R

    2013-02-01

    Eukaryotic translation initiation factor (eIF)4B stimulates recruitment of mRNA to the 43S ribosomal pre-initiation complex (PIC). Yeast eIF4B (yeIF4B), shown previously to bind single-stranded (ss) RNA, consists of an N-terminal domain (NTD), predicted to be unstructured in solution; an RNA-recognition motif (RRM); an unusual domain comprised of seven imperfect repeats of 26 amino acids; and a C-terminal domain. Although the mechanism of yeIF4B action has remained obscure, most models have suggested central roles for its RRM and ssRNA-binding activity. We have dissected the functions of yeIF4B's domains and show that the RRM and its ssRNA-binding activity are dispensable in vitro and in vivo. Instead, our data indicate that the 7-repeats and NTD are the most critical domains, which mediate binding of yeIF4B to the head of the 40S ribosomal subunit via interaction with Rps20. This interaction induces structural changes in the ribosome's mRNA entry channel that could facilitate mRNA loading. We also show that yeIF4B strongly promotes productive interaction of eIF4A with the 43S•mRNA PIC in a manner required for efficient mRNA recruitment.

  2. Optimization of MPEG decoding

    DEFF Research Database (Denmark)

    Martins, Bo; Forchhammer, Søren

    1999-01-01

    MPEG-2 video decoding is examined. A unified approach to quality improvement, chrominance upsampling, de-interlacing and superresolution is presented. The information over several frames is combined as part of the processing....

  3. Forced Sequence Sequential Decoding

    DEFF Research Database (Denmark)

    Jensen, Ole Riis; Paaske, Erik

    1998-01-01

    We describe a new concatenated decoding scheme based on iterations between an inner sequentially decoded convolutional code of rate R=1/4 and memory M=23, and block interleaved outer Reed-Solomon (RS) codes with nonuniform profile. With this scheme decoding with good performance is possible as low...... as Eb/N0=0.6 dB, which is about 1.25 dB below the signal-to-noise ratio (SNR) that marks the cutoff rate for the full system. Accounting for about 0.45 dB due to the outer codes, sequential decoding takes place at about 1.7 dB below the SNR cutoff rate for the convolutional code. This is possible since...... the iteration process provides the sequential decoders with side information that allows a smaller average load and minimizes the probability of computational overflow. Analytical results for the probability that the first RS word is decoded after C computations are presented. These results are supported...

  4. The Unexplored Mechanisms and Regulatory Functions of Ribosomal Translocation

    Science.gov (United States)

    Alejo, Jose Luis

    In every cell, protein synthesis is carried out by the ribosome, a complex macromolecular RNA-protein assembly. Decades of structural and kinetic studies have increased our understanding of ribosome initiation, decoding, translocation and termination. Yet, the underlying mechanism of these fundamental processes has yet to be fully delineated. Hence, the molecular basis of regulation remains obscure. Here, single-molecule fluorescence methods are applied to decipher the mechanism and regulatory roles of the multi-step process of directional substrate translocation on the ribosome that accompanies every round of protein synthesis. In Chapter 1, single-molecule fluorescence resonance energy transfer (smFRET) is introduced as a tool for studying bacterial ribosome translocation. Chapter 2 details the experimental methods. In Chapter 3, the elongation factor G(EF-G)-catalyzed movement of substrates through the ribosome is examined from several perspectives or signals reporting on various degrees of freedom of ribosome dynamics. Two ribosomal states interconvert in the presence of EF-G(GDP), displaying novel head domain motions, until relocking takes place. In Chapter 4, in order to test if the mentioned fluctuations leading to relocking are correlated to the engagement of the P-site by the peptidyl-tRNA, the translocation of miscoded tRNAs is studied. Severe defects in the relocking stages of translocation reveal the correlation between this new stage of translocation and P-site tRNA engagement.

  5. Decoding communities in networks

    Science.gov (United States)

    Radicchi, Filippo

    2018-02-01

    According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

  6. Decoding communities in networks.

    Science.gov (United States)

    Radicchi, Filippo

    2018-02-01

    According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

  7. Adaptive decoding of convolutional codes

    Directory of Open Access Journals (Sweden)

    K. Hueske

    2007-06-01

    Full Text Available Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e. the most probable transmitted code sequence is obtained. On the other hand the mathematical complexity of the algorithm only depends on the used code, not on the number of transmission errors. To reduce the complexity of the decoding process for good transmission conditions, an alternative syndrome based decoder is presented. The reduction of complexity is realized by two different approaches, the syndrome zero sequence deactivation and the path metric equalization. The two approaches enable an easy adaptation of the decoding complexity for different transmission conditions, which results in a trade-off between decoding complexity and error correction performance.

  8. Adaptive decoding of convolutional codes

    Science.gov (United States)

    Hueske, K.; Geldmacher, J.; Götze, J.

    2007-06-01

    Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e. the most probable transmitted code sequence is obtained. On the other hand the mathematical complexity of the algorithm only depends on the used code, not on the number of transmission errors. To reduce the complexity of the decoding process for good transmission conditions, an alternative syndrome based decoder is presented. The reduction of complexity is realized by two different approaches, the syndrome zero sequence deactivation and the path metric equalization. The two approaches enable an easy adaptation of the decoding complexity for different transmission conditions, which results in a trade-off between decoding complexity and error correction performance.

  9. Decoding Xing-Ling codes

    DEFF Research Database (Denmark)

    Nielsen, Rasmus Refslund

    2002-01-01

    This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed.......This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed....

  10. iTRAQ Protein Profile Differential Analysis of Dormant and Germinated Grassbur Twin Seeds Reveals that Ribosomal Synthesis and Carbohydrate Metabolism Promote Germination Possibly Through the PI3K Pathway.

    Science.gov (United States)

    Zhang, Guo-Liang; Zhu, Yue; Fu, Wei-Dong; Wang, Peng; Zhang, Rui-Hai; Zhang, Yan-Lei; Song, Zhen; Xia, Gui-Xian; Wu, Jia-He

    2016-06-01

    Grassbur is a destructive and invasive weed in pastures, and its burs can cause gastric damage to animals. The strong adaptability and reproductive potential of grassbur are partly due to a unique germination mechanism whereby twin seeds develop in a single bur: one seed germinates, but the other remains dormant. To investigate the molecular mechanism of seed germination in twin seeds, we used isobaric tags for relative and absolute quantitation (iTRAQ) to perform a dynamic proteomic analysis of germination and dormancy. A total of 1,984 proteins were identified, 161 of which were considered to be differentially accumulated. The differentially accumulated proteins comprised 102 up-regulated and 59 down-regulated proteins. These proteins were grouped into seven functional categories, ribosomal proteins being the predominant group. The authenticity and accuracy of the results were confirmed by enzyme-linked immunosorbent assay (ELISA) and quantitative real-time reverse transcription-PCR (qPCR). A dynamic proteomic analysis revealed that ribosome synthesis and carbohydrate metabolism affect seed germination possibly through the phosphoinositide 3-kinase (PI3K) pathway. As the PI3K pathway is generally activated by insulin, analyses of seeds treated with exogenous insulin by qPCR, ELISA and iTRAQ confirmed that the PI3K pathway can be activated, which suppresses dormancy and promotes germination in twin grassbur seeds. Together, these results show that the PI3K pathway may play roles in stimulating seed germination in grassbur by modulating ribosomal synthesis and carbohydrate metabolism. © The Author 2016. Published by Oxford University Press on behalf of Japanese Society of Plant Physiologists. All rights reserved. For permissions, please email: journals.permissions@oup.com.

  11. Decoding Codes on Graphs

    Indian Academy of Sciences (India)

    Shannon limit of the channel. Among the earliest discovered codes that approach the. Shannon limit were the low density parity check (LDPC) codes. The term low density arises from the property of the parity check matrix defining the code. We will now define this matrix and the role that it plays in decoding. 2. Linear Codes.

  12. A ribosome without RNA

    Directory of Open Access Journals (Sweden)

    Harold S Bernhardt

    2015-11-01

    Full Text Available It was Francis Crick who first asked why the ribosome contains so much RNA, and discussed the implications of this for the direct flow of genetic information from DNA to protein. Remarkable advances in our understanding of the ribosome and protein synthesis, including the recent publication of two mammalian mitochondrial ribosome structures, have shed new light on this intriguing aspect of evolution in molecular biology. We examine here whether RNA is indispensable for coded protein synthesis, or whether an all-protein ‘ribosome’ (or ‘synthosome’ might be possible, with a protein enzyme catalyzing peptide synthesis, and release factor-like protein adaptors able to read a message composed of deoxyribonucleotides. We also compare the RNA world hypothesis with the alternative ‘proteins first’ hypothesis in terms of their different understandings of the evolution of the ribosome, and whether this might have been preceded by an ancestral form of nonribosomal peptide synthesis catalyzed by protein enzymes.

  13. On minimizing the maximum broadcast decoding delay for instantly decodable network coding

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Ai-Naffouri, Tareq Y.

    2014-01-01

    In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a

  14. PF-4708671, a specific inhibitor of p70 ribosomal S6 kinase 1, activates Nrf2 by promoting p62-dependent autophagic degradation of Keap1

    Energy Technology Data Exchange (ETDEWEB)

    Park, Jeong Su [Severance Biomedical Science Institute (Korea, Republic of); Yonsei Biomedical Research Institute, Yonsei University College of Medicine, 50 Yonsei-ro, Seodaemun-gu, Seoul 120-752 (Korea, Republic of); Kang, Dong Hoon [Department of Life Science and Ewha Research Center for Systems Biology (Korea, Republic of); The Research Center for Cell Homeostasis, Ewha Womans University, Seoul 127-750 (Korea, Republic of); Lee, Da Hyun [Severance Biomedical Science Institute (Korea, Republic of); Yonsei Biomedical Research Institute, Yonsei University College of Medicine, 50 Yonsei-ro, Seodaemun-gu, Seoul 120-752 (Korea, Republic of); Bae, Soo Han, E-mail: soohanbae@yuhs.ac [Severance Biomedical Science Institute (Korea, Republic of); Yonsei Biomedical Research Institute, Yonsei University College of Medicine, 50 Yonsei-ro, Seodaemun-gu, Seoul 120-752 (Korea, Republic of)

    2015-10-23

    p70 ribosomal S6 kinase 1 (S6K1) is an important serine/threonine kinase and downstream target of the mechanistic target of rapamycin complex 1 (mTORC1) signaling pathway. PF-4708671 is a specific inhibitor of S6K1, and prevents S6K1-mediated phosphorylation of the S6 protein. PF-4708671 treatment often leads to apoptotic cell death. However, the protective mechanism against PF-4708671-induced cell death has not been elucidated. The nuclear factor erythroid 2-related factor 2 (Nrf2)-Kelch-like ECH-associated protein 1 (Keap1) pathway is essential for protecting cells against oxidative stress. p62, an adaptor protein in the autophagic process, enhances Nrf2 activation through the impairment of Keap1 activity. In this study, we showed that PF-4708671 induces autophagic Keap1 degradation-mediated Nrf2 activation in p62-dependent manner. Furthermore, p62-dependent Nrf2 activation plays a crucial role in protecting cells from PF-4708671-mediated apoptosis. - Highlights: • PF-4708671, a S6K1-specific inhibitor, prevents S6K1-mediated S6 phosphorylation. • However, PF-4708671 treatment often leads to apoptotic cell death. • Protective mechanism against PF-4708671-induced cell death remains to be elucidated. • PF-4708671 induced p62-dependent, autophagic Keap1 degradation-mediated Nrf2 activation. • p62-dependent Nrf2 activation protects cells from PF-4708671-mediated apoptosis.

  15. Decoding the human genome

    CERN Multimedia

    CERN. Geneva. Audiovisual Unit; Antonerakis, S E

    2002-01-01

    Decoding the Human genome is a very up-to-date topic, raising several questions besides purely scientific, in view of the two competing teams (public and private), the ethics of using the results, and the fact that the project went apparently faster and easier than expected. The lecture series will address the following chapters: Scientific basis and challenges. Ethical and social aspects of genomics.

  16. The Complete Structure of the Mycobacterium smegmatis 70S Ribosome.

    Science.gov (United States)

    Hentschel, Jendrik; Burnside, Chloe; Mignot, Ingrid; Leibundgut, Marc; Boehringer, Daniel; Ban, Nenad

    2017-07-05

    The ribosome carries out the synthesis of proteins in every living cell. It consequently represents a frontline target in anti-microbial therapy. Tuberculosis ranks among the leading causes of death worldwide, due in large part to the combination of difficult-to-treat latency and antibiotic resistance. Here, we present the 3.3-Å cryo-EM structure of the 70S ribosome of Mycobacterium smegmatis, a close relative to the human pathogen Mycobacterium tuberculosis. The structure reveals two additional ribosomal proteins and localizes them to the vicinity of drug-target sites in both the catalytic center and the decoding site of the ribosome. Furthermore, we visualized actinobacterium-specific rRNA and protein expansions that extensively remodel the ribosomal surface with implications for polysome organization. Our results provide a foundation for understanding the idiosyncrasies of mycobacterial translation and reveal atomic details of the structure that will facilitate the design of anti-tubercular therapeutics. Copyright © 2017 The Author(s). Published by Elsevier Inc. All rights reserved.

  17. The effect of tRNA levels on decoding times of mRNA codons.

    Science.gov (United States)

    Dana, Alexandra; Tuller, Tamir

    2014-08-01

    The possible effect of transfer ribonucleic acid (tRNA) concentrations on codons decoding time is a fundamental biomedical research question; however, due to a large number of variables affecting this process and the non-direct relation between them, a conclusive answer to this question has eluded so far researchers in the field. In this study, we perform a novel analysis of the ribosome profiling data of four organisms which enables ranking the decoding times of different codons while filtering translational phenomena such as experimental biases, extreme ribosomal pauses and ribosome traffic jams. Based on this filtering, we show for the first time that there is a significant correlation between tRNA concentrations and the codons estimated decoding time both in prokaryotes and in eukaryotes in natural conditions (-0.38 to -0.66, all P values decoding times are not correlated with aminoacyl-tRNA levels. The reported results support the conjecture that translation efficiency is directly influenced by the tRNA levels in the cell. Thus, they should help to understand the evolution of synonymous aspects of coding sequences via the adaptation of their codons to the tRNA pool. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

  18. Decoding Facial Expressions: A New Test with Decoding Norms.

    Science.gov (United States)

    Leathers, Dale G.; Emigh, Ted H.

    1980-01-01

    Describes the development and testing of a new facial meaning sensitivity test designed to determine how specialized are the meanings that can be decoded from facial expressions. Demonstrates the use of the test to measure a receiver's current level of skill in decoding facial expressions. (JMF)

  19. Genome-wide polysomal analysis of a yeast strain with mutated ribosomal protein S9

    Directory of Open Access Journals (Sweden)

    Arava Yoav

    2007-08-01

    Full Text Available Abstract Background The yeast ribosomal protein S9 (S9 is located at the entrance tunnel of the mRNA into the ribosome. It is known to play a role in accurate decoding and its bacterial homolog (S4 has recently been shown to be involved in opening RNA duplexes. Here we examined the effects of changing the C terminus of S9, which is rich in acidic amino acids and extends out of the ribosome surface. Results We performed a genome-wide analysis to reveal effects at the transcription and translation levels of all yeast genes. While negligible relative changes were observed in steady-state mRNA levels, a significant number of mRNAs appeared to have altered ribosomal density. Notably, 40% of the genes having reliable signals changed their ribosomal association by more than one ribosome. Yet, no general correlations with physical or functional features of the mRNA were observed. Ribosome Density Mapping (RDM along four of the mRNAs with increased association revealed an increase in ribosomal density towards the end of the coding region for at least two of them. Read-through analysis did not reveal any increase in read-through of a premature stop codon by the mutant strain. Conclusion The ribosomal protein rpS9 appears to be involved in the translation of many mRNAs, since altering its C terminus led to a significant change in ribosomal association of many mRNAs. We did not find strong correlations between these changes and several physical features of the mRNA, yet future studies with advanced tools may allow such correlations to be determined. Importantly, our results indicate an accumulation of ribosomes towards the end of the coding regions of some mRNAs. This suggests an involvement of S9 in ribosomal dissociation during translation termination.

  20. Ribosomal Antibiotics: Contemporary Challenges

    Directory of Open Access Journals (Sweden)

    Tamar Auerbach-Nevo

    2016-06-01

    Full Text Available Most ribosomal antibiotics obstruct distinct ribosomal functions. In selected cases, in addition to paralyzing vital ribosomal tasks, some ribosomal antibiotics are involved in cellular regulation. Owing to the global rapid increase in the appearance of multi-drug resistance in pathogenic bacterial strains, and to the extremely slow progress in developing new antibiotics worldwide, it seems that, in addition to the traditional attempts at improving current antibiotics and the intensive screening for additional natural compounds, this field should undergo substantial conceptual revision. Here, we highlight several contemporary issues, including challenging the common preference of broad-range antibiotics; the marginal attention to alterations in the microbiome population resulting from antibiotics usage, and the insufficient awareness of ecological and environmental aspects of antibiotics usage. We also highlight recent advances in the identification of species-specific structural motifs that may be exploited for the design and the creation of novel, environmental friendly, degradable, antibiotic types, with a better distinction between pathogens and useful bacterial species in the microbiome. Thus, these studies are leading towards the design of “pathogen-specific antibiotics,” in contrast to the current preference of broad range antibiotics, partially because it requires significant efforts in speeding up the discovery of the unique species motifs as well as the clinical pathogen identification.

  1. Expanding the ribosomal universe.

    Science.gov (United States)

    Dinman, Jonathan D; Kinzy, Terri Goss

    2009-12-09

    In this issue of Structure, Taylor et al. (2009) present the most complete model of an eukaryotic ribosome to date. This achievement represents a critical milestone along the path to structurally defining the unique aspects of the eukaryotic protein synthetic machinery.

  2. List Decoding of Algebraic Codes

    DEFF Research Database (Denmark)

    Nielsen, Johan Sebastian Rosenkilde

    We investigate three paradigms for polynomial-time decoding of Reed–Solomon codes beyond half the minimum distance: the Guruswami–Sudan algorithm, Power decoding and the Wu algorithm. The main results concern shaping the computational core of all three methods to a problem solvable by module...... Hermitian codes using Guruswami–Sudan or Power decoding faster than previously known, and we show how to Wu list decode binary Goppa codes....... to solve such using module minimisation, or using our new Demand–Driven algorithm which is also based on module minimisation. The decoding paradigms are all derived and analysed in a self-contained manner, often in new ways or examined in greater depth than previously. Among a number of new results, we...

  3. Decoding vigilance with NIRS.

    Science.gov (United States)

    Bogler, Carsten; Mehnert, Jan; Steinbrink, Jens; Haynes, John-Dylan

    2014-01-01

    Sustained, long-term cognitive workload is associated with variations and decrements in performance. Such fluctuations in vigilance can be a risk factor especially during dangerous attention demanding activities. Functional MRI studies have shown that attentional performance is correlated with BOLD-signals, especially in parietal and prefrontal cortical regions. An interesting question is whether these BOLD-signals could be measured in real-world scenarios, say to warn in a dangerous workplace whenever a subjects' vigilance is low. Because fMRI lacks the mobility needed for such applications, we tested whether the monitoring of vigilance might be possible using Near-Infrared Spectroscopy (NIRS). NIRS is a highly mobile technique that measures hemodynamics in the surface of the brain. We demonstrate that non-invasive NIRS signals correlate with vigilance. These signals carry enough information to decode subjects' reaction times at a single trial level.

  4. Decoding vigilance with NIRS.

    Directory of Open Access Journals (Sweden)

    Carsten Bogler

    Full Text Available Sustained, long-term cognitive workload is associated with variations and decrements in performance. Such fluctuations in vigilance can be a risk factor especially during dangerous attention demanding activities. Functional MRI studies have shown that attentional performance is correlated with BOLD-signals, especially in parietal and prefrontal cortical regions. An interesting question is whether these BOLD-signals could be measured in real-world scenarios, say to warn in a dangerous workplace whenever a subjects' vigilance is low. Because fMRI lacks the mobility needed for such applications, we tested whether the monitoring of vigilance might be possible using Near-Infrared Spectroscopy (NIRS. NIRS is a highly mobile technique that measures hemodynamics in the surface of the brain. We demonstrate that non-invasive NIRS signals correlate with vigilance. These signals carry enough information to decode subjects' reaction times at a single trial level.

  5. Astrophysics Decoding the cosmos

    CERN Document Server

    Irwin, Judith A

    2007-01-01

    Astrophysics: Decoding the Cosmos is an accessible introduction to the key principles and theories underlying astrophysics. This text takes a close look at the radiation and particles that we receive from astronomical objects, providing a thorough understanding of what this tells us, drawing the information together using examples to illustrate the process of astrophysics. Chapters dedicated to objects showing complex processes are written in an accessible manner and pull relevant background information together to put the subject firmly into context. The intention of the author is that the book will be a 'tool chest' for undergraduate astronomers wanting to know the how of astrophysics. Students will gain a thorough grasp of the key principles, ensuring that this often-difficult subject becomes more accessible.

  6. Neural Decoder for Topological Codes

    Science.gov (United States)

    Torlai, Giacomo; Melko, Roger G.

    2017-07-01

    We present an algorithm for error correction in topological codes that exploits modern machine learning techniques. Our decoder is constructed from a stochastic neural network called a Boltzmann machine, of the type extensively used in deep learning. We provide a general prescription for the training of the network and a decoding strategy that is applicable to a wide variety of stabilizer codes with very little specialization. We demonstrate the neural decoder numerically on the well-known two-dimensional toric code with phase-flip errors.

  7. Fast decoding algorithms for geometric coded apertures

    International Nuclear Information System (INIS)

    Byard, Kevin

    2015-01-01

    Fast decoding algorithms are described for the class of coded aperture designs known as geometric coded apertures which were introduced by Gourlay and Stephen. When compared to the direct decoding method, the algorithms significantly reduce the number of calculations required when performing the decoding for these apertures and hence speed up the decoding process. Experimental tests confirm the efficacy of these fast algorithms, demonstrating a speed up of approximately two to three orders of magnitude over direct decoding.

  8. Understanding Biases in Ribosome Profiling Experiments Reveals Signatures of Translation Dynamics in Yeast.

    Directory of Open Access Journals (Sweden)

    Jeffrey A Hussmann

    2015-12-01

    Full Text Available Ribosome profiling produces snapshots of the locations of actively translating ribosomes on messenger RNAs. These snapshots can be used to make inferences about translation dynamics. Recent ribosome profiling studies in yeast, however, have reached contradictory conclusions regarding the average translation rate of each codon. Some experiments have used cycloheximide (CHX to stabilize ribosomes before measuring their positions, and these studies all counterintuitively report a weak negative correlation between the translation rate of a codon and the abundance of its cognate tRNA. In contrast, some experiments performed without CHX report strong positive correlations. To explain this contradiction, we identify unexpected patterns in ribosome density downstream of each type of codon in experiments that use CHX. These patterns are evidence that elongation continues to occur in the presence of CHX but with dramatically altered codon-specific elongation rates. The measured positions of ribosomes in these experiments therefore do not reflect the amounts of time ribosomes spend at each position in vivo. These results suggest that conclusions from experiments in yeast using CHX may need reexamination. In particular, we show that in all such experiments, codons decoded by less abundant tRNAs were in fact being translated more slowly before the addition of CHX disrupted these dynamics.

  9. In vitro degradation of ribosomes.

    Science.gov (United States)

    Mora, G; Rivas, A

    1976-12-01

    The cytoplasmic ribosomes from Euglena gracilis var. bacillaris are found to be of two types taking into consideration their stability "in vitro". In the group of unstable ribosomes the large subunit is degraded. The other group apparently does not suffer any degradation under the conditions described. However the RNAs extracted from both types of ribosomes are degraded during sucrose density gradients. The degradation of the largest RNA species has been reported previously, but no comment has been made about the stability of the ribosome itself.

  10. Two Nucleolar Proteins, GDP1 and OLI2, Function As Ribosome Biogenesis Factors and Are Preferentially Involved in Promotion of Leaf Cell Proliferation without Strongly Affecting Leaf Adaxial–Abaxial Patterning in Arabidopsis thaliana

    Directory of Open Access Journals (Sweden)

    Koji Kojima

    2018-01-01

    Full Text Available Leaf abaxial–adaxial patterning is dependent on the mutual repression of leaf polarity genes expressed either adaxially or abaxially. In Arabidopsis thaliana, this process is strongly affected by mutations in ribosomal protein genes and in ribosome biogenesis genes in a sensitized genetic background, such as asymmetric leaves2 (as2. Most ribosome-related mutants by themselves do not show leaf abaxialization, and one of their typical phenotypes is the formation of pointed rather than rounded leaves. In this study, we characterized two ribosome-related mutants to understand how ribosome biogenesis is linked to several aspects of leaf development. Previously, we isolated oligocellula2 (oli2 which exhibits the pointed-leaf phenotype and has a cell proliferation defect. OLI2 encodes a homolog of Nop2 in Saccharomyces cerevisiae, a ribosome biogenesis factor involved in pre-60S subunit maturation. In this study, we found another pointed-leaf mutant that carries a mutation in a gene encoding an uncharacterized protein with a G-patch domain. Similar to oli2, this mutant, named g-patch domain protein1 (gdp1, has a reduced number of leaf cells. In addition, gdp1 oli2 double mutants showed a strong genetic interaction such that they synergistically impaired cell proliferation in leaves and produced markedly larger cells. On the other hand, they showed additive phenotypes when combined with several known ribosomal protein mutants. Furthermore, these mutants have a defect in pre-rRNA processing. GDP1 and OLI2 are strongly expressed in tissues with high cell proliferation activity, and GDP1-GFP and GFP-OLI2 are localized in the nucleolus. These results suggest that OLI2 and GDP1 are involved in ribosome biogenesis. We then examined the effects of gdp1 and oli2 on adaxial–abaxial patterning by crossing them with as2. Interestingly, neither gdp1 nor oli2 strongly enhanced the leaf polarity defect of as2. Similar results were obtained with as2 gdp1 oli2

  11. Yeast ribosomal proteins

    International Nuclear Information System (INIS)

    Otaka, E.; Kobata, K.

    1978-01-01

    The cytoplasmic 80s ribosomal proteins from the cells of yeast Saccharomyces cerevisiae were analyzed by SDS two-dimensional polyacrylamide gel electrophoresis. Seventyfour proteins were identified and consecutively numbered from 1 to 74. Upon oxidation of the 80s proteins with performic acid, ten proteins (no. 15, 20, 35, 40, 44, 46, 49, 51, 54 and 55) were dislocated on the gel without change of the total number of protein spots. Five proteins (no. 8, 14, 16, 36 and 74) were phosphorylated in vivo as seen in 32 P-labelling experiments. The large and small subunits separated in low magnesium medium were analyzed by the above gel electrophoresis. At least forty-five and twenty-eight proteins were assumed to be in the large and small subunits, respectively. All proteins found in the 80s ribosomes, except for no. 3, were detected in either subunit without appearance of new spots. The acidic protein no. 3 seems to be lost during subunit dissociation. (orig.) [de

  12. Orientation decoding: Sense in spirals?

    Science.gov (United States)

    Clifford, Colin W G; Mannion, Damien J

    2015-04-15

    The orientation of a visual stimulus can be successfully decoded from the multivariate pattern of fMRI activity in human visual cortex. Whether this capacity requires coarse-scale orientation biases is controversial. We and others have advocated the use of spiral stimuli to eliminate a potential coarse-scale bias-the radial bias toward local orientations that are collinear with the centre of gaze-and hence narrow down the potential coarse-scale biases that could contribute to orientation decoding. The usefulness of this strategy is challenged by the computational simulations of Carlson (2014), who reported the ability to successfully decode spirals of opposite sense (opening clockwise or counter-clockwise) from the pooled output of purportedly unbiased orientation filters. Here, we elaborate the mathematical relationship between spirals of opposite sense to confirm that they cannot be discriminated on the basis of the pooled output of unbiased or radially biased orientation filters. We then demonstrate that Carlson's (2014) reported decoding ability is consistent with the presence of inadvertent biases in the set of orientation filters; biases introduced by their digital implementation and unrelated to the brain's processing of orientation. These analyses demonstrate that spirals must be processed with an orientation bias other than the radial bias for successful decoding of spiral sense. Copyright © 2014 Elsevier Inc. All rights reserved.

  13. Improved decoding for a concatenated coding system

    DEFF Research Database (Denmark)

    Paaske, Erik

    1990-01-01

    The concatenated coding system recommended by CCSDS (Consultative Committee for Space Data Systems) uses an outer (255,233) Reed-Solomon (RS) code based on 8-b symbols, followed by the block interleaver and an inner rate 1/2 convolutional code with memory 6. Viterbi decoding is assumed. Two new...... decoding procedures based on repeated decoding trials and exchange of information between the two decoders and the deinterleaver are proposed. In the first one, where the improvement is 0.3-0.4 dB, only the RS decoder performs repeated trials. In the second one, where the improvement is 0.5-0.6 dB, both...... decoders perform repeated decoding trials and decoding information is exchanged between them...

  14. Evidence for rRNA 2'-O-methylation plasticity: Control of intrinsic translational capabilities of human ribosomes.

    Science.gov (United States)

    Erales, Jenny; Marchand, Virginie; Panthu, Baptiste; Gillot, Sandra; Belin, Stéphane; Ghayad, Sandra E; Garcia, Maxime; Laforêts, Florian; Marcel, Virginie; Baudin-Baillieu, Agnès; Bertin, Pierre; Couté, Yohann; Adrait, Annie; Meyer, Mélanie; Therizols, Gabriel; Yusupov, Marat; Namy, Olivier; Ohlmann, Théophile; Motorin, Yuri; Catez, Frédéric; Diaz, Jean-Jacques

    2017-12-05

    Ribosomal RNAs (rRNAs) are main effectors of messenger RNA (mRNA) decoding, peptide-bond formation, and ribosome dynamics during translation. Ribose 2'-O-methylation (2'-O-Me) is the most abundant rRNA chemical modification, and displays a complex pattern in rRNA. 2'-O-Me was shown to be essential for accurate and efficient protein synthesis in eukaryotic cells. However, whether rRNA 2'-O-Me is an adjustable feature of the human ribosome and a means of regulating ribosome function remains to be determined. Here we challenged rRNA 2'-O-Me globally by inhibiting the rRNA methyl-transferase fibrillarin in human cells. Using RiboMethSeq, a nonbiased quantitative mapping of 2'-O-Me, we identified a repertoire of 2'-O-Me sites subjected to variation and demonstrate that functional domains of ribosomes are targets of 2'-O-Me plasticity. Using the cricket paralysis virus internal ribosome entry site element, coupled to in vitro translation, we show that the intrinsic capability of ribosomes to translate mRNAs is modulated through a 2'-O-Me pattern and not by nonribosomal actors of the translational machinery. Our data establish rRNA 2'-O-Me plasticity as a mechanism providing functional specificity to human ribosomes.

  15. Miscoding-induced stalling of substrate translocation on the bacterial ribosome.

    Science.gov (United States)

    Alejo, Jose L; Blanchard, Scott C

    2017-10-10

    Directional transit of the ribosome along the messenger RNA (mRNA) template is a key determinant of the rate and processivity of protein synthesis. Imaging of the multistep translocation mechanism using single-molecule FRET has led to the hypothesis that substrate movements relative to the ribosome resolve through relatively long-lived late intermediates wherein peptidyl-tRNA enters the P site of the small ribosomal subunit via reversible, swivel-like motions of the small subunit head domain within the elongation factor G (GDP)-bound ribosome complex. Consistent with translocation being rate-limited by recognition and productive engagement of peptidyl-tRNA within the P site, we now show that base-pairing mismatches between the peptidyl-tRNA anticodon and the mRNA codon dramatically delay this rate-limiting, intramolecular process. This unexpected relationship between aminoacyl-tRNA decoding and translocation suggests that miscoding antibiotics may impact protein synthesis by impairing the recognition of peptidyl-tRNA in the small subunit P site during EF-G-catalyzed translocation. Strikingly, we show that elongation factor P (EF-P), traditionally known to alleviate ribosome stalling at polyproline motifs, can efficiently rescue translocation defects arising from miscoding. These findings help reveal the nature and origin of the rate-limiting steps in substrate translocation on the bacterial ribosome and indicate that EF-P can aid in resuming translation elongation stalled by miscoding errors.

  16. Cross-linking of streptomycin to the 16S ribosomal RNA of Escherichia coli

    International Nuclear Information System (INIS)

    Gravel, M.; Melancon, P.; Barkier-Gingras, L.

    1987-01-01

    [ 3 H]Dihydrostreptomycin was cross-linked to the 30S ribosomal subunit from Escherichia coli with the bifunctional reagent nitrogen mustard. The cross-linking primarily involved the 16S RNA. To localize the site of cross-linking of streptomycin to the 16S RNA, the authors hybridized RNA labeled with streptomycin to restriction fragments of the 16S RNA gene. Labeled RNA hybridized to DNA fragments corresponding to bases 892-917 and bases 1394-1415. These two segments of the ribosomal RNA must by juxtaposed in the ribosome, since there is a single binding site for streptomycin. This region has been implicated both in the decoding site and in the binding of initiation factor IF-3, indicating its functional importance

  17. Soft-decision decoding of RS codes

    DEFF Research Database (Denmark)

    Justesen, Jørn

    2005-01-01

    By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter-Vardy algorithm for soft-decision decoding of RS codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when two or more...

  18. Toric Codes, Multiplicative Structure and Decoding

    DEFF Research Database (Denmark)

    Hansen, Johan Peder

    2017-01-01

    Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for \\emph{decoding}, resembling the decoding of Reed-Solomon codes and al...

  19. FPGA Realization of Memory 10 Viterbi Decoder

    DEFF Research Database (Denmark)

    Paaske, Erik; Bach, Thomas Bo; Andersen, Jakob Dahl

    1997-01-01

    sequence mode when feedback from the Reed-Solomon decoder is available. The Viterbi decoder is realized using two Altera FLEX 10K50 FPGA's. The overall operating speed is 30 kbit/s, and since up to three iterations are performed for each frame and only one decoder is used, the operating speed...

  20. Decoding intention at sensorimotor timescales.

    Directory of Open Access Journals (Sweden)

    Mathew Salvaris

    Full Text Available The ability to decode an individual's intentions in real time has long been a 'holy grail' of research on human volition. For example, a reliable method could be used to improve scientific study of voluntary action by allowing external probe stimuli to be delivered at different moments during development of intention and action. Several Brain Computer Interface applications have used motor imagery of repetitive actions to achieve this goal. These systems are relatively successful, but only if the intention is sustained over a period of several seconds; much longer than the timescales identified in psychophysiological studies for normal preparation for voluntary action. We have used a combination of sensorimotor rhythms and motor imagery training to decode intentions in a single-trial cued-response paradigm similar to those used in human and non-human primate motor control research. Decoding accuracy of over 0.83 was achieved with twelve participants. With this approach, we could decode intentions to move the left or right hand at sub-second timescales, both for instructed choices instructed by an external stimulus and for free choices generated intentionally by the participant. The implications for volition are considered.

  1. Dynamics of intracellular information decoding

    International Nuclear Information System (INIS)

    Kobayashi, Tetsuya J; Kamimura, Atsushi

    2011-01-01

    A variety of cellular functions are robust even to substantial intrinsic and extrinsic noise in intracellular reactions and the environment that could be strong enough to impair or limit them. In particular, of substantial importance is cellular decision-making in which a cell chooses a fate or behavior on the basis of information conveyed in noisy external signals. For robust decoding, the crucial step is filtering out the noise inevitably added during information transmission. As a minimal and optimal implementation of such an information decoding process, the autocatalytic phosphorylation and autocatalytic dephosphorylation (aPadP) cycle was recently proposed. Here, we analyze the dynamical properties of the aPadP cycle in detail. We describe the dynamical roles of the stationary and short-term responses in determining the efficiency of information decoding and clarify the optimality of the threshold value of the stationary response and its information-theoretical meaning. Furthermore, we investigate the robustness of the aPadP cycle against the receptor inactivation time and intrinsic noise. Finally, we discuss the relationship among information decoding with information-dependent actions, bet-hedging and network modularity

  2. Dynamics of intracellular information decoding.

    Science.gov (United States)

    Kobayashi, Tetsuya J; Kamimura, Atsushi

    2011-10-01

    A variety of cellular functions are robust even to substantial intrinsic and extrinsic noise in intracellular reactions and the environment that could be strong enough to impair or limit them. In particular, of substantial importance is cellular decision-making in which a cell chooses a fate or behavior on the basis of information conveyed in noisy external signals. For robust decoding, the crucial step is filtering out the noise inevitably added during information transmission. As a minimal and optimal implementation of such an information decoding process, the autocatalytic phosphorylation and autocatalytic dephosphorylation (aPadP) cycle was recently proposed. Here, we analyze the dynamical properties of the aPadP cycle in detail. We describe the dynamical roles of the stationary and short-term responses in determining the efficiency of information decoding and clarify the optimality of the threshold value of the stationary response and its information-theoretical meaning. Furthermore, we investigate the robustness of the aPadP cycle against the receptor inactivation time and intrinsic noise. Finally, we discuss the relationship among information decoding with information-dependent actions, bet-hedging and network modularity.

  3. Human Genome Research: Decoding DNA

    Science.gov (United States)

    dropdown arrow Site Map A-Z Index Menu Synopsis Human Genome Research: Decoding DNA Resources with of the DNA double helix during April 2003. James D. Watson, Francis Crick, and Maurice Wilkins were company Celera announced the completion of a "working draft" reference DNA sequence of the human

  4. Fast Reed-Solomon Decoder

    Science.gov (United States)

    Liu, K. Y.

    1986-01-01

    High-speed decoder intended for use with Reed-Solomon (RS) codes of long code length and high error-correcting capability. Design based on algorithm that includes high-radix Fermat transform procedure, which is most efficient for high speeds. RS code in question has code-word length of 256 symbols, of which 224 are information symbols and 32 are redundant.

  5. On Decoding Interleaved Chinese Remainder Codes

    DEFF Research Database (Denmark)

    Li, Wenhui; Sidorenko, Vladimir; Nielsen, Johan Sebastian Rosenkilde

    2013-01-01

    We model the decoding of Interleaved Chinese Remainder codes as that of finding a short vector in a Z-lattice. Using the LLL algorithm, we obtain an efficient decoding algorithm, correcting errors beyond the unique decoding bound and having nearly linear complexity. The algorithm can fail...... with a probability dependent on the number of errors, and we give an upper bound for this. Simulation results indicate that the bound is close to the truth. We apply the proposed decoding algorithm for decoding a single CR code using the idea of “Power” decoding, suggested for Reed-Solomon codes. A combination...... of these two methods can be used to decode low-rate Interleaved Chinese Remainder codes....

  6. The ribosome uses two active mechanisms to unwind messenger RNA during translation.

    Science.gov (United States)

    Qu, Xiaohui; Wen, Jin-Der; Lancaster, Laura; Noller, Harry F; Bustamante, Carlos; Tinoco, Ignacio

    2011-07-06

    The ribosome translates the genetic information encoded in messenger RNA into protein. Folded structures in the coding region of an mRNA represent a kinetic barrier that lowers the peptide elongation rate, as the ribosome must disrupt structures it encounters in the mRNA at its entry site to allow translocation to the next codon. Such structures are exploited by the cell to create diverse strategies for translation regulation, such as programmed frameshifting, the modulation of protein expression levels, ribosome localization and co-translational protein folding. Although strand separation activity is inherent to the ribosome, requiring no exogenous helicases, its mechanism is still unknown. Here, using a single-molecule optical tweezers assay on mRNA hairpins, we find that the translation rate of identical codons at the decoding centre is greatly influenced by the GC content of folded structures at the mRNA entry site. Furthermore, force applied to the ends of the hairpin to favour its unfolding significantly speeds translation. Quantitative analysis of the force dependence of its helicase activity reveals that the ribosome, unlike previously studied helicases, uses two distinct active mechanisms to unwind mRNA structure: it destabilizes the helical junction at the mRNA entry site by biasing its thermal fluctuations towards the open state, increasing the probability of the ribosome translocating unhindered; and it mechanically pulls apart the mRNA single strands of the closed junction during the conformational changes that accompany ribosome translocation. The second of these mechanisms ensures a minimal basal rate of translation in the cell; specialized, mechanically stable structures are required to stall the ribosome temporarily. Our results establish a quantitative mechanical basis for understanding the mechanism of regulation of the elongation rate of translation by structured mRNAs. ©2011 Macmillan Publishers Limited. All rights reserved

  7. Effect of mutations in the A site of 16 S rRNA on aminoglycoside antibiotic-ribosome interaction

    DEFF Research Database (Denmark)

    Recht, M I; Douthwaite, S; Dahlquist, K D

    1999-01-01

    antibiotics, which also interact with this region of rRNA. Mutations of certain nucleotides in rRNA reduce aminoglycoside binding affinity, as previously demonstrated using a model RNA oligonucleotide system. Here, predictions from the oligonucleotide system were tested in the ribosome by mutation...... for the aminoglycoside paromomycin, whereas no discernible reduction in affinity was observed with 1406 mutant ribosomes. These data are consistent with prior NMR structural determination of aminoglycoside interaction with the decoding region, and further our understanding of how aminoglycoside resistance can...

  8. Neuron-Like Networks Between Ribosomal Proteins Within the Ribosome

    Science.gov (United States)

    Poirot, Olivier; Timsit, Youri

    2016-05-01

    From brain to the World Wide Web, information-processing networks share common scale invariant properties. Here, we reveal the existence of neural-like networks at a molecular scale within the ribosome. We show that with their extensions, ribosomal proteins form complex assortative interaction networks through which they communicate through tiny interfaces. The analysis of the crystal structures of 50S eubacterial particles reveals that most of these interfaces involve key phylogenetically conserved residues. The systematic observation of interactions between basic and aromatic amino acids at the interfaces and along the extension provides new structural insights that may contribute to decipher the molecular mechanisms of signal transmission within or between the ribosomal proteins. Similar to neurons interacting through “molecular synapses”, ribosomal proteins form a network that suggest an analogy with a simple molecular brain in which the “sensory-proteins” innervate the functional ribosomal sites, while the “inter-proteins” interconnect them into circuits suitable to process the information flow that circulates during protein synthesis. It is likely that these circuits have evolved to coordinate both the complex macromolecular motions and the binding of the multiple factors during translation. This opens new perspectives on nanoscale information transfer and processing.

  9. Interaction of pleuromutilin derivatives with the ribosomal peptidyl transferase center

    DEFF Research Database (Denmark)

    Long, K. S.; Hansen, L. K.; Jakobsen, L.

    2006-01-01

    Tiamulin is a pleuromutilin antibiotic that is used in veterinary medicine. The recently published crystal structure of a tiamulin-50S ribosomal subunit complex provides detailed information about how this drug targets the peptidyl transferase center of the ribosome. To promote rational design...... mutant strain is resistant to tiamulin and pleuromutilin, but not valnemulin, implying that valnemulin is better able to withstand an altered rRNA binding surface around the mutilin core. This is likely due to additional interactions made between the valnemulin side chain extension and the rRNA binding...

  10. Bioinformatics decoding the genome

    CERN Multimedia

    CERN. Geneva; Deutsch, Sam; Michielin, Olivier; Thomas, Arthur; Descombes, Patrick

    2006-01-01

    Extracting the fundamental genomic sequence from the DNA From Genome to Sequence : Biology in the early 21st century has been radically transformed by the availability of the full genome sequences of an ever increasing number of life forms, from bacteria to major crop plants and to humans. The lecture will concentrate on the computational challenges associated with the production, storage and analysis of genome sequence data, with an emphasis on mammalian genomes. The quality and usability of genome sequences is increasingly conditioned by the careful integration of strategies for data collection and computational analysis, from the construction of maps and libraries to the assembly of raw data into sequence contigs and chromosome-sized scaffolds. Once the sequence is assembled, a major challenge is the mapping of biologically relevant information onto this sequence: promoters, introns and exons of protein-encoding genes, regulatory elements, functional RNAs, pseudogenes, transposons, etc. The methodological ...

  11. Structural insights into methyltransferase KsgA function in 30S ribosomal subunit biogenesis.

    Science.gov (United States)

    Boehringer, Daniel; O'Farrell, Heather C; Rife, Jason P; Ban, Nenad

    2012-03-23

    The assembly of the ribosomal subunits is facilitated by ribosome biogenesis factors. The universally conserved methyltransferase KsgA modifies two adjacent adenosine residues in the 3'-terminal helix 45 of the 16 S ribosomal RNA (rRNA). KsgA recognizes its substrate adenosine residues only in the context of a near mature 30S subunit and is required for the efficient processing of the rRNA termini during ribosome biogenesis. Here, we present the cryo-EM structure of KsgA bound to a nonmethylated 30S ribosomal subunit. The structure reveals that KsgA binds to the 30S platform with the catalytic N-terminal domain interacting with substrate adenosine residues in helix 45 and the C-terminal domain making extensive contacts to helix 27 and helix 24. KsgA excludes the penultimate rRNA helix 44 from adopting its position in the mature 30S subunit, blocking the formation of the decoding site and subunit joining. We suggest that the activation of methyltransferase activity and subsequent dissociation of KsgA control conformational changes in helix 44 required for final rRNA processing and translation initiation.

  12. Structural Insights into Methyltransferase KsgA Function in 30S Ribosomal Subunit Biogenesis*

    Science.gov (United States)

    Boehringer, Daniel; O'Farrell, Heather C.; Rife, Jason P.; Ban, Nenad

    2012-01-01

    The assembly of the ribosomal subunits is facilitated by ribosome biogenesis factors. The universally conserved methyltransferase KsgA modifies two adjacent adenosine residues in the 3′-terminal helix 45 of the 16 S ribosomal RNA (rRNA). KsgA recognizes its substrate adenosine residues only in the context of a near mature 30S subunit and is required for the efficient processing of the rRNA termini during ribosome biogenesis. Here, we present the cryo-EM structure of KsgA bound to a nonmethylated 30S ribosomal subunit. The structure reveals that KsgA binds to the 30S platform with the catalytic N-terminal domain interacting with substrate adenosine residues in helix 45 and the C-terminal domain making extensive contacts to helix 27 and helix 24. KsgA excludes the penultimate rRNA helix 44 from adopting its position in the mature 30S subunit, blocking the formation of the decoding site and subunit joining. We suggest that the activation of methyltransferase activity and subsequent dissociation of KsgA control conformational changes in helix 44 required for final rRNA processing and translation initiation. PMID:22308031

  13. LDPC Decoding on GPU for Mobile Device

    Directory of Open Access Journals (Sweden)

    Yiqin Lu

    2016-01-01

    Full Text Available A flexible software LDPC decoder that exploits data parallelism for simultaneous multicode words decoding on the mobile device is proposed in this paper, supported by multithreading on OpenCL based graphics processing units. By dividing the check matrix into several parts to make full use of both the local memory and private memory on GPU and properly modify the code capacity each time, our implementation on a mobile phone shows throughputs above 100 Mbps and delay is less than 1.6 millisecond in decoding, which make high-speed communication like video calling possible. To realize efficient software LDPC decoding on the mobile device, the LDPC decoding feature on communication baseband chip should be replaced to save the cost and make it easier to upgrade decoder to be compatible with a variety of channel access schemes.

  14. Ribosomal frameshifting and transcriptional slippage: From genetic steganography and cryptography to adventitious use.

    Science.gov (United States)

    Atkins, John F; Loughran, Gary; Bhatt, Pramod R; Firth, Andrew E; Baranov, Pavel V

    2016-09-06

    Genetic decoding is not 'frozen' as was earlier thought, but dynamic. One facet of this is frameshifting that often results in synthesis of a C-terminal region encoded by a new frame. Ribosomal frameshifting is utilized for the synthesis of additional products, for regulatory purposes and for translational 'correction' of problem or 'savior' indels. Utilization for synthesis of additional products occurs prominently in the decoding of mobile chromosomal element and viral genomes. One class of regulatory frameshifting of stable chromosomal genes governs cellular polyamine levels from yeasts to humans. In many cases of productively utilized frameshifting, the proportion of ribosomes that frameshift at a shift-prone site is enhanced by specific nascent peptide or mRNA context features. Such mRNA signals, which can be 5' or 3' of the shift site or both, can act by pairing with ribosomal RNA or as stem loops or pseudoknots even with one component being 4 kb 3' from the shift site. Transcriptional realignment at slippage-prone sequences also generates productively utilized products encoded trans-frame with respect to the genomic sequence. This too can be enhanced by nucleic acid structure. Together with dynamic codon redefinition, frameshifting is one of the forms of recoding that enriches gene expression. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

  15. A class of Sudan-decodable codes

    DEFF Research Database (Denmark)

    Nielsen, Rasmus Refslund

    2000-01-01

    In this article, Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based...... on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made....

  16. Interior point decoding for linear vector channels

    International Nuclear Information System (INIS)

    Wadayama, T

    2008-01-01

    In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem

  17. Interior point decoding for linear vector channels

    Energy Technology Data Exchange (ETDEWEB)

    Wadayama, T [Nagoya Institute of Technology, Gokiso, Showa-ku, Nagoya, Aichi, 466-8555 (Japan)], E-mail: wadayama@nitech.ac.jp

    2008-01-15

    In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem.

  18. Video encoder/decoder for encoding/decoding motion compensated images

    NARCIS (Netherlands)

    1996-01-01

    Video encoder and decoder, provided with a motion compensator for motion-compensated video coding or decoding in which a picture is coded or decoded in blocks in alternately horizontal and vertical steps. The motion compensator is provided with addressing means (160) and controlled multiplexers

  19. Evaluation framework for K-best sphere decoders

    KAUST Repository

    Shen, Chungan; Eltawil, Ahmed M.; Salama, Khaled N.

    2010-01-01

    or receive antennas. Tree-searching type decoder structures such as Sphere decoder and K-best decoder present an interesting trade-off between complexity and performance. Many algorithmic developments and VLSI implementations have been reported in literature

  20. Concatenated coding system with iterated sequential inner decoding

    DEFF Research Database (Denmark)

    Jensen, Ole Riis; Paaske, Erik

    1995-01-01

    We describe a concatenated coding system with iterated sequential inner decoding. The system uses convolutional codes of very long constraint length and operates on iterations between an inner Fano decoder and an outer Reed-Solomon decoder......We describe a concatenated coding system with iterated sequential inner decoding. The system uses convolutional codes of very long constraint length and operates on iterations between an inner Fano decoder and an outer Reed-Solomon decoder...

  1. Application of Beyond Bound Decoding for High Speed Optical Communications

    DEFF Research Database (Denmark)

    Li, Bomin; Larsen, Knud J.; Vegas Olmos, Juan José

    2013-01-01

    This paper studies the application of beyond bound decoding method for high speed optical communications. This hard-decision decoding method outperforms traditional minimum distance decoding method, with a total net coding gain of 10.36 dB.......This paper studies the application of beyond bound decoding method for high speed optical communications. This hard-decision decoding method outperforms traditional minimum distance decoding method, with a total net coding gain of 10.36 dB....

  2. On minimizing the maximum broadcast decoding delay for instantly decodable network coding

    KAUST Repository

    Douik, Ahmed S.

    2014-09-01

    In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS). In order to solve this problem, we first derive the expressions for the probability distributions of maximum decoding delay increments. Given these expressions, we formulate the problem as a maximum weight clique problem in the IDNC graph. Although this problem is known to be NP-hard, we design a greedy algorithm to perform effective packet selection. Through extensive simulations, we compare the sum decoding delay and the max decoding delay experienced when applying the policies to minimize the sum decoding delay and our policy to reduce the max decoding delay. Simulations results show that our policy gives a good agreement among all the delay aspects in all situations and outperforms the sum decoding delay policy to effectively minimize the sum decoding delay when the channel conditions become harsher. They also show that our definition of delay significantly improve the number of served receivers when they are subject to strict delay constraints.

  3. Best linear decoding of random mask images

    International Nuclear Information System (INIS)

    Woods, J.W.; Ekstrom, M.P.; Palmieri, T.M.; Twogood, R.E.

    1975-01-01

    In 1968 Dicke proposed coded imaging of x and γ rays via random pinholes. Since then, many authors have agreed with him that this technique can offer significant image improvement. A best linear decoding of the coded image is presented, and its superiority over the conventional matched filter decoding is shown. Experimental results in the visible light region are presented. (U.S.)

  4. Oppositional Decoding as an Act of Resistance.

    Science.gov (United States)

    Steiner, Linda

    1988-01-01

    Argues that contributors to the "No Comment" feature of "Ms." magazine are engaging in oppositional decoding and speculates on why this is a satisfying group process. Also notes such decoding presents another challenge to the idea that mass media has the same effect on all audiences. (SD)

  5. High Speed Frame Synchronization and Viterbi Decoding

    DEFF Research Database (Denmark)

    Paaske, Erik; Justesen, Jørn; Larsen, Knud J.

    1996-01-01

    The purpose of Phase 1 of the study is to describe the system structure and algorithms in sufficient detail to allow drawing the high level architecture of units containing frame synchronization and Viterbi decoding. The systems we consider are high data rate space communication systems. Also...... components. Node synchronization performed within a Viterbi decoder is discussed, and algorithms for frame synchronization are described and analyzed. We present a list of system configurations that we find potentially useful. Further, the high level architecture of units that contain frame synchronization...... and various other functions needed in a complete system is presented. Two such units are described, one for placement before the Viterbi decoder and another for placement after the decoder. The high level architectures of three possible implementations of Viterbi decoders are described: The first...

  6. High Speed Frame Synchronization and Viterbi Decoding

    DEFF Research Database (Denmark)

    Paaske, Erik; Justesen, Jørn; Larsen, Knud J.

    1998-01-01

    The study has been divided into two phases. The purpose of Phase 1 of the study was to describe the system structure and algorithms in sufficient detail to allow drawing the high level architecture of units containing frame synchronization and Viterbi decoding. After selection of which specific...... potentially useful.Algorithms for frame synchronization are described and analyzed. Further, the high level architecture of units that contain frame synchronization and various other functions needed in a complete system is presented. Two such units are described, one for placement before the Viterbi decoder...... towards a realization in an FPGA.Node synchronization performed within a Viterbi decoder is discussed, and the high level architectures of three possible implementations of Viterbi decoders are described: The first implementation uses a number of commercially available decoders while the the two others...

  7. MATHEMATICAL AND COMPUTATIONAL MODELLING OF RIBOSOMAL MOVEMENT AND PROTEIN SYNTHESIS: AN OVERVIEW

    Directory of Open Access Journals (Sweden)

    Tobias von der Haar

    2012-04-01

    Full Text Available Translation or protein synthesis consists of a complex system of chemical reactions, which ultimately result in decoding of the mRNA and the production of a protein. The complexity of this reaction system makes it difficult to quantitatively connect its input parameters (such as translation factor or ribosome concentrations, codon composition of the mRNA, or energy availability to output parameters (such as protein synthesis rates or ribosome densities on mRNAs. Mathematical and computational models of translation have now been used for nearly five decades to investigate translation, and to shed light on the relationship between the different reactions in the system. This review gives an overview over the principal approaches used in the modelling efforts, and summarises some of the major findings that were made.

  8. Structure of Ribosomal Silencing Factor Bound to Mycobacterium tuberculosis Ribosome.

    Science.gov (United States)

    Li, Xiaojun; Sun, Qingan; Jiang, Cai; Yang, Kailu; Hung, Li-Wei; Zhang, Junjie; Sacchettini, James C

    2015-10-06

    The ribosomal silencing factor RsfS slows cell growth by inhibiting protein synthesis during periods of diminished nutrient availability. The crystal structure of Mycobacterium tuberculosis (Mtb) RsfS, together with the cryo-electron microscopy (EM) structure of the large subunit 50S of Mtb ribosome, reveals how inhibition of protein synthesis by RsfS occurs. RsfS binds to the 50S at L14, which, when occupied, blocks the association of the small subunit 30S. Although Mtb RsfS is a dimer in solution, only a single subunit binds to 50S. The overlap between the dimer interface and the L14 binding interface confirms that the RsfS dimer must first dissociate to a monomer in order to bind to L14. RsfS interacts primarily through electrostatic and hydrogen bonding to L14. The EM structure shows extended rRNA density that it is not found in the Escherichia coli ribosome, the most striking of these being the extended RNA helix of H54a. Copyright © 2015 Elsevier Ltd. All rights reserved.

  9. 5S rRNA and ribosome.

    Science.gov (United States)

    Gongadze, G M

    2011-12-01

    5S rRNA is an integral component of the ribosome of all living organisms. It is known that the ribosome without 5S rRNA is functionally inactive. However, the question about the specific role of this RNA in functioning of the translation apparatus is still open. This review presents a brief history of the discovery of 5S rRNA and studies of its origin and localization in the ribosome. The previously expressed hypotheses about the role of this RNA in the functioning of the ribosome are discussed considering the unique location of 5S rRNA in the ribosome and its intermolecular contacts. Based on analysis of the current data on ribosome structure and its functional complexes, the role of 5S rRNA as an intermediary between ribosome functional domains is discussed.

  10. Fast decoders for qudit topological codes

    International Nuclear Information System (INIS)

    Anwar, Hussain; Brown, Benjamin J; Campbell, Earl T; Browne, Dan E

    2014-01-01

    Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However, standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyse their error correction thresholds and efficiency. The first decoder is a generalization of a ‘hard-decisions’ decoder due to Bravyi and Haah (arXiv:1112.3252). We modify this decoder to overcome a percolation effect which limits its threshold performance for many-level quantum systems. The second decoder is a generalization of a ‘soft-decisions’ decoder due to Poulin and Duclos-Cianci (2010 Phys. Rev. Lett. 104 050504), with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes. (paper)

  11. Iterative Decoding of Concatenated Codes: A Tutorial

    Directory of Open Access Journals (Sweden)

    Phillip A. Regalia

    2005-05-01

    Full Text Available The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo CDMA, among others. Despite an accrued understanding of iterative decoding over the years, the “turbo principle” remains elusive to master analytically, thereby inciting interest from researchers outside the communications domain. In this spirit, we develop a tutorial presentation of iterative decoding for parallel and serial concatenated codes, in terms hopefully accessible to a broader audience. We motivate iterative decoding as a computationally tractable attempt to approach maximum-likelihood decoding, and characterize fixed points in terms of a “consensus” property between constituent decoders. We review how the decoding algorithm for both parallel and serial concatenated codes coincides with an alternating projection algorithm, which allows one to identify conditions under which the algorithm indeed converges to a maximum-likelihood solution, in terms of particular likelihood functions factoring into the product of their marginals. The presentation emphasizes a common framework applicable to both parallel and serial concatenated codes.

  12. Decoding small surface codes with feedforward neural networks

    Science.gov (United States)

    Varsamopoulos, Savvas; Criger, Ben; Bertels, Koen

    2018-01-01

    Surface codes reach high error thresholds when decoded with known algorithms, but the decoding time will likely exceed the available time budget, especially for near-term implementations. To decrease the decoding time, we reduce the decoding problem to a classification problem that a feedforward neural network can solve. We investigate quantum error correction and fault tolerance at small code distances using neural network-based decoders, demonstrating that the neural network can generalize to inputs that were not provided during training and that they can reach similar or better decoding performance compared to previous algorithms. We conclude by discussing the time required by a feedforward neural network decoder in hardware.

  13. The serial message-passing schedule for LDPC decoding algorithms

    Science.gov (United States)

    Liu, Mingshan; Liu, Shanshan; Zhou, Yuan; Jiang, Xue

    2015-12-01

    The conventional message-passing schedule for LDPC decoding algorithms is the so-called flooding schedule. It has the disadvantage that the updated messages cannot be used until next iteration, thus reducing the convergence speed . In this case, the Layered Decoding algorithm (LBP) based on serial message-passing schedule is proposed. In this paper the decoding principle of LBP algorithm is briefly introduced, and then proposed its two improved algorithms, the grouped serial decoding algorithm (Grouped LBP) and the semi-serial decoding algorithm .They can improve LBP algorithm's decoding speed while maintaining a good decoding performance.

  14. Fast decoding algorithms for coded aperture systems

    International Nuclear Information System (INIS)

    Byard, Kevin

    2014-01-01

    Fast decoding algorithms are described for a number of established coded aperture systems. The fast decoding algorithms for all these systems offer significant reductions in the number of calculations required when reconstructing images formed by a coded aperture system and hence require less computation time to produce the images. The algorithms may therefore be of use in applications that require fast image reconstruction, such as near real-time nuclear medicine and location of hazardous radioactive spillage. Experimental tests confirm the efficacy of the fast decoding techniques

  15. Decoding Algorithms for Random Linear Network Codes

    DEFF Research Database (Denmark)

    Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank

    2011-01-01

    We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially...... achieve a high coding throughput, and reduce energy consumption.We use an on-the-fly version of the Gauss-Jordan algorithm as a baseline, and provide several simple improvements to reduce the number of operations needed to perform decoding. Our tests show that the improvements can reduce the number...

  16. Three phase full wave dc motor decoder

    Science.gov (United States)

    Studer, P. A. (Inventor)

    1977-01-01

    A three phase decoder for dc motors is disclosed which employs an extremely simple six transistor circuit to derive six properly phased output signals for fullwave operation of dc motors. Six decoding transistors are coupled at their base-emitter junctions across a resistor network arranged in a delta configuration. Each point of the delta configuration is coupled to one of three position sensors which sense the rotational position of the motor. A second embodiment of the invention is disclosed in which photo-optical isolators are used in place of the decoding transistors.

  17. Improved Power Decoding of One-Point Hermitian Codes

    DEFF Research Database (Denmark)

    Puchinger, Sven; Bouw, Irene; Rosenkilde, Johan Sebastian Heesemann

    2017-01-01

    We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami–Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power...... decoding algorithm for Reed–Solomon codes and does not require an expensive root-finding step. In addition, it promises improvements for decoding interleaved Hermitian codes....

  18. Decoding of interleaved Reed-Solomon codes using improved power decoding

    DEFF Research Database (Denmark)

    Puchinger, Sven; Rosenkilde ne Nielsen, Johan

    2017-01-01

    We propose a new partial decoding algorithm for m-interleaved Reed-Solomon (IRS) codes that can decode, with high probability, a random error of relative weight 1 − Rm/m+1 at all code rates R, in time polynomial in the code length n. For m > 2, this is an asymptotic improvement over the previous...... state-of-the-art for all rates, and the first improvement for R > 1/3 in the last 20 years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius....

  19. Low-Power Bitstream-Residual Decoder for H.264/AVC Baseline Profile Decoding

    Directory of Open Access Journals (Sweden)

    Xu Ke

    2009-01-01

    Full Text Available Abstract We present the design and VLSI implementation of a novel low-power bitstream-residual decoder for H.264/AVC baseline profile. It comprises a syntax parser, a parameter decoder, and an Inverse Quantization Inverse Transform (IQIT decoder. The syntax parser detects and decodes each incoming codeword in the bitstream under the control of a hierarchical Finite State Machine (FSM; the IQIT decoder performs inverse transform and quantization with pipelining and parallelism. Various power reduction techniques, such as data-driven based on statistic results, nonuniform partition, precomputation, guarded evaluation, hierarchical FSM decomposition, TAG method, zero-block skipping, and clock gating , are adopted and integrated throughout the bitstream-residual decoder. With innovative architecture, the proposed design is able to decode QCIF video sequences of 30 fps at a clock rate as low as 1.5 MHz. A prototype H.264/AVC baseline decoding chip utilizing the proposed decoder is fabricated in UMC 0.18  m 1P6M CMOS technology. The proposed design is measured under 1 V 1.8 V supply with 0.1 V step. It dissipates 76  W at 1 V and 253  W at 1.8 V.

  20. Control of ribosome formation in rat heart

    International Nuclear Information System (INIS)

    Russo, L.A.

    1987-01-01

    Diabetes of 9 days duration produced a 17% diminution in the rate of total protein synthesis in rat hearts perfused as Langendorff preparations supplied with glucose, plasma levels of amino acids, and 400 μU/ml insulin. This reduction was attributable to a decrease in efficiency of protein synthesis and total RNA content. Total messenger RNA content decreased in diabetic hearts in proportion to the reduction in total RNA. Diabetes also resulted in diminished ribosome content as reflected by the induction in total RNA. Ribosome production was investigated by monitoring incorporation of [ 3 H]phenylalanine into the proteins of cytoplasmic ribosomes. Rates of ribosome formation in diabetic hearts were as fast as control rates in the presence of insulin, and were faster than control rates in the absence of the hormone. These results indicated that ribosome content fell in diabetic hearts despite unchanged or faster rates of ribosome formation

  1. Decoding Dyslexia, a Common Learning Disability

    Science.gov (United States)

    ... if they continue to struggle. Read More "Dyslexic" Articles In Their Own Words: Dealing with Dyslexia / Decoding Dyslexia, a Common Learning Disability / What is Dyslexia? / Special Education and Research ...

  2. tRNA's wobble decoding of the genome: 40 years of modification.

    Science.gov (United States)

    Agris, Paul F; Vendeix, Franck A P; Graham, William D

    2007-02-09

    The genetic code is degenerate, in that 20 amino acids are encoded by 61 triplet codes. In 1966, Francis Crick hypothesized that the cell's limited number of tRNAs decoded the genome by recognizing more than one codon. The ambiguity of that recognition resided in the third base-pair, giving rise to the Wobble Hypothesis. Post-transcriptional modifications at tRNA's wobble position 34, especially modifications of uridine 34, enable wobble to occur. The Modified Wobble Hypothesis proposed in 1991 that specific modifications of a tRNA wobble nucleoside shape the anticodon architecture in such a manner that interactions were restricted to the complementary base plus a single wobble pairing for amino acids with twofold degenerate codons. However, chemically different modifications at position 34 would expand the ability of a tRNA to read three or even four of the fourfold degenerate codons. One foundation of Crick's Wobble Hypothesis was that a near-constant geometry of canonical base-pairing be maintained in forming all three base-pairs between the tRNA anticodon and mRNA codon on the ribosome. In accepting an aminoacyl-tRNA, the ribosome requires maintenance of a specific geometry for the anticodon-codon base-pairing. However, it is the post-transcriptional modifications at tRNA wobble position 34 and purine 37, 3'-adjacent to the anticodon, that pre-structure the anticodon domain to ensure the correct codon binding. The modifications create both the architecture and the stability needed for decoding through restraints on anticodon stereochemistry and conformational space, and through selective hydrogen bonding. A physicochemical understanding of modified nucleoside contributions to the tRNA anticodon domain architecture and its decoding of the genome has advanced RNA world evolutionary theory, the principles of RNA chemistry, and the application of this knowledge to the introduction of new amino acids to proteins.

  3. HCV IRES domain IIb affects the configuration of coding RNA in the 40S subunit's decoding groove.

    Science.gov (United States)

    Filbin, Megan E; Kieft, Jeffrey S

    2011-07-01

    Hepatitis C virus (HCV) uses a structured internal ribosome entry site (IRES) RNA to recruit the translation machinery to the viral RNA and begin protein synthesis without the ribosomal scanning process required for canonical translation initiation. Different IRES structural domains are used in this process, which begins with direct binding of the 40S ribosomal subunit to the IRES RNA and involves specific manipulation of the translational machinery. We have found that upon initial 40S subunit binding, the stem-loop domain of the IRES that contains the start codon unwinds and adopts a stable configuration within the subunit's decoding groove. This configuration depends on the sequence and structure of a different stem-loop domain (domain IIb) located far from the start codon in sequence, but spatially proximal in the IRES•40S complex. Mutation of domain IIb results in misconfiguration of the HCV RNA in the decoding groove that includes changes in the placement of the AUG start codon, and a substantial decrease in the ability of the IRES to initiate translation. Our results show that two distal regions of the IRES are structurally communicating at the initial step of 40S subunit binding and suggest that this is an important step in driving protein synthesis.

  4. Multiuser Random Coding Techniques for Mismatched Decoding

    OpenAIRE

    Scarlett, Jonathan; Martinez, Alfonso; Guillén i Fàbregas, Albert

    2016-01-01

    This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth...

  5. Identification and role of functionally important motifs in the 970 loop of Escherichia coli 16S ribosomal RNA.

    Science.gov (United States)

    Saraiya, Ashesh A; Lamichhane, Tek N; Chow, Christine S; SantaLucia, John; Cunningham, Philip R

    2008-02-22

    The 970 loop (helix 31) of Escherichia coli 16S ribosomal RNA contains two modified nucleotides, m(2)G966 and m(5)C967. Positions A964, A969, and C970 are conserved among the Bacteria, Archaea, and Eukarya. The nucleotides present at positions 965, 966, 967, 968, and 971, however, are only conserved and unique within each domain. All organisms contain a modified nucleoside at position 966, but the type of the modification is domain specific. Biochemical and structure studies have placed this loop near the P site and have shown it to be involved in the decoding process and in binding the antibiotic tetracycline. To identify the functional components of this ribosomal RNA hairpin, the eight nucleotides of the 970 loop of helix 31 were subjected to saturation mutagenesis and 107 unique functional mutants were isolated and analyzed. Nonrandom nucleotide distributions were observed at each mutated position among the functional isolates. Nucleotide identity at positions 966 and 969 significantly affects ribosome function. Ribosomes with single mutations of m(2)G966 or m(5)C967 produce more protein in vivo than do wild-type ribosomes. Overexpression of initiation factor 3 specifically restored wild-type levels of protein synthesis to the 966 and 967 mutants, suggesting that modification of these residues is important for initiation factor 3 binding and for the proper initiation of protein synthesis.

  6. Ribosomal protein methyltransferases in the yeast Saccharomyces cerevisiae: Roles in ribosome biogenesis and translation.

    Science.gov (United States)

    Al-Hadid, Qais; White, Jonelle; Clarke, Steven

    2016-02-12

    A significant percentage of the methyltransferasome in Saccharomyces cerevisiae and higher eukaryotes is devoted to methylation of the translational machinery. Methylation of the RNA components of the translational machinery has been studied extensively and is important for structure stability, ribosome biogenesis, and translational fidelity. However, the functional effects of ribosomal protein methylation by their cognate methyltransferases are still largely unknown. Previous work has shown that the ribosomal protein Rpl3 methyltransferase, histidine protein methyltransferase 1 (Hpm1), is important for ribosome biogenesis and translation elongation fidelity. In this study, yeast strains deficient in each of the ten ribosomal protein methyltransferases in S. cerevisiae were examined for potential defects in ribosome biogenesis and translation. Like Hpm1-deficient cells, loss of four of the nine other ribosomal protein methyltransferases resulted in defects in ribosomal subunit synthesis. All of the mutant strains exhibited resistance to the ribosome inhibitors anisomycin and/or cycloheximide in plate assays, but not in liquid culture. Translational fidelity assays measuring stop codon readthrough, amino acid misincorporation, and programmed -1 ribosomal frameshifting, revealed that eight of the ten enzymes are important for translation elongation fidelity and the remaining two are necessary for translation termination efficiency. Altogether, these results demonstrate that ribosomal protein methyltransferases in S. cerevisiae play important roles in ribosome biogenesis and translation. Copyright © 2016 Elsevier Inc. All rights reserved.

  7. A novel parallel pipeline structure of VP9 decoder

    Science.gov (United States)

    Qin, Huabiao; Chen, Wu; Yi, Sijun; Tan, Yunfei; Yi, Huan

    2018-04-01

    To improve the efficiency of VP9 decoder, a novel parallel pipeline structure of VP9 decoder is presented in this paper. According to the decoding workflow, VP9 decoder can be divided into sub-modules which include entropy decoding, inverse quantization, inverse transform, intra prediction, inter prediction, deblocking and pixel adaptive compensation. By analyzing the computing time of each module, hotspot modules are located and the causes of low efficiency of VP9 decoder can be found. Then, a novel pipeline decoder structure is designed by using mixed parallel decoding methods of data division and function division. The experimental results show that this structure can greatly improve the decoding efficiency of VP9.

  8. Coding and decoding with dendrites.

    Science.gov (United States)

    Papoutsi, Athanasia; Kastellakis, George; Psarrou, Maria; Anastasakis, Stelios; Poirazi, Panayiota

    2014-02-01

    Since the discovery of complex, voltage dependent mechanisms in the dendrites of multiple neuron types, great effort has been devoted in search of a direct link between dendritic properties and specific neuronal functions. Over the last few years, new experimental techniques have allowed the visualization and probing of dendritic anatomy, plasticity and integrative schemes with unprecedented detail. This vast amount of information has caused a paradigm shift in the study of memory, one of the most important pursuits in Neuroscience, and calls for the development of novel theories and models that will unify the available data according to some basic principles. Traditional models of memory considered neural cells as the fundamental processing units in the brain. Recent studies however are proposing new theories in which memory is not only formed by modifying the synaptic connections between neurons, but also by modifications of intrinsic and anatomical dendritic properties as well as fine tuning of the wiring diagram. In this review paper we present previous studies along with recent findings from our group that support a key role of dendrites in information processing, including the encoding and decoding of new memories, both at the single cell and the network level. Copyright © 2013 Elsevier Ltd. All rights reserved.

  9. Remodeling of ribosomal genes in somatic cells by Xenopus egg extract

    DEFF Research Database (Denmark)

    Østrup, Olga; Hyttel, Poul; Klærke, Dan Arne

    2011-01-01

    Extracts from Xenopus eggs can reprogram gene expression in somatic nuclei, however little is known about the earliest processes associated with the switch in the transcriptional program. We show here that an early reprogramming event is the remodeling of ribosomal chromatin and gene expression....... This occurs within hours of extract treatment and is distinct from a stress response. Egg extract elicits remodeling of the nuclear envelope, chromatin and nucleolus. Nucleolar remodeling involves a rapid and stable decrease in ribosomal gene transcription, and promoter targeting of the nucleolar remodeling...... and elicits a stress-type nuclear response. Thus, an early event of Xenopus egg extract-mediated nuclear reprogramming is the remodeling of ribosomal genes involving nucleolar remodeling complex. Condition-specific and rapid silencing of ribosomal genes may serve as a sensitive marker for evaluation...

  10. Trapping the ribosome to control gene expression.

    Science.gov (United States)

    Boehringer, Daniel; Ban, Nenad

    2007-09-21

    Protein synthesis is often regulated by structured mRNAs that interact with ribosomes. In this issue of Cell, Marzi et al. (2007) provide insights into the autoregulation of protein S15 by visualizing the folded repressor mRNA on the ribosome stalled in the preinitiation state. These results have implications for our understanding of the mechanism of translation initiation in general.

  11. Differential Stoichiometry among Core Ribosomal Proteins

    Directory of Open Access Journals (Sweden)

    Nikolai Slavov

    2015-11-01

    Full Text Available Understanding the regulation and structure of ribosomes is essential to understanding protein synthesis and its dysregulation in disease. While ribosomes are believed to have a fixed stoichiometry among their core ribosomal proteins (RPs, some experiments suggest a more variable composition. Testing such variability requires direct and precise quantification of RPs. We used mass spectrometry to directly quantify RPs across monosomes and polysomes of mouse embryonic stem cells (ESC and budding yeast. Our data show that the stoichiometry among core RPs in wild-type yeast cells and ESC depends both on the growth conditions and on the number of ribosomes bound per mRNA. Furthermore, we find that the fitness of cells with a deleted RP-gene is inversely proportional to the enrichment of the corresponding RP in polysomes. Together, our findings support the existence of ribosomes with distinct protein composition and physiological function.

  12. FPGA implementation of low complexity LDPC iterative decoder

    Science.gov (United States)

    Verma, Shivani; Sharma, Sanjay

    2016-07-01

    Low-density parity-check (LDPC) codes, proposed by Gallager, emerged as a class of codes which can yield very good performance on the additive white Gaussian noise channel as well as on the binary symmetric channel. LDPC codes have gained lots of importance due to their capacity achieving property and excellent performance in the noisy channel. Belief propagation (BP) algorithm and its approximations, most notably min-sum, are popular iterative decoding algorithms used for LDPC and turbo codes. The trade-off between the hardware complexity and the decoding throughput is a critical factor in the implementation of the practical decoder. This article presents introduction to LDPC codes and its various decoding algorithms followed by realisation of LDPC decoder by using simplified message passing algorithm and partially parallel decoder architecture. Simplified message passing algorithm has been proposed for trade-off between low decoding complexity and decoder performance. It greatly reduces the routing and check node complexity of the decoder. Partially parallel decoder architecture possesses high speed and reduced complexity. The improved design of the decoder possesses a maximum symbol throughput of 92.95 Mbps and a maximum of 18 decoding iterations. The article presents implementation of 9216 bits, rate-1/2, (3, 6) LDPC decoder on Xilinx XC3D3400A device from Spartan-3A DSP family.

  13. Performance breakdown in optimal stimulus decoding.

    Science.gov (United States)

    Lubomir Kostal; Lansky, Petr; Pilarski, Stevan

    2015-06-01

    One of the primary goals of neuroscience is to understand how neurons encode and process information about their environment. The problem is often approached indirectly by examining the degree to which the neuronal response reflects the stimulus feature of interest. In this context, the methods of signal estimation and detection theory provide the theoretical limits on the decoding accuracy with which the stimulus can be identified. The Cramér-Rao lower bound on the decoding precision is widely used, since it can be evaluated easily once the mathematical model of the stimulus-response relationship is determined. However, little is known about the behavior of different decoding schemes with respect to the bound if the neuronal population size is limited. We show that under broad conditions the optimal decoding displays a threshold-like shift in performance in dependence on the population size. The onset of the threshold determines a critical range where a small increment in size, signal-to-noise ratio or observation time yields a dramatic gain in the decoding precision. We demonstrate the existence of such threshold regions in early auditory and olfactory information coding. We discuss the origin of the threshold effect and its impact on the design of effective coding approaches in terms of relevant population size.

  14. Symbol synchronization for the TDRSS decoder

    Science.gov (United States)

    Costello, D. J., Jr.

    1983-01-01

    Each 8 bits out of the Viterbi decoder correspond to one symbol of the R/S code. Synchronization must be maintained here so that each 8-bit symbol delivered to the R/S decoder corresponds to an 8-bit symbol from the R/S encoder. Lack of synchronization, would cause an error in almost every R/S symbol since even a - 1-bit sync slip shifts every bit in each 8-bit symbol by one position, therby confusing the mapping betweeen 8-bit sequences and symbols. The error correcting capability of the R/S code would be exceeded. Possible ways to correcting this condition include: (1) designing the R/S decoder to recognize the overload and shifting the output sequence of the inner decoder to establish a different sync state; (2) using the characteristics of the inner decoder to establish symbol synchronization for the outer code, with or without a deinterleaver and an interleaver; and (3) modifying the encoder to alternate periodically between two sets of generators.

  15. Modified Decoding Algorithm of LLR-SPA

    Directory of Open Access Journals (Sweden)

    Zhongxun Wang

    2014-09-01

    Full Text Available In wireless sensor networks, the energy consumption is mainly occurred in the stage of information transmission. The Low Density Parity Check code can make full use of the channel information to save energy. Because of the widely used decoding algorithm of the Low Density Parity Check code, this paper proposes a new decoding algorithm which is based on the LLR-SPA (Sum-Product Algorithm in Log-Likelihood-domain to improve the accuracy of the decoding algorithm. In the modified algorithm, a piecewise linear function is used to approximate the complicated Jacobi correction term in LLR-SPA decoding algorithm. Construct the tangent by the tangency point to the function of Jacobi correction term, which is based on the first order Taylor Series. In this way, the proposed piecewise linear approximation offers almost a perfect match to the function of Jacobi correction term. Meanwhile, the proposed piecewise linear approximation could avoid the operation of logarithmic which is more suitable for practical application. The simulation results show that the proposed algorithm could improve the decoding accuracy greatly without noticeable variation of the computational complexity.

  16. Completion time reduction in instantly decodable network coding through decoding delay control

    KAUST Repository

    Douik, Ahmed S.

    2014-12-01

    For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users\\' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.

  17. Completion time reduction in instantly decodable network coding through decoding delay control

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Al-Naffouri, Tareq Y.

    2014-01-01

    For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.

  18. NP-hardness of decoding quantum error-correction codes

    Science.gov (United States)

    Hsieh, Min-Hsiu; Le Gall, François

    2011-05-01

    Although the theory of quantum error correction is intimately related to classical coding theory and, in particular, one can construct quantum error-correction codes (QECCs) from classical codes with the dual-containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expects degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or nondegenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.

  19. NP-hardness of decoding quantum error-correction codes

    International Nuclear Information System (INIS)

    Hsieh, Min-Hsiu; Le Gall, Francois

    2011-01-01

    Although the theory of quantum error correction is intimately related to classical coding theory and, in particular, one can construct quantum error-correction codes (QECCs) from classical codes with the dual-containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expects degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or nondegenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.

  20. Generalized Sudan's List Decoding for Order Domain Codes

    DEFF Research Database (Denmark)

    Geil, Hans Olav; Matsumoto, Ryutaroh

    2007-01-01

    We generalize Sudan's list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the proposed method is larger than the original list decoding without multiplicity....

  1. Partially blind instantly decodable network codes for lossy feedback environment

    KAUST Repository

    Sorour, Sameh; Douik, Ahmed S.; Valaee, Shahrokh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2014-01-01

    an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both

  2. Neuroprosthetic Decoder Training as Imitation Learning.

    Science.gov (United States)

    Merel, Josh; Carlson, David; Paninski, Liam; Cunningham, John P

    2016-05-01

    Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user's intention is not directly observable, recent methods have demonstrated value in training the decoder against a surrogate for the user's intended movement. Here we show that training a decoder in this way is a novel variant of an imitation learning problem, where an oracle or expert is employed for supervised training in lieu of direct observations, which are not available. Specifically, we describe how a generic imitation learning meta-algorithm, dataset aggregation (DAgger), can be adapted to train a generic brain-computer interface. By deriving existing learning algorithms for brain-computer interfaces in this framework, we provide a novel analysis of regret (an important metric of learning efficacy) for brain-computer interfaces. This analysis allows us to characterize the space of algorithmic variants and bounds on their regret rates. Existing approaches for decoder learning have been performed in the cursor control setting, but the available design principles for these decoders are such that it has been impossible to scale them to naturalistic settings. Leveraging our findings, we then offer an algorithm that combines imitation learning with optimal control, which should allow for training of arbitrary effectors for which optimal control can generate goal-oriented control. We demonstrate this novel and general BCI algorithm with simulated neuroprosthetic control of a 26 degree-of-freedom model of an arm, a sophisticated and realistic end effector.

  3. Neuroprosthetic Decoder Training as Imitation Learning.

    Directory of Open Access Journals (Sweden)

    Josh Merel

    2016-05-01

    Full Text Available Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user's intention is not directly observable, recent methods have demonstrated value in training the decoder against a surrogate for the user's intended movement. Here we show that training a decoder in this way is a novel variant of an imitation learning problem, where an oracle or expert is employed for supervised training in lieu of direct observations, which are not available. Specifically, we describe how a generic imitation learning meta-algorithm, dataset aggregation (DAgger, can be adapted to train a generic brain-computer interface. By deriving existing learning algorithms for brain-computer interfaces in this framework, we provide a novel analysis of regret (an important metric of learning efficacy for brain-computer interfaces. This analysis allows us to characterize the space of algorithmic variants and bounds on their regret rates. Existing approaches for decoder learning have been performed in the cursor control setting, but the available design principles for these decoders are such that it has been impossible to scale them to naturalistic settings. Leveraging our findings, we then offer an algorithm that combines imitation learning with optimal control, which should allow for training of arbitrary effectors for which optimal control can generate goal-oriented control. We demonstrate this novel and general BCI algorithm with simulated neuroprosthetic control of a 26 degree-of-freedom model of an arm, a sophisticated and realistic end effector.

  4. Decoding of concatenated codes with interleaved outer codes

    DEFF Research Database (Denmark)

    Justesen, Jørn; Høholdt, Tom; Thommesen, Christian

    2004-01-01

    Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes.......Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes....

  5. Binary Systematic Network Coding for Progressive Packet Decoding

    OpenAIRE

    Jones, Andrew L.; Chatzigeorgiou, Ioannis; Tassi, Andrea

    2015-01-01

    We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional net- work coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve ...

  6. Decoding Hermitian Codes with Sudan's Algorithm

    DEFF Research Database (Denmark)

    Høholdt, Tom; Nielsen, Rasmus Refslund

    1999-01-01

    We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q-polynomial, and a reduct......We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q...

  7. Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

    DEFF Research Database (Denmark)

    Puchinger, Sven; Müelich, Sven; Mödinger, David

    2017-01-01

    We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ3n(ω+1)/2log⁡(n)) decoding algorithm for ℓ-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent.......We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ3n(ω+1)/2log⁡(n)) decoding algorithm for ℓ-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent....

  8. Decoding LDPC Convolutional Codes on Markov Channels

    Directory of Open Access Journals (Sweden)

    Kashyap Manohar

    2008-01-01

    Full Text Available Abstract This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.

  9. Decoding LDPC Convolutional Codes on Markov Channels

    Directory of Open Access Journals (Sweden)

    Chris Winstead

    2008-04-01

    Full Text Available This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.

  10. Decoding algorithm for vortex communications receiver

    Science.gov (United States)

    Kupferman, Judy; Arnon, Shlomi

    2018-01-01

    Vortex light beams can provide a tremendous alphabet for encoding information. We derive a symbol decoding algorithm for a direct detection matrix detector vortex beam receiver using Laguerre Gauss (LG) modes, and develop a mathematical model of symbol error rate (SER) for this receiver. We compare SER as a function of signal to noise ratio (SNR) for our algorithm and for the Pearson correlation algorithm. To our knowledge, this is the first comprehensive treatment of a decoding algorithm of a matrix detector for an LG receiver.

  11. Oxidative damage of 18S and 5S ribosomal RNA in digestive gland of mussels exposed to trace metals.

    Science.gov (United States)

    Kournoutou, Georgia G; Giannopoulou, Panagiota C; Sazakli, Eleni; Leotsinidis, Michel; Kalpaxis, Dimitrios L

    2017-11-01

    Numerous studies have shown the ability of trace metals to accumulate in marine organisms and cause oxidative stress that leads to perturbations in many important intracellular processes, including protein synthesis. This study is mainly focused on the exploration of structural changes, like base modifications, scissions, and conformational changes, caused in 18S and 5S ribosomal RNA (rRNA) isolated from the mussel Mytilus galloprovincialis exposed to 40μg/L Cu, 30μg/L Hg, or 100μg/L Cd, for 5 or 15days. 18S rRNA and 5S rRNA are components of the small and large ribosomal subunit, respectively, found in complex with ribosomal proteins, translation factors and other auxiliary components (metal ions, toxins etc). 18S rRNA plays crucial roles in all stages of protein synthesis, while 5S rRNA serves as a master signal transducer between several functional regions of 28S rRNA. Therefore, structural changes in these ribosomal constituents could affect the basic functions of ribosomes and hence the normal metabolism of cells. Especially, 18S rRNA along with ribosomal proteins forms the decoding centre that ensures the correct codon-anticodon pairing. As exemplified by ELISA, primer extension analysis and DMS footprinting analysis, each metal caused oxidative damage to rRNA, depending on the nature of metal ion and the duration of exposure. Interestingly, exposure of mussels to Cu or Hg caused structural alterations in 5S rRNA, localized in paired regions and within loops A, B, C, and E, leading to a continuous progressive loss of the 5S RNA structural integrity. In contrast, structural impairments of 5S rRNA in mussels exposed to Cd were accumulating for the initial 5days, and then progressively decreased to almost the normal level by day 15, probably due to the parallel elevation of metallothionein content that depletes the pools of free Cd. Regions of interest in 18S rRNA, such as the decoding centre, sites implicated in the binding of tRNAs (A- and P-sites) or

  12. The ribosome as a molecular machine: the mechanism of tRNA-mRNA movement in translocation.

    Science.gov (United States)

    Rodnina, Marina V; Wintermeyer, Wolfgang

    2011-04-01

    Translocation of tRNA and mRNA through the ribosome is one of the most dynamic events during protein synthesis. In the cell, translocation is catalysed by EF-G (elongation factor G) and driven by GTP hydrolysis. Major unresolved questions are: how the movement is induced and what the moving parts of the ribosome are. Recent progress in time-resolved cryoelectron microscopy revealed trajectories of tRNA movement through the ribosome. Driven by thermal fluctuations, the ribosome spontaneously samples a large number of conformational states. The spontaneous movement of tRNAs through the ribosome is loosely coupled to the motions within the ribosome. EF-G stabilizes conformational states prone to translocation and promotes a conformational rearrangement of the ribosome (unlocking) that accelerates the rate-limiting step of translocation: the movement of the tRNA anticodons on the small ribosomal subunit. EF-G acts as a Brownian ratchet providing directional bias for movement at the cost of GTP hydrolysis.

  13. On Lattice Sequential Decoding for The Unconstrained AWGN Channel

    KAUST Repository

    Abediseid, Walid; Alouini, Mohamed-Slim

    2013-01-01

    channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the \\textit{lattice decoder}. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement

  14. Image transmission system using adaptive joint source and channel decoding

    Science.gov (United States)

    Liu, Weiliang; Daut, David G.

    2005-03-01

    In this paper, an adaptive joint source and channel decoding method is designed to accelerate the convergence of the iterative log-dimain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec, which makes it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. Due to the error resilience modes, some bits are known to be either correct or in error. The positions of these bits are then fed back to the channel decoder. The log-likelihood ratios (LLR) of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. That is, for lower channel SNR, a larger factor is assigned, and vice versa. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the non-source controlled decoding method up to 5dB in terms of PSNR for various reconstructed images.

  15. Decoding and Encoding Facial Expressions in Preschool-Age Children.

    Science.gov (United States)

    Zuckerman, Miron; Przewuzman, Sylvia J.

    1979-01-01

    Preschool-age children drew, decoded, and encoded facial expressions depicting five different emotions. Accuracy of drawing, decoding and encoding each of the five emotions was consistent across the three tasks; decoding ability was correlated with drawing ability among female subjects, but neither of these abilities was correlated with encoding…

  16. Molecular dynamics simulation of ribosome jam

    KAUST Repository

    Matsumoto, Shigenori; Takagi, Fumiko; Shimada, Takashi; Ito, Nobuyasu

    2011-01-01

    We propose a coarse-grained molecular dynamics model of ribosome molecules to study the dependence of translation process on environmental parameters. We found the model exhibits traffic jam property, which is consistent with an ASEP model. We

  17. Ribosome evolution: Emergence of peptide synthesis machinery

    Indian Academy of Sciences (India)

    suggested the dynamic movement of ribosomal proteins. The L2 protein (a .... Such kinds of interactions are important in elucidating the evolution of RNA .... Tamura K 2009 Molecular handedness of life: significance of RNA aminoacylation.

  18. Is The Ribosome Targeted By Adaptive Mutations

    DEFF Research Database (Denmark)

    Jimenez Fernandez, Alicia; Molin, Søren; Johansen, Helle Krogh

    2015-01-01

    Introduction: RNA polymerase and ribosomes, composing the macromolecular synthesis machinery (MMSM), carry out the central processes of transcription and translation, but are usually seen as mechanical elements with no regulatory function. Extensive investigations of gene regulation and the high ...

  19. On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes

    DEFF Research Database (Denmark)

    Beelen, Peter; Høholdt, Tom; Nielsen, Johan Sebastian Rosenkilde

    2013-01-01

    We derive the Wu list-decoding algorithm for generalized Reed–Solomon (GRS) codes by using Gröbner bases over modules and the Euclidean algorithm as the initial algorithm instead of the Berlekamp–Massey algorithm. We present a novel method for constructing the interpolation polynomial fast. We gi...... and a duality in the choice of parameters needed for decoding, both in the case of GRS codes and in the case of Goppa codes....

  20. Synthetic peptides and ribosomal proteins as substrate for 60S ribosomal protein kinase from yeast cells

    DEFF Research Database (Denmark)

    Grankowski, N; Gasior, E; Issinger, O G

    1993-01-01

    Kinetic studies on the 60S protein kinase were conducted with synthetic peptides and ribosomal proteins as substrate. Peptide RRREEESDDD proved to be the best synthetic substrate for this enzyme. The peptide has a sequence of amino acids which most closely resembles the structure of potential...... phosphorylation sites in natural substrates, i.e., acidic ribosomal proteins. The superiority of certain kinetic parameters for 60S kinase obtained with the native whole 80S ribosomes over those of the isolated fraction of acidic ribosomal proteins indicates that the affinity of 60S kinase to the specific protein...

  1. Crystallization of ribosomes from Thermus thermophilus

    International Nuclear Information System (INIS)

    Karpova, E.A.; Serdyuk, I.N.; Tarkhovskii, Yu.S.; Orlova, E.V.; Borovyagin, V.L.

    1987-01-01

    An understanding of the molecular bases of the process of protein biosynthesis on the ribosome requires a knowledge of its structure with high three-dimensional resolution involving the method of x-ray crystallographic analysis. The authors report on the production of crystals of the 70S ribosomes from a new source - the highly thermophilic bacterium Thermus thermophilus. Ribosomes for crystallization were obtained from Th. thermophilus strain HB8 by two washings in buffer with high ionic strength. The ribosome preparation was investigated for homogeneity by the method of high-speed sedimentation in a buffer containing 15 mM MgCl 2 , 50 mM NH 4 Cl, and 10 MM Tris-HCl, pH 7.5. Analysis showed that the preparation if homogeneous. The same preparation was investigated for intactness of ribosomal RNA by the method of gel electrophoresis in 2.75% acrylamide 0.5% agarose gel in a buffer containing 30 mM Tris, 30 mM NaH 2 PO 4 , 10 mM EDTA, 1-2% SDS, and 6 M urea. Analysis showed that the preparation possesses intact 16S and 23S RNA. The latter did not degrade, at least in a week of exposure of the ribosomes in buffer solution at 5 0 C. The ribosome preparation had no appreciable RNase activity, which was verified by incubating 4.5 micrograms of ribosomes with 3 micrograms of 14 C-labeled 16S rRna (50 0 C, 90 min) in a buffer containing 10 mM MgCl 2 , 100 mM NH 4 Cl, and 10 mM Tris-HCl, pH/sub 20 0 / 7.5. The incubated nonhydrolyzed RNA was precipitated with 5% trichloroacetic acid and applied on a GF/C filter. The radioactivity was determined in a toluene scintillator on an LS-100C counter

  2. Bayesian population decoding of spiking neurons.

    Science.gov (United States)

    Gerwinn, Sebastian; Macke, Jakob; Bethge, Matthias

    2009-01-01

    The timing of action potentials in spiking neurons depends on the temporal dynamics of their inputs and contains information about temporal fluctuations in the stimulus. Leaky integrate-and-fire neurons constitute a popular class of encoding models, in which spike times depend directly on the temporal structure of the inputs. However, optimal decoding rules for these models have only been studied explicitly in the noiseless case. Here, we study decoding rules for probabilistic inference of a continuous stimulus from the spike times of a population of leaky integrate-and-fire neurons with threshold noise. We derive three algorithms for approximating the posterior distribution over stimuli as a function of the observed spike trains. In addition to a reconstruction of the stimulus we thus obtain an estimate of the uncertainty as well. Furthermore, we derive a 'spike-by-spike' online decoding scheme that recursively updates the posterior with the arrival of each new spike. We use these decoding rules to reconstruct time-varying stimuli represented by a Gaussian process from spike trains of single neurons as well as neural populations.

  3. Faster 2-regular information-set decoding

    NARCIS (Netherlands)

    Bernstein, D.J.; Lange, T.; Peters, C.P.; Schwabe, P.; Chee, Y.M.

    2011-01-01

    Fix positive integers B and w. Let C be a linear code over F 2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of which has Hamming weight 0 or 2. This problem appears in attacks on the FSB (fast syndrome-based) hash function and

  4. Bayesian population decoding of spiking neurons

    Directory of Open Access Journals (Sweden)

    Sebastian Gerwinn

    2009-10-01

    Full Text Available The timing of action potentials in spiking neurons depends on the temporal dynamics of their inputs and contains information about temporal fluctuations in the stimulus. Leaky integrate-and-fire neurons constitute a popular class of encoding models, in which spike times depend directly on the temporal structure of the inputs. However, optimal decoding rules for these models have only been studied explicitly in the noiseless case. Here, we study decoding rules for probabilistic inference of a continuous stimulus from the spike times of a population of leaky integrate-and-fire neurons with threshold noise. We derive three algorithms for approximating the posterior distribution over stimuli as a function of the observed spike trains. In addition to a reconstruction of the stimulus we thus obtain an estimate of the uncertainty as well. Furthermore, we derive a `spike-by-spike' online decoding scheme that recursively updates the posterior with the arrival of each new spike. We use these decoding rules to reconstruct time-varying stimuli represented by a Gaussian process from spike trains of single neurons as well as neural populations.

  5. Sequential decoders for large MIMO systems

    KAUST Repository

    Ali, Konpal S.; Abediseid, Walid; Alouini, Mohamed-Slim

    2014-01-01

    the Sequential Decoder using the Fano Algorithm for large MIMO systems. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity

  6. 47 CFR 11.33 - EAS Decoder.

    Science.gov (United States)

    2010-10-01

    ..., satellite, public switched telephone network, or any other source that uses the EAS protocol. (2) Valid..., analog radio and television broadcast stations, analog cable systems and wireless cable systems may... program data must be retained even with power removed. (7) Outputs. Decoders shall have the following...

  7. Older Adults Have Difficulty in Decoding Sarcasm

    Science.gov (United States)

    Phillips, Louise H.; Allen, Roy; Bull, Rebecca; Hering, Alexandra; Kliegel, Matthias; Channon, Shelley

    2015-01-01

    Younger and older adults differ in performance on a range of social-cognitive skills, with older adults having difficulties in decoding nonverbal cues to emotion and intentions. Such skills are likely to be important when deciding whether someone is being sarcastic. In the current study we investigated in a life span sample whether there are…

  8. Bounded-Angle Iterative Decoding of LDPC Codes

    Science.gov (United States)

    Dolinar, Samuel; Andrews, Kenneth; Pollara, Fabrizio; Divsalar, Dariush

    2009-01-01

    Bounded-angle iterative decoding is a modified version of conventional iterative decoding, conceived as a means of reducing undetected-error rates for short low-density parity-check (LDPC) codes. For a given code, bounded-angle iterative decoding can be implemented by means of a simple modification of the decoder algorithm, without redesigning the code. Bounded-angle iterative decoding is based on a representation of received words and code words as vectors in an n-dimensional Euclidean space (where n is an integer).

  9. A Scalable Architecture of a Structured LDPC Decoder

    Science.gov (United States)

    Lee, Jason Kwok-San; Lee, Benjamin; Thorpe, Jeremy; Andrews, Kenneth; Dolinar, Sam; Hamkins, Jon

    2004-01-01

    We present a scalable decoding architecture for a certain class of structured LDPC codes. The codes are designed using a small (n,r) protograph that is replicated Z times to produce a decoding graph for a (Z x n, Z x r) code. Using this architecture, we have implemented a decoder for a (4096,2048) LDPC code on a Xilinx Virtex-II 2000 FPGA, and achieved decoding speeds of 31 Mbps with 10 fixed iterations. The implemented message-passing algorithm uses an optimized 3-bit non-uniform quantizer that operates with 0.2dB implementation loss relative to a floating point decoder.

  10. Decoding subjective mental states from fMRI activity patterns

    International Nuclear Information System (INIS)

    Tamaki, Masako; Kamitani, Yukiyasu

    2011-01-01

    In recent years, functional magnetic resonance imaging (fMRI) decoding has emerged as a powerful tool to read out detailed stimulus features from multi-voxel brain activity patterns. Moreover, the method has been extended to perform a primitive form of 'mind-reading,' by applying a decoder 'objectively' trained using stimulus features to more 'subjective' conditions. In this paper, we first introduce basic procedures for fMRI decoding based on machine learning techniques. Second, we discuss the source of information used for decoding, in particular, the possibility of extracting information from subvoxel neural structures. We next introduce two experimental designs for decoding subjective mental states: the 'objective-to-subjective design' and the 'subjective-to-subjective design.' Then, we illustrate recent studies on the decoding of a variety of mental states, such as, attention, awareness, decision making, memory, and mental imagery. Finally, we discuss the challenges and new directions of fMRI decoding. (author)

  11. SYMBOL LEVEL DECODING FOR DUO-BINARY TURBO CODES

    Directory of Open Access Journals (Sweden)

    Yogesh Beeharry

    2017-05-01

    Full Text Available This paper investigates the performance of three different symbol level decoding algorithms for Duo-Binary Turbo codes. Explicit details of the computations involved in the three decoding techniques, and a computational complexity analysis are given. Simulation results with different couple lengths, code-rates, and QPSK modulation reveal that the symbol level decoding with bit-level information outperforms the symbol level decoding by 0.1 dB on average in the error floor region. Moreover, a complexity analysis reveals that symbol level decoding with bit-level information reduces the decoding complexity by 19.6 % in terms of the total number of computations required for each half-iteration as compared to symbol level decoding.

  12. Belief propagation decoding of quantum channels by passing quantum messages

    International Nuclear Information System (INIS)

    Renes, Joseph M

    2017-01-01

    The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical–quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels. (fast track communication)

  13. Belief propagation decoding of quantum channels by passing quantum messages

    Science.gov (United States)

    Renes, Joseph M.

    2017-07-01

    The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical-quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels.

  14. Elegant grapheme-phoneme correspondence: a periodic chart and singularity generalization unify decoding.

    Science.gov (United States)

    Gates, Louis

    2017-12-11

    The accompanying article introduces highly transparent grapheme-phoneme relationships embodied within a Periodic table of decoding cells, which arguably presents the quintessential transparent decoding elements. The study then folds these cells into one highly transparent but simply stated singularity generalization-this generalization unifies the decoding cells (97% transparency). Deeper, the periodic table and singularity generalization together highlight the connectivity of the periodic cells. Moreover, these interrelated cells, coupled with the singularity generalization, clarify teaching targets and enable efficient learning of the letter-sound code. This singularity generalization, in turn, serves as a model for creating unified but easily stated subordinate generalizations for any one of the transparent cells or groups of cells shown within the tables. The article then expands the periodic cells into two tables of teacher-ready sample word lists-one table includes sample words for the basic and phonogram vowel cells, and the other table embraces word samples for the transparent consonant cells. The paper concludes with suggestions for teaching the cellular transparency embedded within reoccurring isolated words and running text to promote decoding automaticity of the periodic cells.

  15. Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; The Map and Related Decoding Algirithms

    Science.gov (United States)

    Lin, Shu; Fossorier, Marc

    1998-01-01

    In a coded communication system with equiprobable signaling, MLD minimizes the word error probability and delivers the most likely codeword associated with the corresponding received sequence. This decoding has two drawbacks. First, minimization of the word error probability is not equivalent to minimization of the bit error probability. Therefore, MLD becomes suboptimum with respect to the bit error probability. Second, MLD delivers a hard-decision estimate of the received sequence, so that information is lost between the input and output of the ML decoder. This information is important in coded schemes where the decoded sequence is further processed, such as concatenated coding schemes, multi-stage and iterative decoding schemes. In this chapter, we first present a decoding algorithm which both minimizes bit error probability, and provides the corresponding soft information at the output of the decoder. This algorithm is referred to as the MAP (maximum aposteriori probability) decoding algorithm.

  16. Ribosomal studies on the 70S ribosome of E.coli by means of neutron scattering

    International Nuclear Information System (INIS)

    Burkhardt, N.

    1997-01-01

    Ribosomes are ribonucleo-protein complexes, which catalyse proteinbiosynthesis in all living organisms. Currently, most of the structural models of the prokaryotic 70S ribosome rely on electron microscopy and describe mainly the outer shape of the particle. Neutron scattering can provide information on the internal structure of the ribosome. Parts of the structure can be contrasted for neutrons by means of an isotopic exchange of the naturally occurring hydrogen ( 1 H) for deuterium ( 2 H), allowing direct measurements in situ. Specifically deuterium-labeled ribosomes (E. coli) were prepared and analysed with neutron scattering. The biochemical methods were established and combined to a generally applicable preparation system. This allows labeling of all ribosomal components in any combination. A systematic analysis of the protein and RNA phases resulted in the development of a new model for the 70S ribosome. This model describes not only the outer shape of the particle, but displays also an experimentally determined internal protein-RNA distribution and the border of subunits for the first time (four-phase model; resolution: 50A). Models of the 70S ribosome from other studies were evaluated and ranked according to consistency with the measured scattering data. Applying a new neutron scattering technique of particular sensitivity, the proton-spin contrast-variation, single proteins could be measured and localized. The positions of the proteins S6 and S10 were determined, providing the first coordinates of protein mass centers within the 70S ribosome. (orig.) [de

  17. On Lattice Sequential Decoding for The Unconstrained AWGN Channel

    KAUST Repository

    Abediseid, Walid

    2013-04-04

    In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the \\\\textit{lattice decoder}. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.

  18. On Lattice Sequential Decoding for The Unconstrained AWGN Channel

    KAUST Repository

    Abediseid, Walid

    2012-10-01

    In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.

  19. Video coding for decoding power-constrained embedded devices

    Science.gov (United States)

    Lu, Ligang; Sheinin, Vadim

    2004-01-01

    Low power dissipation and fast processing time are crucial requirements for embedded multimedia devices. This paper presents a technique in video coding to decrease the power consumption at a standard video decoder. Coupled with a small dedicated video internal memory cache on a decoder, the technique can substantially decrease the amount of data traffic to the external memory at the decoder. A decrease in data traffic to the external memory at decoder will result in multiple benefits: faster real-time processing and power savings. The encoder, given prior knowledge of the decoder"s dedicated video internal memory cache management scheme, regulates its choice of motion compensated predictors to reduce the decoder"s external memory accesses. This technique can be used in any standard or proprietary encoder scheme to generate a compliant output bit stream decodable by standard CPU-based and dedicated hardware-based decoders for power savings with the best quality-power cost trade off. Our simulation results show that with a relatively small amount of dedicated video internal memory cache, the technique may decrease the traffic between CPU and external memory over 50%.

  20. On Lattice Sequential Decoding for The Unconstrained AWGN Channel

    KAUST Repository

    Abediseid, Walid; Alouini, Mohamed-Slim

    2012-01-01

    In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.

  1. The ribosome can prevent aggregation of partially folded protein intermediates: studies using the Escherichia coli ribosome.

    Directory of Open Access Journals (Sweden)

    Bani Kumar Pathak

    Full Text Available BACKGROUND: Molecular chaperones that support de novo folding of proteins under non stress condition are classified as chaperone 'foldases' that are distinct from chaperone' holdases' that provide high affinity binding platform for unfolded proteins and prevent their aggregation specifically under stress conditions. Ribosome, the cellular protein synthesis machine can act as a foldase chaperone that can bind unfolded proteins and release them in folding competent state. The peptidyl transferase center (PTC located in the domain V of the 23S rRNA of Escherichia coli ribosome (bDV RNA is the chaperoning center of the ribosome. It has been proposed that via specific interactions between the RNA and refolding proteins, the chaperone provides information for the correct folding of unfolded polypeptide chains. RESULTS: We demonstrate using Escherichia coli ribosome and variants of its domain V RNA that the ribosome can bind to partially folded intermediates of bovine carbonic anhydrase II (BCAII and lysozyme and suppress aggregation during their refolding. Using mutants of domain V RNA we demonstrate that the time for which the chaperone retains the bound protein is an important factor in determining its ability to suppress aggregation and/or support reactivation of protein. CONCLUSION: The ribosome can behave like a 'holdase' chaperone and has the ability to bind and hold back partially folded intermediate states of proteins from participating in the aggregation process. Since the ribosome is an essential organelle that is present in large numbers in all living cells, this ability of the ribosome provides an energetically inexpensive way to suppress cellular aggregation. Further, this ability of the ribosome might also be crucial in the context that the ribosome is one of the first chaperones to be encountered by a large nascent polypeptide chains that have a tendency to form partially folded intermediates immediately following their synthesis.

  2. Decoding spikes in a spiking neuronal network

    Energy Technology Data Exchange (ETDEWEB)

    Feng Jianfeng [Department of Informatics, University of Sussex, Brighton BN1 9QH (United Kingdom); Ding, Mingzhou [Department of Mathematics, Florida Atlantic University, Boca Raton, FL 33431 (United States)

    2004-06-04

    We investigate how to reliably decode the input information from the output of a spiking neuronal network. A maximum likelihood estimator of the input signal, together with its Fisher information, is rigorously calculated. The advantage of the maximum likelihood estimation over the 'brute-force rate coding' estimate is clearly demonstrated. It is pointed out that the ergodic assumption in neuroscience, i.e. a temporal average is equivalent to an ensemble average, is in general not true. Averaging over an ensemble of neurons usually gives a biased estimate of the input information. A method on how to compensate for the bias is proposed. Reconstruction of dynamical input signals with a group of spiking neurons is extensively studied and our results show that less than a spike is sufficient to accurately decode dynamical inputs.

  3. Decoding spikes in a spiking neuronal network

    International Nuclear Information System (INIS)

    Feng Jianfeng; Ding, Mingzhou

    2004-01-01

    We investigate how to reliably decode the input information from the output of a spiking neuronal network. A maximum likelihood estimator of the input signal, together with its Fisher information, is rigorously calculated. The advantage of the maximum likelihood estimation over the 'brute-force rate coding' estimate is clearly demonstrated. It is pointed out that the ergodic assumption in neuroscience, i.e. a temporal average is equivalent to an ensemble average, is in general not true. Averaging over an ensemble of neurons usually gives a biased estimate of the input information. A method on how to compensate for the bias is proposed. Reconstruction of dynamical input signals with a group of spiking neurons is extensively studied and our results show that less than a spike is sufficient to accurately decode dynamical inputs

  4. Neural decoding of visual imagery during sleep.

    Science.gov (United States)

    Horikawa, T; Tamaki, M; Miyawaki, Y; Kamitani, Y

    2013-05-03

    Visual imagery during sleep has long been a topic of persistent speculation, but its private nature has hampered objective analysis. Here we present a neural decoding approach in which machine-learning models predict the contents of visual imagery during the sleep-onset period, given measured brain activity, by discovering links between human functional magnetic resonance imaging patterns and verbal reports with the assistance of lexical and image databases. Decoding models trained on stimulus-induced brain activity in visual cortical areas showed accurate classification, detection, and identification of contents. Our findings demonstrate that specific visual experience during sleep is represented by brain activity patterns shared by stimulus perception, providing a means to uncover subjective contents of dreaming using objective neural measurement.

  5. Power decoding Reed-Solomon codes up to the Johnson radius

    DEFF Research Database (Denmark)

    Rosenkilde, Johan Sebastian Heesemann

    2018-01-01

    Power decoding, or "decoding using virtual interleaving" is a technique for decoding Reed-Solomon codes up to the Sudan radius. Since the method's inception, it has been an open question if it is possible to use this approach to decode up to the Johnson radius - the decoding radius of the Guruswami...

  6. Resource Efficient LDPC Decoders for Multimedia Communication

    OpenAIRE

    Chandrasetty, Vikram Arkalgud; Aziz, Syed Mahfuzul

    2013-01-01

    Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the communication channel. This paper presents an innovative flexible architecture for error correction using Low-Density Parity-Check (LDPC) codes. The proposed partially-parallel decoder architecture utilizes a novel code construction technique based on multi-level H...

  7. Decoding divergent series in nonparaxial optics.

    Science.gov (United States)

    Borghi, Riccardo; Gori, Franco; Guattari, Giorgio; Santarsiero, Massimo

    2011-03-15

    A theoretical analysis aimed at investigating the divergent character of perturbative series involved in the study of free-space nonparaxial propagation of vectorial optical beams is proposed. Our analysis predicts a factorial divergence for such series and provides a theoretical framework within which the results of recently published numerical experiments concerning nonparaxial propagation of vectorial Gaussian beams find a meaningful interpretation in terms of the decoding operated on such series by the Weniger transformation.

  8. Sequential decoders for large MIMO systems

    KAUST Repository

    Ali, Konpal S.

    2014-05-01

    Due to their ability to provide high data rates, multiple-input multiple-output (MIMO) systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In this paper, we employ the Sequential Decoder using the Fano Algorithm for large MIMO systems. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity and vice versa for higher bias values. Numerical results are done that show moderate bias values result in a decent performance-complexity trade-off. We also attempt to bound the error by bounding the bias, using the minimum distance of a lattice. The variations in complexity with SNR have an interesting trend that shows room for considerable improvement. Our work is compared against linear decoders (LDs) aided with Element-based Lattice Reduction (ELR) and Complex Lenstra-Lenstra-Lovasz (CLLL) reduction. © 2014 IFIP.

  9. Markov source model for printed music decoding

    Science.gov (United States)

    Kopec, Gary E.; Chou, Philip A.; Maltz, David A.

    1995-03-01

    This paper describes a Markov source model for a simple subset of printed music notation. The model is based on the Adobe Sonata music symbol set and a message language of our own design. Chord imaging is the most complex part of the model. Much of the complexity follows from a rule of music typography that requires the noteheads for adjacent pitches to be placed on opposite sides of the chord stem. This rule leads to a proliferation of cases for other typographic details such as dot placement. We describe the language of message strings accepted by the model and discuss some of the imaging issues associated with various aspects of the message language. We also point out some aspects of music notation that appear problematic for a finite-state representation. Development of the model was greatly facilitated by the duality between image synthesis and image decoding. Although our ultimate objective was a music image model for use in decoding, most of the development proceeded by using the evolving model for image synthesis, since it is computationally far less costly to image a message than to decode an image.

  10. Kernel Temporal Differences for Neural Decoding

    Science.gov (United States)

    Bae, Jihye; Sanchez Giraldo, Luis G.; Pohlmeyer, Eric A.; Francis, Joseph T.; Sanchez, Justin C.; Príncipe, José C.

    2015-01-01

    We study the feasibility and capability of the kernel temporal difference (KTD)(λ) algorithm for neural decoding. KTD(λ) is an online, kernel-based learning algorithm, which has been introduced to estimate value functions in reinforcement learning. This algorithm combines kernel-based representations with the temporal difference approach to learning. One of our key observations is that by using strictly positive definite kernels, algorithm's convergence can be guaranteed for policy evaluation. The algorithm's nonlinear functional approximation capabilities are shown in both simulations of policy evaluation and neural decoding problems (policy improvement). KTD can handle high-dimensional neural states containing spatial-temporal information at a reasonable computational complexity allowing real-time applications. When the algorithm seeks a proper mapping between a monkey's neural states and desired positions of a computer cursor or a robot arm, in both open-loop and closed-loop experiments, it can effectively learn the neural state to action mapping. Finally, a visualization of the coadaptation process between the decoder and the subject shows the algorithm's capabilities in reinforcement learning brain machine interfaces. PMID:25866504

  11. Detection and Quantification of Ribosome Inhibition by Aminoglycoside Antibiotics in Living Bacteria Using an Orthogonal Ribosome-Controlled Fluorescent Reporter.

    Science.gov (United States)

    Huang, Shijie; Zhu, Xuechen; Melançon, Charles E

    2016-01-15

    The ribosome is the quintessential antibacterial drug target, with many structurally and mechanistically distinct classes of antibacterial agents acting by inhibiting ribosome function. Detecting and quantifying ribosome inhibition by small molecules and investigating their binding modes and mechanisms of action are critical to antibacterial drug discovery and development efforts. To develop a ribosome inhibition assay that is operationally simple, yet provides direct information on the drug target and the mechanism of action, we have developed engineered E. coli strains harboring an orthogonal ribosome-controlled green fluorescent protein (GFP) reporter that produce fluorescent signal when the orthogonal ribosome is inhibited. As a proof of concept, we demonstrate that these strains, when coexpressing homogeneous populations of aminoglycoside resistant ribosomes, act as sensitive and quantitative detectors of ribosome inhibition by a set of 12 structurally diverse aminoglycoside antibiotics. We suggest that this strategy can be extended to quantifying ribosome inhibition by other drug classes.

  12. Deep Learning Methods for Improved Decoding of Linear Codes

    Science.gov (United States)

    Nachmani, Eliya; Marciano, Elad; Lugosch, Loren; Gross, Warren J.; Burshtein, David; Be'ery, Yair

    2018-02-01

    The problem of low complexity, close to optimal, channel decoding of linear codes with short to moderate block length is considered. It is shown that deep learning methods can be used to improve a standard belief propagation decoder, despite the large example space. Similar improvements are obtained for the min-sum algorithm. It is also shown that tying the parameters of the decoders across iterations, so as to form a recurrent neural network architecture, can be implemented with comparable results. The advantage is that significantly less parameters are required. We also introduce a recurrent neural decoder architecture based on the method of successive relaxation. Improvements over standard belief propagation are also observed on sparser Tanner graph representations of the codes. Furthermore, we demonstrate that the neural belief propagation decoder can be used to improve the performance, or alternatively reduce the computational complexity, of a close to optimal decoder of short BCH codes.

  13. Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding

    KAUST Repository

    Douik, Ahmed

    2016-06-27

    For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.

  14. Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2016-01-01

    For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.

  15. Observations on Polar Coding with CRC-Aided List Decoding

    Science.gov (United States)

    2016-09-01

    TECHNICAL REPORT 3041 September 2016 Observations on Polar Coding with CRC-Aided List Decoding David Wasserman Approved for public release. SSC...described in [2, 3]. In FY15 and FY16 we used cyclic redundancy check (CRC)-aided polar list decoding [4]. Section 2 describes the basics of polar coding ...and gives details of the encoders and decoders we used. In the course of our research, we performed simulations of polar codes in hundreds of cases

  16. Polar Coding with CRC-Aided List Decoding

    Science.gov (United States)

    2015-08-01

    TECHNICAL REPORT 2087 August 2015 Polar Coding with CRC-Aided List Decoding David Wasserman Approved...list decoding . RESULTS Our simulation results show that polar coding can produce results very similar to the FEC used in the Digital Video...standard. RECOMMENDATIONS In any application for which the DVB-S2 FEC is considered, polar coding with CRC-aided list decod - ing with N = 65536

  17. A quantum algorithm for Viterbi decoding of classical convolutional codes

    OpenAIRE

    Grice, Jon R.; Meyer, David A.

    2014-01-01

    We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper the proposed algorithm is applied to decoding classical convolutional codes, for instance; large constraint length $Q$ and short decode frames $N$. Other applications of the classical Viterbi algorithm where $Q$ is large (e.g. speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butter...

  18. Design of a VLSI Decoder for Partially Structured LDPC Codes

    Directory of Open Access Journals (Sweden)

    Fabrizio Vacca

    2008-01-01

    of their parity matrix can be partitioned into two disjoint sets, namely, the structured and the random ones. For the proposed class of codes a constructive design method is provided. To assess the value of this method the constructed codes performance are presented. From these results, a novel decoding method called split decoding is introduced. Finally, to prove the effectiveness of the proposed approach a whole VLSI decoder is designed and characterized.

  19. Interpolation decoding method with variable parameters for fractal image compression

    International Nuclear Information System (INIS)

    He Chuanjiang; Li Gaoping; Shen Xiaona

    2007-01-01

    The interpolation fractal decoding method, which is introduced by [He C, Yang SX, Huang X. Progressive decoding method for fractal image compression. IEE Proc Vis Image Signal Process 2004;3:207-13], involves generating progressively the decoded image by means of an interpolation iterative procedure with a constant parameter. It is well-known that the majority of image details are added at the first steps of iterations in the conventional fractal decoding; hence the constant parameter for the interpolation decoding method must be set as a smaller value in order to achieve a better progressive decoding. However, it needs to take an extremely large number of iterations to converge. It is thus reasonable for some applications to slow down the iterative process at the first stages of decoding and then to accelerate it afterwards (e.g., at some iteration as we need). To achieve the goal, this paper proposed an interpolation decoding scheme with variable (iteration-dependent) parameters and proved the convergence of the decoding process mathematically. Experimental results demonstrate that the proposed scheme has really achieved the above-mentioned goal

  20. Joint Decoding of Concatenated VLEC and STTC System

    Directory of Open Access Journals (Sweden)

    Chen Huijun

    2008-01-01

    Full Text Available Abstract We consider the decoding of wireless communication systems with both source coding in the application layer and channel coding in the physical layer for high-performance transmission over fading channels. Variable length error correcting codes (VLECs and space time trellis codes (STTCs are used to provide bandwidth efficient data compression as well as coding and diversity gains. At the receiver, an iterative joint source and space time decoding scheme are developed to utilize redundancy in both STTC and VLEC to improve overall decoding performance. Issues such as the inseparable systematic information in the symbol level, the asymmetric trellis structure of VLEC, and information exchange between bit and symbol domains have been considered in the maximum a posteriori probability (MAP decoding algorithm. Simulation results indicate that the developed joint decoding scheme achieves a significant decoding gain over the separate decoding in fading channels, whether or not the channel information is perfectly known at the receiver. Furthermore, how rate allocation between STTC and VLEC affects the performance of the joint source and space-time decoder is investigated. Different systems with a fixed overall information rate are studied. It is shown that for a system with more redundancy dedicated to the source code and a higher order modulation of STTC, the joint decoding yields better performance, though with increased complexity.

  1. Joint Decoding of Concatenated VLEC and STTC System

    Directory of Open Access Journals (Sweden)

    Huijun Chen

    2008-07-01

    Full Text Available We consider the decoding of wireless communication systems with both source coding in the application layer and channel coding in the physical layer for high-performance transmission over fading channels. Variable length error correcting codes (VLECs and space time trellis codes (STTCs are used to provide bandwidth efficient data compression as well as coding and diversity gains. At the receiver, an iterative joint source and space time decoding scheme are developed to utilize redundancy in both STTC and VLEC to improve overall decoding performance. Issues such as the inseparable systematic information in the symbol level, the asymmetric trellis structure of VLEC, and information exchange between bit and symbol domains have been considered in the maximum a posteriori probability (MAP decoding algorithm. Simulation results indicate that the developed joint decoding scheme achieves a significant decoding gain over the separate decoding in fading channels, whether or not the channel information is perfectly known at the receiver. Furthermore, how rate allocation between STTC and VLEC affects the performance of the joint source and space-time decoder is investigated. Different systems with a fixed overall information rate are studied. It is shown that for a system with more redundancy dedicated to the source code and a higher order modulation of STTC, the joint decoding yields better performance, though with increased complexity.

  2. Grasp movement decoding from premotor and parietal cortex.

    Science.gov (United States)

    Townsend, Benjamin R; Subasi, Erk; Scherberger, Hansjörg

    2011-10-05

    Despite recent advances in harnessing cortical motor-related activity to control computer cursors and robotic devices, the ability to decode and execute different grasping patterns remains a major obstacle. Here we demonstrate a simple Bayesian decoder for real-time classification of grip type and wrist orientation in macaque monkeys that uses higher-order planning signals from anterior intraparietal cortex (AIP) and ventral premotor cortex (area F5). Real-time decoding was based on multiunit signals, which had similar tuning properties to cells in previous single-unit recording studies. Maximum decoding accuracy for two grasp types (power and precision grip) and five wrist orientations was 63% (chance level, 10%). Analysis of decoder performance showed that grip type decoding was highly accurate (90.6%), with most errors occurring during orientation classification. In a subsequent off-line analysis, we found small but significant performance improvements (mean, 6.25 percentage points) when using an optimized spike-sorting method (superparamagnetic clustering). Furthermore, we observed significant differences in the contributions of F5 and AIP for grasp decoding, with F5 being better suited for classification of the grip type and AIP contributing more toward decoding of object orientation. However, optimum decoding performance was maximal when using neural activity simultaneously from both areas. Overall, these results highlight quantitative differences in the functional representation of grasp movements in AIP and F5 and represent a first step toward using these signals for developing functional neural interfaces for hand grasping.

  3. Sub-quadratic decoding of one-point hermitian codes

    DEFF Research Database (Denmark)

    Nielsen, Johan Sebastian Rosenkilde; Beelen, Peter

    2015-01-01

    We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realization of the Guruswami-Sudan algorithm using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimization. The second is a power...... decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the matrix minimization algorithms from computer algebra, yielding similar asymptotic complexities....

  4. Interaction of Pleuromutilin Derivatives with the Ribosomal Peptidyl Transferase Center

    Science.gov (United States)

    Long, Katherine S.; Hansen, Lykke H.; Jakobsen, Lene; Vester, Birte

    2006-01-01

    Tiamulin is a pleuromutilin antibiotic that is used in veterinary medicine. The recently published crystal structure of a tiamulin-50S ribosomal subunit complex provides detailed information about how this drug targets the peptidyl transferase center of the ribosome. To promote rational design of pleuromutilin-based drugs, the binding of the antibiotic pleuromutilin and three semisynthetic derivatives with different side chain extensions has been investigated using chemical footprinting. The nucleotides A2058, A2059, G2505, and U2506 are affected in all of the footprints, suggesting that the drugs are similarly anchored in the binding pocket by the common tricyclic mutilin core. However, varying effects are observed at U2584 and U2585, indicating that the side chain extensions adopt distinct conformations within the cavity and thereby affect the rRNA conformation differently. An Escherichia coli L3 mutant strain is resistant to tiamulin and pleuromutilin, but not valnemulin, implying that valnemulin is better able to withstand an altered rRNA binding surface around the mutilin core. This is likely due to additional interactions made between the valnemulin side chain extension and the rRNA binding site. The data suggest that pleuromutilin drugs with enhanced antimicrobial activity may be obtained by maximizing the number of interactions between the side chain moiety and the peptidyl transferase cavity. PMID:16569865

  5. Effect of primary and secondary radicals on chain breaks in ribosomal RNA in E. coli ribosomes

    International Nuclear Information System (INIS)

    Singh, H.; Bishop, J.

    1984-01-01

    It has been shown previously that, in dilute aerated solutions, ribosomes are inactivated by OH radicals and by secondary radicals produced from added alcohols (Singh and Vadasz 1983 a). In de-aerated solutions, both radicalH and e - sub(aq) also inactivate ribosomes (Singh and Vadasz 1983 b). The results of these studies and other on different systems (Adams et al. 1973, Aldrich and Cundall 1969, Dewey and Stein 1970, Masuda et al. 1971, Nabben et al. 1982, 1983, Samuni et al. 1980, Singh and Singh 1982) have shown that damage to biological systems occurs by diverse mechanisms. One of these mechanisms involves chain breaks in RNA (Pollard and Weller 1967). The purpose of this study was to determine which of the primary and secondary radicals cause chain breaks in ribosomal RNA (rRNA) within the ribosomes. (author)

  6. Sudan-decoding generalized geometric Goppa codes

    DEFF Research Database (Denmark)

    Heydtmann, Agnes Eileen

    2003-01-01

    Generalized geometric Goppa codes are vector spaces of n-tuples with entries from different extension fields of a ground field. They are derived from evaluating functions similar to conventional geometric Goppa codes, but allowing evaluation in places of arbitrary degree. A decoding scheme...... for these codes based on Sudan's improved algorithm is presented and its error-correcting capacity is analyzed. For the implementation of the algorithm it is necessary that the so-called increasing zero bases of certain spaces of functions are available. A method to obtain such bases is developed....

  7. Memory-efficient decoding of LDPC codes

    Science.gov (United States)

    Kwok-San Lee, Jason; Thorpe, Jeremy; Hawkins, Jon

    2005-01-01

    We present a low-complexity quantization scheme for the implementation of regular (3,6) LDPC codes. The quantization parameters are optimized to maximize the mutual information between the source and the quantized messages. Using this non-uniform quantized belief propagation algorithm, we have simulated that an optimized 3-bit quantizer operates with 0.2dB implementation loss relative to a floating point decoder, and an optimized 4-bit quantizer operates less than 0.1dB quantization loss.

  8. [Modulation of Metacognition with Decoded Neurofeedback].

    Science.gov (United States)

    Koizumi, Ai; Cortese, Aurelio; Amano, Kaoru; Kawato, Mitsuo; Lau, Hakwan

    2017-12-01

    Humans often assess their confidence in their own perception, e.g., feeling "confident" or "certain" of having seen a friend, or feeling "uncertain" about whether the phone rang. The neural mechanism underlying the metacognitive function that reflects subjective perception still remains under debate. We have previously used decoded neurofeedback (DecNef) to demonstrate that manipulating the multivoxel activation patterns in the frontoparietal network modulates perceptual confidence without affecting perceptual performance. The results provided clear evidence for a dissociation between perceptual confidence and performance and suggested a distinct role of the frontoparietal network in metacognition.

  9. Maximum a posteriori decoder for digital communications

    Science.gov (United States)

    Altes, Richard A. (Inventor)

    1997-01-01

    A system and method for decoding by identification of the most likely phase coded signal corresponding to received data. The present invention has particular application to communication with signals that experience spurious random phase perturbations. The generalized estimator-correlator uses a maximum a posteriori (MAP) estimator to generate phase estimates for correlation with incoming data samples and for correlation with mean phases indicative of unique hypothesized signals. The result is a MAP likelihood statistic for each hypothesized transmission, wherein the highest value statistic identifies the transmitted signal.

  10. Acrolein preferentially damages nucleolus eliciting ribosomal stress and apoptosis in human cancer cells.

    Science.gov (United States)

    Wang, Hsiang-Tsui; Chen, Tzu-Ying; Weng, Ching-Wen; Yang, Chun-Hsiang; Tang, Moon-Shong

    2016-12-06

    Acrolein (Acr) is a potent cytotoxic and DNA damaging agent which is ubiquitous in the environment and abundant in tobacco smoke. Acr is also an active cytotoxic metabolite of the anti-cancer drugs cyclophosphamide and ifosfamide. The mechanisms via which Acr exerts its anti-cancer activity and cytotoxicity are not clear. In this study, we found that Acr induces cytotoxicity and cell death in human cancer cells with different activities of p53. Acr preferentially binds nucleolar ribosomal DNA (rDNA) to form Acr-deoxyguanosine adducts, and induces oxidative damage to both rDNA and ribosomal RNA (rRNA). Acr triggers ribosomal stress responses, inhibits rRNA synthesis, reduces RNA polymerase I binding to the promoter of rRNA gene, disrupts nucleolar integrity, and impairs ribosome biogenesis and polysome formation. Acr causes an increase in MDM2 levels and phosphorylation of MDM2 in A549 and HeLa cells which are p53 active and p53 inactive, respectively. It enhances the binding of ribosomal protein RPL11 to MDM2 and reduces the binding of p53 and E2F-1 to MDM2 resulting in stabilization/activation of p53 in A549 cells and degradation of E2F-1 in A549 and HeLa cells. We propose that Acr induces ribosomal stress which leads to activation of MDM2 and RPL11-MDM2 binding, consequently, activates p53 and enhances E2F-1 degradation, and that taken together these two processes induce apoptosis and cell death.

  11. Vectorization of Reed Solomon decoding and mapping on the EVP

    NARCIS (Netherlands)

    Kumar, A.; Berkel, van C.H.

    2008-01-01

    Reed Solomon (RS) codes are used in a variety of (wireless) communication systems. Although commonly implemented in dedicated hardware, this paper explores the mapping of high-throughput RS decoding on vector DSPs. The four modules of such a decoder, viz. Syndrome Computation, Key Equation Solver,

  12. LDPC Codes--Structural Analysis and Decoding Techniques

    Science.gov (United States)

    Zhang, Xiaojie

    2012-01-01

    Low-density parity-check (LDPC) codes have been the focus of much research over the past decade thanks to their near Shannon limit performance and to their efficient message-passing (MP) decoding algorithms. However, the error floor phenomenon observed in MP decoding, which manifests itself as an abrupt change in the slope of the error-rate curve,…

  13. IQ Predicts Word Decoding Skills in Populations with Intellectual Disabilities

    Science.gov (United States)

    Levy, Yonata

    2011-01-01

    This is a study of word decoding in adolescents with Down syndrome and in adolescents with Intellectual Deficits of unknown etiology. It was designed as a replication of studies of word decoding in English speaking and in Hebrew speaking adolescents with Williams syndrome ([0230] and [0235]). Participants' IQ was matched to IQ in the groups with…

  14. Word Processing in Dyslexics: An Automatic Decoding Deficit?

    Science.gov (United States)

    Yap, Regina; Van Der Leu, Aryan

    1993-01-01

    Compares dyslexic children with normal readers on measures of phonological decoding and automatic word processing. Finds that dyslexics have a deficit in automatic phonological decoding skills. Discusses results within the framework of the phonological deficit and the automatization deficit hypotheses. (RS)

  15. Role of Gender and Linguistic Diversity in Word Decoding Development

    Science.gov (United States)

    Verhoeven, Ludo; van Leeuwe, Jan

    2011-01-01

    The purpose of the present study was to investigate the role of gender and linguistic diversity in the growth of Dutch word decoding skills throughout elementary school for a representative sample of children living in the Netherlands. Following a longitudinal design, the children's decoding abilities for (1) regular CVC words, (2) complex…

  16. Decoding bipedal locomotion from the rat sensorimotor cortex

    NARCIS (Netherlands)

    Rigosa, J.; Panarese, A.; Dominici, N.; Friedli, L.; van den Brand, R.; Carpaneto, J.; DiGiovanna, J.; Courtine, G.; Micera, S.

    2015-01-01

    Objective. Decoding forelimb movements from the firing activity of cortical neurons has been interfaced with robotic and prosthetic systems to replace lost upper limb functions in humans. Despite the potential of this approach to improve locomotion and facilitate gait rehabilitation, decoding lower

  17. DNA Binding by the Ribosomal DNA Transcription Factor Rrn3 Is Essential for Ribosomal DNA Transcription*

    Science.gov (United States)

    Stepanchick, Ann; Zhi, Huijun; Cavanaugh, Alice H.; Rothblum, Katrina; Schneider, David A.; Rothblum, Lawrence I.

    2013-01-01

    The human homologue of yeast Rrn3 is an RNA polymerase I-associated transcription factor that is essential for ribosomal DNA (rDNA) transcription. The generally accepted model is that Rrn3 functions as a bridge between RNA polymerase I and the transcription factors bound to the committed template. In this model Rrn3 would mediate an interaction between the mammalian Rrn3-polymerase I complex and SL1, the rDNA transcription factor that binds to the core promoter element of the rDNA. In the course of studying the role of Rrn3 in recruitment, we found that Rrn3 was in fact a DNA-binding protein. Analysis of the sequence of Rrn3 identified a domain with sequence similarity to the DNA binding domain of heat shock transcription factor 2. Randomization, or deletion, of the amino acids in this region in Rrn3, amino acids 382–400, abrogated its ability to bind DNA, indicating that this domain was an important contributor to DNA binding by Rrn3. Control experiments demonstrated that these mutant Rrn3 constructs were capable of interacting with both rpa43 and SL1, two other activities demonstrated to be essential for Rrn3 function. However, neither of these Rrn3 mutants was capable of functioning in transcription in vitro. Moreover, although wild-type human Rrn3 complemented a yeast rrn3-ts mutant, the DNA-binding site mutant did not. These results demonstrate that DNA binding by Rrn3 is essential for transcription by RNA polymerase I. PMID:23393135

  18. DNA binding by the ribosomal DNA transcription factor rrn3 is essential for ribosomal DNA transcription.

    Science.gov (United States)

    Stepanchick, Ann; Zhi, Huijun; Cavanaugh, Alice H; Rothblum, Katrina; Schneider, David A; Rothblum, Lawrence I

    2013-03-29

    The human homologue of yeast Rrn3 is an RNA polymerase I-associated transcription factor that is essential for ribosomal DNA (rDNA) transcription. The generally accepted model is that Rrn3 functions as a bridge between RNA polymerase I and the transcription factors bound to the committed template. In this model Rrn3 would mediate an interaction between the mammalian Rrn3-polymerase I complex and SL1, the rDNA transcription factor that binds to the core promoter element of the rDNA. In the course of studying the role of Rrn3 in recruitment, we found that Rrn3 was in fact a DNA-binding protein. Analysis of the sequence of Rrn3 identified a domain with sequence similarity to the DNA binding domain of heat shock transcription factor 2. Randomization, or deletion, of the amino acids in this region in Rrn3, amino acids 382-400, abrogated its ability to bind DNA, indicating that this domain was an important contributor to DNA binding by Rrn3. Control experiments demonstrated that these mutant Rrn3 constructs were capable of interacting with both rpa43 and SL1, two other activities demonstrated to be essential for Rrn3 function. However, neither of these Rrn3 mutants was capable of functioning in transcription in vitro. Moreover, although wild-type human Rrn3 complemented a yeast rrn3-ts mutant, the DNA-binding site mutant did not. These results demonstrate that DNA binding by Rrn3 is essential for transcription by RNA polymerase I.

  19. GTPases and the origin of the ribosome

    Directory of Open Access Journals (Sweden)

    Smith Temple F

    2010-05-01

    Full Text Available Abstract Background This paper is an attempt to trace the evolution of the ribosome through the evolution of the universal P-loop GTPases that are involved with the ribosome in translation and with the attachment of the ribosome to the membrane. The GTPases involved in translation in Bacteria/Archaea are the elongation factors EFTu/EF1, the initiation factors IF2/aeIF5b + aeIF2, and the elongation factors EFG/EF2. All of these GTPases also contain the OB fold also found in the non GTPase IF1 involved in initiation. The GTPase involved in the signal recognition particle in most Bacteria and Archaea is SRP54. Results 1 The Elongation Factors of the Archaea based on structural considerations of the domains have the following evolutionary path: EF1→ aeIF2 → EF2. The evolution of the aeIF5b was a later event; 2 the Elongation Factors of the Bacteria based on the topological considerations of the GTPase domain have a similar evolutionary path: EFTu→ IF→2→EFG. These evolutionary sequences reflect the evolution of the LSU followed by the SSU to form the ribosome; 3 the OB-fold IF1 is a mimic of an ancient tRNA minihelix. Conclusion The evolution of translational GTPases of both the Archaea and Bacteria point to the evolution of the ribosome. The elongation factors, EFTu/EF1, began as a Ras-like GTPase bringing the activated minihelix tRNA to the Large Subunit Unit. The initiation factors and elongation factor would then have evolved from the EFTu/EF1 as the small subunit was added to the evolving ribosome. The SRP has an SRP54 GTPase and a specific RNA fold in its RNA component similar to the PTC. We consider the SRP to be a remnant of an ancient form of an LSU bound to a membrane. Reviewers This article was reviewed by George Fox, Leonid Mirny and Chris Sander.

  20. Multi-stage decoding of multi-level modulation codes

    Science.gov (United States)

    Lin, Shu; Kasami, Tadao; Costello, Daniel J., Jr.

    1991-01-01

    Various types of multi-stage decoding for multi-level modulation codes are investigated. It is shown that if the component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. Particularly, it is shown that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum soft-decision decoding of the code is very small, only a fraction of dB loss in signal to noise ratio at a bit error rate (BER) of 10(exp -6).

  1. Iterative List Decoding of Concatenated Source-Channel Codes

    Directory of Open Access Journals (Sweden)

    Hedayat Ahmadreza

    2005-01-01

    Full Text Available Whenever variable-length entropy codes are used in the presence of a noisy channel, any channel errors will propagate and cause significant harm. Despite using channel codes, some residual errors always remain, whose effect will get magnified by error propagation. Mitigating this undesirable effect is of great practical interest. One approach is to use the residual redundancy of variable length codes for joint source-channel decoding. In this paper, we improve the performance of residual redundancy source-channel decoding via an iterative list decoder made possible by a nonbinary outer CRC code. We show that the list decoding of VLC's is beneficial for entropy codes that contain redundancy. Such codes are used in state-of-the-art video coders, for example. The proposed list decoder improves the overall performance significantly in AWGN and fully interleaved Rayleigh fading channels.

  2. Decoding magnetoencephalographic rhythmic activity using spectrospatial information.

    Science.gov (United States)

    Kauppi, Jukka-Pekka; Parkkonen, Lauri; Hari, Riitta; Hyvärinen, Aapo

    2013-12-01

    We propose a new data-driven decoding method called Spectral Linear Discriminant Analysis (Spectral LDA) for the analysis of magnetoencephalography (MEG). The method allows investigation of changes in rhythmic neural activity as a result of different stimuli and tasks. The introduced classification model only assumes that each "brain state" can be characterized as a combination of neural sources, each of which shows rhythmic activity at one or several frequency bands. Furthermore, the model allows the oscillation frequencies to be different for each such state. We present decoding results from 9 subjects in a four-category classification problem defined by an experiment involving randomly alternating epochs of auditory, visual and tactile stimuli interspersed with rest periods. The performance of Spectral LDA was very competitive compared with four alternative classifiers based on different assumptions concerning the organization of rhythmic brain activity. In addition, the spectral and spatial patterns extracted automatically on the basis of trained classifiers showed that Spectral LDA offers a novel and interesting way of analyzing spectrospatial oscillatory neural activity across the brain. All the presented classification methods and visualization tools are freely available as a Matlab toolbox. © 2013.

  3. Unsupervised learning of facial emotion decoding skills

    Directory of Open Access Journals (Sweden)

    Jan Oliver Huelle

    2014-02-01

    Full Text Available Research on the mechanisms underlying human facial emotion recognition has long focussed on genetically determined neural algorithms and often neglected the question of how these algorithms might be tuned by social learning. Here we show that facial emotion decoding skills can be significantly and sustainably improved by practise without an external teaching signal. Participants saw video clips of dynamic facial expressions of five different women and were asked to decide which of four possible emotions (anger, disgust, fear and sadness was shown in each clip. Although no external information about the correctness of the participant’s response or the sender’s true affective state was provided, participants showed a significant increase of facial emotion recognition accuracy both within and across two training sessions two days to several weeks apart. We discuss several similarities and differences between the unsupervised improvement of facial decoding skills observed in the current study, unsupervised perceptual learning of simple stimuli described in previous studies and practise effects often observed in cognitive tasks.

  4. Unsupervised learning of facial emotion decoding skills.

    Science.gov (United States)

    Huelle, Jan O; Sack, Benjamin; Broer, Katja; Komlewa, Irina; Anders, Silke

    2014-01-01

    Research on the mechanisms underlying human facial emotion recognition has long focussed on genetically determined neural algorithms and often neglected the question of how these algorithms might be tuned by social learning. Here we show that facial emotion decoding skills can be significantly and sustainably improved by practice without an external teaching signal. Participants saw video clips of dynamic facial expressions of five different women and were asked to decide which of four possible emotions (anger, disgust, fear, and sadness) was shown in each clip. Although no external information about the correctness of the participant's response or the sender's true affective state was provided, participants showed a significant increase of facial emotion recognition accuracy both within and across two training sessions two days to several weeks apart. We discuss several similarities and differences between the unsupervised improvement of facial decoding skills observed in the current study, unsupervised perceptual learning of simple stimuli described in previous studies and practice effects often observed in cognitive tasks.

  5. Decoding suprathreshold stochastic resonance with optimal weights

    International Nuclear Information System (INIS)

    Xu, Liyan; Vladusich, Tony; Duan, Fabing; Gunn, Lachlan J.; Abbott, Derek; McDonnell, Mark D.

    2015-01-01

    We investigate an array of stochastic quantizers for converting an analog input signal into a discrete output in the context of suprathreshold stochastic resonance. A new optimal weighted decoding is considered for different threshold level distributions. We show that for particular noise levels and choices of the threshold levels optimally weighting the quantizer responses provides a reduced mean square error in comparison with the original unweighted array. However, there are also many parameter regions where the original array provides near optimal performance, and when this occurs, it offers a much simpler approach than optimally weighting each quantizer's response. - Highlights: • A weighted summing array of independently noisy binary comparators is investigated. • We present an optimal linearly weighted decoding scheme for combining the comparator responses. • We solve for the optimal weights by applying least squares regression to simulated data. • We find that the MSE distortion of weighting before summation is superior to unweighted summation of comparator responses. • For some parameter regions, the decrease in MSE distortion due to weighting is negligible

  6. Bayer image parallel decoding based on GPU

    Science.gov (United States)

    Hu, Rihui; Xu, Zhiyong; Wei, Yuxing; Sun, Shaohua

    2012-11-01

    In the photoelectrical tracking system, Bayer image is decompressed in traditional method, which is CPU-based. However, it is too slow when the images become large, for example, 2K×2K×16bit. In order to accelerate the Bayer image decoding, this paper introduces a parallel speedup method for NVIDA's Graphics Processor Unit (GPU) which supports CUDA architecture. The decoding procedure can be divided into three parts: the first is serial part, the second is task-parallelism part, and the last is data-parallelism part including inverse quantization, inverse discrete wavelet transform (IDWT) as well as image post-processing part. For reducing the execution time, the task-parallelism part is optimized by OpenMP techniques. The data-parallelism part could advance its efficiency through executing on the GPU as CUDA parallel program. The optimization techniques include instruction optimization, shared memory access optimization, the access memory coalesced optimization and texture memory optimization. In particular, it can significantly speed up the IDWT by rewriting the 2D (Tow-dimensional) serial IDWT into 1D parallel IDWT. Through experimenting with 1K×1K×16bit Bayer image, data-parallelism part is 10 more times faster than CPU-based implementation. Finally, a CPU+GPU heterogeneous decompression system was designed. The experimental result shows that it could achieve 3 to 5 times speed increase compared to the CPU serial method.

  7. The Differential Contributions of Auditory-Verbal and Visuospatial Working Memory on Decoding Skills in Children Who Are Poor Decoders

    Science.gov (United States)

    Squires, Katie Ellen

    2013-01-01

    This study investigated the differential contribution of auditory-verbal and visuospatial working memory (WM) on decoding skills in second- and fifth-grade children identified with poor decoding. Thirty-two second-grade students and 22 fifth-grade students completed measures that assessed simple and complex auditory-verbal and visuospatial memory,…

  8. Remodeling of ribosomal genes in somatic cells by Xenopus egg extract

    Energy Technology Data Exchange (ETDEWEB)

    Ostrup, Olga, E-mail: osvarcova@gmail.com [Institute of Basic Animal and Veterinary Sciences, Faculty of Life Sciences, University of Copenhagen, Frederiksberg C (Denmark); Stem Cell Epigenetics Laboratory, Institute of Basic Medical Sciences, Faculty of Medicine, University of Oslo, Oslo (Norway); Norwegian Center for Stem Cell Research, Oslo (Norway); Hyttel, Poul; Klaerke, Dan A. [Institute of Basic Animal and Veterinary Sciences, Faculty of Life Sciences, University of Copenhagen, Frederiksberg C (Denmark); Collas, Philippe, E-mail: philc@medisin.uio.no [Stem Cell Epigenetics Laboratory, Institute of Basic Medical Sciences, Faculty of Medicine, University of Oslo, Oslo (Norway); Norwegian Center for Stem Cell Research, Oslo (Norway)

    2011-09-02

    Highlights: {yields} Xenopus egg extract remodels nuclei and alter cell growth characteristics. {yields} Ribosomal genes are reprogrammed within 6 h after extract exposure. {yields} rDNA reprogramming involves promoter targeting of SNF2H remodeling complex. {yields} Xenopus egg extract does not initiate stress-related response in somatic cells. {yields} Aza-cytidine elicits a stress-induced response in reprogrammed cells. -- Abstract: Extracts from Xenopus eggs can reprogram gene expression in somatic nuclei, however little is known about the earliest processes associated with the switch in the transcriptional program. We show here that an early reprogramming event is the remodeling of ribosomal chromatin and gene expression. This occurs within hours of extract treatment and is distinct from a stress response. Egg extract elicits remodeling of the nuclear envelope, chromatin and nucleolus. Nucleolar remodeling involves a rapid and stable decrease in ribosomal gene transcription, and promoter targeting of the nucleolar remodeling complex component SNF2H without affecting occupancy of the transcription factor UBF and the stress silencers SUV39H1 and SIRT1. During this process, nucleolar localization of UBF and SIRT1 is not altered. On contrary, azacytidine pre-treatment has an adverse effect on rDNA remodeling induced by extract and elicits a stress-type nuclear response. Thus, an early event of Xenopus egg extract-mediated nuclear reprogramming is the remodeling of ribosomal genes involving nucleolar remodeling complex. Condition-specific and rapid silencing of ribosomal genes may serve as a sensitive marker for evaluation of various reprogramming methods.

  9. Ribosomal proteins S12 and S13 function as control elements for translocation of the mRNA:tRNA complex.

    Science.gov (United States)

    Cukras, Anthony R; Southworth, Daniel R; Brunelle, Julie L; Culver, Gloria M; Green, Rachel

    2003-08-01

    Translocation of the mRNA:tRNA complex through the ribosome is promoted by elongation factor G (EF-G) during the translation cycle. Previous studies established that modification of ribosomal proteins with thiol-specific reagents promotes this event in the absence of EF-G. Here we identify two small subunit interface proteins S12 and S13 that are essential for maintenance of a pretranslocation state. Omission of these proteins using in vitro reconstitution procedures yields ribosomal particles that translate in the absence of enzymatic factors. Conversely, replacement of cysteine residues in these two proteins yields ribosomal particles that are refractive to stimulation with thiol-modifying reagents. These data support a model where S12 and S13 function as control elements for the more ancient rRNA- and tRNA-driven movements of translocation.

  10. Kinetic pathway of 40S ribosomal subunit recruitment to hepatitis C virus internal ribosome entry site.

    Science.gov (United States)

    Fuchs, Gabriele; Petrov, Alexey N; Marceau, Caleb D; Popov, Lauren M; Chen, Jin; O'Leary, Seán E; Wang, Richard; Carette, Jan E; Sarnow, Peter; Puglisi, Joseph D

    2015-01-13

    Translation initiation can occur by multiple pathways. To delineate these pathways by single-molecule methods, fluorescently labeled ribosomal subunits are required. Here, we labeled human 40S ribosomal subunits with a fluorescent SNAP-tag at ribosomal protein eS25 (RPS25). The resulting ribosomal subunits could be specifically labeled in living cells and in vitro. Using single-molecule Förster resonance energy transfer (FRET) between RPS25 and domain II of the hepatitis C virus (HCV) internal ribosome entry site (IRES), we measured the rates of 40S subunit arrival to the HCV IRES. Our data support a single-step model of HCV IRES recruitment to 40S subunits, irreversible on the initiation time scale. We furthermore demonstrated that after binding, the 40S:HCV IRES complex is conformationally dynamic, undergoing slow large-scale rearrangements. Addition of translation extracts suppresses these fluctuations, funneling the complex into a single conformation on the 80S assembly pathway. These findings show that 40S:HCV IRES complex formation is accompanied by dynamic conformational rearrangements that may be modulated by initiation factors.

  11. The complete structure of the chloroplast 70S ribosome in complex with translation factor pY.

    Science.gov (United States)

    Bieri, Philipp; Leibundgut, Marc; Saurer, Martin; Boehringer, Daniel; Ban, Nenad

    2017-02-15

    Chloroplasts are cellular organelles of plants and algae that are responsible for energy conversion and carbon fixation by the photosynthetic reaction. As a consequence of their endosymbiotic origin, they still contain their own genome and the machinery for protein biosynthesis. Here, we present the atomic structure of the chloroplast 70S ribosome prepared from spinach leaves and resolved by cryo-EM at 3.4 Å resolution. The complete structure reveals the features of the 4.5S rRNA, which probably evolved by the fragmentation of the 23S rRNA, and all five plastid-specific ribosomal proteins. These proteins, required for proper assembly and function of the chloroplast translation machinery, bind and stabilize rRNA including regions that only exist in the chloroplast ribosome. Furthermore, the structure reveals plastid-specific extensions of ribosomal proteins that extensively remodel the mRNA entry and exit site on the small subunit as well as the polypeptide tunnel exit and the putative binding site of the signal recognition particle on the large subunit. The translation factor pY, involved in light- and temperature-dependent control of protein synthesis, is bound to the mRNA channel of the small subunit and interacts with 16S rRNA nucleotides at the A-site and P-site, where it protects the decoding centre and inhibits translation by preventing tRNA binding. The small subunit is locked by pY in a non-rotated state, in which the intersubunit bridges to the large subunit are stabilized. © 2016 The Authors. Published under the terms of the CC BY NC ND 4.0 license.

  12. Of blood, bones, and ribosomes: is Swachman-Diamond syndrome a ribosomopathy?

    Science.gov (United States)

    Johnson, Arlen W; Ellis, Steve R

    2011-05-01

    Mutations in the human SBDS (Shwachman-Bodian-Diamond syndrome) gene are the most common cause of Shwachman-Diamond syndrome, an inherited bone marrow failure syndrome. In this issue of Genes & Development, Finch and colleagues (pp. 917-929) establish that SBDS functions in ribosome synthesis by promoting the recycling of eukaryotic initiation factor 6 (eIF6) in a GTP-dependent manner. This work supports the idea that a ribosomopathy may underlie this syndrome.

  13. Of blood, bones, and ribosomes: is Swachman-Diamond syndrome a ribosomopathy?

    OpenAIRE

    Johnson, Arlen W.; Ellis, Steve R.

    2011-01-01

    Mutations in the human SBDS (Shwachman-Bodian-Diamond syndrome) gene are the most common cause of Shwachman-Diamond syndrome, an inherited bone marrow failure syndrome. In this issue of Genes & Development, Finch and colleagues (pp. 917–929) establish that SBDS functions in ribosome synthesis by promoting the recycling of eukaryotic initiation factor 6 (eIF6) in a GTP-dependent manner. This work supports the idea that a ribosomopathy may underlie this syndrome.

  14. The "periodic table" of the genetic code: A new way to look at the code and the decoding process.

    Science.gov (United States)

    Komar, Anton A

    2016-01-01

    Henri Grosjean and Eric Westhof recently presented an information-rich, alternative view of the genetic code, which takes into account current knowledge of the decoding process, including the complex nature of interactions between mRNA, tRNA and rRNA that take place during protein synthesis on the ribosome, and it also better reflects the evolution of the code. The new asymmetrical circular genetic code has a number of advantages over the traditional codon table and the previous circular diagrams (with a symmetrical/clockwise arrangement of the U, C, A, G bases). Most importantly, all sequence co-variances can be visualized and explained based on the internal logic of the thermodynamics of codon-anticodon interactions.

  15. O2-GIDNC: Beyond instantly decodable network coding

    KAUST Repository

    Aboutorab, Neda

    2013-06-01

    In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC scheme, receivers can store non-instantly decodable packets (NIDPs) comprising two of their missing packets, and use them in a systematic way for later decodings. Once this graph representation is found, it can be used to extend the GIDNC graph-based analyses to the proposed O2-GIDNC scheme with a limited increase in complexity. In the proposed O2-GIDNC scheme, the information of the stored NIDPs at the receivers and the decoding opportunities they create can be exploited to improve the broadcast completion time and decoding delay compared to traditional GIDNC scheme. The completion time and decoding delay minimizing algorithms that can operate on the new O2-GIDNC graph are further described. The simulation results show that our proposed O2-GIDNC improves the completion time and decoding delay performance of the traditional GIDNC. © 2013 IEEE.

  16. On decoding of multi-level MPSK modulation codes

    Science.gov (United States)

    Lin, Shu; Gupta, Alok Kumar

    1990-01-01

    The decoding problem of multi-level block modulation codes is investigated. The hardware design of soft-decision Viterbi decoder for some short length 8-PSK block modulation codes is presented. An effective way to reduce the hardware complexity of the decoder by reducing the branch metric and path metric, using a non-uniform floating-point to integer mapping scheme, is proposed and discussed. The simulation results of the design are presented. The multi-stage decoding (MSD) of multi-level modulation codes is also investigated. The cases of soft-decision and hard-decision MSD are considered and their performance are evaluated for several codes of different lengths and different minimum squared Euclidean distances. It is shown that the soft-decision MSD reduces the decoding complexity drastically and it is suboptimum. The hard-decision MSD further simplifies the decoding while still maintaining a reasonable coding gain over the uncoded system, if the component codes are chosen properly. Finally, some basic 3-level 8-PSK modulation codes using BCH codes as component codes are constructed and their coding gains are found for hard decision multistage decoding.

  17. Encoder-decoder optimization for brain-computer interfaces.

    Science.gov (United States)

    Merel, Josh; Pianto, Donald M; Cunningham, John P; Paninski, Liam

    2015-06-01

    Neuroprosthetic brain-computer interfaces are systems that decode neural activity into useful control signals for effectors, such as a cursor on a computer screen. It has long been recognized that both the user and decoding system can adapt to increase the accuracy of the end effector. Co-adaptation is the process whereby a user learns to control the system in conjunction with the decoder adapting to learn the user's neural patterns. We provide a mathematical framework for co-adaptation and relate co-adaptation to the joint optimization of the user's control scheme ("encoding model") and the decoding algorithm's parameters. When the assumptions of that framework are respected, co-adaptation cannot yield better performance than that obtainable by an optimal initial choice of fixed decoder, coupled with optimal user learning. For a specific case, we provide numerical methods to obtain such an optimized decoder. We demonstrate our approach in a model brain-computer interface system using an online prosthesis simulator, a simple human-in-the-loop pyschophysics setup which provides a non-invasive simulation of the BCI setting. These experiments support two claims: that users can learn encoders matched to fixed, optimal decoders and that, once learned, our approach yields expected performance advantages.

  18. Encoder-decoder optimization for brain-computer interfaces.

    Directory of Open Access Journals (Sweden)

    Josh Merel

    2015-06-01

    Full Text Available Neuroprosthetic brain-computer interfaces are systems that decode neural activity into useful control signals for effectors, such as a cursor on a computer screen. It has long been recognized that both the user and decoding system can adapt to increase the accuracy of the end effector. Co-adaptation is the process whereby a user learns to control the system in conjunction with the decoder adapting to learn the user's neural patterns. We provide a mathematical framework for co-adaptation and relate co-adaptation to the joint optimization of the user's control scheme ("encoding model" and the decoding algorithm's parameters. When the assumptions of that framework are respected, co-adaptation cannot yield better performance than that obtainable by an optimal initial choice of fixed decoder, coupled with optimal user learning. For a specific case, we provide numerical methods to obtain such an optimized decoder. We demonstrate our approach in a model brain-computer interface system using an online prosthesis simulator, a simple human-in-the-loop pyschophysics setup which provides a non-invasive simulation of the BCI setting. These experiments support two claims: that users can learn encoders matched to fixed, optimal decoders and that, once learned, our approach yields expected performance advantages.

  19. Hard decoding algorithm for optimizing thresholds under general Markovian noise

    Science.gov (United States)

    Chamberland, Christopher; Wallman, Joel; Beale, Stefanie; Laflamme, Raymond

    2017-04-01

    Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of error-correcting codes have been obtained. However, realistic quantum systems can undergo noise processes that differ significantly from Pauli noise. In this paper, we present an efficient hard decoding algorithm for optimizing thresholds and lowering failure rates of an error-correcting code under general completely positive and trace-preserving (i.e., Markovian) noise. We use our hard decoding algorithm to study the performance of several error-correcting codes under various non-Pauli noise models by computing threshold values and failure rates for these codes. We compare the performance of our hard decoding algorithm to decoders optimized for depolarizing noise and show improvements in thresholds and reductions in failure rates by several orders of magnitude. Our hard decoding algorithm can also be adapted to take advantage of a code's non-Pauli transversal gates to further suppress noise. For example, we show that using the transversal gates of the 5-qubit code allows arbitrary rotations around certain axes to be perfectly corrected. Furthermore, we show that Pauli twirling can increase or decrease the threshold depending upon the code properties. Lastly, we show that even if the physical noise model differs slightly from the hypothesized noise model used to determine an optimized decoder, failure rates can still be reduced by applying our hard decoding algorithm.

  20. Ribosomal history reveals origins of modern protein synthesis.

    Directory of Open Access Journals (Sweden)

    Ajith Harish

    Full Text Available The origin and evolution of the ribosome is central to our understanding of the cellular world. Most hypotheses posit that the ribosome originated in the peptidyl transferase center of the large ribosomal subunit. However, these proposals do not link protein synthesis to RNA recognition and do not use a phylogenetic comparative framework to study ribosomal evolution. Here we infer evolution of the structural components of the ribosome. Phylogenetic methods widely used in morphometrics are applied directly to RNA structures of thousands of molecules and to a census of protein structures in hundreds of genomes. We find that components of the small subunit involved in ribosomal processivity evolved earlier than the catalytic peptidyl transferase center responsible for protein synthesis. Remarkably, subunit RNA and proteins coevolved, starting with interactions between the oldest proteins (S12 and S17 and the oldest substructure (the ribosomal ratchet in the small subunit and ending with the rise of a modern multi-subunit ribosome. Ancestral ribonucleoprotein components show similarities to in vitro evolved RNA replicase ribozymes and protein structures in extant replication machinery. Our study therefore provides important clues about the chicken-or-egg dilemma associated with the central dogma of molecular biology by showing that ribosomal history is driven by the gradual structural accretion of protein and RNA structures. Most importantly, results suggest that functionally important and conserved regions of the ribosome were recruited and could be relics of an ancient ribonucleoprotein world.

  1. Decoding emotional valence from electroencephalographic rhythmic activity.

    Science.gov (United States)

    Celikkanat, Hande; Moriya, Hiroki; Ogawa, Takeshi; Kauppi, Jukka-Pekka; Kawanabe, Motoaki; Hyvarinen, Aapo

    2017-07-01

    We attempt to decode emotional valence from electroencephalographic rhythmic activity in a naturalistic setting. We employ a data-driven method developed in a previous study, Spectral Linear Discriminant Analysis, to discover the relationships between the classification task and independent neuronal sources, optimally utilizing multiple frequency bands. A detailed investigation of the classifier provides insight into the neuronal sources related with emotional valence, and the individual differences of the subjects in processing emotions. Our findings show: (1) sources whose locations are similar across subjects are consistently involved in emotional responses, with the involvement of parietal sources being especially significant, and (2) even though the locations of the involved neuronal sources are consistent, subjects can display highly varying degrees of valence-related EEG activity in the sources.

  2. Decoding the mechanisms of Antikythera astronomical device

    CERN Document Server

    Lin, Jian-Liang

    2016-01-01

    This book presents a systematic design methodology for decoding the interior structure of the Antikythera mechanism, an astronomical device from ancient Greece. The historical background, surviving evidence and reconstructions of the mechanism are introduced, and the historical development of astronomical achievements and various astronomical instruments are investigated. Pursuing an approach based on the conceptual design of modern mechanisms and bearing in mind the standards of science and technology at the time, all feasible designs of the six lost/incomplete/unclear subsystems are synthesized as illustrated examples, and 48 feasible designs of the complete interior structure are presented. This approach provides not only a logical tool for applying modern mechanical engineering knowledge to the reconstruction of the Antikythera mechanism, but also an innovative research direction for identifying the original structures of the mechanism in the future. In short, the book offers valuable new insights for all...

  3. Academic Training - Bioinformatics: Decoding the Genome

    CERN Multimedia

    Chris Jones

    2006-01-01

    ACADEMIC TRAINING LECTURE SERIES 27, 28 February 1, 2, 3 March 2006 from 11:00 to 12:00 - Auditorium, bldg. 500 Decoding the Genome A special series of 5 lectures on: Recent extraordinary advances in the life sciences arising through new detection technologies and bioinformatics The past five years have seen an extraordinary change in the information and tools available in the life sciences. The sequencing of the human genome, the discovery that we possess far fewer genes than foreseen, the measurement of the tiny changes in the genomes that differentiate us, the sequencing of the genomes of many pathogens that lead to diseases such as malaria are all examples of completely new information that is now available in the quest for improved healthcare. New tools have allowed similar strides in the discovery of the associated protein structures, providing invaluable information for those searching for new drugs. New DNA microarray chips permit simultaneous measurement of the state of expression of tens...

  4. Real-time minimal-bit-error probability decoding of convolutional codes

    Science.gov (United States)

    Lee, L.-N.

    1974-01-01

    A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.

  5. Real-time minimal bit error probability decoding of convolutional codes

    Science.gov (United States)

    Lee, L. N.

    1973-01-01

    A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.

  6. Multiple LDPC decoding for distributed source coding and video coding

    DEFF Research Database (Denmark)

    Forchhammer, Søren; Luong, Huynh Van; Huang, Xin

    2011-01-01

    Distributed source coding (DSC) is a coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. Distributed video coding (DVC) is one example. This paper considers the use of Low Density Parity Check Accumulate...... (LDPCA) codes in a DSC scheme with feed-back. To improve the LDPC coding performance in the context of DSC and DVC, while retaining short encoder blocks, this paper proposes multiple parallel LDPC decoding. The proposed scheme passes soft information between decoders to enhance performance. Experimental...

  7. Locally decodable codes and private information retrieval schemes

    CERN Document Server

    Yekhanin, Sergey

    2010-01-01

    Locally decodable codes (LDCs) are codes that simultaneously provide efficient random access retrieval and high noise resilience by allowing reliable reconstruction of an arbitrary bit of a message by looking at only a small number of randomly chosen codeword bits. Local decodability comes with a certain loss in terms of efficiency - specifically, locally decodable codes require longer codeword lengths than their classical counterparts. Private information retrieval (PIR) schemes are cryptographic protocols designed to safeguard the privacy of database users. They allow clients to retrieve rec

  8. Neural network decoder for quantum error correcting codes

    Science.gov (United States)

    Krastanov, Stefan; Jiang, Liang

    Artificial neural networks form a family of extremely powerful - albeit still poorly understood - tools used in anything from image and sound recognition through text generation to, in our case, decoding. We present a straightforward Recurrent Neural Network architecture capable of deducing the correcting procedure for a quantum error-correcting code from a set of repeated stabilizer measurements. We discuss the fault-tolerance of our scheme and the cost of training the neural network for a system of a realistic size. Such decoders are especially interesting when applied to codes, like the quantum LDPC codes, that lack known efficient decoding schemes.

  9. EXIT Chart Analysis of Binary Message-Passing Decoders

    DEFF Research Database (Denmark)

    Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard

    2007-01-01

    Binary message-passing decoders for LDPC codes are analyzed using EXIT charts. For the analysis, the variable node decoder performs all computations in the L-value domain. For the special case of a hard decision channel, this leads to the well know Gallager B algorithm, while the analysis can...... be extended to channels with larger output alphabets. By increasing the output alphabet from hard decisions to four symbols, a gain of more than 1.0 dB is achieved using optimized codes. For this code optimization, the mixing property of EXIT functions has to be modified to the case of binary message......-passing decoders....

  10. Turbo decoder architecture for beyond-4G applications

    CERN Document Server

    Wong, Cheng-Chi

    2013-01-01

    This book describes the most recent techniques for turbo decoder implementation, especially for 4G and beyond 4G applications. The authors reveal techniques for the design of high-throughput decoders for future telecommunication systems, enabling designers to reduce hardware cost and shorten processing time. Coverage includes an explanation of VLSI implementation of the turbo decoder, from basic functional units to advanced parallel architecture. The authors discuss both hardware architecture techniques and experimental results, showing the variations in area/throughput/performance with respec

  11. Encoding and Decoding Models in Cognitive Electrophysiology

    Directory of Open Access Journals (Sweden)

    Christopher R. Holdgraf

    2017-09-01

    Full Text Available Cognitive neuroscience has seen rapid growth in the size and complexity of data recorded from the human brain as well as in the computational tools available to analyze this data. This data explosion has resulted in an increased use of multivariate, model-based methods for asking neuroscience questions, allowing scientists to investigate multiple hypotheses with a single dataset, to use complex, time-varying stimuli, and to study the human brain under more naturalistic conditions. These tools come in the form of “Encoding” models, in which stimulus features are used to model brain activity, and “Decoding” models, in which neural features are used to generated a stimulus output. Here we review the current state of encoding and decoding models in cognitive electrophysiology and provide a practical guide toward conducting experiments and analyses in this emerging field. Our examples focus on using linear models in the study of human language and audition. We show how to calculate auditory receptive fields from natural sounds as well as how to decode neural recordings to predict speech. The paper aims to be a useful tutorial to these approaches, and a practical introduction to using machine learning and applied statistics to build models of neural activity. The data analytic approaches we discuss may also be applied to other sensory modalities, motor systems, and cognitive systems, and we cover some examples in these areas. In addition, a collection of Jupyter notebooks is publicly available as a complement to the material covered in this paper, providing code examples and tutorials for predictive modeling in python. The aim is to provide a practical understanding of predictive modeling of human brain data and to propose best-practices in conducting these analyses.

  12. Study of bifurcation behavior of two-dimensional turbo product code decoders

    International Nuclear Information System (INIS)

    He Yejun; Lau, Francis C.M.; Tse, Chi K.

    2008-01-01

    Turbo codes, low-density parity-check (LDPC) codes and turbo product codes (TPCs) are high performance error-correction codes which employ iterative algorithms for decoding. Under different conditions, the behaviors of the decoders are different. While the nonlinear dynamical behaviors of turbo code decoders and LDPC decoders have been reported in the literature, the dynamical behavior of TPC decoders is relatively unexplored. In this paper, we investigate the behavior of the iterative algorithm of a two-dimensional TPC decoder when the input signal-to-noise ratio (SNR) varies. The quantity to be measured is the mean square value of the posterior probabilities of the information bits. Unlike turbo decoders or LDPC decoders, TPC decoders do not produce a clear 'waterfall region'. This is mainly because the TPC decoding algorithm does not converge to 'indecisive' fixed points even at very low SNR values

  13. Study of bifurcation behavior of two-dimensional turbo product code decoders

    Energy Technology Data Exchange (ETDEWEB)

    He Yejun [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China); Lau, Francis C.M. [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China)], E-mail: encmlau@polyu.edu.hk; Tse, Chi K. [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China)

    2008-04-15

    Turbo codes, low-density parity-check (LDPC) codes and turbo product codes (TPCs) are high performance error-correction codes which employ iterative algorithms for decoding. Under different conditions, the behaviors of the decoders are different. While the nonlinear dynamical behaviors of turbo code decoders and LDPC decoders have been reported in the literature, the dynamical behavior of TPC decoders is relatively unexplored. In this paper, we investigate the behavior of the iterative algorithm of a two-dimensional TPC decoder when the input signal-to-noise ratio (SNR) varies. The quantity to be measured is the mean square value of the posterior probabilities of the information bits. Unlike turbo decoders or LDPC decoders, TPC decoders do not produce a clear 'waterfall region'. This is mainly because the TPC decoding algorithm does not converge to 'indecisive' fixed points even at very low SNR values.

  14. Architecture for time or transform domain decoding of reed-solomon codes

    Science.gov (United States)

    Shao, Howard M. (Inventor); Truong, Trieu-Kie (Inventor); Hsu, In-Shek (Inventor); Deutsch, Leslie J. (Inventor)

    1989-01-01

    Two pipeline (255,233) RS decoders, one a time domain decoder and the other a transform domain decoder, use the same first part to develop an errata locator polynomial .tau.(x), and an errata evaluator polynominal A(x). Both the time domain decoder and transform domain decoder have a modified GCD that uses an input multiplexer and an output demultiplexer to reduce the number of GCD cells required. The time domain decoder uses a Chien search and polynomial evaluator on the GCD outputs .tau.(x) and A(x), for the final decoding steps, while the transform domain decoder uses a transform error pattern algorithm operating on .tau.(x) and the initial syndrome computation S(x), followed by an inverse transform algorithm in sequence for the final decoding steps prior to adding the received RS coded message to produce a decoded output message.

  15. Phosphorylation of acidic ribosomal proteins from rabbit reticulocytes by a ribosome-associated casein kinase

    DEFF Research Database (Denmark)

    Issinger, O G

    1977-01-01

    Two acidic proteins from 80-S ribosomes were isolated and purified to homogeneity. The purified acidic proteins could be phosphorylated by casein kinase using [gamma-32P]ATP and [gamma-32P]GTP as a phosphoryl donor. The proteins became phosphorylated in situ, too. Sodium dodecyl sulfate polyacryl......Two acidic proteins from 80-S ribosomes were isolated and purified to homogeneity. The purified acidic proteins could be phosphorylated by casein kinase using [gamma-32P]ATP and [gamma-32P]GTP as a phosphoryl donor. The proteins became phosphorylated in situ, too. Sodium dodecyl sulfate...

  16. The ribosomal protein Rpl22 controls ribosome composition by directly repressing expression of its own paralog, Rpl22l1.

    Directory of Open Access Journals (Sweden)

    Monique N O'Leary

    Full Text Available Most yeast ribosomal protein genes are duplicated and their characterization has led to hypotheses regarding the existence of specialized ribosomes with different subunit composition or specifically-tailored functions. In yeast, ribosomal protein genes are generally duplicated and evidence has emerged that paralogs might have specific roles. Unlike yeast, most mammalian ribosomal proteins are thought to be encoded by a single gene copy, raising the possibility that heterogenous populations of ribosomes are unique to yeast. Here, we examine the roles of the mammalian Rpl22, finding that Rpl22(-/- mice have only subtle phenotypes with no significant translation defects. We find that in the Rpl22(-/- mouse there is a compensatory increase in Rpl22-like1 (Rpl22l1 expression and incorporation into ribosomes. Consistent with the hypothesis that either ribosomal protein can support translation, knockdown of Rpl22l1 impairs growth of cells lacking Rpl22. Mechanistically, Rpl22 regulates Rpl22l1 directly by binding to an internal hairpin structure and repressing its expression. We propose that ribosome specificity may exist in mammals, providing evidence that one ribosomal protein can influence composition of the ribosome by regulating its own paralog.

  17. Architecture of the large subunit of the mammalian mitochondrial ribosome.

    Science.gov (United States)

    Greber, Basil J; Boehringer, Daniel; Leitner, Alexander; Bieri, Philipp; Voigts-Hoffmann, Felix; Erzberger, Jan P; Leibundgut, Marc; Aebersold, Ruedi; Ban, Nenad

    2014-01-23

    Mitochondrial ribosomes synthesize a number of highly hydrophobic proteins encoded on the genome of mitochondria, the organelles in eukaryotic cells that are responsible for energy conversion by oxidative phosphorylation. The ribosomes in mammalian mitochondria have undergone massive structural changes throughout their evolution, including ribosomal RNA shortening and acquisition of mitochondria-specific ribosomal proteins. Here we present the three-dimensional structure of the 39S large subunit of the porcine mitochondrial ribosome determined by cryo-electron microscopy at 4.9 Å resolution. The structure, combined with data from chemical crosslinking and mass spectrometry experiments, reveals the unique features of the 39S subunit at near-atomic resolution and provides detailed insight into the architecture of the polypeptide exit site. This region of the mitochondrial ribosome has been considerably remodelled compared to its bacterial counterpart, providing a specialized platform for the synthesis and membrane insertion of the highly hydrophobic protein components of the respiratory chain.

  18. Ribosomal protein L5 has a highly twisted concave surface and flexible arms responsible for rRNA binding.

    OpenAIRE

    Nakashima, T; Yao, M; Kawamura, S; Iwasaki, K; Kimura, M; Tanaka, I

    2001-01-01

    Ribosomal protein L5 is a 5S rRNA binding protein in the large subunit and plays an essential role in the promotion of a particular conformation of 5S rRNA. The crystal structure of the ribosomal protein L5 from Bacillus stearothermophilus has been determined at 1.8 A resolution. The molecule consists of a five-stranded antiparallel beta-sheet and four alpha-helices, which fold in a way that is topologically similar to the ribonucleoprotein (RNP) domain. The molecular shape and electrostatic ...

  19. Placeholder factors in ribosome biogenesis: please, pave my way

    Directory of Open Access Journals (Sweden)

    Francisco J. Espinar-Marchena

    2017-04-01

    Full Text Available The synthesis of cytoplasmic eukaryotic ribosomes is an extraordinarily energy-demanding cellular activity that occurs progressively from the nucleolus to the cytoplasm. In the nucleolus, precursor rRNAs associate with a myriad of trans-acting factors and some ribosomal proteins to form pre-ribosomal particles. These factors include snoRNPs, nucleases, ATPases, GTPases, RNA helicases, and a vast list of proteins with no predicted enzymatic activity. Their coordinate activity orchestrates in a spatiotemporal manner the modification and processing of precursor rRNAs, the rearrangement reactions required for the formation of productive RNA folding intermediates, the ordered assembly of the ribosomal proteins, and the export of pre-ribosomal particles to the cytoplasm; thus, providing speed, directionality and accuracy to the overall process of formation of translation-competent ribosomes. Here, we review a particular class of trans-acting factors known as “placeholders”. Placeholder factors temporarily bind selected ribosomal sites until these have achieved a structural context that is appropriate for exchanging the placeholder with another site-specific binding factor. By this strategy, placeholders sterically prevent premature recruitment of subsequently binding factors, premature formation of structures, avoid possible folding traps, and act as molecular clocks that supervise the correct progression of pre-ribosomal particles into functional ribosomal subunits. We summarize the current understanding of those factors that delay the assembly of distinct ribosomal proteins or subsequently bind key sites in pre-ribosomal particles. We also discuss recurrent examples of RNA-protein and protein-protein mimicry between rRNAs and/or factors, which have clear functional implications for the ribosome biogenesis pathway.

  20. Molecular dynamics simulation of ribosome jam

    KAUST Repository

    Matsumoto, Shigenori

    2011-09-01

    We propose a coarse-grained molecular dynamics model of ribosome molecules to study the dependence of translation process on environmental parameters. We found the model exhibits traffic jam property, which is consistent with an ASEP model. We estimated the influence of the temperature and concentration of molecules on the hopping probability used in the ASEP model. Our model can also treat environmental effects on the translation process that cannot be explained by such cellular automaton models. © 2010 Elsevier B.V. All rights reserved.

  1. Ribosomal RNA: a key to phylogeny

    Science.gov (United States)

    Olsen, G. J.; Woese, C. R.

    1993-01-01

    As molecular phylogeny increasingly shapes our understanding of organismal relationships, no molecule has been applied to more questions than have ribosomal RNAs. We review this role of the rRNAs and some of the insights that have been gained from them. We also offer some of the practical considerations in extracting the phylogenetic information from the sequences. Finally, we stress the importance of comparing results from multiple molecules, both as a method for testing the overall reliability of the organismal phylogeny and as a method for more broadly exploring the history of the genome.

  2. Construction and decoding of a class of algebraic geometry codes

    DEFF Research Database (Denmark)

    Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd

    1989-01-01

    A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result is a decod...... is a decoding algorithm which turns out to be a generalization of the Peterson algorithm for decoding BCH decoder codes......A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result...

  3. Toward a universal decoder of linguistic meaning from brain activation.

    Science.gov (United States)

    Pereira, Francisco; Lou, Bin; Pritchett, Brianna; Ritter, Samuel; Gershman, Samuel J; Kanwisher, Nancy; Botvinick, Matthew; Fedorenko, Evelina

    2018-03-06

    Prior work decoding linguistic meaning from imaging data has been largely limited to concrete nouns, using similar stimuli for training and testing, from a relatively small number of semantic categories. Here we present a new approach for building a brain decoding system in which words and sentences are represented as vectors in a semantic space constructed from massive text corpora. By efficiently sampling this space to select training stimuli shown to subjects, we maximize the ability to generalize to new meanings from limited imaging data. To validate this approach, we train the system on imaging data of individual concepts, and show it can decode semantic vector representations from imaging data of sentences about a wide variety of both concrete and abstract topics from two separate datasets. These decoded representations are sufficiently detailed to distinguish even semantically similar sentences, and to capture the similarity structure of meaning relationships between sentences.

  4. Illustrative examples in a bilingual decoding dictionary: An (un ...

    African Journals Online (AJOL)

    Keywords: Illustrative Examples, Bilingual Decoding Dictionary, Semantic Differences Between Source Language (Sl) And Target Language (Tl), Grammatical Differences Between Sl And Tl, Translation Of Examples, Transposition, Context-Dependent Translation, One-Word Equivalent, Zero Equivalent, Idiomatic ...

  5. Decoding Reed-Solomon Codes beyond half the minimum distance

    DEFF Research Database (Denmark)

    Høholdt, Tom; Nielsen, Rasmus Refslund

    1999-01-01

    We describe an efficient implementation of M.Sudan"s algorithm for decoding Reed-Solomon codes beyond half the minimum distance. Furthermore we calculate an upper bound of the probabilty of getting more than one codeword as output...

  6. Eukaryotic ribosome display with in situ DNA recovery.

    Science.gov (United States)

    He, Mingyue; Edwards, Bryan M; Kastelic, Damjana; Taussig, Michael J

    2012-01-01

    Ribosome display is a cell-free display technology for in vitro selection and optimisation of proteins from large diversified libraries. It operates through the formation of stable protein-ribosome-mRNA (PRM) complexes and selection of ligand-binding proteins, followed by DNA recovery from the selected genetic information. Both prokaryotic and eukaryotic ribosome display systems have been developed. In this chapter, we describe the eukaryotic rabbit reticulocyte method in which a distinct in situ single-primer RT-PCR procedure is used to recover DNA from the selected PRM complexes without the need for prior disruption of the ribosome.

  7. An overview of turbo decoding on fading channels

    OpenAIRE

    ATILGAN, Doğan

    2009-01-01

    A review of turbo coding and decoding has been presented in the literature [1]. In that paper, turbo coding and decoding on AWGN (Additive White Gaussian Noise) channels has been elaborated. In wireless communications, a phenomennon called multipath fading is frequently encountered. Therefore, investigation of efficient techniques to tackle with the destructive effects of fading is essential. Turbo coding has been proven as an efficient channel coding technique for AWGN channels. Some of the ...

  8. Performance Analysis of a Decoding Algorithm for Algebraic Geometry Codes

    DEFF Research Database (Denmark)

    Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund; Høholdt, Tom

    1998-01-01

    We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance......We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance...

  9. Recent results in the decoding of Algebraic geometry codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund

    1998-01-01

    We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is [(dFR-1)/2]+1, where dFR is the Feng-Rao distance......We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is [(dFR-1)/2]+1, where dFR is the Feng-Rao distance...

  10. Effect of video decoder errors on video interpretability

    Science.gov (United States)

    Young, Darrell L.

    2014-06-01

    The advancement in video compression technology can result in more sensitivity to bit errors. Bit errors can propagate causing sustained loss of interpretability. In the worst case, the decoder "freezes" until it can re-synchronize with the stream. Detection of artifacts enables downstream processes to avoid corrupted frames. A simple template approach to detect block stripes and a more advanced cascade approach to detect compression artifacts was shown to correlate to the presence of artifacts and decoder messages.

  11. In Profile: Models of Ribosome Biogenesis Defects and Regulation of Protein Synthesis

    NARCIS (Netherlands)

    Essers, P.B.M.

    2013-01-01

    Ribosomes are the mediators of protein synthesis in the cell and therefore crucial to proper cell function. In addition, ribosomes are highly abundant, with ribosomal RNA making up 80% of the RNA in the cell. A large amount of resources go into maintaining this pool of ribosomes, so ribosome

  12. Electrophysiological difference between mental state decoding and mental state reasoning.

    Science.gov (United States)

    Cao, Bihua; Li, Yiyuan; Li, Fuhong; Li, Hong

    2012-06-29

    Previous studies have explored the neural mechanism of Theory of Mind (ToM), but the neural correlates of its two components, mental state decoding and mental state reasoning, remain unclear. In the present study, participants were presented with various photographs, showing an actor looking at 1 of 2 objects, either with a happy or an unhappy expression. They were asked to either decode the emotion of the actor (mental state decoding task), predict which object would be chosen by the actor (mental state reasoning task), or judge at which object the actor was gazing (physical task), while scalp potentials were recorded. Results showed that (1) the reasoning task elicited an earlier N2 peak than the decoding task did over the prefrontal scalp sites; and (2) during the late positive component (240-440 ms), the reasoning task elicited a more positive deflection than the other two tasks did at the prefrontal scalp sites. In addition, neither the decoding task nor the reasoning task has no left/right hemisphere difference. These findings imply that mental state reasoning differs from mental state decoding early (210 ms) after stimulus onset, and that the prefrontal lobe is the neural basis of mental state reasoning. Copyright © 2012 Elsevier B.V. All rights reserved.

  13. Evaluation framework for K-best sphere decoders

    KAUST Repository

    Shen, Chungan

    2010-08-01

    While Maximum-Likelihood (ML) is the optimum decoding scheme for most communication scenarios, practical implementation difficulties limit its use, especially for Multiple Input Multiple Output (MIMO) systems with a large number of transmit or receive antennas. Tree-searching type decoder structures such as Sphere decoder and K-best decoder present an interesting trade-off between complexity and performance. Many algorithmic developments and VLSI implementations have been reported in literature with widely varying performance to area and power metrics. In this semi-tutorial paper we present a holistic view of different Sphere decoding techniques and K-best decoding techniques, identifying the key algorithmic and implementation trade-offs. We establish a consistent benchmark framework to investigate and compare the delay cost, power cost, and power-delay-product cost incurred by each method. Finally, using the framework, we propose and analyze a novel architecture and compare that to other published approaches. Our goal is to explicitly elucidate the overall advantages and disadvantages of each proposed algorithms in one coherent framework. © 2010 World Scientific Publishing Company.

  14. Partially blind instantly decodable network codes for lossy feedback environment

    KAUST Repository

    Sorour, Sameh

    2014-09-01

    In this paper, we study the multicast completion and decoding delay minimization problems for instantly decodable network coding (IDNC) in the case of lossy feedback. When feedback loss events occur, the sender falls into uncertainties about packet reception at the different receivers, which forces it to perform partially blind selections of packet combinations in subsequent transmissions. To determine efficient selection policies that reduce the completion and decoding delays of IDNC in such an environment, we first extend the perfect feedback formulation in our previous works to the lossy feedback environment, by incorporating the uncertainties resulting from unheard feedback events in these formulations. For the completion delay problem, we use this formulation to identify the maximum likelihood state of the network in events of unheard feedback and employ it to design a partially blind graph update extension to the multicast IDNC algorithm in our earlier work. For the decoding delay problem, we derive an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both outperform previously proposed approaches and achieve tolerable degradation even at relatively high feedback loss rates.

  15. A computational investigation on the connection between dynamics properties of ribosomal proteins and ribosome assembly.

    Directory of Open Access Journals (Sweden)

    Brittany Burton

    Full Text Available Assembly of the ribosome from its protein and RNA constituents has been studied extensively over the past 50 years, and experimental evidence suggests that prokaryotic ribosomal proteins undergo conformational changes during assembly. However, to date, no studies have attempted to elucidate these conformational changes. The present work utilizes computational methods to analyze protein dynamics and to investigate the linkage between dynamics and binding of these proteins during the assembly of the ribosome. Ribosomal proteins are known to be positively charged and we find the percentage of positive residues in r-proteins to be about twice that of the average protein: Lys+Arg is 18.7% for E. coli and 21.2% for T. thermophilus. Also, positive residues constitute a large proportion of RNA contacting residues: 39% for E. coli and 46% for T. thermophilus. This affirms the known importance of charge-charge interactions in the assembly of the ribosome. We studied the dynamics of three primary proteins from E. coli and T. thermophilus 30S subunits that bind early in the assembly (S15, S17, and S20 with atomic molecular dynamic simulations, followed by a study of all r-proteins using elastic network models. Molecular dynamics simulations show that solvent-exposed proteins (S15 and S17 tend to adopt more stable solution conformations than an RNA-embedded protein (S20. We also find protein residues that contact the 16S rRNA are generally more mobile in comparison with the other residues. This is because there is a larger proportion of contacting residues located in flexible loop regions. By the use of elastic network models, which are computationally more efficient, we show that this trend holds for most of the 30S r-proteins.

  16. Direct migration motion estimation and mode decision to decoder for a low-complexity decoder Wyner-Ziv video coding

    Science.gov (United States)

    Lei, Ted Chih-Wei; Tseng, Fan-Shuo

    2017-07-01

    This paper addresses the problem of high-computational complexity decoding in traditional Wyner-Ziv video coding (WZVC). The key focus is the migration of two traditionally high-computationally complex encoder algorithms, namely motion estimation and mode decision. In order to reduce the computational burden in this process, the proposed architecture adopts the partial boundary matching algorithm and four flexible types of block mode decision at the decoder. This approach does away with the need for motion estimation and mode decision at the encoder. The experimental results show that the proposed padding block-based WZVC not only decreases decoder complexity to approximately one hundredth that of the state-of-the-art DISCOVER decoding but also outperforms DISCOVER codec by up to 3 to 4 dB.

  17. Defining the bacteroides ribosomal binding site.

    Science.gov (United States)

    Wegmann, Udo; Horn, Nikki; Carding, Simon R

    2013-03-01

    The human gastrointestinal tract, in particular the colon, hosts a vast number of commensal microorganisms. Representatives of the genus Bacteroides are among the most abundant bacterial species in the human colon. Bacteroidetes diverged from the common line of eubacterial descent before other eubacterial groups. As a result, they employ unique transcription initiation signals and, because of this uniqueness, they require specific genetic tools. Although some tools exist, they are not optimal for studying the roles and functions of these bacteria in the human gastrointestinal tract. Focusing on translation initiation signals in Bacteroides, we created a series of expression vectors allowing for different levels of protein expression in this genus, and we describe the use of pepI from Lactobacillus delbrueckii subsp. lactis as a novel reporter gene for Bacteroides. Furthermore, we report the identification of the 3' end of the 16S rRNA of Bacteroides ovatus and analyze in detail its ribosomal binding site, thus defining a core region necessary for efficient translation, which we have incorporated into the design of our expression vectors. Based on the sequence logo information from the 5' untranslated region of other Bacteroidales ribosomal protein genes, we conclude that our findings are relevant to all members of this order.

  18. Roles of Transcriptional and Translational Control Mechanisms in Regulation of Ribosomal Protein Synthesis in Escherichia coli.

    Science.gov (United States)

    Burgos, Hector L; O'Connor, Kevin; Sanchez-Vazquez, Patricia; Gourse, Richard L

    2017-11-01

    Bacterial ribosome biogenesis is tightly regulated to match nutritional conditions and to prevent formation of defective ribosomal particles. In Escherichia coli , most ribosomal protein (r-protein) synthesis is coordinated with rRNA synthesis by a translational feedback mechanism: when r-proteins exceed rRNAs, specific r-proteins bind to their own mRNAs and inhibit expression of the operon. It was recently discovered that the second messenger nucleotide guanosine tetra and pentaphosphate (ppGpp), which directly regulates rRNA promoters, is also capable of regulating many r-protein promoters. To examine the relative contributions of the translational and transcriptional control mechanisms to the regulation of r-protein synthesis, we devised a reporter system that enabled us to genetically separate the cis -acting sequences responsible for the two mechanisms and to quantify their relative contributions to regulation under the same conditions. We show that the synthesis of r-proteins from the S20 and S10 operons is regulated by ppGpp following shifts in nutritional conditions, but most of the effect of ppGpp required the 5' region of the r-protein mRNA containing the target site for translational feedback regulation and not the promoter. These results suggest that most regulation of the S20 and S10 operons by ppGpp following nutritional shifts is indirect and occurs in response to changes in rRNA synthesis. In contrast, we found that the promoters for the S20 operon were regulated during outgrowth, likely in response to increasing nucleoside triphosphate (NTP) levels. Thus, r-protein synthesis is dynamic, with different mechanisms acting at different times. IMPORTANCE Bacterial cells have evolved complex and seemingly redundant strategies to regulate many high-energy-consuming processes. In E. coli , synthesis of ribosomal components is tightly regulated with respect to nutritional conditions by mechanisms that act at both the transcription and translation steps. In

  19. Singer product apertures—A coded aperture system with a fast decoding algorithm

    International Nuclear Information System (INIS)

    Byard, Kevin; Shutler, Paul M.E.

    2017-01-01

    A new type of coded aperture configuration that enables fast decoding of the coded aperture shadowgram data is presented. Based on the products of incidence vectors generated from the Singer difference sets, we call these Singer product apertures. For a range of aperture dimensions, we compare experimentally the performance of three decoding methods: standard decoding, induction decoding and direct vector decoding. In all cases the induction and direct vector methods are several orders of magnitude faster than the standard method, with direct vector decoding being significantly faster than induction decoding. For apertures of the same dimensions the increase in speed offered by direct vector decoding over induction decoding is better for lower throughput apertures.

  20. An FPGA Implementation of (3,6-Regular Low-Density Parity-Check Code Decoder

    Directory of Open Access Journals (Sweden)

    Tong Zhang

    2003-05-01

    Full Text Available Because of their excellent error-correcting performance, low-density parity-check (LDPC codes have recently attracted a lot of attention. In this paper, we are interested in the practical LDPC code decoder hardware implementations. The direct fully parallel decoder implementation usually incurs too high hardware complexity for many real applications, thus partly parallel decoder design approaches that can achieve appropriate trade-offs between hardware complexity and decoding throughput are highly desirable. Applying a joint code and decoder design methodology, we develop a high-speed (3,k-regular LDPC code partly parallel decoder architecture based on which we implement a 9216-bit, rate-1/2(3,6-regular LDPC code decoder on Xilinx FPGA device. This partly parallel decoder supports a maximum symbol throughput of 54 Mbps and achieves BER 10−6 at 2 dB over AWGN channel while performing maximum 18 decoding iterations.

  1. Singer product apertures—A coded aperture system with a fast decoding algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Byard, Kevin, E-mail: kevin.byard@aut.ac.nz [School of Economics, Faculty of Business, Economics and Law, Auckland University of Technology, Auckland 1142 (New Zealand); Shutler, Paul M.E. [National Institute of Education, Nanyang Technological University, 1 Nanyang Walk, Singapore 637616 (Singapore)

    2017-06-01

    A new type of coded aperture configuration that enables fast decoding of the coded aperture shadowgram data is presented. Based on the products of incidence vectors generated from the Singer difference sets, we call these Singer product apertures. For a range of aperture dimensions, we compare experimentally the performance of three decoding methods: standard decoding, induction decoding and direct vector decoding. In all cases the induction and direct vector methods are several orders of magnitude faster than the standard method, with direct vector decoding being significantly faster than induction decoding. For apertures of the same dimensions the increase in speed offered by direct vector decoding over induction decoding is better for lower throughput apertures.

  2. Decoding reality the universe as quantum information

    CERN Document Server

    Vedral, Vlatko

    2010-01-01

    In Decoding Reality, Vlatko Vedral offers a mind-stretching look at the deepest questions about the universe--where everything comes from, why things are as they are, what everything is. The most fundamental definition of reality is not matter or energy, he writes, but information--and it is the processing of information that lies at the root of all physical, biological, economic, and social phenomena. This view allows Vedral to address a host of seemingly unrelated questions: Why does DNA bind like it does? What is the ideal diet for longevity? How do you make your first million dollars? We can unify all through the understanding that everything consists of bits of information, he writes, though that raises the question of where these bits come from. To find the answer, he takes us on a guided tour through the bizarre realm of quantum physics. At this sub-sub-subatomic level, we find such things as the interaction of separated quantum particles--what Einstein called "spooky action at a distance." In fact, V...

  3. Statistical coding and decoding of heartbeat intervals.

    Science.gov (United States)

    Lucena, Fausto; Barros, Allan Kardec; Príncipe, José C; Ohnishi, Noboru

    2011-01-01

    The heart integrates neuroregulatory messages into specific bands of frequency, such that the overall amplitude spectrum of the cardiac output reflects the variations of the autonomic nervous system. This modulatory mechanism seems to be well adjusted to the unpredictability of the cardiac demand, maintaining a proper cardiac regulation. A longstanding theory holds that biological organisms facing an ever-changing environment are likely to evolve adaptive mechanisms to extract essential features in order to adjust their behavior. The key question, however, has been to understand how the neural circuitry self-organizes these feature detectors to select behaviorally relevant information. Previous studies in computational perception suggest that a neural population enhances information that is important for survival by minimizing the statistical redundancy of the stimuli. Herein we investigate whether the cardiac system makes use of a redundancy reduction strategy to regulate the cardiac rhythm. Based on a network of neural filters optimized to code heartbeat intervals, we learn a population code that maximizes the information across the neural ensemble. The emerging population code displays filter tuning proprieties whose characteristics explain diverse aspects of the autonomic cardiac regulation, such as the compromise between fast and slow cardiac responses. We show that the filters yield responses that are quantitatively similar to observed heart rate responses during direct sympathetic or parasympathetic nerve stimulation. Our findings suggest that the heart decodes autonomic stimuli according to information theory principles analogous to how perceptual cues are encoded by sensory systems.

  4. Rate Aware Instantly Decodable Network Codes

    KAUST Repository

    Douik, Ahmed

    2016-02-26

    This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.

  5. Encoding and decoding messages with chaotic lasers

    International Nuclear Information System (INIS)

    Alsing, P.M.; Gavrielides, A.; Kovanis, V.; Roy, R.; Thornburg, K.S. Jr.

    1997-01-01

    We investigate the structure of the strange attractor of a chaotic loss-modulated solid-state laser utilizing return maps based on a combination of intensity maxima and interspike intervals, as opposed to those utilizing Poincare sections defined by the intensity maxima of the laser (I=0,Ie<0) alone. We find both experimentally and numerically that a simple, intrinsic relationship exists between an intensity maximum and the pair of preceding and succeeding interspike intervals. In addition, we numerically investigate encoding messages on the output of a chaotic transmitter laser and its subsequent decoding by a similar receiver laser. By exploiting the relationship between the intensity maxima and the interspike intervals, we demonstrate that the method utilized to encode the message is vital to the system close-quote s ability to hide the signal from unwanted deciphering. In this work alternative methods are studied in order to encode messages by modulating the magnitude of pumping of the transmitter laser and also by driving its loss modulation with more than one frequency. copyright 1997 The American Physical Society

  6. Fast mental states decoding in mixed reality.

    Directory of Open Access Journals (Sweden)

    Daniele eDe Massari

    2014-11-01

    Full Text Available The combination of Brain-Computer Interface technology, allowing online monitoring and decoding of brain activity, with virtual and mixed reality systems may help to shape and guide implicit and explicit learning using ecological scenarios. Real-time information of ongoing brain states acquired through BCI might be exploited for controlling data presentation in virtual environments. In this context, assessing to what extent brain states can be discriminated during mixed reality experience is critical for adapting specific data features to contingent brain activity. In this study we recorded EEG data while participants experienced a mixed reality scenario implemented through the eXperience Induction Machine (XIM. The XIM is a novel framework modeling the integration of a sensing system that evaluates and measures physiological and psychological states with a number of actuators and effectors that coherently reacts to the user's actions. We then assessed continuous EEG-based discrimination of spatial navigation, reading and calculation performed in mixed reality, using LDA and SVM classifiers. Dynamic single trial classification showed high accuracy of LDA and SVM classifiers in detecting multiple brain states as well as in differentiating between high and low mental workload, using a 5 s time-window shifting every 200 ms. Our results indicate overall better performance of LDA with respect to SVM and suggest applicability of our approach in a BCI-controlled mixed reality scenario. Ultimately, successful prediction of brain states might be used to drive adaptation of data representation in order to boost information processing in mixed reality.

  7. Decoding P4-ATPase substrate interactions.

    Science.gov (United States)

    Roland, Bartholomew P; Graham, Todd R

    Cellular membranes display a diversity of functions that are conferred by the unique composition and organization of their proteins and lipids. One important aspect of lipid organization is the asymmetric distribution of phospholipids (PLs) across the plasma membrane. The unequal distribution of key PLs between the cytofacial and exofacial leaflets of the bilayer creates physical surface tension that can be used to bend the membrane; and like Ca 2+ , a chemical gradient that can be used to transduce biochemical signals. PL flippases in the type IV P-type ATPase (P4-ATPase) family are the principle transporters used to set and repair this PL gradient and the asymmetric organization of these membranes are encoded by the substrate specificity of these enzymes. Thus, understanding the mechanisms of P4-ATPase substrate specificity will help reveal their role in membrane organization and cell biology. Further, decoding the structural determinants of substrate specificity provides investigators the opportunity to mutationally tune this specificity to explore the role of particular PL substrates in P4-ATPase cellular functions. This work reviews the role of P4-ATPases in membrane biology, presents our current understanding of P4-ATPase substrate specificity, and discusses how these fundamental aspects of P4-ATPase enzymology may be used to enhance our knowledge of cellular membrane biology.

  8. Fast mental states decoding in mixed reality.

    Science.gov (United States)

    De Massari, Daniele; Pacheco, Daniel; Malekshahi, Rahim; Betella, Alberto; Verschure, Paul F M J; Birbaumer, Niels; Caria, Andrea

    2014-01-01

    The combination of Brain-Computer Interface (BCI) technology, allowing online monitoring and decoding of brain activity, with virtual and mixed reality (MR) systems may help to shape and guide implicit and explicit learning using ecological scenarios. Real-time information of ongoing brain states acquired through BCI might be exploited for controlling data presentation in virtual environments. Brain states discrimination during mixed reality experience is thus critical for adapting specific data features to contingent brain activity. In this study we recorded electroencephalographic (EEG) data while participants experienced MR scenarios implemented through the eXperience Induction Machine (XIM). The XIM is a novel framework modeling the integration of a sensing system that evaluates and measures physiological and psychological states with a number of actuators and effectors that coherently reacts to the user's actions. We then assessed continuous EEG-based discrimination of spatial navigation, reading and calculation performed in MR, using linear discriminant analysis (LDA) and support vector machine (SVM) classifiers. Dynamic single trial classification showed high accuracy of LDA and SVM classifiers in detecting multiple brain states as well as in differentiating between high and low mental workload, using a 5 s time-window shifting every 200 ms. Our results indicate overall better performance of LDA with respect to SVM and suggest applicability of our approach in a BCI-controlled MR scenario. Ultimately, successful prediction of brain states might be used to drive adaptation of data representation in order to boost information processing in MR.

  9. Observing human movements helps decoding environmental forces.

    Science.gov (United States)

    Zago, Myrka; La Scaleia, Barbara; Miller, William L; Lacquaniti, Francesco

    2011-11-01

    Vision of human actions can affect several features of visual motion processing, as well as the motor responses of the observer. Here, we tested the hypothesis that action observation helps decoding environmental forces during the interception of a decelerating target within a brief time window, a task intrinsically very difficult. We employed a factorial design to evaluate the effects of scene orientation (normal or inverted) and target gravity (normal or inverted). Button-press triggered the motion of a bullet, a piston, or a human arm. We found that the timing errors were smaller for upright scenes irrespective of gravity direction in the Bullet group, while the errors were smaller for the standard condition of normal scene and gravity in the Piston group. In the Arm group, instead, performance was better when the directions of scene and target gravity were concordant, irrespective of whether both were upright or inverted. These results suggest that the default viewer-centered reference frame is used with inanimate scenes, such as those of the Bullet and Piston protocols. Instead, the presence of biological movements in animate scenes (as in the Arm protocol) may help processing target kinematics under the ecological conditions of coherence between scene and target gravity directions.

  10. Rate Aware Instantly Decodable Network Codes

    KAUST Repository

    Douik, Ahmed; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2016-01-01

    This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.

  11. Statistical coding and decoding of heartbeat intervals.

    Directory of Open Access Journals (Sweden)

    Fausto Lucena

    Full Text Available The heart integrates neuroregulatory messages into specific bands of frequency, such that the overall amplitude spectrum of the cardiac output reflects the variations of the autonomic nervous system. This modulatory mechanism seems to be well adjusted to the unpredictability of the cardiac demand, maintaining a proper cardiac regulation. A longstanding theory holds that biological organisms facing an ever-changing environment are likely to evolve adaptive mechanisms to extract essential features in order to adjust their behavior. The key question, however, has been to understand how the neural circuitry self-organizes these feature detectors to select behaviorally relevant information. Previous studies in computational perception suggest that a neural population enhances information that is important for survival by minimizing the statistical redundancy of the stimuli. Herein we investigate whether the cardiac system makes use of a redundancy reduction strategy to regulate the cardiac rhythm. Based on a network of neural filters optimized to code heartbeat intervals, we learn a population code that maximizes the information across the neural ensemble. The emerging population code displays filter tuning proprieties whose characteristics explain diverse aspects of the autonomic cardiac regulation, such as the compromise between fast and slow cardiac responses. We show that the filters yield responses that are quantitatively similar to observed heart rate responses during direct sympathetic or parasympathetic nerve stimulation. Our findings suggest that the heart decodes autonomic stimuli according to information theory principles analogous to how perceptual cues are encoded by sensory systems.

  12. Mechanism of recycling of post-termination ribosomal complexes in ...

    Indian Academy of Sciences (India)

    Madhu

    all pathway of ribosome recycling in eubacteria with especial reference to the important role of the initiation factor ... [Seshadri A and Varshney U 2006 Mechanism of recycling of post-termination ribosomal complexes in eubacteria: a new role of initiation factor 3 .... RRF binding results in a remarkable conformational change.

  13. Expression of protein-coding genes embedded in ribosomal DNA

    DEFF Research Database (Denmark)

    Johansen, Steinar D; Haugen, Peik; Nielsen, Henrik

    2007-01-01

    Ribosomal DNA (rDNA) is a specialised chromosomal location that is dedicated to high-level transcription of ribosomal RNA genes. Interestingly, rDNAs are frequently interrupted by parasitic elements, some of which carry protein genes. These are non-LTR retrotransposons and group II introns that e...... in the nucleolus....

  14. Proto-ribosome: a theoretical approach based on RNA relics

    OpenAIRE

    Demongeot, Jacques

    2017-01-01

    We describe in this paper, based on already published articles, a contribution to the theory postulating the existence of a proto-ribosome, which could have appeared early at the origin of life and we discuss the interest of this notion in an evolutionary perspective, taking into account the existence of possible RNA relics of this proto-ribosome.

  15. Efficient universal computing architectures for decoding neural activity.

    Directory of Open Access Journals (Sweden)

    Benjamin I Rapoport

    Full Text Available The ability to decode neural activity into meaningful control signals for prosthetic devices is critical to the development of clinically useful brain- machine interfaces (BMIs. Such systems require input from tens to hundreds of brain-implanted recording electrodes in order to deliver robust and accurate performance; in serving that primary function they should also minimize power dissipation in order to avoid damaging neural tissue; and they should transmit data wirelessly in order to minimize the risk of infection associated with chronic, transcutaneous implants. Electronic architectures for brain- machine interfaces must therefore minimize size and power consumption, while maximizing the ability to compress data to be transmitted over limited-bandwidth wireless channels. Here we present a system of extremely low computational complexity, designed for real-time decoding of neural signals, and suited for highly scalable implantable systems. Our programmable architecture is an explicit implementation of a universal computing machine emulating the dynamics of a network of integrate-and-fire neurons; it requires no arithmetic operations except for counting, and decodes neural signals using only computationally inexpensive logic operations. The simplicity of this architecture does not compromise its ability to compress raw neural data by factors greater than [Formula: see text]. We describe a set of decoding algorithms based on this computational architecture, one designed to operate within an implanted system, minimizing its power consumption and data transmission bandwidth; and a complementary set of algorithms for learning, programming the decoder, and postprocessing the decoded output, designed to operate in an external, nonimplanted unit. The implementation of the implantable portion is estimated to require fewer than 5000 operations per second. A proof-of-concept, 32-channel field-programmable gate array (FPGA implementation of this portion

  16. A real-time MPEG software decoder using a portable message-passing library

    Energy Technology Data Exchange (ETDEWEB)

    Kwong, Man Kam; Tang, P.T. Peter; Lin, Biquan

    1995-12-31

    We present a real-time MPEG software decoder that uses message-passing libraries such as MPL, p4 and MPI. The parallel MPEG decoder currently runs on the IBM SP system but can be easil ported to other parallel machines. This paper discusses our parallel MPEG decoding algorithm as well as the parallel programming environment under which it uses. Several technical issues are discussed, including balancing of decoding speed, memory limitation, 1/0 capacities, and optimization of MPEG decoding components. This project shows that a real-time portable software MPEG decoder is feasible in a general-purpose parallel machine.

  17. Macrolide antibiotic interaction and resistance on the bacterial ribosome.

    Science.gov (United States)

    Poehlsgaard, Jacob; Douthwaite, Stephen

    2003-02-01

    Our understanding of the fine structure of many antibiotic target sites has reached a new level of enlightenment in the last couple of years due to the advent, by X-ray crystallography, of high-resolution structures of the bacterial ribosome. Many classes of clinically useful antibiotics bind to the ribosome to inhibit bacterial protein synthesis. Macrolide, lincosamide and streptogramin B (MLSB) antibiotics form one of the largest groups, and bind to the same site on the 50S ribosomal subunit. Here, we review the molecular details of the ribosomal MLSB site to put into perspective the main points from a wealth of biochemical and genetic data that have been collected over several decades. The information is now available to understand, at atomic resolution, how macrolide antibiotics interact with their ribosomal target, how the target is altered to confer resistance, and in which directions we need to look if we are to rationally design better drugs to overcome the extant resistance mechanisms.

  18. Cis-regulatory RNA elements that regulate specialized ribosome activity.

    Science.gov (United States)

    Xue, Shifeng; Barna, Maria

    2015-01-01

    Recent evidence has shown that the ribosome itself can play a highly regulatory role in the specialized translation of specific subpools of mRNAs, in particular at the level of ribosomal proteins (RP). However, the mechanism(s) by which this selection takes place has remained poorly understood. In our recent study, we discovered a combination of unique RNA elements in the 5'UTRs of mRNAs that allows for such control by the ribosome. These mRNAs contain a Translation Inhibitory Element (TIE) that inhibits general cap-dependent translation, and an Internal Ribosome Entry Site (IRES) that relies on a specific RP for activation. The unique combination of an inhibitor of general translation and an activator of specialized translation is key to ribosome-mediated control of gene expression. Here we discuss how these RNA regulatory elements provide a new level of control to protein expression and their implications for gene expression, organismal development and evolution.

  19. RINT-1 interacts with MSP58 within nucleoli and plays a role in ribosomal gene transcription

    International Nuclear Information System (INIS)

    Yang, Chuan-Pin; Kuo, Yu-Liang; Lee, Yi-Chao; Lee, Kuen-Haur; Chiang, Chi-Wu; Wang, Ju-Ming; Hsu, Che-Chia

    2016-01-01

    The nucleolus is the cellular site of ribosomal (r)DNA transcription and ribosome biogenesis. The 58-kDa microspherule protein (MSP58) is a nucleolar protein involved in rDNA transcription and cell proliferation. However, regulation of MSP58-mediated rDNA transcription remains unknown. Using a yeast two-hybrid system with MSP58 as bait, we isolated complementary (c)DNA encoding Rad50-interacting protein 1 (RINT-1), as a MSP58-binding protein. RINT-1 was implicated in the cell cycle checkpoint, membrane trafficking, Golgi apparatus and centrosome dynamic integrity, and telomere length control. Both in vitro and in vivo interaction assays showed that MSP58 directly interacts with RINT-1. Interestingly, microscopic studies revealed the co-localization of MSP58, RINT-1, and the upstream binding factor (UBF), a rRNA transcription factor, in the nucleolus. We showed that ectopic expression of MSP58 or RINT-1 resulted in decreased rRNA expression and rDNA promoter activity, whereas knockdown of MSP58 or RINT-1 by siRNA exerted the opposite effect. Coexpression of MSP58 and RINT-1 robustly decreased rRNA synthesis compared to overexpression of either protein alone, whereas depletion of RINT-1 from MSP58-transfected cells enhanced rRNA synthesis. We also found that MSP58, RINT-1, and the UBF were associated with the rDNA promoter using a chromatin immunoprecipitation assay. Because aberrant ribosome biogenesis contributes to neoplastic transformation, our results revealed a novel protein complex involved in the regulation of rRNA gene expression, suggesting a role for MSP58 and RINT-1 in cancer development. - Highlights: • RINT-1 is a novel MSP58-interacting protein. • RINT-1 is a nucleolar protein that suppresses ribosomal RNA gene transcription. • RINT-1 and MSP58 cooperate to suppress ribosomal RNA gene transcription. • RINT-1, MSP58, and UBF form a complex on the rDNA promoter.

  20. Control of Ribosome Synthesis in Escherichia coli

    DEFF Research Database (Denmark)

    Molin, Søren; Meyenburg, K. von; Måløe, O.

    1977-01-01

    The rate of ribosome synthesis and accumulation in Escherichia coli during the transition after an energy source shift-down was analyzed. The shift was imposed on cultures of stringent and relaxed strains growing in glucose minimal medium by the addition of the glucose analogue {alpha...... and to estimate the transcription time for the rRNA operon under different conditions. In steady states of growth with growth rates ranging from 0.75 to 2.3 doublings/h, as well as during the transition after a shift-down, the transcription time of the rRNA operon was constant. The rate of synthesis of r......RNA correlated during this transition – in contrast to the rate of accumulation (M. T. Hansen et al., J. Bacteriol. 122: 585-591, 1975) – with the ppGpp pool in the same way as has been observed during partial amino acid starvation....

  1. Hierarchical recruitment of ribosomal proteins and assembly factors remodels nucleolar pre-60S ribosomes.

    Science.gov (United States)

    Biedka, Stephanie; Micic, Jelena; Wilson, Daniel; Brown, Hailey; Diorio-Toth, Luke; Woolford, John L

    2018-04-24

    Ribosome biogenesis involves numerous preribosomal RNA (pre-rRNA) processing events to remove internal and external transcribed spacer sequences, ultimately yielding three mature rRNAs. Removal of the internal transcribed spacer 2 spacer RNA is the final step in large subunit pre-rRNA processing and begins with endonucleolytic cleavage at the C 2 site of 27SB pre-rRNA. C 2 cleavage requires the hierarchical recruitment of 11 ribosomal proteins and 14 ribosome assembly factors. However, the function of these proteins in C 2 cleavage remained unclear. In this study, we have performed a detailed analysis of the effects of depleting proteins required for C 2 cleavage and interpreted these results using cryo-electron microscopy structures of assembling 60S subunits. This work revealed that these proteins are required for remodeling of several neighborhoods, including two major functional centers of the 60S subunit, suggesting that these remodeling events form a checkpoint leading to C 2 cleavage. Interestingly, when C 2 cleavage is directly blocked by depleting or inactivating the C 2 endonuclease, assembly progresses through all other subsequent steps. © 2018 Biedka et al.

  2. Mapping visual stimuli to perceptual decisions via sparse decoding of mesoscopic neural activity.

    Science.gov (United States)

    Sajda, Paul

    2010-01-01

    In this talk I will describe our work investigating sparse decoding of neural activity, given a realistic mapping of the visual scene to neuronal spike trains generated by a model of primary visual cortex (V1). We use a linear decoder which imposes sparsity via an L1 norm. The decoder can be viewed as a decoding neuron (linear summation followed by a sigmoidal nonlinearity) in which there are relatively few non-zero synaptic weights. We find: (1) the best decoding performance is for a representation that is sparse in both space and time, (2) decoding of a temporal code results in better performance than a rate code and is also a better fit to the psychophysical data, (3) the number of neurons required for decoding increases monotonically as signal-to-noise in the stimulus decreases, with as little as 1% of the neurons required for decoding at the highest signal-to-noise levels, and (4) sparse decoding results in a more accurate decoding of the stimulus and is a better fit to psychophysical performance than a distributed decoding, for example one imposed by an L2 norm. We conclude that sparse coding is well-justified from a decoding perspective in that it results in a minimum number of neurons and maximum accuracy when sparse representations can be decoded from the neural dynamics.

  3. Robust pattern decoding in shape-coded structured light

    Science.gov (United States)

    Tang, Suming; Zhang, Xu; Song, Zhan; Song, Lifang; Zeng, Hai

    2017-09-01

    Decoding is a challenging and complex problem in a coded structured light system. In this paper, a robust pattern decoding method is proposed for the shape-coded structured light in which the pattern is designed as grid shape with embedded geometrical shapes. In our decoding method, advancements are made at three steps. First, a multi-template feature detection algorithm is introduced to detect the feature point which is the intersection of each two orthogonal grid-lines. Second, pattern element identification is modelled as a supervised classification problem and the deep neural network technique is applied for the accurate classification of pattern elements. Before that, a training dataset is established, which contains a mass of pattern elements with various blurring and distortions. Third, an error correction mechanism based on epipolar constraint, coplanarity constraint and topological constraint is presented to reduce the false matches. In the experiments, several complex objects including human hand are chosen to test the accuracy and robustness of the proposed method. The experimental results show that our decoding method not only has high decoding accuracy, but also owns strong robustness to surface color and complex textures.

  4. Optimal and efficient decoding of concatenated quantum block codes

    International Nuclear Information System (INIS)

    Poulin, David

    2006-01-01

    We consider the problem of optimally decoding a quantum error correction code--that is, to find the optimal recovery procedure given the outcomes of partial ''check'' measurements on the system. In general, this problem is NP hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message-passing algorithm. We compare the performance of the message-passing algorithm to that of the widespread blockwise hard decoding technique. Our Monte Carlo results using the five-qubit and Steane's code on a depolarizing channel demonstrate significant advantages of the message-passing algorithms in two respects: (i) Optimal decoding increases by as much as 94% the error threshold below which the error correction procedure can be used to reliably send information over a noisy channel; and (ii) for noise levels below these thresholds, the probability of error after optimal decoding is suppressed at a significantly higher rate, leading to a substantial reduction of the error correction overhead

  5. Distributed coding/decoding complexity in video sensor networks.

    Science.gov (United States)

    Cordeiro, Paulo J; Assunção, Pedro

    2012-01-01

    Video Sensor Networks (VSNs) are recent communication infrastructures used to capture and transmit dense visual information from an application context. In such large scale environments which include video coding, transmission and display/storage, there are several open problems to overcome in practical implementations. This paper addresses the most relevant challenges posed by VSNs, namely stringent bandwidth usage and processing time/power constraints. In particular, the paper proposes a novel VSN architecture where large sets of visual sensors with embedded processors are used for compression and transmission of coded streams to gateways, which in turn transrate the incoming streams and adapt them to the variable complexity requirements of both the sensor encoders and end-user decoder terminals. Such gateways provide real-time transcoding functionalities for bandwidth adaptation and coding/decoding complexity distribution by transferring the most complex video encoding/decoding tasks to the transcoding gateway at the expense of a limited increase in bit rate. Then, a method to reduce the decoding complexity, suitable for system-on-chip implementation, is proposed to operate at the transcoding gateway whenever decoders with constrained resources are targeted. The results show that the proposed method achieves good performance and its inclusion into the VSN infrastructure provides an additional level of complexity control functionality.

  6. On the intracellular trafficking of mouse S5 ribosomal protein from cytoplasm to nucleoli.

    Science.gov (United States)

    Matragkou, Ch; Papachristou, H; Karetsou, Z; Papadopoulos, G; Papamarcaki, T; Vizirianakis, I S; Tsiftsoglou, A S; Choli-Papadopoulou, T

    2009-10-09

    The non-ribosomal functions of mammalian ribosomal proteins have recently attracted worldwide attention. The mouse ribosomal protein S5 (rpS5) derived from ribosomal material is an assembled non-phosphorylated protein. The free form of rpS5 protein, however, undergoes phosphorylation. In this study, we have (a) investigated the potential role of phosphorylation in rpS5 protein transport into the nucleus and then into nucleoli and (b) determined which of the domains of rpS5 are involved in this intracellular trafficking. In vitro PCR mutagenesis of mouse rpS5 cDNA, complemented by subsequent cloning and expression of rpS5 truncated recombinant forms, produced in fusion with green fluorescent protein, permitted the investigation of rpS5 intracellular trafficking in HeLa cells using confocal microscopy complemented by Western blot analysis. Our results indicate the following: (a) rpS5 protein enters the nucleus via the region 38-50 aa that forms a random coil as revealed by molecular dynamic simulation. (b) Immunoprecipitation of rpS5 with casein kinase II and immobilized metal affinity chromatography analysis complemented by in vitro kinase assay revealed that phosphorylation of rpS5 seems to be indispensable for its transport from nucleus to nucleoli; upon entering the nucleus, Thr-133 phosphorylation triggers Ser-24 phosphorylation by casein kinase II, thus promoting entrance of rpS5 into the nucleoli. Another important role of rpS5 N-terminal region is proposed to be the regulation of protein's cellular level. The repetitively co-appearance of a satellite C-terminal band below the entire rpS5 at the late stationary phase, and not at the early logarithmic phase, of cell growth suggests a specific degradation balancing probably the unassembled ribosomal protein molecules with those that are efficiently assembled to ribosomal subunits. Overall, these data provide new insights on the structural and functional domains within the rpS5 molecule that contribute to its

  7. A comparative study of ribosomal proteins: linkage between amino acid distribution and ribosomal assembly

    International Nuclear Information System (INIS)

    Lott, Brittany Burton; Wang, Yongmei; Nakazato, Takuya

    2013-01-01

    Assembly of the ribosome from its protein and RNA constituents must occur quickly and efficiently in order to synthesize the proteins necessary for all cellular activity. Since the early 1960’s, certain characteristics of possible assembly pathways have been elucidated, yet the mechanisms that govern the precise recognition events remain unclear. We utilize a comparative analysis to investigate the amino acid composition of ribosomal proteins (r-proteins) with respect to their role in the assembly process. We compared small subunit (30S) r-protein sequences to those of other housekeeping proteins from 560 bacterial species and searched for correlations between r-protein amino acid content and factors such as assembly binding order, environmental growth temperature, protein size, and contact with ribosomal RNA (rRNA) in the 30S complex. We find r-proteins have a significantly high percent of positive residues, which are highly represented at rRNA contact sites. An inverse correlation between the percent of positive residues and r-protein size was identified and is mainly due to the content of Lysine residues, rather than Arginine. Nearly all r-proteins carry a net positive charge, but no statistical correlation between the net charge and the binding order was detected. Thermophilic (high-temperature) r-proteins contain increased Arginine, Isoleucine, and Tyrosine, and decreased Serine and Threonine compared to mesophilic (lower-temperature), reflecting a known distinction between thermophiles and mesophiles, possibly to account for protein thermostability. However, this difference in amino acid content does not extend to rRNA contact sites, as the proportions of thermophilic and mesophilic contact residues are not significantly different. Given the significantly higher level of positively charged residues in r-proteins and at contact sites, we conclude that ribosome assembly relies heavily on an electrostatic component of interaction. However, the binding order of

  8. Translational regulation of ribosomal protein S15 drives characteristic patterns of protein-mRNA epistasis.

    Science.gov (United States)

    Mallik, Saurav; Basu, Sudipto; Hait, Suman; Kundu, Sudip

    2018-04-21

    Do coding and regulatory segments of a gene co-evolve with each-other? Seeking answers to this question, here we analyze the case of Escherichia coli ribosomal protein S15, that represses its own translation by specifically binding its messenger RNA (rpsO mRNA) and stabilizing a pseudoknot structure at the upstream untranslated region, thus trapping the ribosome into an incomplete translation initiation complex. In the absence of S15, ribosomal protein S1 recognizes rpsO and promotes translation by melting this very pseudoknot. We employ a robust statistical method to detect signatures of positive epistasis between residue site pairs and find that biophysical constraints of translational regulation (S15-rpsO and S1-rpsO recognition, S15-mediated rpsO structural rearrangement, and S1-mediated melting) are strong predictors of positive epistasis. Transforming the epistatic pairs into a network, we find that signatures of two different, but interconnected regulatory cascades are imprinted in the sequence-space and can be captured in terms of two dense network modules that are sparsely connected to each other. This network topology further reflects a general principle of how functionally coupled components of biological networks are interconnected. These results depict a model case, where translational regulation drives characteristic residue-level epistasis-not only between a protein and its own mRNA but also between a protein and the mRNA of an entirely different protein. © 2018 Wiley Periodicals, Inc.

  9. On the control of ribosomal protein biosynthesis in Escherichia coli

    International Nuclear Information System (INIS)

    Pichon, J.; Marvaldi, J.; Coeroli, C.; Cozzone, A.; Marchis-Mouren, G.

    1977-01-01

    The rate of individual ribosomal protein synthesis relative to total protein synthesis has been determined in Escherichia coli rel + and rel - cells, under valyl-tRNA deprivation. These strains have a temperature-sensitive valyl-tRNA synthetase. Starvation was obtained following transfer of the cells to non-permissive temperature. Ribosomal proteins were obtained by treatment of either total lysates of freeze-thawed lysozyme spheroplasts or ammonium sulphate precipitate of ribosomes, with acetic acid. Differential labelling of the ribosomal proteins was observed in both strains: proteins from the rel + strain appear more labelled than those from the rel - strain, the rate of labelling of individual proteins being about the same in both strains. Moreover ribosomal proteins were found as stable during starvation as total protein. It is thus concluded that in starving cells individual ribosomal proteins are not synthesized at equal rates. This indicates that the synthesis of ribosomal proteins is not only under the control of the rel gene

  10. Post-transcriptional regulation of ribosome biogenesis in yeast

    Directory of Open Access Journals (Sweden)

    Isabelle C. Kos-Braun

    2017-05-01

    Full Text Available Most microorganisms are exposed to the constantly and often rapidly changing environment. As such they evolved mechanisms to balance their metabolism and energy expenditure with the resources available to them. When resources become scarce or conditions turn out to be unfavourable for growth, cells reduce their metabolism and energy usage to survive. One of the major energy consuming processes in the cell is ribosome biogenesis. Unsurprisingly, cells encountering adverse conditions immediately shut down production of new ribosomes. It is well established that nutrient depletion leads to a rapid repression of transcription of the genes encoding ribosomal proteins, ribosome biogenesis factors as well as ribosomal RNA (rRNA. However, if pre-rRNA processing and ribosome assembly are regulated post-transcriptionally remains largely unclear. We have recently uncovered that the yeast Saccharomyces cerevisiae rapidly switches between two alternative pre-rRNA processing pathways depending on the environmental conditions. Our findings reveal a new level of complexity in the regulation of ribosome biogenesis.

  11. Lexical decoder for continuous speech recognition: sequential neural network approach

    International Nuclear Information System (INIS)

    Iooss, Christine

    1991-01-01

    The work presented in this dissertation concerns the study of a connectionist architecture to treat sequential inputs. In this context, the model proposed by J.L. Elman, a recurrent multilayers network, is used. Its abilities and its limits are evaluated. Modifications are done in order to treat erroneous or noisy sequential inputs and to classify patterns. The application context of this study concerns the realisation of a lexical decoder for analytical multi-speakers continuous speech recognition. Lexical decoding is completed from lattices of phonemes which are obtained after an acoustic-phonetic decoding stage relying on a K Nearest Neighbors search technique. Test are done on sentences formed from a lexicon of 20 words. The results are obtained show the ability of the proposed connectionist model to take into account the sequentiality at the input level, to memorize the context and to treat noisy or erroneous inputs. (author) [fr

  12. Systolic array processing of the sequential decoding algorithm

    Science.gov (United States)

    Chang, C. Y.; Yao, K.

    1989-01-01

    A systolic array processing technique is applied to implementing the stack algorithm form of the sequential decoding algorithm. It is shown that sorting, a key function in the stack algorithm, can be efficiently realized by a special type of systolic arrays known as systolic priority queues. Compared to the stack-bucket algorithm, this approach is shown to have the advantages that the decoding always moves along the optimal path, that it has a fast and constant decoding speed and that its simple and regular hardware architecture is suitable for VLSI implementation. Three types of systolic priority queues are discussed: random access scheme, shift register scheme and ripple register scheme. The property of the entries stored in the systolic priority queue is also investigated. The results are applicable to many other basic sorting type problems.

  13. Analysis of Minimal LDPC Decoder System on a Chip Implementation

    Directory of Open Access Journals (Sweden)

    T. Palenik

    2015-09-01

    Full Text Available This paper presents a practical method of potential replacement of several different Quasi-Cyclic Low-Density Parity-Check (QC-LDPC codes with one, with the intention of saving as much memory as required to implement the LDPC encoder and decoder in a memory-constrained System on a Chip (SoC. The presented method requires only a very small modification of the existing encoder and decoder, making it suitable for utilization in a Software Defined Radio (SDR platform. Besides the analysis of the effects of necessary variable-node value fixation during the Belief Propagation (BP decoding algorithm, practical standard-defined code parameters are scrutinized in order to evaluate the feasibility of the proposed LDPC setup simplification. Finally, the error performance of the modified system structure is evaluated and compared with the original system structure by means of simulation.

  14. Analysis and Design of Binary Message-Passing Decoders

    DEFF Research Database (Denmark)

    Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard

    2012-01-01

    Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the L-value domain. A hard decision channel results...... message-passing decoders. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived....... in the well-know Gallager B algorithm, and increasing the output alphabet from hard decisions to two bits yields a gain of more than 1.0 dB in the required signal to noise ratio when using optimized codes. The code optimization requires adapting the mixing property of EXIT functions to the case of binary...

  15. Error-correction coding and decoding bounds, codes, decoders, analysis and applications

    CERN Document Server

    Tomlinson, Martin; Ambroze, Marcel A; Ahmed, Mohammed; Jibril, Mubarak

    2017-01-01

    This book discusses both the theory and practical applications of self-correcting data, commonly known as error-correcting codes. The applications included demonstrate the importance of these codes in a wide range of everyday technologies, from smartphones to secure communications and transactions. Written in a readily understandable style, the book presents the authors’ twenty-five years of research organized into five parts: Part I is concerned with the theoretical performance attainable by using error correcting codes to achieve communications efficiency in digital communications systems. Part II explores the construction of error-correcting codes and explains the different families of codes and how they are designed. Techniques are described for producing the very best codes. Part III addresses the analysis of low-density parity-check (LDPC) codes, primarily to calculate their stopping sets and low-weight codeword spectrum which determines the performance of these codes. Part IV deals with decoders desi...

  16. The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions

    Science.gov (United States)

    Reed, I. S.; Scholtz, R. A.; Welch, L. R.; Truong, T. K.

    1978-01-01

    It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields GF(F sub n), where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

  17. Joint Estimation and Decoding of Space-Time Trellis Codes

    Directory of Open Access Journals (Sweden)

    Zhang Jianqiu

    2002-01-01

    Full Text Available We explore the possibility of using an emerging tool in statistical signal processing, sequential importance sampling (SIS, for joint estimation and decoding of space-time trellis codes (STTC. First, we provide background on SIS, and then we discuss its application to space-time trellis code (STTC systems. It is shown through simulations that SIS is suitable for joint estimation and decoding of STTC with time-varying flat-fading channels when phase ambiguity is avoided. We used a design criterion for STTCs and temporally correlated channels that combats phase ambiguity without pilot signaling. We have shown by simulations that the design is valid.

  18. Efficient decoding of random errors for quantum expander codes

    OpenAIRE

    Fawzi , Omar; Grospellier , Antoine; Leverrier , Anthony

    2017-01-01

    We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Z\\'emor can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a linear number of random errors with a negligible failure probability. Finding codes with these properties is also motivated by Gottes...

  19. Min-Max decoding for non binary LDPC codes

    OpenAIRE

    Savin, Valentin

    2008-01-01

    Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is one of them and it has the benefit of two possible LLR domain implementations: a standard implementation, whose complexity scales as the square of the Galois field's cardinality and a reduced c...

  20. Decoding ensemble activity from neurophysiological recordings in the temporal cortex.

    Science.gov (United States)

    Kreiman, Gabriel

    2011-01-01

    We study subjects with pharmacologically intractable epilepsy who undergo semi-chronic implantation of electrodes for clinical purposes. We record physiological activity from tens to more than one hundred electrodes implanted in different parts of neocortex. These recordings provide higher spatial and temporal resolution than non-invasive measures of human brain activity. Here we discuss our efforts to develop hardware and algorithms to interact with the human brain by decoding ensemble activity in single trials. We focus our discussion on decoding visual information during a variety of visual object recognition tasks but the same technologies and algorithms can also be directly applied to other cognitive phenomena.

  1. Linear-time general decoding algorithm for the surface code

    Science.gov (United States)

    Darmawan, Andrew S.; Poulin, David

    2018-05-01

    A quantum error correcting protocol can be substantially improved by taking into account features of the physical noise process. We present an efficient decoder for the surface code which can account for general noise features, including coherences and correlations. We demonstrate that the decoder significantly outperforms the conventional matching algorithm on a variety of noise models, including non-Pauli noise and spatially correlated noise. The algorithm is based on an approximate calculation of the logical channel using a tensor-network description of the noisy state.

  2. Progressive Image Transmission Based on Joint Source-Channel Decoding Using Adaptive Sum-Product Algorithm

    Directory of Open Access Journals (Sweden)

    David G. Daut

    2007-03-01

    Full Text Available A joint source-channel decoding method is designed to accelerate the iterative log-domain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec making it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. The positions of bits belonging to error-free coding passes are then fed back to the channel decoder. The log-likelihood ratios (LLRs of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the nonsource controlled decoding method by up to 3 dB in terms of PSNR.

  3. Progressive Image Transmission Based on Joint Source-Channel Decoding Using Adaptive Sum-Product Algorithm

    Directory of Open Access Journals (Sweden)

    Liu Weiliang

    2007-01-01

    Full Text Available A joint source-channel decoding method is designed to accelerate the iterative log-domain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec making it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. The positions of bits belonging to error-free coding passes are then fed back to the channel decoder. The log-likelihood ratios (LLRs of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the nonsource controlled decoding method by up to 3 dB in terms of PSNR.

  4. Performance-complexity tradeoff in sequential decoding for the unconstrained AWGN channel

    KAUST Repository

    Abediseid, Walid; Alouini, Mohamed-Slim

    2013-01-01

    channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement

  5. Construction and decoding of matrix-product codes from nested codes

    DEFF Research Database (Denmark)

    Hernando, Fernando; Lally, Kristine; Ruano, Diego

    2009-01-01

    We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs  are nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm decodes up to half of the minimum distance....

  6. Adaptive decoding of MPEG-4 sprites for memory-constrained embedded systems

    NARCIS (Netherlands)

    Pastrnak, M.; Farin, D.S.; With, de P.H.N.; Cardinal, J.; Cerf, N.; Delgrnage, O.

    2005-01-01

    Background sprite decoding is an essential part of object-based video coding.The composition and rendering of a final scene involves the placing of individual video objects in a predefined way superimposed on the decoded background image. The MPEG-4 standard includes the decoding algorithm for

  7. TIF-IA-dependent regulation of ribosome synthesis in drosophila muscle is required to maintain systemic insulin signaling and larval growth.

    Directory of Open Access Journals (Sweden)

    Abhishek Ghosh

    2014-10-01

    Full Text Available The conserved TOR kinase signaling network links nutrient availability to cell, tissue and body growth in animals. One important growth-regulatory target of TOR signaling is ribosome biogenesis. Studies in yeast and mammalian cell culture have described how TOR controls rRNA synthesis-a limiting step in ribosome biogenesis-via the RNA Polymerase I transcription factor TIF-IA. However, the contribution of TOR-dependent ribosome synthesis to tissue and body growth in animals is less clear. Here we show in Drosophila larvae that ribosome synthesis in muscle is required non-autonomously to maintain normal body growth and development. We find that amino acid starvation and TOR inhibition lead to reduced levels of TIF-IA, and decreased rRNA synthesis in larval muscle. When we mimic this decrease in muscle ribosome synthesis using RNAi-mediated knockdown of TIF-IA, we observe delayed larval development and reduced body growth. This reduction in growth is caused by lowered systemic insulin signaling via two endocrine responses: reduced expression of Drosophila insulin-like peptides (dILPs from the brain and increased expression of Imp-L2-a secreted factor that binds and inhibits dILP activity-from muscle. We also observed that maintaining TIF-IA levels in muscle could partially reverse the starvation-mediated suppression of systemic insulin signaling. Finally, we show that activation of TOR specifically in muscle can increase overall body size and this effect requires TIF-IA function. These data suggest that muscle ribosome synthesis functions as a nutrient-dependent checkpoint for overall body growth: in nutrient rich conditions, TOR is required to maintain levels of TIF-IA and ribosome synthesis to promote high levels of systemic insulin, but under conditions of starvation stress, reduced muscle ribosome synthesis triggers an endocrine response that limits systemic insulin signaling to restrict growth and maintain homeostasis.

  8. Cisplatin Targeting of Bacterial Ribosomal RNA Hairpins

    Directory of Open Access Journals (Sweden)

    Gayani N. P. Dedduwa-Mudalige

    2015-09-01

    Full Text Available Cisplatin is a clinically important chemotherapeutic agent known to target purine bases in nucleic acids. In addition to major deoxyribonucleic acid (DNA intrastrand cross-links, cisplatin also forms stable adducts with many types of ribonucleic acid (RNA including siRNA, spliceosomal RNAs, tRNA, and rRNA. All of these RNAs play vital roles in the cell, such as catalysis of protein synthesis by rRNA, and therefore serve as potential drug targets. This work focused on platination of two highly conserved RNA hairpins from E. coli ribosomes, namely pseudouridine-modified helix 69 from 23S rRNA and the 790 loop of helix 24 from 16S rRNA. RNase T1 probing, MALDI mass spectrometry, and dimethyl sulfate mapping revealed platination at GpG sites. Chemical probing results also showed platination-induced RNA structural changes. These findings reveal solvent and structural accessibility of sites within bacterial RNA secondary structures that are functionally significant and therefore viable targets for cisplatin as well as other classes of small molecules. Identifying target preferences at the nucleotide level, as well as determining cisplatin-induced RNA conformational changes, is important for the design of more potent drug molecules. Furthermore, the knowledge gained through studies of RNA-targeting by cisplatin is applicable to a broad range of organisms from bacteria to human.

  9. Organization of Replication of Ribosomal DNA in Saccharomyces cerevisiae

    NARCIS (Netherlands)

    Linskens, Maarten H.K.; Huberman, Joel A.

    1988-01-01

    Using recently developed replicon mapping techniques, we have analyzed the replication of the ribosomal DNA in Saccharomyces cerevisiae. The results show that (i) the functional origin of replication colocalizes with an autonomously replicating sequence element previously mapped to the

  10. Ribosome slowed by mutation to streptomycin resistance. [Escherichia coli

    Energy Technology Data Exchange (ETDEWEB)

    Galas, D J; Branscomb, E W

    1976-08-12

    The effect of mutation to streptomycin resistance on the speed of polypeptide elongation in Escherichia coli was investigated. Translation speed was determined by measuring the time required for the first newly synthesized ..beta..-galactosidase molecules to appear after induction of the lactose operon. The results showed that ribosome speed is not a fixed parameter inherent to the protein synthetic apparatus, but a variable determined by the kinetics of translation and ultimately by the structure of the ribosome. (HLW)

  11. Defective ribosome assembly in Shwachman-Diamond syndrome.

    Science.gov (United States)

    Wong, Chi C; Traynor, David; Basse, Nicolas; Kay, Robert R; Warren, Alan J

    2011-10-20

    Shwachman-Diamond syndrome (SDS), a recessive leukemia predisposition disorder characterized by bone marrow failure, exocrine pancreatic insufficiency, skeletal abnormalities and poor growth, is caused by mutations in the highly conserved SBDS gene. Here, we test the hypothesis that defective ribosome biogenesis underlies the pathogenesis of SDS. We create conditional mutants in the essential SBDS ortholog of the ancient eukaryote Dictyostelium discoideum using temperature-sensitive, self-splicing inteins, showing that mutant cells fail to grow at the restrictive temperature because ribosomal subunit joining is markedly impaired. Remarkably, wild type human SBDS complements the growth and ribosome assembly defects in mutant Dictyostelium cells, but disease-associated human SBDS variants are defective. SBDS directly interacts with the GTPase elongation factor-like 1 (EFL1) on nascent 60S subunits in vivo and together they catalyze eviction of the ribosome antiassociation factor eukaryotic initiation factor 6 (eIF6), a prerequisite for the translational activation of ribosomes. Importantly, lymphoblasts from SDS patients harbor a striking defect in ribosomal subunit joining whose magnitude is inversely proportional to the level of SBDS protein. These findings in Dictyostelium and SDS patient cells provide compelling support for the hypothesis that SDS is a ribosomopathy caused by corruption of an essential cytoplasmic step in 60S subunit maturation.

  12. Emerging functions of ribosomal proteins in gene-specific transcription and translation

    International Nuclear Information System (INIS)

    Lindstroem, Mikael S.

    2009-01-01

    Ribosomal proteins have remained highly conserved during evolution presumably reflecting often critical functions in ribosome biogenesis or mature ribosome function. In addition, several ribosomal proteins possess distinct extra-ribosomal functions in apoptosis, DNA repair and transcription. An increasing number of ribosomal proteins have been shown to modulate the trans-activation function of important regulatory proteins such as NF-κB, p53, c-Myc and nuclear receptors. Furthermore, a subset of ribosomal proteins can bind directly to untranslated regions of mRNA resulting in transcript-specific translational control outside of the ribosome itself. Collectively, these findings suggest that ribosomal proteins may have a wider functional repertoire within the cell than previously thought. The future challenge is to identify and validate these novel functions in the background of an often essential primary function in ribosome biogenesis and cell growth.

  13. Fluctuations between multiple EF-G-induced chimeric tRNA states during translocation on the ribosome

    Science.gov (United States)

    Adio, Sarah; Senyushkina, Tamara; Peske, Frank; Fischer, Niels; Wintermeyer, Wolfgang; Rodnina, Marina V.

    2015-06-01

    The coupled translocation of transfer RNA and messenger RNA through the ribosome entails large-scale structural rearrangements, including step-wise movements of the tRNAs. Recent structural work has visualized intermediates of translocation induced by elongation factor G (EF-G) with tRNAs trapped in chimeric states with respect to 30S and 50S ribosomal subunits. The functional role of the chimeric states is not known. Here we follow the formation of translocation intermediates by single-molecule fluorescence resonance energy transfer. Using EF-G mutants, a non-hydrolysable GTP analogue, and fusidic acid, we interfere with either translocation or EF-G release from the ribosome and identify several rapidly interconverting chimeric tRNA states on the reaction pathway. EF-G engagement prevents backward transitions early in translocation and increases the fraction of ribosomes that rapidly fluctuate between hybrid, chimeric and posttranslocation states. Thus, the engagement of EF-G alters the energetics of translocation towards a flat energy landscape, thereby promoting forward tRNA movement.

  14. Decoding sound level in the marmoset primary auditory cortex.

    Science.gov (United States)

    Sun, Wensheng; Marongelli, Ellisha N; Watkins, Paul V; Barbour, Dennis L

    2017-10-01

    Neurons that respond favorably to a particular sound level have been observed throughout the central auditory system, becoming steadily more common at higher processing areas. One theory about the role of these level-tuned or nonmonotonic neurons is the level-invariant encoding of sounds. To investigate this theory, we simulated various subpopulations of neurons by drawing from real primary auditory cortex (A1) neuron responses and surveyed their performance in forming different sound level representations. Pure nonmonotonic subpopulations did not provide the best level-invariant decoding; instead, mixtures of monotonic and nonmonotonic neurons provided the most accurate decoding. For level-fidelity decoding, the inclusion of nonmonotonic neurons slightly improved or did not change decoding accuracy until they constituted a high proportion. These results indicate that nonmonotonic neurons fill an encoding role complementary to, rather than alternate to, monotonic neurons. NEW & NOTEWORTHY Neurons with nonmonotonic rate-level functions are unique to the central auditory system. These level-tuned neurons have been proposed to account for invariant sound perception across sound levels. Through systematic simulations based on real neuron responses, this study shows that neuron populations perform sound encoding optimally when containing both monotonic and nonmonotonic neurons. The results indicate that instead of working independently, nonmonotonic neurons complement the function of monotonic neurons in different sound-encoding contexts. Copyright © 2017 the American Physiological Society.

  15. Complete ML Decoding orf the (73,45) PG Code

    DEFF Research Database (Denmark)

    Justesen, Jørn; Høholdt, Tom; Hjaltason, Johan

    2005-01-01

    Our recent proof of the completeness of decoding by list bit flipping is reviewed. The proof is based on an enumeration of all cosets of low weight in terms of their minimum weight and syndrome weight. By using a geometric description of the error patterns we characterize all remaining cosets....

  16. Decoding Representations: How Children with Autism Understand Drawings

    Science.gov (United States)

    Allen, Melissa L.

    2009-01-01

    Young typically developing children can reason about abstract depictions if they know the intention of the artist. Children with autism spectrum disorder (ASD), who are notably impaired in social, "intention monitoring" domains, may have great difficulty in decoding vague representations. In Experiment 1, children with ASD are unable to use…

  17. A quantum algorithm for Viterbi decoding of classical convolutional codes

    Science.gov (United States)

    Grice, Jon R.; Meyer, David A.

    2015-07-01

    We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper, the proposed algorithm is applied to decoding classical convolutional codes, for instance, large constraint length and short decode frames . Other applications of the classical Viterbi algorithm where is large (e.g., speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butterfly diagram of the fast Fourier transform, with its corresponding fast quantum algorithm. The tensor-product structure of the butterfly diagram corresponds to a quantum superposition that we show can be efficiently prepared. The quantum speedup is possible because the performance of the QVA depends on the fanout (number of possible transitions from any given state in the hidden Markov model) which is in general much less than . The QVA constructs a superposition of states which correspond to all legal paths through the decoding lattice, with phase as a function of the probability of the path being taken given received data. A specialized amplitude amplification procedure is applied one or more times to recover a superposition where the most probable path has a high probability of being measured.

  18. The Fluid Reading Primer: Animated Decoding Support for Emergent Readers.

    Science.gov (United States)

    Zellweger, Polle T.; Mackinlay, Jock D.

    A prototype application called the Fluid Reading Primer was developed to help emergent readers with the process of decoding written words into their spoken forms. The Fluid Reading Primer is part of a larger research project called Fluid Documents, which is exploring the use of interactive animation of typography to show additional information in…

  19. Adaptive Combined Source and Channel Decoding with Modulation ...

    African Journals Online (AJOL)

    In this paper, an adaptive system employing combined source and channel decoding with modulation is proposed for slow Rayleigh fading channels. Huffman code is used as the source code and Convolutional code is used for error control. The adaptive scheme employs a family of Convolutional codes of different rates ...

  20. Tracking Perceptual and Memory Decisions by Decoding Brain Activity

    NARCIS (Netherlands)

    van Vugt, Marieke; Brandt, Armin; Schulze-Bonhage, Andreas

    2017-01-01

    Decision making is thought to involve a process of evidence accumulation, modelled as a drifting diffusion process. This modeling framework suggests that all single-stage decisions involve a similar evidence accumulation process. In this paper we use decoding by machine learning classifiers on

  1. Peeling Decoding of LDPC Codes with Applications in Compressed Sensing

    Directory of Open Access Journals (Sweden)

    Weijun Zeng

    2016-01-01

    Full Text Available We present a new approach for the analysis of iterative peeling decoding recovery algorithms in the context of Low-Density Parity-Check (LDPC codes and compressed sensing. The iterative recovery algorithm is particularly interesting for its low measurement cost and low computational complexity. The asymptotic analysis can track the evolution of the fraction of unrecovered signal elements in each iteration, which is similar to the well-known density evolution analysis in the context of LDPC decoding algorithm. Our analysis shows that there exists a threshold on the density factor; if under this threshold, the recovery algorithm is successful; otherwise it will fail. Simulation results are also provided for verifying the agreement between the proposed asymptotic analysis and recovery algorithm. Compared with existing works of peeling decoding algorithm, focusing on the failure probability of the recovery algorithm, our proposed approach gives accurate evolution of performance with different parameters of measurement matrices and is easy to implement. We also show that the peeling decoding algorithm performs better than other schemes based on LDPC codes.

  2. High-throughput GPU-based LDPC decoding

    Science.gov (United States)

    Chang, Yang-Lang; Chang, Cheng-Chun; Huang, Min-Yu; Huang, Bormin

    2010-08-01

    Low-density parity-check (LDPC) code is a linear block code known to approach the Shannon limit via the iterative sum-product algorithm. LDPC codes have been adopted in most current communication systems such as DVB-S2, WiMAX, WI-FI and 10GBASE-T. LDPC for the needs of reliable and flexible communication links for a wide variety of communication standards and configurations have inspired the demand for high-performance and flexibility computing. Accordingly, finding a fast and reconfigurable developing platform for designing the high-throughput LDPC decoder has become important especially for rapidly changing communication standards and configurations. In this paper, a new graphic-processing-unit (GPU) LDPC decoding platform with the asynchronous data transfer is proposed to realize this practical implementation. Experimental results showed that the proposed GPU-based decoder achieved 271x speedup compared to its CPU-based counterpart. It can serve as a high-throughput LDPC decoder.

  3. Real Time Decoding of Color Symbol for Optical Positioning System

    Directory of Open Access Journals (Sweden)

    Abdul Waheed Malik

    2015-01-01

    Full Text Available This paper presents the design and real-time decoding of a color symbol that can be used as a reference marker for optical navigation. The designed symbol has a circular shape and is printed on paper using two distinct colors. This pair of colors is selected based on the highest achievable signal to noise ratio. The symbol is designed to carry eight bit information. Real time decoding of this symbol is performed using a heterogeneous combination of Field Programmable Gate Array (FPGA and a microcontroller. An image sensor having a resolution of 1600 by 1200 pixels is used to capture images of symbols in complex backgrounds. Dynamic image segmentation, component labeling and feature extraction was performed on the FPGA. The region of interest was further computed from the extracted features. Feature data belonging to the symbol was sent from the FPGA to the microcontroller. Image processing tasks are partitioned between the FPGA and microcontroller based on data intensity. Experiments were performed to verify the rotational independence of the symbols. The maximum distance between camera and symbol allowing for correct detection and decoding was analyzed. Experiments were also performed to analyze the number of generated image components and sub-pixel precision versus different light sources and intensities. The proposed hardware architecture can process up to 55 frames per second for accurate detection and decoding of symbols at two Megapixels resolution. The power consumption of the complete system is 342mw.

  4. Fast decoding of codes from algebraic plane curves

    DEFF Research Database (Denmark)

    Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd

    1992-01-01

    Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve the authors correct up to d*/2-m2 /8+m/4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding...

  5. Name that tune: decoding music from the listening brain.

    NARCIS (Netherlands)

    Schaefer, R.S.; Farquhar, J.D.R.; Blokland, Y.M.; Sadakata, M.; Desain, P.W.M.

    2011-01-01

    In the current study we use electroencephalography (EEG) to detect heard music from the brain signal, hypothesizing that the time structure in music makes it especially suitable for decoding perception from EEG signals. While excluding music with vocals, we classified the perception of seven

  6. Name that tune: Decoding music from the listening brain

    NARCIS (Netherlands)

    Schaefer, R.S.; Farquhar, J.D.R.; Blokland, Y.M.; Sadakata, M.; Desain, P.W.M.

    2011-01-01

    In the current study we use electroencephalography (EEG) to detect heard music from the brain signal, hypothesizing that the time structure in music makes it especially suitable for decoding perception from EEG signals. While excluding music with vocals, we classified the perception of seven

  7. Decoding English Alphabet Letters Using EEG Phase Information

    Directory of Open Access Journals (Sweden)

    YiYan Wang

    2018-02-01

    Full Text Available Increasing evidence indicates that the phase pattern and power of the low frequency oscillations of brain electroencephalograms (EEG contain significant information during the human cognition of sensory signals such as auditory and visual stimuli. Here, we investigate whether and how the letters of the alphabet can be directly decoded from EEG phase and power data. In addition, we investigate how different band oscillations contribute to the classification and determine the critical time periods. An English letter recognition task was assigned, and statistical analyses were conducted to decode the EEG signal corresponding to each letter visualized on a computer screen. We applied support vector machine (SVM with gradient descent method to learn the potential features for classification. It was observed that the EEG phase signals have a higher decoding accuracy than the oscillation power information. Low-frequency theta and alpha oscillations have phase information with higher accuracy than do other bands. The decoding performance was best when the analysis period began from 180 to 380 ms after stimulus presentation, especially in the lateral occipital and posterior temporal scalp regions (PO7 and PO8. These results may provide a new approach for brain-computer interface techniques (BCI and may deepen our understanding of EEG oscillations in cognition.

  8. O2-GIDNC: Beyond instantly decodable network coding

    KAUST Repository

    Aboutorab, Neda; Sorour, Sameh; Sadeghi, Parastoo

    2013-01-01

    In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC

  9. EEG source imaging assists decoding in a face recognition task

    DEFF Research Database (Denmark)

    Andersen, Rasmus S.; Eliasen, Anders U.; Pedersen, Nicolai

    2017-01-01

    of face recognition. This task concerns the differentiation of brain responses to images of faces and scrambled faces and poses a rather difficult decoding problem at the single trial level. We implement the pipeline using spatially focused features and show that this approach is challenged and source...

  10. LDPC-based iterative joint source-channel decoding for JPEG2000.

    Science.gov (United States)

    Pu, Lingling; Wu, Zhenyu; Bilgin, Ali; Marcellin, Michael W; Vasic, Bane

    2007-02-01

    A framework is proposed for iterative joint source-channel decoding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to perform source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ER modes to identify corrupt sections of the codestream and provides this information to the channel decoder. Decoding is carried out jointly in an iterative fashion. Experimental results indicate that the proposed method requires fewer iterations and improves overall system performance.

  11. On Lattice Sequential Decoding for Large MIMO Systems

    KAUST Repository

    Ali, Konpal S.

    2014-04-01

    Due to their ability to provide high data rates, Multiple-Input Multiple-Output (MIMO) wireless communication systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In the case of large overdetermined MIMO systems, we employ the Sequential Decoder using the Fano Algorithm. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity and vice versa for higher bias values. We attempt to bound the error by bounding the bias, using the minimum distance of a lattice. Also, a particular trend is observed with increasing SNR: a region of low complexity and high error, followed by a region of high complexity and error falling, and finally a region of low complexity and low error. For lower bias values, the stages of the trend are incurred at lower SNR than for higher bias values. This has the important implication that a low enough bias value, at low to moderate SNR, can result in low error and low complexity even for large MIMO systems. Our work is compared against Lattice Reduction (LR) aided Linear Decoders (LDs). Another impressive observation for low bias values that satisfy the error bound is that the Sequential Decoder\\'s error is seen to fall with increasing system size, while it grows for the LR-aided LDs. For the case of large underdetermined MIMO systems, Sequential Decoding with two preprocessing schemes is proposed – 1) Minimum Mean Square Error Generalized Decision Feedback Equalization (MMSE-GDFE) preprocessing 2) MMSE-GDFE preprocessing, followed by Lattice Reduction and Greedy Ordering. Our work is compared against previous work which employs Sphere Decoding preprocessed using MMSE-GDFE, Lattice Reduction and Greedy Ordering. For the case of large systems, this results in high complexity and difficulty in choosing the sphere radius. Our schemes

  12. RINT-1 interacts with MSP58 within nucleoli and plays a role in ribosomal gene transcription.

    Science.gov (United States)

    Yang, Chuan-Pin; Kuo, Yu-Liang; Lee, Yi-Chao; Lee, Kuen-Haur; Chiang, Chi-Wu; Wang, Ju-Ming; Hsu, Che-Chia; Chang, Wen-Chang; Lin, Ding-Yen

    2016-09-16

    The nucleolus is the cellular site of ribosomal (r)DNA transcription and ribosome biogenesis. The 58-kDa microspherule protein (MSP58) is a nucleolar protein involved in rDNA transcription and cell proliferation. However, regulation of MSP58-mediated rDNA transcription remains unknown. Using a yeast two-hybrid system with MSP58 as bait, we isolated complementary (c)DNA encoding Rad50-interacting protein 1 (RINT-1), as a MSP58-binding protein. RINT-1 was implicated in the cell cycle checkpoint, membrane trafficking, Golgi apparatus and centrosome dynamic integrity, and telomere length control. Both in vitro and in vivo interaction assays showed that MSP58 directly interacts with RINT-1. Interestingly, microscopic studies revealed the co-localization of MSP58, RINT-1, and the upstream binding factor (UBF), a rRNA transcription factor, in the nucleolus. We showed that ectopic expression of MSP58 or RINT-1 resulted in decreased rRNA expression and rDNA promoter activity, whereas knockdown of MSP58 or RINT-1 by siRNA exerted the opposite effect. Coexpression of MSP58 and RINT-1 robustly decreased rRNA synthesis compared to overexpression of either protein alone, whereas depletion of RINT-1 from MSP58-transfected cells enhanced rRNA synthesis. We also found that MSP58, RINT-1, and the UBF were associated with the rDNA promoter using a chromatin immunoprecipitation assay. Because aberrant ribosome biogenesis contributes to neoplastic transformation, our results revealed a novel protein complex involved in the regulation of rRNA gene expression, suggesting a role for MSP58 and RINT-1 in cancer development. Copyright © 2016 Elsevier Inc. All rights reserved.

  13. Multi-stage decoding for multi-level block modulation codes

    Science.gov (United States)

    Lin, Shu

    1991-01-01

    In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. Based on our study and computation results, we find that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. In particular, we find that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum decoding of the overall code is very small: only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.

  14. Real-time SHVC software decoding with multi-threaded parallel processing

    Science.gov (United States)

    Gudumasu, Srinivas; He, Yuwen; Ye, Yan; He, Yong; Ryu, Eun-Seok; Dong, Jie; Xiu, Xiaoyu

    2014-09-01

    This paper proposes a parallel decoding framework for scalable HEVC (SHVC). Various optimization technologies are implemented on the basis of SHVC reference software SHM-2.0 to achieve real-time decoding speed for the two layer spatial scalability configuration. SHVC decoder complexity is analyzed with profiling information. The decoding process at each layer and the up-sampling process are designed in parallel and scheduled by a high level application task manager. Within each layer, multi-threaded decoding is applied to accelerate the layer decoding speed. Entropy decoding, reconstruction, and in-loop processing are pipeline designed with multiple threads based on groups of coding tree units (CTU). A group of CTUs is treated as a processing unit in each pipeline stage to achieve a better trade-off between parallelism and synchronization. Motion compensation, inverse quantization, and inverse transform modules are further optimized with SSE4 SIMD instructions. Simulations on a desktop with an Intel i7 processor 2600 running at 3.4 GHz show that the parallel SHVC software decoder is able to decode 1080p spatial 2x at up to 60 fps (frames per second) and 1080p spatial 1.5x at up to 50 fps for those bitstreams generated with SHVC common test conditions in the JCT-VC standardization group. The decoding performance at various bitrates with different optimization technologies and different numbers of threads are compared in terms of decoding speed and resource usage, including processor and memory.

  15. Decoding bipedal locomotion from the rat sensorimotor cortex

    Science.gov (United States)

    Rigosa, J.; Panarese, A.; Dominici, N.; Friedli, L.; van den Brand, R.; Carpaneto, J.; DiGiovanna, J.; Courtine, G.; Micera, S.

    2015-10-01

    Objective. Decoding forelimb movements from the firing activity of cortical neurons has been interfaced with robotic and prosthetic systems to replace lost upper limb functions in humans. Despite the potential of this approach to improve locomotion and facilitate gait rehabilitation, decoding lower limb movement from the motor cortex has received comparatively little attention. Here, we performed experiments to identify the type and amount of information that can be decoded from neuronal ensemble activity in the hindlimb area of the rat motor cortex during bipedal locomotor tasks. Approach. Rats were trained to stand, step on a treadmill, walk overground and climb staircases in a bipedal posture. To impose this gait, the rats were secured in a robotic interface that provided support against the direction of gravity and in the mediolateral direction, but behaved transparently in the forward direction. After completion of training, rats were chronically implanted with a micro-wire array spanning the left hindlimb motor cortex to record single and multi-unit activity, and bipolar electrodes into 10 muscles of the right hindlimb to monitor electromyographic signals. Whole-body kinematics, muscle activity, and neural signals were simultaneously recorded during execution of the trained tasks over multiple days of testing. Hindlimb kinematics, muscle activity, gait phases, and locomotor tasks were decoded using offline classification algorithms. Main results. We found that the stance and swing phases of gait and the locomotor tasks were detected with accuracies as robust as 90% in all rats. Decoded hindlimb kinematics and muscle activity exhibited a larger variability across rats and tasks. Significance. Our study shows that the rodent motor cortex contains useful information for lower limb neuroprosthetic development. However, brain-machine interfaces estimating gait phases or locomotor behaviors, instead of continuous variables such as limb joint positions or speeds

  16. Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes

    Directory of Open Access Journals (Sweden)

    BOT, A.

    2013-11-01

    Full Text Available The paper proposes a low complexity belief propagation (BP based decoding algorithm for LDPC codes. In spite of the iterative nature of the decoding process, the proposed algorithm provides both reduced complexity and increased BER performances as compared with the classic min-sum (MS algorithm, generally used for hardware implementations. Linear approximations of check-nodes update function are used in order to reduce the complexity of the BP algorithm. Considering this decoding approach, an FPGA based hardware architecture is proposed for implementing the decoding algorithm, aiming to increase the decoder throughput. FPGA technology was chosen for the LDPC decoder implementation, due to its parallel computation and reconfiguration capabilities. The obtained results show improvements regarding decoding throughput and BER performances compared with state-of-the-art approaches.

  17. Low Power LDPC Code Decoder Architecture Based on Intermediate Message Compression Technique

    Science.gov (United States)

    Shimizu, Kazunori; Togawa, Nozomu; Ikenaga, Takeshi; Goto, Satoshi

    Reducing the power dissipation for LDPC code decoder is a major challenging task to apply it to the practical digital communication systems. In this paper, we propose a low power LDPC code decoder architecture based on an intermediate message-compression technique which features as follows: (i) An intermediate message compression technique enables the decoder to reduce the required memory capacity and write power dissipation. (ii) A clock gated shift register based intermediate message memory architecture enables the decoder to decompress the compressed messages in a single clock cycle while reducing the read power dissipation. The combination of the above two techniques enables the decoder to reduce the power dissipation while keeping the decoding throughput. The simulation results show that the proposed architecture improves the power efficiency up to 52% and 18% compared to that of the decoder based on the overlapped schedule and the rapid convergence schedule without the proposed techniques respectively.

  18. Design of FBG En/decoders in Coherent 2-D Time-polarization OCDMA Systems

    Science.gov (United States)

    Hou, Fen-fei; Yang, Ming

    2012-12-01

    A novel fiber Bragg grating (FBG)-based en/decoder for the two-dimensional (2-D) time-spreading and polarization multiplexer optical coding is proposed. Compared with other 2-D en/decoders, the proposed en/decoding for an optical code-division multiple-access (OCDMA) system uses a single phase-encoded FBG and coherent en/decoding. Furthermore, combined with reconstruction-equivalent-chirp technology, such en/decoders can be realized with a conventional simple fabrication setup. Experimental results of such en/decoders and the corresponding system test at a data rate of 5 Gbit/s demonstrate that this kind of 2-D FBG-based en/decoders could improve the performances of OCDMA systems.

  19. Effect of sodium fluoride on the amount of polyribosomes, single ribosomes and ribosomal subunits in a cellular slime mold, Dictyostelium discoideum

    Energy Technology Data Exchange (ETDEWEB)

    Sameshima, M; Ito, K; Iwabuchi, M

    1972-01-01

    In the slime mold, Dictyostelium discoideum, when the rate of protein synthesis was decreased by NaF, free 80-S ribosomes accumulated at the expense of polyribosomes, while 60-S and 40-S ribosomal subunits remained almost constant. The same level of ribosomal subunits was also maintained in cells after incubation with cycloheximide or at the stationary phase of growth.

  20. Decoding the genome with an integrative analysis tool: combinatorial CRM Decoder.

    Science.gov (United States)

    Kang, Keunsoo; Kim, Joomyeong; Chung, Jae Hoon; Lee, Daeyoup

    2011-09-01

    The identification of genome-wide cis-regulatory modules (CRMs) and characterization of their associated epigenetic features are fundamental steps toward the understanding of gene regulatory networks. Although integrative analysis of available genome-wide information can provide new biological insights, the lack of novel methodologies has become a major bottleneck. Here, we present a comprehensive analysis tool called combinatorial CRM decoder (CCD), which utilizes the publicly available information to identify and characterize genome-wide CRMs in a species of interest. CCD first defines a set of the epigenetic features which is significantly associated with a set of known CRMs as a code called 'trace code', and subsequently uses the trace code to pinpoint putative CRMs throughout the genome. Using 61 genome-wide data sets obtained from 17 independent mouse studies, CCD successfully catalogued ∼12 600 CRMs (five distinct classes) including polycomb repressive complex 2 target sites as well as imprinting control regions. Interestingly, we discovered that ∼4% of the identified CRMs belong to at least two different classes named 'multi-functional CRM', suggesting their functional importance for regulating spatiotemporal gene expression. From these examples, we show that CCD can be applied to any potential genome-wide datasets and therefore will shed light on unveiling genome-wide CRMs in various species.

  1. DNA replication initiator Cdc6 also regulates ribosomal DNA transcription initiation.

    Science.gov (United States)

    Huang, Shijiao; Xu, Xiaowei; Wang, Guopeng; Lu, Guoliang; Xie, Wenbing; Tao, Wei; Zhang, Hongyin; Jiang, Qing; Zhang, Chuanmao

    2016-04-01

    RNA-polymerase-I-dependent ribosomal DNA (rDNA) transcription is fundamental to rRNA processing, ribosome assembly and protein synthesis. However, how this process is initiated during the cell cycle is not fully understood. By performing a proteomic analysis of transcription factors that bind RNA polymerase I during rDNA transcription initiation, we identified that the DNA replication initiator Cdc6 interacts with RNA polymerase I and its co-factors, and promotes rDNA transcription in G1 phase in an ATPase-activity-dependent manner. We further showed that Cdc6 is targeted to the nucleolus during late mitosis and G1 phase in a manner that is dependent on B23 (also known as nucleophosmin, NPM1), and preferentially binds to the rDNA promoter through its ATP-binding domain. Overexpression of Cdc6 increases rDNA transcription, whereas knockdown of Cdc6 results in a decreased association of both RNA polymerase I and the RNA polymerase I transcription factor RRN3 with rDNA, and a reduction of rDNA transcription. Furthermore, depletion of Cdc6 impairs the interaction between RRN3 and RNA polymerase I. Taken together, our data demonstrate that Cdc6 also serves as a regulator of rDNA transcription initiation, and indicate a mechanism by which initiation of rDNA transcription and DNA replication can be coordinated in cells. © 2016. Published by The Company of Biologists Ltd.

  2. Ribosome. The complete structure of the 55S mammalian mitochondrial ribosome.

    Science.gov (United States)

    Greber, Basil J; Bieri, Philipp; Leibundgut, Marc; Leitner, Alexander; Aebersold, Ruedi; Boehringer, Daniel; Ban, Nenad

    2015-04-17

    Mammalian mitochondrial ribosomes (mitoribosomes) synthesize mitochondrially encoded membrane proteins that are critical for mitochondrial function. Here we present the complete atomic structure of the porcine 55S mitoribosome at 3.8 angstrom resolution by cryo-electron microscopy and chemical cross-linking/mass spectrometry. The structure of the 28S subunit in the complex was resolved at 3.6 angstrom resolution by focused alignment, which allowed building of a detailed atomic structure including all of its 15 mitoribosomal-specific proteins. The structure reveals the intersubunit contacts in the 55S mitoribosome, the molecular architecture of the mitoribosomal messenger RNA (mRNA) binding channel and its interaction with transfer RNAs, and provides insight into the highly specialized mechanism of mRNA recruitment to the 28S subunit. Furthermore, the structure contributes to a mechanistic understanding of aminoglycoside ototoxicity. Copyright © 2015, American Association for the Advancement of Science.

  3. Ribosomes slide on lysine-encoding homopolymeric A stretches

    Science.gov (United States)

    Koutmou, Kristin S; Schuller, Anthony P; Brunelle, Julie L; Radhakrishnan, Aditya; Djuranovic, Sergej; Green, Rachel

    2015-01-01

    Protein output from synonymous codons is thought to be equivalent if appropriate tRNAs are sufficiently abundant. Here we show that mRNAs encoding iterated lysine codons, AAA or AAG, differentially impact protein synthesis: insertion of iterated AAA codons into an ORF diminishes protein expression more than insertion of synonymous AAG codons. Kinetic studies in E. coli reveal that differential protein production results from pausing on consecutive AAA-lysines followed by ribosome sliding on homopolymeric A sequence. Translation in a cell-free expression system demonstrates that diminished output from AAA-codon-containing reporters results from premature translation termination on out of frame stop codons following ribosome sliding. In eukaryotes, these premature termination events target the mRNAs for Nonsense-Mediated-Decay (NMD). The finding that ribosomes slide on homopolymeric A sequences explains bioinformatic analyses indicating that consecutive AAA codons are under-represented in gene-coding sequences. Ribosome ‘sliding’ represents an unexpected type of ribosome movement possible during translation. DOI: http://dx.doi.org/10.7554/eLife.05534.001 PMID:25695637

  4. The Phosphorylation of Ribosomal Protein in Lemna minor

    Science.gov (United States)

    Trewavas, A.

    1973-01-01

    Sterile cultures of Lemna minor have been labeled with 32P1, and the ribosomal proteins have been examined for radioactivity. In relatively short term labeling a radioactive protein was found which ran as a single component in both urea/acetic acid and sodium lauryl sulfate gel electrophoresis. Acid hydrolysis of the labeled protein permitted the isolation of serine phosphate. After labeling to equilibrium with 32P1, calculation indicated only 0.6 to 0.75 atom of this protein phosphorus per ribosome. The phosphorylated protein is found in both polysomes and “derived” monomers and appears to be located in the ribosomal small subunit. Its apparent molecular weight is 42,000. Addition of growth-inhibiting concentrations of abscisic acid does not alter the apparent degree of labeling of this protein in 5 hours, but after 24 hours of treatment the total protein phosphorus was reduced from 0.75 atom of phosphorus per ribosome to 0.36 atom of phosphorus per ribosome. PMID:16658405

  5. Performance-complexity tradeoff in sequential decoding for the unconstrained AWGN channel

    KAUST Repository

    Abediseid, Walid

    2013-06-01

    In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter - the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity. © 2013 IEEE.

  6. Achievable Information Rates for Coded Modulation With Hard Decision Decoding for Coherent Fiber-Optic Systems

    Science.gov (United States)

    Sheikh, Alireza; Amat, Alexandre Graell i.; Liva, Gianluigi

    2017-12-01

    We analyze the achievable information rates (AIRs) for coded modulation schemes with QAM constellations with both bit-wise and symbol-wise decoders, corresponding to the case where a binary code is used in combination with a higher-order modulation using the bit-interleaved coded modulation (BICM) paradigm and to the case where a nonbinary code over a field matched to the constellation size is used, respectively. In particular, we consider hard decision decoding, which is the preferable option for fiber-optic communication systems where decoding complexity is a concern. Recently, Liga \\emph{et al.} analyzed the AIRs for bit-wise and symbol-wise decoders considering what the authors called \\emph{hard decision decoder} which, however, exploits \\emph{soft information} of the transition probabilities of discrete-input discrete-output channel resulting from the hard detection. As such, the complexity of the decoder is essentially the same as the complexity of a soft decision decoder. In this paper, we analyze instead the AIRs for the standard hard decision decoder, commonly used in practice, where the decoding is based on the Hamming distance metric. We show that if standard hard decision decoding is used, bit-wise decoders yield significantly higher AIRs than symbol-wise decoders. As a result, contrary to the conclusion by Liga \\emph{et al.}, binary decoders together with the BICM paradigm are preferable for spectrally-efficient fiber-optic systems. We also design binary and nonbinary staircase codes and show that, in agreement with the AIRs, binary codes yield better performance.

  7. STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM

    Directory of Open Access Journals (Sweden)

    H. Prashantha Kumar

    2012-03-01

    Full Text Available The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decoding of block codes using tree structure. Many good block codes are presently known. Several of them have been used in applications ranging from deep space communication to error control in storage systems. But the primary difficulty with applying Viterbi or BCJR algorithms to decode of block codes is that, even though they are optimum decoding methods, the promised bit error rates are not achieved in practice at data rates close to capacity. This is because the decoding effort is fixed and grows with block length, and thus only short block length codes can be used. Therefore, an important practical question is whether a suboptimal realizable soft decision decoding method can be found for block codes. A noteworthy result which provides a partial answer to this question is described in the following sections. This result of near optimum decoding will be used as motivation for the investigation of different soft decision decoding methods for linear block codes which can lead to the development of efficient decoding algorithms. The code tree can be treated as an expanded version of the trellis, where every path is totally distinct from every other path. We have derived the tree structure for (8, 4 and (16, 11 extended Hamming codes and have succeeded in implementing the soft decision stack algorithm to decode them. For the discrete memoryless channel, gains in excess of 1.5dB at a bit error rate of 10-5 with respect to conventional hard decision decoding are demonstrated for these codes.

  8. Decoding thalamic afferent input using microcircuit spiking activity.

    Science.gov (United States)

    Sederberg, Audrey J; Palmer, Stephanie E; MacLean, Jason N

    2015-04-01

    A behavioral response appropriate to a sensory stimulus depends on the collective activity of thousands of interconnected neurons. The majority of cortical connections arise from neighboring neurons, and thus understanding the cortical code requires characterizing information representation at the scale of the cortical microcircuit. Using two-photon calcium imaging, we densely sampled the thalamically evoked response of hundreds of neurons spanning multiple layers and columns in thalamocortical slices of mouse somatosensory cortex. We then used a biologically plausible decoder to characterize the representation of two distinct thalamic inputs, at the level of the microcircuit, to reveal those aspects of the activity pattern that are likely relevant to downstream neurons. Our data suggest a sparse code, distributed across lamina, in which a small population of cells carries stimulus-relevant information. Furthermore, we find that, within this subset of neurons, decoder performance improves when noise correlations are taken into account. Copyright © 2015 the American Physiological Society.

  9. Codes on the Klein quartic, ideals, and decoding

    DEFF Research Database (Denmark)

    Hansen, Johan P.

    1987-01-01

    descriptions as left ideals in the group-algebra GF(2^{3})[G]. This description allows for easy decoding. For instance, in the case of the single error correcting code of length21and dimension16with minimal distance3. decoding is obtained by multiplication with an idempotent in the group algebra.......A sequence of codes with particular symmetries and with large rates compared to their minimal distances is constructed over the field GF(2^{3}). In the sequence there is, for instance, a code of length 21 and dimension10with minimal distance9, and a code of length21and dimension16with minimal...... distance3. The codes are constructed from algebraic geometry using the dictionary between coding theory and algebraic curves over finite fields established by Goppa. The curve used in the present work is the Klein quartic. This curve has the maximal number of rational points over GF(2^{3})allowed by Serre...

  10. Soft decoding a self-dual (48, 24; 12) code

    Science.gov (United States)

    Solomon, G.

    1993-01-01

    A self-dual (48,24;12) code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix, adding an eighth all-zero column, and then adjoining six dimensions to this extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. A soft decoding using these properties and approximating maximum likelihood is presented here. This is preliminary to a possible soft decoding of the box (72,36;15) code that promises a 7.7-dB theoretical coding under maximum likelihood.

  11. DECODING OF ACADEMIC CONTENT BY THE 1st GRADE STUDENTS

    Directory of Open Access Journals (Sweden)

    Kamil Błaszczyński

    2017-07-01

    Full Text Available In the paper a comparative study conducted on the 1st grade students of sociology and pedagogy is discussed. The study was focused on the language skills of students. The most important skills tested were the abilities to decode academic content. The study shows that the students have very poor language skills in decoding the academic content on every level of its complexity. They also have noticeable problems with the definition of basic academic terms. The significance of the obtained results are high because of the innovative topic and character of the study, which was the first such study conducted on students of a Polish university. Results are also valuable for academic teachers who are interested in such problems as effective communication with students.

  12. Decoding Signal Processing at the Single-Cell Level

    Energy Technology Data Exchange (ETDEWEB)

    Wiley, H. Steven

    2017-12-01

    The ability of cells to detect and decode information about their extracellular environment is critical to generating an appropriate response. In multicellular organisms, cells must decode dozens of signals from their neighbors and extracellular matrix to maintain tissue homeostasis while still responding to environmental stressors. How cells detect and process information from their surroundings through a surprisingly limited number of signal transduction pathways is one of the most important question in biology. Despite many decades of research, many of the fundamental principles that underlie cell signal processing remain obscure. However, in this issue of Cell Systems, Gillies et al present compelling evidence that the early response gene circuit can act as a linear signal integrator, thus providing significant insight into how cells handle fluctuating signals and noise in their environment.

  13. Reaction Decoder Tool (RDT): extracting features from chemical reactions.

    Science.gov (United States)

    Rahman, Syed Asad; Torrance, Gilliean; Baldacci, Lorenzo; Martínez Cuesta, Sergio; Fenninger, Franz; Gopal, Nimish; Choudhary, Saket; May, John W; Holliday, Gemma L; Steinbeck, Christoph; Thornton, Janet M

    2016-07-01

    Extracting chemical features like Atom-Atom Mapping (AAM), Bond Changes (BCs) and Reaction Centres from biochemical reactions helps us understand the chemical composition of enzymatic reactions. Reaction Decoder is a robust command line tool, which performs this task with high accuracy. It supports standard chemical input/output exchange formats i.e. RXN/SMILES, computes AAM, highlights BCs and creates images of the mapped reaction. This aids in the analysis of metabolic pathways and the ability to perform comparative studies of chemical reactions based on these features. This software is implemented in Java, supported on Windows, Linux and Mac OSX, and freely available at https://github.com/asad/ReactionDecoder : asad@ebi.ac.uk or s9asad@gmail.com. © The Author 2016. Published by Oxford University Press.

  14. Fast decoder for local quantum codes using Groebner basis

    Science.gov (United States)

    Haah, Jeongwan

    2013-03-01

    Based on arXiv:1204.1063. A local translation-invariant quantum code has a description in terms of Laurent polynomials. As an application of this observation, we present a fast decoding algorithm for translation-invariant local quantum codes in any spatial dimensions using the straightforward division algorithm for multivariate polynomials. The running time is O (n log n) on average, or O (n2 log n) on worst cases, where n is the number of physical qubits. The algorithm improves a subroutine of the renormalization-group decoder by Bravyi and Haah (arXiv:1112.3252) in the translation-invariant case. This work is supported in part by the Insitute for Quantum Information and Matter, an NSF Physics Frontier Center, and the Korea Foundation for Advanced Studies.

  15. [Efficacy of decoding training for children with difficulty reading hiragana].

    Science.gov (United States)

    Uchiyama, Hitoshi; Tanaka, Daisuke; Seki, Ayumi; Wakamiya, Eiji; Hirasawa, Noriko; Iketani, Naotake; Kato, Ken; Koeda, Tatsuya

    2013-05-01

    The present study aimed to clarify the efficacy of decoding training focusing on the correspondence between written symbols and their readings for children with difficulty reading hiragana (Japanese syllabary). Thirty-five children with difficulty reading hiragana were selected from among 367 first-grade elementary school students using a reading aloud test and were then divided into intervention (n=15) and control (n=20) groups. The intervention comprised 5 minutes of decoding training each day for a period of 3 weeks using an original program on a personal computer. Reading time and number of reading errors in the reading aloud test were compared between the groups. The intervention group showed a significant shortening of reading time (F(1,33)=5.40, phiragana.

  16. Label-Free Quantitation of Ribosomal Proteins from Bacillus subtilis for Antibiotic Research.

    Science.gov (United States)

    Schäkermann, Sina; Prochnow, Pascal; Bandow, Julia E

    2017-01-01

    Current research is focusing on ribosome heterogeneity as a response to changing environmental conditions and stresses, such as antibiotic stress. Altered stoichiometry and composition of ribosomal proteins as well as association of additional protein factors are mechanisms for shaping the protein expression profile or hibernating ribosomes. Here, we present a method for the isolation of ribosomes to analyze antibiotic-induced changes in the composition of ribosomes in Bacillus subtilis or other bacteria. Ribosomes and associated proteins are isolated by ultracentrifugation and proteins are identified and quantified using label-free mass spectrometry.

  17. Cryo-EM structure of the archaeal 50S ribosomal subunit in complex with initiation factor 6 and implications for ribosome evolution

    DEFF Research Database (Denmark)

    Greber, Basil J; Boehringer, Daniel; Godinic-Mikulcic, Vlatka

    2012-01-01

    additional components of the translation machinery with eukaryotes that are absent in bacteria. One of these translation factors is initiation factor 6 (IF6), which associates with the large ribosomal subunit. We have reconstructed the 50S ribosomal subunit from the archaeon Methanothermobacter...... between this archaeal ribosome and eukaryotic ribosomes but are mostly absent in bacteria and in some archaeal lineages. Furthermore, the structure reveals that, in spite of highly divergent evolutionary trajectories of the ribosomal particle and the acquisition of novel functions of IF6 in eukaryotes......, the molecular binding of IF6 on the ribosome is conserved between eukaryotes and archaea. The structure also provides a snapshot of the reductive evolution of the archaeal ribosome and offers new insights into the evolution of the translation system in archaea....

  18. Interaction of tRNA with Eukaryotic Ribosome

    Directory of Open Access Journals (Sweden)

    Dmitri Graifer

    2015-03-01

    Full Text Available This paper is a review of currently available data concerning interactions of tRNAs with the eukaryotic ribosome at various stages of translation. These data include the results obtained by means of cryo-electron microscopy and X-ray crystallography applied to various model ribosomal complexes, site-directed cross-linking with the use of tRNA derivatives bearing chemically or photochemically reactive groups in the CCA-terminal fragment and chemical probing of 28S rRNA in the region of the peptidyl transferase center. Similarities and differences in the interactions of tRNAs with prokaryotic and eukaryotic ribosomes are discussed with concomitant consideration of the extent of resemblance between molecular mechanisms of translation in eukaryotes and bacteria.

  19. 5SRNAdb: an information resource for 5S ribosomal RNAs.

    Science.gov (United States)

    Szymanski, Maciej; Zielezinski, Andrzej; Barciszewski, Jan; Erdmann, Volker A; Karlowski, Wojciech M

    2016-01-04

    Ribosomal 5S RNA (5S rRNA) is the ubiquitous RNA component found in the large subunit of ribosomes in all known organisms. Due to its small size, abundance and evolutionary conservation 5S rRNA for many years now is used as a model molecule in studies on RNA structure, RNA-protein interactions and molecular phylogeny. 5SRNAdb (http://combio.pl/5srnadb/) is the first database that provides a high quality reference set of ribosomal 5S RNAs (5S rRNA) across three domains of life. Here, we give an overview of new developments in the database and associated web tools since 2002, including updates to database content, curation processes and user web interfaces. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

  20. Structural basis for precursor protein-directed ribosomal peptide macrocyclization

    Science.gov (United States)

    Li, Kunhua; Condurso, Heather L.; Li, Gengnan; Ding, Yousong; Bruner, Steven D.

    2016-01-01

    Macrocyclization is a common feature of natural product biosynthetic pathways including the diverse family of ribosomal peptides. Microviridins are architecturally complex cyanobacterial ribosomal peptides whose members target proteases with potent reversible inhibition. The product structure is constructed by three macrocyclizations catalyzed sequentially by two members of the ATP-grasp family, a unique strategy for ribosomal peptide macrocyclization. Here, we describe the detailed structural basis for the enzyme-catalyzed macrocyclizations in the microviridin J pathway of Microcystis aeruginosa. The macrocyclases, MdnC and MdnB, interact with a conserved α-helix of the precursor peptide using a novel precursor peptide recognition mechanism. The results provide insight into the unique protein/protein interactions key to the chemistry, suggest an origin of the natural combinatorial synthesis of microviridin peptides and provide a framework for future engineering efforts to generate designed compounds. PMID:27669417

  1. Structural basis for precursor protein-directed ribosomal peptide macrocyclization.

    Science.gov (United States)

    Li, Kunhua; Condurso, Heather L; Li, Gengnan; Ding, Yousong; Bruner, Steven D

    2016-11-01

    Macrocyclization is a common feature of natural product biosynthetic pathways including the diverse family of ribosomal peptides. Microviridins are architecturally complex cyanobacterial ribosomal peptides that target proteases with potent reversible inhibition. The product structure is constructed via three macrocyclizations catalyzed sequentially by two members of the ATP-grasp family, a unique strategy for ribosomal peptide macrocyclization. Here we describe in detail the structural basis for the enzyme-catalyzed macrocyclizations in the microviridin J pathway of Microcystis aeruginosa. The macrocyclases MdnC and MdnB interact with a conserved α-helix of the precursor peptide using a novel precursor-peptide recognition mechanism. The results provide insight into the unique protein-protein interactions that are key to the chemistry, suggest an origin for the natural combinatorial synthesis of microviridin peptides, and provide a framework for future engineering efforts to generate designed compounds.

  2. Iterative demodulation and decoding of coded non-square QAM

    Science.gov (United States)

    Li, L.; Divsalar, D.; Dolinar, S.

    2003-01-01

    Simulation results show that, with iterative demodulation and decoding, coded NS-8QAM performs 0.5 dB better than standard 8QAM and 0.7 dB better than 8PSK at BER= 10(sup -5), when the FEC code is the (15, 11) Hamming code concatenated with a rate-1 accumulator code, while coded NS-32QAM performs 0.25 dB better than standard 32QAM.

  3. Design and Implementation of Viterbi Decoder Using VHDL

    Science.gov (United States)

    Thakur, Akash; Chattopadhyay, Manju K.

    2018-03-01

    A digital design conversion of Viterbi decoder for ½ rate convolutional encoder with constraint length k = 3 is presented in this paper. The design is coded with the help of VHDL, simulated and synthesized using XILINX ISE 14.7. Synthesis results show a maximum frequency of operation for the design is 100.725 MHz. The requirement of memory is less as compared to conventional method.

  4. Maximum likelihood convolutional decoding (MCD) performance due to system losses

    Science.gov (United States)

    Webster, L.

    1976-01-01

    A model for predicting the computational performance of a maximum likelihood convolutional decoder (MCD) operating in a noisy carrier reference environment is described. This model is used to develop a subroutine that will be utilized by the Telemetry Analysis Program to compute the MCD bit error rate. When this computational model is averaged over noisy reference phase errors using a high-rate interpolation scheme, the results are found to agree quite favorably with experimental measurements.

  5. Decoding Gimmicks of Financial Shenanigans in Telecom Sector in India

    OpenAIRE

    Sandeep GOEL

    2013-01-01

    Major corporate financial shenanigans get away in the name of creative accounting. But, they need to be studied for lessons learned and strategies to avoid or reduce the incidence of such frauds in the future. It is essential for shareholders, particularly the common man who does not have any access to the company except reported financial numbers. This paper aims to decode the level of financial shenanigans practices in corporate enterprises in telecom sector in India. The reason being is th...

  6. Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes

    Science.gov (United States)

    Truong, Trieu-Kie; Cheung, Kar-Ming; Shiozaki, A.; Reed, Irving S.

    1992-01-01

    Fast, efficient Fermat number transform used to compute F'(x) analogous to computation of syndrome in conventional decoding scheme. Eliminates polynomial multiplications and reduces number of multiplications in reconstruction of F'(x) to n log (n). Euclidean algorithm used to evaluate F(x) directly, without going through intermediate steps of solving error-locator and error-evaluator polynomials. Algorithm suitable for implementation in very-large-scale integrated circuits.

  7. Genes Involved in Human Ribosome Biogenesis areTranscriptionally Upregulated in Colorectal Cancer

    DEFF Research Database (Denmark)

    Mansilla, Francisco; Lamy, Philippe; Ørntoft, Torben Falck

    2009-01-01

    Microarray gene expression profiling comprising 168 colorectal adenocarcinomas and 10 normal mucosas showed that over 79% of the genes involved in human ribosome biogenesis are significantly upregulated (log2>0.5, p<10-3) when compared to normal mucosa. Overexpression was independent of microsate......Microarray gene expression profiling comprising 168 colorectal adenocarcinomas and 10 normal mucosas showed that over 79% of the genes involved in human ribosome biogenesis are significantly upregulated (log2>0.5, p... of microsatellite status. The promoters of the genes studied showed a significant enrichment for several transcription factor binding sites. There was a significant correlation between the number of binding site targets for these transcription factors and the observed gene transcript upregulation. The upregulation...

  8. Protein-protein interactions within late pre-40S ribosomes.

    Directory of Open Access Journals (Sweden)

    Melody G Campbell

    2011-01-01

    Full Text Available Ribosome assembly in eukaryotic organisms requires more than 200 assembly factors to facilitate and coordinate rRNA transcription, processing, and folding with the binding of the ribosomal proteins. Many of these assembly factors bind and dissociate at defined times giving rise to discrete assembly intermediates, some of which have been partially characterized with regards to their protein and RNA composition. Here, we have analyzed the protein-protein interactions between the seven assembly factors bound to late cytoplasmic pre-40S ribosomes using recombinant proteins in binding assays. Our data show that these factors form two modules: one comprising Enp1 and the export adaptor Ltv1 near the beak structure, and the second comprising the kinase Rio2, the nuclease Nob1, and a regulatory RNA binding protein Dim2/Pno1 on the front of the head. The GTPase-like Tsr1 and the universally conserved methylase Dim1 are also peripherally connected to this second module. Additionally, in an effort to further define the locations for these essential proteins, we have analyzed the interactions between these assembly factors and six ribosomal proteins: Rps0, Rps3, Rps5, Rps14, Rps15 and Rps29. Together, these results and previous RNA-protein crosslinking data allow us to propose a model for the binding sites of these seven assembly factors. Furthermore, our data show that the essential kinase Rio2 is located at the center of the pre-ribosomal particle and interacts, directly or indirectly, with every other assembly factor, as well as three ribosomal proteins required for cytoplasmic 40S maturation. These data suggest that Rio2 could play a central role in regulating cytoplasmic maturation steps.

  9. Efficient algorithms for maximum likelihood decoding in the surface code

    Science.gov (United States)

    Bravyi, Sergey; Suchara, Martin; Vargo, Alexander

    2014-09-01

    We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the two-dimensional surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time O (n2), where n is the number of code qubits. Our implementation uses a reduction from MLD to simulation of matchgate quantum circuits. This reduction however requires a special noise model with independent bit-flip and phase-flip errors. Secondly, we show how to implement MLD approximately for more general noise models using matrix product states (MPS). Our implementation has running time O (nχ3), where χ is a parameter that controls the approximation precision. The key step of our algorithm, borrowed from the density matrix renormalization-group method, is a subroutine for contracting a tensor network on the two-dimensional grid. The subroutine uses MPS with a bond dimension χ to approximate the sequence of tensors arising in the course of contraction. We benchmark the MPS-based decoder against the standard minimum weight matching decoder observing a significant reduction of the logical error probability for χ ≥4.

  10. Biological 2-Input Decoder Circuit in Human Cells

    Science.gov (United States)

    2015-01-01

    Decoders are combinational circuits that convert information from n inputs to a maximum of 2n outputs. This operation is of major importance in computing systems yet it is vastly underexplored in synthetic biology. Here, we present a synthetic gene network architecture that operates as a biological decoder in human cells, converting 2 inputs to 4 outputs. As a proof-of-principle, we use small molecules to emulate the two inputs and fluorescent reporters as the corresponding four outputs. The experiments are performed using transient transfections in human kidney embryonic cells and the characterization by fluorescence microscopy and flow cytometry. We show a clear separation between the ON and OFF mean fluorescent intensity states. Additionally, we adopt the integrated mean fluorescence intensity for the characterization of the circuit and show that this metric is more robust to transfection conditions when compared to the mean fluorescent intensity. To conclude, we present the first implementation of a genetic decoder. This combinational system can be valuable toward engineering higher-order circuits as well as accommodate a multiplexed interface with endogenous cellular functions. PMID:24694115

  11. An Area-Efficient Reconfigurable LDPC Decoder with Conflict Resolution

    Science.gov (United States)

    Zhou, Changsheng; Huang, Yuebin; Huang, Shuangqu; Chen, Yun; Zeng, Xiaoyang

    Based on Turbo-Decoding Message-Passing (TDMP) and Normalized Min-Sum (NMS) algorithm, an area efficient LDPC decoder that supports both structured and unstructured LDPC codes is proposed in this paper. We introduce a solution to solve the memory access conflict problem caused by TDMP algorithm. We also arrange the main timing schedule carefully to handle the operations of our solution while avoiding much additional hardware consumption. To reduce the memory bits needed, the extrinsic message storing strategy is also optimized. Besides the extrinsic message recover and the accumulate operation are merged together. To verify our architecture, a LDPC decoder that supports both China Multimedia Mobile Broadcasting (CMMB) and Digital Terrestrial/ Television Multimedia Broadcasting (DTMB) standards is developed using SMIC 0.13µm standard CMOS process. The core area is 4.75mm2 and the maximum operating clock frequency is 200MHz. The estimated power consumption is 48.4mW at 25MHz for CMMB and 130.9mW at 50MHz for DTMB with 5 iterations and 1.2V supply.

  12. Biological 2-input decoder circuit in human cells.

    Science.gov (United States)

    Guinn, Michael; Bleris, Leonidas

    2014-08-15

    Decoders are combinational circuits that convert information from n inputs to a maximum of 2(n) outputs. This operation is of major importance in computing systems yet it is vastly underexplored in synthetic biology. Here, we present a synthetic gene network architecture that operates as a biological decoder in human cells, converting 2 inputs to 4 outputs. As a proof-of-principle, we use small molecules to emulate the two inputs and fluorescent reporters as the corresponding four outputs. The experiments are performed using transient transfections in human kidney embryonic cells and the characterization by fluorescence microscopy and flow cytometry. We show a clear separation between the ON and OFF mean fluorescent intensity states. Additionally, we adopt the integrated mean fluorescence intensity for the characterization of the circuit and show that this metric is more robust to transfection conditions when compared to the mean fluorescent intensity. To conclude, we present the first implementation of a genetic decoder. This combinational system can be valuable toward engineering higher-order circuits as well as accommodate a multiplexed interface with endogenous cellular functions.

  13. A streamlined ribosome profiling protocol for the characterization of microorganisms

    DEFF Research Database (Denmark)

    Latif, Haythem; Szubin, Richard; Tan, Justin

    2015-01-01

    Ribosome profiling is a powerful tool for characterizing in vivo protein translation at the genome scale, with multiple applications ranging from detailed molecular mechanisms to systems-level predictive modeling. Though highly effective, this intricate technique has yet to become widely used...... in the microbial research community. Here we present a streamlined ribosome profiling protocol with reduced barriers to entry for microbial characterization studies. Our approach provides simplified alternatives during harvest, lysis, and recovery of monosomes and also eliminates several time-consuming steps...

  14. The basis of orientation decoding in human primary visual cortex: fine- or coarse-scale biases?

    Science.gov (United States)

    Maloney, Ryan T

    2015-01-01

    Orientation signals in human primary visual cortex (V1) can be reliably decoded from the multivariate pattern of activity as measured with functional magnetic resonance imaging (fMRI). The precise underlying source of these decoded signals (whether by orientation biases at a fine or coarse scale in cortex) remains a matter of some controversy, however. Freeman and colleagues (J Neurosci 33: 19695-19703, 2013) recently showed that the accuracy of decoding of spiral patterns in V1 can be predicted by a voxel's preferred spatial position (the population receptive field) and its coarse orientation preference, suggesting that coarse-scale biases are sufficient for orientation decoding. Whether they are also necessary for decoding remains an open question, and one with implications for the broader interpretation of multivariate decoding results in fMRI studies. Copyright © 2015 the American Physiological Society.

  15. Emotion Decoding and Incidental Processing Fluency as Antecedents of Attitude Certainty.

    Science.gov (United States)

    Petrocelli, John V; Whitmire, Melanie B

    2017-07-01

    Previous research demonstrates that attitude certainty influences the degree to which an attitude changes in response to persuasive appeals. In the current research, decoding emotions from facial expressions and incidental processing fluency, during attitude formation, are examined as antecedents of both attitude certainty and attitude change. In Experiment 1, participants who decoded anger or happiness during attitude formation expressed their greater attitude certainty, and showed more resistance to persuasion than participants who decoded sadness. By manipulating the emotion decoded, the diagnosticity of processing fluency experienced during emotion decoding, and the gaze direction of the social targets, Experiment 2 suggests that the link between emotion decoding and attitude certainty results from incidental processing fluency. Experiment 3 demonstrated that fluency in processing irrelevant stimuli influences attitude certainty, which in turn influences resistance to persuasion. Implications for appraisal-based accounts of attitude formation and attitude change are discussed.

  16. Charge Segregation and Low Hydrophobicity Are Key Features of Ribosomal Proteins from Different Organisms*

    Science.gov (United States)

    Fedyukina, Daria V.; Jennaro, Theodore S.; Cavagnero, Silvia

    2014-01-01

    Ribosomes are large and highly charged macromolecular complexes consisting of RNA and proteins. Here, we address the electrostatic and nonpolar properties of ribosomal proteins that are important for ribosome assembly and interaction with other cellular components and may influence protein folding on the ribosome. We examined 50 S ribosomal subunits from 10 species and found a clear distinction between the net charge of ribosomal proteins from halophilic and non-halophilic organisms. We found that ∼67% ribosomal proteins from halophiles are negatively charged, whereas only up to ∼15% of ribosomal proteins from non-halophiles share this property. Conversely, hydrophobicity tends to be lower for ribosomal proteins from halophiles than for the corresponding proteins from non-halophiles. Importantly, the surface electrostatic potential of ribosomal proteins from all organisms, especially halophiles, has distinct positive and negative regions across all the examined species. Positively and negatively charged residues of ribosomal proteins tend to be clustered in buried and solvent-exposed regions, respectively. Hence, the majority of ribosomal proteins is characterized by a significant degree of intramolecular charge segregation, regardless of the organism of origin. This key property enables the ribosome to accommodate proteins within its complex scaffold regardless of their overall net charge. PMID:24398678

  17. Coding/decoding two-dimensional images with orbital angular momentum of light.

    Science.gov (United States)

    Chu, Jiaqi; Li, Xuefeng; Smithwick, Quinn; Chu, Daping

    2016-04-01

    We investigate encoding and decoding of two-dimensional information using the orbital angular momentum (OAM) of light. Spiral phase plates and phase-only spatial light modulators are used in encoding and decoding of OAM states, respectively. We show that off-axis points and spatial variables encoded with a given OAM state can be recovered through decoding with the corresponding complimentary OAM state.

  18. A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems

    OpenAIRE

    Wang, Xuepeng; Bai, Baoming; Ma, Xiao

    2010-01-01

    In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC codedmodulation systems. The algorithm combines hard-decision decoding using the message-passing strategy with the signal detector in an iterative manner. It requires low computational complexity, offers good system performance and has a fast rate of decoding convergence. Compared to the q-ary sum-product algorithm (QSPA), it provides an attractive candidate for practical applications of q-ary LDP...

  19. Negative feedback governs gonadotrope frequency-decoding of gonadotropin releasing hormone pulse-frequency.

    Directory of Open Access Journals (Sweden)

    Stefan Lim

    Full Text Available The synthesis of the gonadotropin subunits is directed by pulsatile gonadotropin-releasing hormone (GnRH from the hypothalamus, with the frequency of GnRH pulses governing the differential expression of the common alpha-subunit, luteinizing hormone beta-subunit (LHbeta and follicle-stimulating hormone beta-subunit (FSHbeta. Three mitogen-activated protein kinases, (MAPKs, ERK1/2, JNK and p38, contribute uniquely and combinatorially to the expression of each of these subunit genes. In this study, using both experimental and computational methods, we found that dual specificity phosphatase regulation of the activity of the three MAPKs through negative feedback is required, and forms the basis for decoding the frequency of pulsatile GnRH. A fourth MAPK, ERK5, was shown also to be activated by GnRH. ERK5 was found to stimulate FSHbeta promoter activity and to increase FSHbeta mRNA levels, as well as enhancing its preference for low GnRH pulse frequencies. The latter is achieved through boosting the ultrasensitive behavior of FSHbeta gene expression by increasing the number of MAPK dependencies, and through modulating the feedforward effects of JNK activation on the GnRH receptor (GnRH-R. Our findings contribute to understanding the role of changing GnRH pulse-frequency in controlling transcription of the pituitary gonadotropins, which comprises a crucial aspect in regulating reproduction. Pulsatile stimuli and oscillating signals are integral to many biological processes, and elucidation of the mechanisms through which the pulsatility is decoded explains how the same stimulant can lead to various outcomes in a single cell.

  20. Decoding using back-project algorithm from coded image in ICF

    International Nuclear Information System (INIS)

    Jiang shaoen; Liu Zhongli; Zheng Zhijian; Tang Daoyuan

    1999-01-01

    The principle of the coded imaging and its decoding in inertial confinement fusion is described simply. The authors take ring aperture microscope for example and use back-project (BP) algorithm to decode the coded image. The decoding program has been performed for numerical simulation. Simulations of two models are made, and the results show that the accuracy of BP algorithm is high and effect of reconstruction is good. Thus, it indicates that BP algorithm is applicable to decoding for coded image in ICF experiments

  1. Analysis of Iterated Hard Decision Decoding of Product Codes with Reed-Solomon Component Codes

    DEFF Research Database (Denmark)

    Justesen, Jørn; Høholdt, Tom

    2007-01-01

    Products of Reed-Solomon codes are important in applications because they offer a combination of large blocks, low decoding complexity, and good performance. A recent result on random graphs can be used to show that with high probability a large number of errors can be corrected by iterating...... minimum distance decoding. We present an analysis related to density evolution which gives the exact asymptotic value of the decoding threshold and also provides a closed form approximation to the distribution of errors in each step of the decoding of finite length codes....

  2. VLSI Architectures for Sliding-Window-Based Space-Time Turbo Trellis Code Decoders

    Directory of Open Access Journals (Sweden)

    Georgios Passas

    2012-01-01

    Full Text Available The VLSI implementation of SISO-MAP decoders used for traditional iterative turbo coding has been investigated in the literature. In this paper, a complete architectural model of a space-time turbo code receiver that includes elementary decoders is presented. These architectures are based on newly proposed building blocks such as a recursive add-compare-select-offset (ACSO unit, A-, B-, Γ-, and LLR output calculation modules. Measurements of complexity and decoding delay of several sliding-window-technique-based MAP decoder architectures and a proposed parameter set lead to defining equations and comparison between those architectures.

  3. A new LDPC decoding scheme for PDM-8QAM BICM coherent optical communication system

    Science.gov (United States)

    Liu, Yi; Zhang, Wen-bo; Xi, Li-xia; Tang, Xian-feng; Zhang, Xiao-guang

    2015-11-01

    A new log-likelihood ratio (LLR) message estimation method is proposed for polarization-division multiplexing eight quadrature amplitude modulation (PDM-8QAM) bit-interleaved coded modulation (BICM) optical communication system. The formulation of the posterior probability is theoretically analyzed, and the way to reduce the pre-decoding bit error rate ( BER) of the low density parity check (LDPC) decoder for PDM-8QAM constellations is presented. Simulation results show that it outperforms the traditional scheme, i.e., the new post-decoding BER is decreased down to 50% of that of the traditional post-decoding algorithm.

  4. Multiple-Symbol Noncoherent Decoding of Uncoded and Convolutionally Codes Continous Phase Modulation

    Science.gov (United States)

    Divsalar, D.; Raphaeli, D.

    2000-01-01

    Recently, a method for combined noncoherent detection and decoding of trellis-codes (noncoherent coded modulation) has been proposed, which can practically approach the performance of coherent detection.

  5. Firing rate estimation using infinite mixture models and its application to neural decoding.

    Science.gov (United States)

    Shibue, Ryohei; Komaki, Fumiyasu

    2017-11-01

    Neural decoding is a framework for reconstructing external stimuli from spike trains recorded by various neural recordings. Kloosterman et al. proposed a new decoding method using marked point processes (Kloosterman F, Layton SP, Chen Z, Wilson MA. J Neurophysiol 111: 217-227, 2014). This method does not require spike sorting and thereby improves decoding accuracy dramatically. In this method, they used kernel density estimation to estimate intensity functions of marked point processes. However, the use of kernel density estimation causes problems such as low decoding accuracy and high computational costs. To overcome these problems, we propose a new decoding method using infinite mixture models to estimate intensity. The proposed method improves decoding performance in terms of accuracy and computational speed. We apply the proposed method to simulation and experimental data to verify its performance. NEW & NOTEWORTHY We propose a new neural decoding method using infinite mixture models and nonparametric Bayesian statistics. The proposed method improves decoding performance in terms of accuracy and computation speed. We have successfully applied the proposed method to position decoding from spike trains recorded in a rat hippocampus. Copyright © 2017 the American Physiological Society.

  6. Parallel iterative decoding of transform domain Wyner-Ziv video using cross bitplane correlation

    DEFF Research Database (Denmark)

    Luong, Huynh Van; Huang, Xin; Forchhammer, Søren

    2011-01-01

    decoding scheme is proposed to improve the coding efficiency of TDWZ video codecs. The proposed parallel iterative LDPC decoding scheme is able to utilize cross bitplane correlation during decoding, by iteratively refining the soft-input, updating a modeled noise distribution and thereafter enhancing......In recent years, Transform Domain Wyner-Ziv (TDWZ) video coding has been proposed as an efficient Distributed Video Coding (DVC) solution, which fully or partly exploits the source statistics at the decoder to reduce the computational burden at the encoder. In this paper, a parallel iterative LDPC...

  7. Visual perception as retrospective Bayesian decoding from high- to low-level features.

    Science.gov (United States)

    Ding, Stephanie; Cueva, Christopher J; Tsodyks, Misha; Qian, Ning

    2017-10-24

    When a stimulus is presented, its encoding is known to progress from low- to high-level features. How these features are decoded to produce perception is less clear, and most models assume that decoding follows the same low- to high-level hierarchy of encoding. There are also theories arguing for global precedence, reversed hierarchy, or bidirectional processing, but they are descriptive without quantitative comparison with human perception. Moreover, observers often inspect different parts of a scene sequentially to form overall perception, suggesting that perceptual decoding requires working memory, yet few models consider how working-memory properties may affect decoding hierarchy. We probed decoding hierarchy by comparing absolute judgments of single orientations and relative/ordinal judgments between two sequentially presented orientations. We found that lower-level, absolute judgments failed to account for higher-level, relative/ordinal judgments. However, when ordinal judgment was used to retrospectively decode memory representations of absolute orientations, striking aspects of absolute judgments, including the correlation and forward/backward aftereffects between two reported orientations in a trial, were explained. We propose that the brain prioritizes decoding of higher-level features because they are more behaviorally relevant, and more invariant and categorical, and thus easier to specify and maintain in noisy working memory, and that more reliable higher-level decoding constrains less reliable lower-level decoding. Published under the PNAS license.

  8. Spontaneous reverse movement of mRNA-bound tRNA through the ribosome.

    Science.gov (United States)

    Konevega, Andrey L; Fischer, Niels; Semenkov, Yuri P; Stark, Holger; Wintermeyer, Wolfgang; Rodnina, Marina V

    2007-04-01

    During the translocation step of protein synthesis, a complex of two transfer RNAs bound to messenger RNA (tRNA-mRNA) moves through the ribosome. The reaction is promoted by an elongation factor, called EF-G in bacteria, which, powered by GTP hydrolysis, induces an open, unlocked conformation of the ribosome that allows for spontaneous tRNA-mRNA movement. Here we show that, in the absence of EF-G, there is spontaneous backward movement, or retrotranslocation, of two tRNAs bound to mRNA. Retrotranslocation is driven by the gain in affinity when a cognate E-site tRNA moves into the P site, which compensates the affinity loss accompanying the movement of peptidyl-tRNA from the P to the A site. These results lend support to the diffusion model of tRNA movement during translocation. In the cell, tRNA movement is biased in the forward direction by EF-G, which acts as a Brownian ratchet and prevents backward movement.

  9. Ribosomal protein mutations induce autophagy through S6 kinase inhibition of the insulin pathway.

    Directory of Open Access Journals (Sweden)

    Harry F Heijnen

    Full Text Available Mutations affecting the ribosome lead to several diseases known as ribosomopathies, with phenotypes that include growth defects, cytopenia, and bone marrow failure. Diamond-Blackfan anemia (DBA, for example, is a pure red cell aplasia linked to the mutation of ribosomal protein (RP genes. Here we show the knock-down of the DBA-linked RPS19 gene induces the cellular self-digestion process of autophagy, a pathway critical for proper hematopoiesis. We also observe an increase of autophagy in cells derived from DBA patients, in CD34+ erythrocyte progenitor cells with RPS19 knock down, in the red blood cells of zebrafish embryos with RP-deficiency, and in cells from patients with Shwachman-Diamond syndrome (SDS. The loss of RPs in all these models results in a marked increase in S6 kinase phosphorylation that we find is triggered by an increase in reactive oxygen species (ROS. We show that this increase in S6 kinase phosphorylation inhibits the insulin pathway and AKT phosphorylation activity through a mechanism reminiscent of insulin resistance. While stimulating RP-deficient cells with insulin reduces autophagy, antioxidant treatment reduces S6 kinase phosphorylation, autophagy, and stabilization of the p53 tumor suppressor. Our data suggest that RP loss promotes the aberrant activation of both S6 kinase and p53 by increasing intracellular ROS levels. The deregulation of these signaling pathways is likely playing a major role in the pathophysiology of ribosomopathies.

  10. Selection of mRNA 5'-untranslated region sequence with high translation efficiency through ribosome display

    International Nuclear Information System (INIS)

    Mie, Masayasu; Shimizu, Shun; Takahashi, Fumio; Kobatake, Eiry

    2008-01-01

    The 5'-untranslated region (5'-UTR) of mRNAs functions as a translation enhancer, promoting translation efficiency. Many in vitro translation systems exhibit a reduced efficiency in protein translation due to decreased translation initiation. The use of a 5'-UTR sequence with high translation efficiency greatly enhances protein production in these systems. In this study, we have developed an in vitro selection system that favors 5'-UTRs with high translation efficiency using a ribosome display technique. A 5'-UTR random library, comprised of 5'-UTRs tagged with a His-tag and Renilla luciferase (R-luc) fusion, were in vitro translated in rabbit reticulocytes. By limiting the translation period, only mRNAs with high translation efficiency were translated. During translation, mRNA, ribosome and translated R-luc with His-tag formed ternary complexes. They were collected with translated His-tag using Ni-particles. Extracted mRNA from ternary complex was amplified using RT-PCR and sequenced. Finally, 5'-UTR with high translation efficiency was obtained from random 5'-UTR library

  11. Highly divergent 16S rRNA sequences in ribosomal operons of Scytonema hyalinum (Cyanobacteria.

    Directory of Open Access Journals (Sweden)

    Jeffrey R Johansen

    Full Text Available A highly divergent 16S rRNA gene was found in one of the five ribosomal operons present in a species complex currently circumscribed as Scytonema hyalinum (Nostocales, Cyanobacteria using clone libraries. If 16S rRNA sequence macroheterogeneity among ribosomal operons due to insertions, deletions or truncation is excluded, the sequence heterogeneity observed in S. hyalinum was the highest observed in any prokaryotic species thus far (7.3-9.0%. The secondary structure of the 16S rRNA molecules encoded by the two divergent operons was nearly identical, indicating possible functionality. The 23S rRNA gene was examined for a few strains in this complex, and it was also found to be highly divergent from the gene in Type 2 operons (8.7%, and likewise had nearly identical secondary structure between the Type 1 and Type 2 operons. Furthermore, the 16S-23S ITS showed marked differences consistent between operons among numerous strains. Both operons have promoter sequences that satisfy consensus requirements for functional prokaryotic transcription initiation. Horizontal gene transfer from another unknown heterocytous cyanobacterium is considered the most likely explanation for the origin of this molecule, but does not explain the ultimate origin of this sequence, which is very divergent from all 16S rRNA sequences found thus far in cyanobacteria. The divergent sequence is highly conserved among numerous strains of S. hyalinum, suggesting adaptive advantage and selective constraint of the divergent sequence.

  12. Cryo-EM Structure of the Archaeal 50S Ribosomal Subunit in Complex with Initiation Factor 6 and Implications for Ribosome Evolution

    Science.gov (United States)

    Greber, Basil J.; Boehringer, Daniel; Godinic-Mikulcic, Vlatka; Crnkovic, Ana; Ibba, Michael; Weygand-Durasevic, Ivana; Ban, Nenad

    2013-01-01

    Translation of mRNA into proteins by the ribosome is universally conserved in all cellular life. The composition and complexity of the translation machinery differ markedly between the three domains of life. Organisms from the domain Archaea show an intermediate level of complexity, sharing several additional components of the translation machinery with eukaryotes that are absent in bacteria. One of these translation factors is initiation factor 6 (IF6), which associates with the large ribosomal subunit. We have reconstructed the 50S ribosomal subunit from the archaeon Methanothermobacter thermautotrophicus in complex with archaeal IF6 at 6.6 Å resolution using cryo-electron microscopy (EM). The structure provides detailed architectural insights into the 50S ribosomal subunit from a methanogenic archaeon through identification of the rRNA expansion segments and ribosomal proteins that are shared between this archaeal ribosome and eukaryotic ribosomes but are mostly absent in bacteria and in some archaeal lineages. Furthermore, the structure reveals that, in spite of highly divergent evolutionary trajectories of the ribosomal particle and the acquisition of novel functions of IF6 in eukaryotes, the molecular binding of IF6 on the ribosome is conserved between eukaryotes and archaea. The structure also provides a snapshot of the reductive evolution of the archaeal ribosome and offers new insights into the evolution of the translation system in archaea. PMID:22306461

  13. Nuclear ribosomal DNA diversity of a cotton pest ( Rotylenchulus ...

    African Journals Online (AJOL)

    The reniform nematode (Rotylenchulus reniformis) has emerged as a major cotton pest in the United States. A recent analysis of over 20 amphimictic populations of this pest from the US and three other countries has shown no sequence variation at the nuclear ribosomal internal transcribed spacer (ITS) despite the region's ...

  14. The ribosome-associated complex antagonizes prion formation in yeast.

    Science.gov (United States)

    Amor, Alvaro J; Castanzo, Dominic T; Delany, Sean P; Selechnik, Daniel M; van Ooy, Alex; Cameron, Dale M

    2015-01-01

    The number of known fungal proteins capable of switching between alternative stable conformations is steadily increasing, suggesting that a prion-like mechanism may be broadly utilized as a means to propagate altered cellular states. To gain insight into the mechanisms by which cells regulate prion formation and toxicity we examined the role of the yeast ribosome-associated complex (RAC) in modulating both the formation of the [PSI(+)] prion - an alternative conformer of Sup35 protein - and the toxicity of aggregation-prone polypeptides. The Hsp40 RAC chaperone Zuo1 anchors the RAC to ribosomes and stimulates the ATPase activity of the Hsp70 chaperone Ssb. We found that cells lacking Zuo1 are sensitive to over-expression of some aggregation-prone proteins, including the Sup35 prion domain, suggesting that co-translational protein misfolding increases in Δzuo1 strains. Consistent with this finding, Δzuo1 cells exhibit higher frequencies of spontaneous and induced prion formation. Cells expressing mutant forms of Zuo1 lacking either a C-terminal charged region required for ribosome association, or the J-domain responsible for Ssb ATPase stimulation, exhibit similarly high frequencies of prion formation. Our findings are consistent with a role for the RAC in chaperoning nascent Sup35 to regulate folding of the N-terminal prion domain as it emerges from the ribosome.

  15. Ribosomal DNA internal transcribed spacer 1 and internal ...

    African Journals Online (AJOL)

    USER

    2010-07-26

    Jul 26, 2010 ... in some East Asian countries such as China, Korea and. *Corresponding author. E-mail: soonkwan@kangwon.ac.kr. Tel: +82 33 250 6476. Fax: +82 33 250 6470. Abbreviations: nrDNA, Nuclear ribosomal DNA; ITS, internal transcribed spacer; PCR, polymerase chain reaction; BLAST, basic local alignment ...

  16. cDNA, genomic sequence cloning and overexpression of ribosomal ...

    African Journals Online (AJOL)

    RPS16 of eukaryote is a component of the 40S small ribosomal subunit encoded by RPS16 gene and is also a homolog of prokaryotic RPS9. The cDNA and genomic sequence of RPS16 was cloned successfully for the first time from the Giant Panda (Ailuropoda melanoleuca) using reverse transcription-polymerase chain ...

  17. (Brassicaceae) based on nuclear ribosomal ITS DNA sequences

    Indian Academy of Sciences (India)

    Home; Journals; Journal of Genetics; Volume 93; Issue 2. Phylogeny and biogeography of Alyssum (Brassicaceae) based on nuclear ribosomal ITS DNA sequences. Yan Li Yan Kong Zhe Zhang Yanqiang Yin Bin Liu Guanghui Lv Xiyong Wang. Research Article Volume 93 Issue 2 August 2014 pp 313-323 ...

  18. Expression of a ribosome inactivating protein (curcin 2) in Jatropha ...

    Indian Academy of Sciences (India)

    Unknown

    mechanisms employed by a number of higher-plant species involve defensive ... of RIPs in the same plant species. ..... Lam C J, Ryals J A, Ward E R and Dixon R A 1992 Emerging ... against insect pests and diseases of plants: ribosome in-.

  19. Protein folding on the ribosome studied using NMR spectroscopy

    Science.gov (United States)

    Waudby, Christopher A.; Launay, Hélène; Cabrita, Lisa D.; Christodoulou, John

    2013-01-01

    NMR spectroscopy is a powerful tool for the investigation of protein folding and misfolding, providing a characterization of molecular structure, dynamics and exchange processes, across a very wide range of timescales and with near atomic resolution. In recent years NMR methods have also been developed to study protein folding as it might occur within the cell, in a de novo manner, by observing the folding of nascent polypeptides in the process of emerging from the ribosome during synthesis. Despite the 2.3 MDa molecular weight of the bacterial 70S ribosome, many nascent polypeptides, and some ribosomal proteins, have sufficient local flexibility that sharp resonances may be observed in solution-state NMR spectra. In providing information on dynamic regions of the structure, NMR spectroscopy is therefore highly complementary to alternative methods such as X-ray crystallography and cryo-electron microscopy, which have successfully characterized the rigid core of the ribosome particle. However, the low working concentrations and limited sample stability associated with ribosome–nascent chain complexes means that such studies still present significant technical challenges to the NMR spectroscopist. This review will discuss the progress that has been made in this area, surveying all NMR studies that have been published to date, and with a particular focus on strategies for improving experimental sensitivity. PMID:24083462

  20. Architecture of the E.coli 70S ribosome

    DEFF Research Database (Denmark)

    Burkhardt, N.; Diedrich, G.; Nierhaus, K.H.

    1997-01-01

    The 70S ribosome from E.coli was analysed by neutron scattering focusing on the shape and the internal protein-RNA-distribution of the complex. Measurements on selectively deuterated 70S particles and free 30S and 50S subunits applying conventional contrast variation and proton-spin contrast...

  1. Structure based hypothesis of a mitochondrial ribosome rescue mechanism

    Directory of Open Access Journals (Sweden)

    Huynen Martijn A

    2012-05-01

    Full Text Available Abstract Background mtRF1 is a vertebrate mitochondrial protein with an unknown function that arose from a duplication of the mitochondrial release factor mtRF1a. To elucidate the function of mtRF1, we determined the positions that are conserved among mtRF1 sequences but that are different in their mtRF1a paralogs. We subsequently modeled the 3D structure of mtRF1a and mtRF1 bound to the ribosome, highlighting the structural implications of these differences to derive a hypothesis for the function of mtRF1. Results Our model predicts, in agreement with the experimental data, that the 3D structure of mtRF1a allows it to recognize the stop codons UAA and UAG in the A-site of the ribosome. In contrast, we show that mtRF1 likely can only bind the ribosome when the A-site is devoid of mRNA. Furthermore, while mtRF1a will adopt its catalytic conformation, in which it functions as a peptidyl-tRNA hydrolase in the ribosome, only upon binding of a stop codon in the A-site, mtRF1 appears specifically adapted to assume this extended, peptidyl-tRNA hydrolyzing conformation in the absence of mRNA in the A-site. Conclusions We predict that mtRF1 specifically recognizes ribosomes with an empty A-site and is able to function as a peptidyl-tRNA hydrolase in those situations. Stalled ribosomes with empty A-sites that still contain a tRNA bound to a peptide chain can result from the translation of truncated, stop-codon less mRNAs. We hypothesize that mtRF1 recycles such stalled ribosomes, performing a function that is analogous to that of tmRNA in bacteria. Reviewers This article was reviewed by Dr. Eugene Koonin, Prof. Knud H. Nierhaus (nominated by Dr. Sarah Teichmann and Dr. Shamil Sunyaev.

  2. Differential antibiotic sensitivity determined by the large ribosomal subunit in thermophilic archaea.

    OpenAIRE

    Ruggero, D; Londei, P

    1996-01-01

    Hybrid ribosomes obtained by mixing the ribosomal subunits of the extremely thermophilic archaea Sulfolobus solfataricus and Desulfurococcus mobilis were tested for their sensitivity to selected antibiotics. It is shown that structural differences in the large ribosomal subunits determine qualitatively and quantitatively the patterns of response to alpha-sarcin and paromomycin in these species.

  3. cDNA, genomic sequence cloning and analysis of the ribosomal ...

    African Journals Online (AJOL)

    Ribosomal protein L37A (RPL37A) is a component of 60S large ribosomal subunit encoded by the RPL37A gene, which belongs to the family of ribosomal L37AE proteins, located in the cytoplasm. The complementary deoxyribonucleic acid (cDNA) and the genomic sequence of RPL37A were cloned successfully from giant ...

  4. DNA replication stress restricts ribosomal DNA copy number

    Science.gov (United States)

    Salim, Devika; Bradford, William D.; Freeland, Amy; Cady, Gillian; Wang, Jianmin

    2017-01-01

    Ribosomal RNAs (rRNAs) in budding yeast are encoded by ~100–200 repeats of a 9.1kb sequence arranged in tandem on chromosome XII, the ribosomal DNA (rDNA) locus. Copy number of rDNA repeat units in eukaryotic cells is maintained far in excess of the requirement for ribosome biogenesis. Despite the importance of the repeats for both ribosomal and non-ribosomal functions, it is currently not known how “normal” copy number is determined or maintained. To identify essential genes involved in the maintenance of rDNA copy number, we developed a droplet digital PCR based assay to measure rDNA copy number in yeast and used it to screen a yeast conditional temperature-sensitive mutant collection of essential genes. Our screen revealed that low rDNA copy number is associated with compromised DNA replication. Further, subculturing yeast under two separate conditions of DNA replication stress selected for a contraction of the rDNA array independent of the replication fork blocking protein, Fob1. Interestingly, cells with a contracted array grew better than their counterparts with normal copy number under conditions of DNA replication stress. Our data indicate that DNA replication stresses select for a smaller rDNA array. We speculate that this liberates scarce replication factors for use by the rest of the genome, which in turn helps cells complete DNA replication and continue to propagate. Interestingly, tumors from mini chromosome maintenance 2 (MCM2)-deficient mice also show a loss of rDNA repeats. Our data suggest that a reduction in rDNA copy number may indicate a history of DNA replication stress, and that rDNA array size could serve as a diagnostic marker for replication stress. Taken together, these data begin to suggest the selective pressures that combine to yield a “normal” rDNA copy number. PMID:28915237

  5. ABC-F Proteins Mediate Antibiotic Resistance through Ribosomal Protection.

    Science.gov (United States)

    Sharkey, Liam K R; Edwards, Thomas A; O'Neill, Alex J

    2016-03-22

    Members of the ABC-F subfamily of ATP-binding cassette proteins mediate resistance to a broad array of clinically important antibiotic classes that target the ribosome of Gram-positive pathogens. The mechanism by which these proteins act has been a subject of long-standing controversy, with two competing hypotheses each having gained considerable support: antibiotic efflux versus ribosomal protection. Here, we report on studies employing a combination of bacteriological and biochemical techniques to unravel the mechanism of resistance of these proteins, and provide several lines of evidence that together offer clear support to the ribosomal protection hypothesis. Of particular note, we show that addition of purified ABC-F proteins to anin vitrotranslation assay prompts dose-dependent rescue of translation, and demonstrate that such proteins are capable of displacing antibiotic from the ribosomein vitro To our knowledge, these experiments constitute the first direct evidence that ABC-F proteins mediate antibiotic resistance through ribosomal protection.IMPORTANCEAntimicrobial resistance ranks among the greatest threats currently facing human health. Elucidation of the mechanisms by which microorganisms resist the effect of antibiotics is central to understanding the biology of this phenomenon and has the potential to inform the development of new drugs capable of blocking or circumventing resistance. Members of the ABC-F family, which includelsa(A),msr(A),optr(A), andvga(A), collectively yield resistance to a broader range of clinically significant antibiotic classes than any other family of resistance determinants, although their mechanism of action has been controversial since their discovery 25 years ago. Here we present the first direct evidence that proteins of the ABC-F family act to protect the bacterial ribosome from antibiotic-mediated inhibition. Copyright © 2016 Sharkey et al.

  6. DNA replication stress restricts ribosomal DNA copy number.

    Science.gov (United States)

    Salim, Devika; Bradford, William D; Freeland, Amy; Cady, Gillian; Wang, Jianmin; Pruitt, Steven C; Gerton, Jennifer L

    2017-09-01

    Ribosomal RNAs (rRNAs) in budding yeast are encoded by ~100-200 repeats of a 9.1kb sequence arranged in tandem on chromosome XII, the ribosomal DNA (rDNA) locus. Copy number of rDNA repeat units in eukaryotic cells is maintained far in excess of the requirement for ribosome biogenesis. Despite the importance of the repeats for both ribosomal and non-ribosomal functions, it is currently not known how "normal" copy number is determined or maintained. To identify essential genes involved in the maintenance of rDNA copy number, we developed a droplet digital PCR based assay to measure rDNA copy number in yeast and used it to screen a yeast conditional temperature-sensitive mutant collection of essential genes. Our screen revealed that low rDNA copy number is associated with compromised DNA replication. Further, subculturing yeast under two separate conditions of DNA replication stress selected for a contraction of the rDNA array independent of the replication fork blocking protein, Fob1. Interestingly, cells with a contracted array grew better than their counterparts with normal copy number under conditions of DNA replication stress. Our data indicate that DNA replication stresses select for a smaller rDNA array. We speculate that this liberates scarce replication factors for use by the rest of the genome, which in turn helps cells complete DNA replication and continue to propagate. Interestingly, tumors from mini chromosome maintenance 2 (MCM2)-deficient mice also show a loss of rDNA repeats. Our data suggest that a reduction in rDNA copy number may indicate a history of DNA replication stress, and that rDNA array size could serve as a diagnostic marker for replication stress. Taken together, these data begin to suggest the selective pressures that combine to yield a "normal" rDNA copy number.

  7. DNA replication stress restricts ribosomal DNA copy number.

    Directory of Open Access Journals (Sweden)

    Devika Salim

    2017-09-01

    Full Text Available Ribosomal RNAs (rRNAs in budding yeast are encoded by ~100-200 repeats of a 9.1kb sequence arranged in tandem on chromosome XII, the ribosomal DNA (rDNA locus. Copy number of rDNA repeat units in eukaryotic cells is maintained far in excess of the requirement for ribosome biogenesis. Despite the importance of the repeats for both ribosomal and non-ribosomal functions, it is currently not known how "normal" copy number is determined or maintained. To identify essential genes involved in the maintenance of rDNA copy number, we developed a droplet digital PCR based assay to measure rDNA copy number in yeast and used it to screen a yeast conditional temperature-sensitive mutant collection of essential genes. Our screen revealed that low rDNA copy number is associated with compromised DNA replication. Further, subculturing yeast under two separate conditions of DNA replication stress selected for a contraction of the rDNA array independent of the replication fork blocking protein, Fob1. Interestingly, cells with a contracted array grew better than their counterparts with normal copy number under conditions of DNA replication stress. Our data indicate that DNA replication stresses select for a smaller rDNA array. We speculate that this liberates scarce replication factors for use by the rest of the genome, which in turn helps cells complete DNA replication and continue to propagate. Interestingly, tumors from mini chromosome maintenance 2 (MCM2-deficient mice also show a loss of rDNA repeats. Our data suggest that a reduction in rDNA copy number may indicate a history of DNA replication stress, and that rDNA array size could serve as a diagnostic marker for replication stress. Taken together, these data begin to suggest the selective pressures that combine to yield a "normal" rDNA copy number.

  8. Studies on the catalytic rate constant of ribosomal peptidyltransferase.

    Science.gov (United States)

    Synetos, D; Coutsogeorgopoulos, C

    1987-02-20

    A detailed kinetic analysis of a model reaction for the ribosomal peptidyltransferase is described, using fMet-tRNA or Ac-Phe-tRNA as the peptidyl donor and puromycin as the acceptor. The initiation complex (fMet-tRNA X AUG X 70 S ribosome) or (Ac-Phe-tRNA X poly(U) X 70 S ribosome) (complex C) is isolated and then reacted with excess puromycin (S) to give fMet-puromycin or Ac-Phe-puromycin. This reaction (puromycin reaction) is first order at all concentrations of S tested. An important asset of this kinetic analysis is the fact that the relationship between the first order rate constant kobs and [S] shows hyperbolic saturation and that the value of kobs at saturating [S] is a measure of the catalytic rate constant (k cat) of peptidyltransferase in the puromycin reaction. With fMet-tRNA as the donor, this kcat of peptidyltransferase is 8.3 min-1 when the 0.5 M NH4Cl ribosomal wash is present, compared to 3.8 min-1 in its absence. The kcat of peptidyltransferase is 2.0 min-1 when Ac-Phe-tRNA replaces fMet-tRNA in the presence of the ribosomal wash and decreases to 0.8 min-1 in its absence. This kinetic procedure is the best method available for evaluating changes in the activity of peptidyltransferase in vitro. The results suggest that peptidyltransferase is subjected to activation by the binding of fMet-tRNA to the 70 S initiation complex.

  9. Is there a channel in the ribosome for nascent peptide. Labellimg of translating ribosomes with atomar tritium

    Energy Technology Data Exchange (ETDEWEB)

    Kolb, V A; Kammer, A A; Spirin, A S

    1987-01-01

    The method of tritium bombardment was applied to investigate exposure of growing peptide on the surface of ribsome E.coli. Distribution of radioactivity by fractions is presented. Tritium inclusion in all the aminoacid residues of heteropeptide testifies to its exposure on the surface of the ribosome.

  10. An Improved Unscented Kalman Filter Based Decoder for Cortical Brain-Machine Interfaces.

    Science.gov (United States)

    Li, Simin; Li, Jie; Li, Zheng

    2016-01-01

    Brain-machine interfaces (BMIs) seek to connect brains with machines or computers directly, for application in areas such as prosthesis control. For this application, the accuracy of the decoding of movement intentions is crucial. We aim to improve accuracy by designing a better encoding model of primary motor cortical activity during hand movements and combining this with decoder engineering refinements, resulting in a new unscented Kalman filter based decoder, UKF2, which improves upon our previous unscented Kalman filter decoder, UKF1. The new encoding model includes novel acceleration magnitude, position-velocity interaction, and target-cursor-distance features (the decoder does not require target position as input, it is decoded). We add a novel probabilistic velocity threshold to better determine the user's intent to move. We combine these improvements with several other refinements suggested by others in the field. Data from two Rhesus monkeys indicate that the UKF2 generates offline reconstructions of hand movements (mean CC 0.851) significantly more accurately than the UKF1 (0.833) and the popular position-velocity Kalman filter (0.812). The encoding model of the UKF2 could predict the instantaneous firing rate of neurons (mean CC 0.210), given kinematic variables and past spiking, better than the encoding models of these two decoders (UKF1: 0.138, p-v Kalman: 0.098). In closed-loop experiments where each monkey controlled a computer cursor with each decoder in turn, the UKF2 facilitated faster task completion (mean 1.56 s vs. 2.05 s) and higher Fitts's Law bit rate (mean 0.738 bit/s vs. 0.584 bit/s) than the UKF1. These results suggest that the modeling and decoder engineering refinements of the UKF2 improve decoding performance. We believe they can be used to enhance other decoders as well.

  11. Selection of antigenic markers on a GFP-Cκ fusion scaffold with high sensitivity by eukaryotic ribosome display

    International Nuclear Information System (INIS)

    Yang Yongmin; Barankiewicz, Teresa J.; He Mingyue; Taussig, Michael J.; Chen, Swey-Shen

    2007-01-01

    Ribosome display is a cell-free system permitting gene selection through the physical association of genetic material (mRNA) and its phenotypic (protein) product. While often used to select single-chain antibodies from large libraries by panning against immobilized antigens, we have adapted ribosome display for use in the 'reverse' format in order to select high affinity antigenic determinants against solid-phase antibody. To create an antigenic scaffold, DNA encoding green fluorescent protein (GFP) was fused to a light chain constant domain (Cκ) with stop codon deleted, and with 5' signals (T7 promoter, Kozak) enabling coupled transcription/translation in a eukaryotic cell-free system. Epitopes on either GFP (5') or Cκ (3') were selected by anti-GFP or anti-Cκ antibodies, respectively, coupled to magnetic beads. After selection, mRNA was amplified directly from protein-ribosome-mRNA (PRM) complexes by in situ PCR followed by internal amplification and reassembly PCR. As little as 10 fg of the 1 kb DNA construct, i.e. approximately 7500 molecules, could be recovered following a single round of interaction with solid-phase anti-GFP antibody. This platform is highly specific and sensitive for the antigen-antibody interaction and may permit selection and reshaping of high affinity antigenic variants of scaffold proteins

  12. Selection of antigenic markers on a GFP-C{kappa} fusion scaffold with high sensitivity by eukaryotic ribosome display

    Energy Technology Data Exchange (ETDEWEB)

    Yongmin, Yang [Institute of Genetics, San Diego, CA 92121-2233 (United States); IgE Therapeutics, Inc., San Diego, CA 92121-2233 (United States); Barankiewicz, Teresa J [Institute of Genetics, San Diego, CA 92121-2233 (United States); IgE Therapeutics, Inc., San Diego, CA 92121-2233 (United States); Mingyue, He [Babraham Institute, Cambridge CB2 4AT (United Kingdom); Taussig, Michael J [Babraham Institute, Cambridge CB2 4AT (United Kingdom); Chen, Swey-Shen [Institute of Genetics, San Diego, CA 92121-2233 (United States) and IgE Therapeutics, Inc., San Diego, CA 92121-2233 (United States)

    2007-07-27

    Ribosome display is a cell-free system permitting gene selection through the physical association of genetic material (mRNA) and its phenotypic (protein) product. While often used to select single-chain antibodies from large libraries by panning against immobilized antigens, we have adapted ribosome display for use in the 'reverse' format in order to select high affinity antigenic determinants against solid-phase antibody. To create an antigenic scaffold, DNA encoding green fluorescent protein (GFP) was fused to a light chain constant domain (C{kappa}) with stop codon deleted, and with 5' signals (T7 promoter, Kozak) enabling coupled transcription/translation in a eukaryotic cell-free system. Epitopes on either GFP (5') or C{kappa} (3') were selected by anti-GFP or anti-C{kappa} antibodies, respectively, coupled to magnetic beads. After selection, mRNA was amplified directly from protein-ribosome-mRNA (PRM) complexes by in situ PCR followed by internal amplification and reassembly PCR. As little as 10 fg of the 1 kb DNA construct, i.e. approximately 7500 molecules, could be recovered following a single round of interaction with solid-phase anti-GFP antibody. This platform is highly specific and sensitive for the antigen-antibody interaction and may permit selection and reshaping of high affinity antigenic variants of scaffold proteins.

  13. A Deconvolution Protocol for ChIP-Seq Reveals Analogous Enhancer Structures on the Mouse and Human Ribosomal RNA Genes

    Directory of Open Access Journals (Sweden)

    Jean-Clement Mars

    2018-01-01

    Full Text Available The combination of Chromatin Immunoprecipitation and Massively Parallel Sequencing, or ChIP-Seq, has greatly advanced our genome-wide understanding of chromatin and enhancer structures. However, its resolution at any given genetic locus is limited by several factors. In applying ChIP-Seq to the study of the ribosomal RNA genes, we found that a major limitation to resolution was imposed by the underlying variability in sequence coverage that very often dominates the protein–DNA interaction profiles. Here, we describe a simple numerical deconvolution approach that, in large part, corrects for this variability, and significantly improves both the resolution and quantitation of protein–DNA interaction maps deduced from ChIP-Seq data. This approach has allowed us to determine the in vivo organization of the RNA polymerase I preinitiation complexes that form at the promoters and enhancers of the mouse (Mus musculus and human (Homo sapiens ribosomal RNA genes, and to reveal a phased binding of the HMG-box factor UBF across the rDNA. The data identify and map a “Spacer Promoter” and associated stalled polymerase in the intergenic spacer of the human ribosomal RNA genes, and reveal a very similar enhancer structure to that found in rodents and lower vertebrates.

  14. NEDDylation promotes stress granule assembly.

    Science.gov (United States)

    Jayabalan, Aravinth Kumar; Sanchez, Anthony; Park, Ra Young; Yoon, Sang Pil; Kang, Gum-Yong; Baek, Je-Hyun; Anderson, Paul; Kee, Younghoon; Ohn, Takbum

    2016-07-06

    Stress granules (SGs) harbour translationally stalled messenger ribonucleoproteins and play important roles in regulating gene expression and cell fate. Here we show that neddylation promotes SG assembly in response to arsenite-induced oxidative stress. Inhibition or depletion of key components of the neddylation machinery concomitantly inhibits stress-induced polysome disassembly and SG assembly. Affinity purification and subsequent mass-spectrometric analysis of Nedd8-conjugated proteins from translationally stalled ribosomal fractions identified ribosomal proteins, translation factors and RNA-binding proteins (RBPs), including SRSF3, a previously known SG regulator. We show that SRSF3 is selectively neddylated at Lys85 in response to arsenite. A non-neddylatable SRSF3 (K85R) mutant do not prevent arsenite-induced polysome disassembly, but fails to support the SG assembly, suggesting that the neddylation pathway plays an important role in SG assembly.

  15. Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

    Science.gov (United States)

    Lin, Shu

    1998-01-01

    A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and

  16. Research on coding and decoding method for digital levels

    Energy Technology Data Exchange (ETDEWEB)

    Tu Lifen; Zhong Sidong

    2011-01-20

    A new coding and decoding method for digital levels is proposed. It is based on an area-array CCD sensor and adopts mixed coding technology. By taking advantage of redundant information in a digital image signal, the contradiction that the field of view and image resolution restrict each other in a digital level measurement is overcome, and the geodetic leveling becomes easier. The experimental results demonstrate that the uncertainty of measurement is 1mm when the measuring range is between 2m and 100m, which can meet practical needs.

  17. Research on coding and decoding method for digital levels.

    Science.gov (United States)

    Tu, Li-fen; Zhong, Si-dong

    2011-01-20

    A new coding and decoding method for digital levels is proposed. It is based on an area-array CCD sensor and adopts mixed coding technology. By taking advantage of redundant information in a digital image signal, the contradiction that the field of view and image resolution restrict each other in a digital level measurement is overcome, and the geodetic leveling becomes easier. The experimental results demonstrate that the uncertainty of measurement is 1 mm when the measuring range is between 2 m and 100 m, which can meet practical needs.

  18. Central Decoding for Multiple Description Codes based on Domain Partitioning

    Directory of Open Access Journals (Sweden)

    M. Spiertz

    2006-01-01

    Full Text Available Multiple Description Codes (MDC can be used to trade redundancy against packet loss resistance for transmitting data over lossy diversity networks. In this work we focus on MD transform coding based on domain partitioning. Compared to Vaishampayan’s quantizer based MDC, domain based MD coding is a simple approach for generating different descriptions, by using different quantizers for each description. Commonly, only the highest rate quantizer is used for reconstruction. In this paper we investigate the benefit of using the lower rate quantizers to enhance the reconstruction quality at decoder side. The comparison is done on artificial source data and on image data. 

  19. An LDPC decoder architecture for wireless sensor network applications.

    Science.gov (United States)

    Biroli, Andrea Dario Giancarlo; Martina, Maurizio; Masera, Guido

    2012-01-01

    The pervasive use of wireless sensors in a growing spectrum of human activities reinforces the need for devices with low energy dissipation. In this work, coded communication between a couple of wireless sensor devices is considered as a method to reduce the dissipated energy per transmitted bit with respect to uncoded communication. Different Low Density Parity Check (LDPC) codes are considered to this purpose and post layout results are shown for a low-area low-energy decoder, which offers percentage energy savings with respect to the uncoded solution in the range of 40%-80%, depending on considered environment, distance and bit error rate.

  20. Optimized iterative decoding method for TPC coded CPM

    Science.gov (United States)

    Ma, Yanmin; Lai, Penghui; Wang, Shilian; Xie, Shunqin; Zhang, Wei

    2018-05-01

    Turbo Product Code (TPC) coded Continuous Phase Modulation (CPM) system (TPC-CPM) has been widely used in aeronautical telemetry and satellite communication. This paper mainly investigates the improvement and optimization on the TPC-CPM system. We first add the interleaver and deinterleaver to the TPC-CPM system, and then establish an iterative system to iteratively decode. However, the improved system has a poor convergence ability. To overcome this issue, we use the Extrinsic Information Transfer (EXIT) analysis to find the optimal factors for the system. The experiments show our method is efficient to improve the convergence performance.

  1. Synthesizer for decoding a coded short wave length irradiation

    International Nuclear Information System (INIS)

    1976-01-01

    The system uses point irradiation source, typically an X-ray emitter, which illuminates a three dimensional object consisting of a set of parallel planes, each of which acts as a source of coded information. The secondary source images are superimposed on a common flat screen. The decoding system comprises an imput light-screen detector, a picture screen amplifier, a beam deflector, on output picture screen, an optical focussing unit including three lenses, a masking unit, an output light screen detector and a video signal reproduction unit of cathode ray tube from, or similar, to create a three dimensional image of the object. (G.C.)

  2. New decoding methods of interleaved burst error-correcting codes

    Science.gov (United States)

    Nakano, Y.; Kasahara, M.; Namekawa, T.

    1983-04-01

    A probabilistic method of single burst error correction, using the syndrome correlation of subcodes which constitute the interleaved code, is presented. This method makes it possible to realize a high capability of burst error correction with less decoding delay. By generalizing this method it is possible to obtain probabilistic method of multiple (m-fold) burst error correction. After estimating the burst error positions using syndrome correlation of subcodes which are interleaved m-fold burst error detecting codes, this second method corrects erasure errors in each subcode and m-fold burst errors. The performance of these two methods is analyzed via computer simulation, and their effectiveness is demonstrated.

  3. An LDPC Decoder Architecture for Wireless Sensor Network Applications

    Science.gov (United States)

    Giancarlo Biroli, Andrea Dario; Martina, Maurizio; Masera, Guido

    2012-01-01

    The pervasive use of wireless sensors in a growing spectrum of human activities reinforces the need for devices with low energy dissipation. In this work, coded communication between a couple of wireless sensor devices is considered as a method to reduce the dissipated energy per transmitted bit with respect to uncoded communication. Different Low Density Parity Check (LDPC) codes are considered to this purpose and post layout results are shown for a low-area low-energy decoder, which offers percentage energy savings with respect to the uncoded solution in the range of 40%–80%, depending on considered environment, distance and bit error rate. PMID:22438724

  4. Video semaphore decoding for free-space optical communication

    Science.gov (United States)

    Last, Matthew; Fisher, Brian; Ezekwe, Chinwuba; Hubert, Sean M.; Patel, Sheetal; Hollar, Seth; Leibowitz, Brian S.; Pister, Kristofer S. J.

    2001-04-01

    Using teal-time image processing we have demonstrated a low bit-rate free-space optical communication system at a range of more than 20km with an average optical transmission power of less than 2mW. The transmitter is an autonomous one cubic inch microprocessor-controlled sensor node with a laser diode output. The receiver is a standard CCD camera with a 1-inch aperture lens, and both hardware and software implementations of the video semaphore decoding algorithm. With this system sensor data can be reliably transmitted 21 km form San Francisco to Berkeley.

  5. Simulation of the color vision: decoding quantum-electric transduction

    Directory of Open Access Journals (Sweden)

    Élgion Lúcio da Silva Loreto

    2008-08-01

    Full Text Available We propose an experimental simulation, using accessible and low cost materials, on the biophysical mechanism of the color vision in accordance with the Young-Helmholtz s Trichromatic Theory, approaching mainly the coding and decoding process of electric signs that arrive to the cerebral cortex. The stimulus that unchains this process is given through transformation of the quantized energy of a light photon that takes place in the photocells of the retina of the human eye. The construction of a simple system of collection and analysis of data, using a multimeter, filters, LDR and LEDs allows us to establish connections between the visual system and the simulation model.

  6. A Novel Modified Algorithm with Reduced Complexity LDPC Code Decoder

    Directory of Open Access Journals (Sweden)

    Song Yang

    2014-10-01

    Full Text Available A novel efficient decoding algorithm reduced the sum-product algorithm (SPA Complexity with LPDC code is proposed. Base on the hyperbolic tangent rule, modified the Check node update with two horizontal process, which have similar calculation, Motivated by the finding that sun- min (MS algorithm reduce the complexity reducing the approximation error in the horizontal process, simplify the information weight small part. Compared with the exiting approximations, the proposed method is less computational complexity than SPA algorithm. Simulation results show that the author algorithm can achieve performance very close SPA.

  7. On the average complexity of sphere decoding in lattice space-time coded multiple-input multiple-output channel

    KAUST Repository

    Abediseid, Walid

    2012-01-01

    complexity of sphere decoding for the quasi- static, lattice space-time (LAST) coded MIMO channel. Specifically, we drive an upper bound of the tail distribution of the decoder's computational complexity. We show that when the computational complexity exceeds

  8. Photoaffinity labeling of rat liver ribosomes by N-(2-Nitro-4-azidobenzoyl)puromycin

    International Nuclear Information System (INIS)

    Boehm, H.; Stahl, J.; Bielka, H.

    1979-01-01

    N-(2-nitro-4-azidobenzoyl)-[ 3 H]puromycin (NAB-puromycin) was synthesized as a photoreactive derivative of puromycin in order to detect ribosomal proteins located near the peptidyltransferase centre of rat liver ribosomes. Irradiation of ribosome-NAB-puromycin complexes leads to covalent attachment of the affinity label to proteins of the large ribosomal subunit, in particular to proteins L28/29, and, to a somewhat lower extent, to proteins L4, L6, L10 and L24. The results are discussed in the light of earlier studies performed with other affinity labels that attacked the peptidyltransferase region of rat liver ribosomes. (author)

  9. Translation activity of chimeric ribosomes composed of Escherichia coli and Bacillus subtilis or Geobacillus stearothermophilus subunits

    Directory of Open Access Journals (Sweden)

    Sayaka Tsuji

    2017-07-01

    Full Text Available Ribosome composition, consisting of rRNA and ribosomal proteins, is highly conserved among a broad range of organisms. However, biochemical studies focusing on ribosomal subunit exchangeability between organisms remain limited. In this study, we show that chimeric ribosomes, composed of Escherichia coli and Bacillus subtilis or E. coli and Geobacillus stearothermophilus subunits, are active for β-galactosidase translation in a highly purified E. coli translation system. Activities of the chimeric ribosomes showed only a modest decrease when using E. coli 30 S subunits, indicating functional conservation of the 50 S subunit between these bacterial species.

  10. Unstable structure of ribosomal particles synthesized in. gamma. -irradiated Escherichia coli

    Energy Technology Data Exchange (ETDEWEB)

    Fujita, H; Morita, K [National Inst. of Radiological Sciences, Chiba (Japan)

    1975-06-01

    Stability of Escherichia coli ribosomes newly synthesized after ..gamma..-irradiation was compared with that of normal ribosomes. The ribosomal particles around 70-S synthesized in irradiated cells were more sensitive to digestion by pancreatic ribonuclease A. A larger number of the salt-unstable '50-S' precursor particles existed in the extract from irradiated cells than in the extract from unirradiated cells. These facts suggest that ribosomal particles, synthesized during an earlier stage in irradiated cells, maintain an incomplete structure even though they are not distinguishable from normal ribosomes by means of sucrose density-gradient centrifugation.

  11. Decoding and finding the minimum distance with Gröbner bases : history and new insights

    NARCIS (Netherlands)

    Bulygin, S.; Pellikaan, G.R.; Woungang, I.; Misra, S.; Misra, S.C.

    2010-01-01

    In this chapter, we discuss decoding techniques and finding the minimum distance of linear codes with the use of Grobner bases. First, we give a historical overview of decoding cyclic codes via solving systems polynominal equations over finite fields. In particular, we mention papers of Cooper,.

  12. Video coding and decoding devices and methods preserving ppg relevant information

    NARCIS (Netherlands)

    2013-01-01

    The present invention relates to a video encoding device (10) for encoding video data and a corresponding video decoding device, wherein during decoding PPG relevant information shall be preserved. For this purpose the video coding device (10) comprises a first encoder (20) for encoding input video

  13. A Fully Parallel VLSI-implementation of the Viterbi Decoding Algorithm

    DEFF Research Database (Denmark)

    Sparsø, Jens; Jørgensen, Henrik Nordtorp; Paaske, Erik

    1989-01-01

    In this paper we describe the implementation of a K = 7, R = 1/2 single-chip Viterbi decoder intended to operate at 10-20 Mbit/sec. We propose a general, regular and area efficient floor-plan that is also suitable for implementation of decoders for codes with different generator polynomials...

  14. Multi-Trial Guruswami–Sudan Decoding for Generalised Reed–Solomon Codes

    DEFF Research Database (Denmark)

    Nielsen, Johan Sebastian Rosenkilde; Zeh, Alexander

    2013-01-01

    An iterated refinement procedure for the Guruswami–Sudan list decoding algorithm for Generalised Reed–Solomon codes based on Alekhnovich’s module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list...

  15. The Three Stages of Coding and Decoding in Listening Courses of College Japanese Specialty

    Science.gov (United States)

    Yang, Fang

    2008-01-01

    The main focus of research papers on listening teaching published in recent years is the theoretical meanings of decoding on the training of listening comprehension ability. Although in many research papers the bottom-up approach and top-down approach, information processing mode theory, are applied to illustrate decoding and to emphasize the…

  16. A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting

    Science.gov (United States)

    Pan, Xiaofei; Pan, Kegang; Ye, Zhan; Gong, Chao

    2014-01-01

    We propose a parallel decoding algorithm based on error checking and correcting to improve the performance of the short polar codes. In order to enhance the error-correcting capacity of the decoding algorithm, we first derive the error-checking equations generated on the basis of the frozen nodes, and then we introduce the method to check the errors in the input nodes of the decoder by the solutions of these equations. In order to further correct those checked errors, we adopt the method of modifying the probability messages of the error nodes with constant values according to the maximization principle. Due to the existence of multiple solutions of the error-checking equations, we formulate a CRC-aided optimization problem of finding the optimal solution with three different target functions, so as to improve the accuracy of error checking. Besides, in order to increase the throughput of decoding, we use a parallel method based on the decoding tree to calculate probability messages of all the nodes in the decoder. Numerical results show that the proposed decoding algorithm achieves better performance than that of some existing decoding algorithms with the same code length. PMID:25540813

  17. Iterative channel decoding of FEC-based multiple-description codes.

    Science.gov (United States)

    Chang, Seok-Ho; Cosman, Pamela C; Milstein, Laurence B

    2012-03-01

    Multiple description coding has been receiving attention as a robust transmission framework for multimedia services. This paper studies the iterative decoding of FEC-based multiple description codes. The proposed decoding algorithms take advantage of the error detection capability of Reed-Solomon (RS) erasure codes. The information of correctly decoded RS codewords is exploited to enhance the error correction capability of the Viterbi algorithm at the next iteration of decoding. In the proposed algorithm, an intradescription interleaver is synergistically combined with the iterative decoder. The interleaver does not affect the performance of noniterative decoding but greatly enhances the performance when the system is iteratively decoded. We also address the optimal allocation of RS parity symbols for unequal error protection. For the optimal allocation in iterative decoding, we derive mathematical equations from which the probability distributions of description erasures can be generated in a simple way. The performance of the algorithm is evaluated over an orthogonal frequency-division multiplexing system. The results show that the performance of the multiple description codes is significantly enhanced.

  18. Application of source biasing technique for energy efficient DECODER circuit design: memory array application

    Science.gov (United States)

    Gupta, Neha; Parihar, Priyanka; Neema, Vaibhav

    2018-04-01

    Researchers have proposed many circuit techniques to reduce leakage power dissipation in memory cells. If we want to reduce the overall power in the memory system, we have to work on the input circuitry of memory architecture i.e. row and column decoder. In this research work, low leakage power with a high speed row and column decoder for memory array application is designed and four new techniques are proposed. In this work, the comparison of cluster DECODER, body bias DECODER, source bias DECODER, and source coupling DECODER are designed and analyzed for memory array application. Simulation is performed for the comparative analysis of different DECODER design parameters at 180 nm GPDK technology file using the CADENCE tool. Simulation results show that the proposed source bias DECODER circuit technique decreases the leakage current by 99.92% and static energy by 99.92% at a supply voltage of 1.2 V. The proposed circuit also improves dynamic power dissipation by 5.69%, dynamic PDP/EDP 65.03% and delay 57.25% at 1.2 V supply voltage.

  19. The Contribution of Attentional Control and Working Memory to Reading Comprehension and Decoding

    Science.gov (United States)

    Arrington, C. Nikki; Kulesz, Paulina A.; Francis, David J.; Fletcher, Jack M.; Barnes, Marcia A.

    2014-01-01

    Little is known about how specific components of working memory, namely, attentional processes including response inhibition, sustained attention, and cognitive inhibition, are related to reading decoding and comprehension. The current study evaluated the relations of reading comprehension, decoding, working memory, and attentional control in…

  20. Fast N-Gram Language Model Look-Ahead for Decoders With Static Pronunciation Prefix Trees

    NARCIS (Netherlands)

    Huijbregts, M.A.H.; Ordelman, Roeland J.F.; de Jong, Franciska M.G.

    2008-01-01

    Decoders that make use of token-passing restrict their search space by various types of token pruning. With use of the Language Model Look-Ahead (LMLA) technique it is possible to increase the number of tokens that can be pruned without loss of decoding precision. Unfortunately, for token passing

  1. Scaffolding Students’ Independent Decoding of Unfamiliar Text with a Prototype of an eBook-Feature

    DEFF Research Database (Denmark)

    Gissel, Stig Toke

    2015-01-01

    the relevant spelling patterns and in generalizing, in order to strengthen their decoding skills. The prototype was evaluated with Danish students in the second grade to see how and under what circumstances students can use the feature in ways that strengthen their decoding skills and support them in reading...

  2. Word-Decoding Skill Interacts with Working Memory Capacity to Influence Inference Generation during Reading

    Science.gov (United States)

    Hamilton, Stephen; Freed, Erin; Long, Debra L.

    2016-01-01

    The aim of this study was to examine predictions derived from a proposal about the relation between word-decoding skill and working memory capacity, called verbal efficiency theory. The theory states that poor word representations and slow decoding processes consume resources in working memory that would otherwise be used to execute high-level…

  3. Hierarchical Neural Representation of Dreamed Objects Revealed by Brain Decoding with Deep Neural Network Features.

    Science.gov (United States)

    Horikawa, Tomoyasu; Kamitani, Yukiyasu

    2017-01-01

    Dreaming is generally thought to be generated by spontaneous brain activity during sleep with patterns common to waking experience. This view is supported by a recent study demonstrating that dreamed objects can be predicted from brain activity during sleep using statistical decoders trained with stimulus-induced brain activity. However, it remains unclear whether and how visual image features associated with dreamed objects are represented in the brain. In this study, we used a deep neural network (DNN) model for object recognition as a proxy for hierarchical visual feature representation, and DNN features for dreamed objects were analyzed with brain decoding of fMRI data collected during dreaming. The decoders were first trained with stimulus-induced brain activity labeled with the feature values of the stimulus image from multiple DNN layers. The decoders were then used to decode DNN features from the dream fMRI data, and the decoded features were compared with the averaged features of each object category calculated from a large-scale image database. We found that the feature values decoded from the dream fMRI data positively correlated with those associated with dreamed object categories at mid- to high-level DNN layers. Using the decoded features, the dreamed object category could be identified at above-chance levels by matching them to the averaged features for candidate categories. The results suggest that dreaming recruits hierarchical visual feature representations associated with objects, which may support phenomenal aspects of dream experience.

  4. Decoding error-correcting codes with Gröbner bases

    NARCIS (Netherlands)

    Bulygin, S.; Pellikaan, G.R.; Veldhuis, R.; Cronie, H.; Hoeksema, H.

    2007-01-01

    The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equations by means of Buchberger’s algorithm for finding a Gröbner basis. This generalizes the algorithm of Berlekamp-Massey for decoding Reed Solomon, Goppa and cyclic codes up to half the true minimum

  5. Bounded distance decoding of linear error-correcting codes with Gröbner bases

    NARCIS (Netherlands)

    Bulygin, S.; Pellikaan, G.R.

    2009-01-01

    The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed. A new method is proposed, which is based on reducing an initial decoding problem to solving a certain system of polynomial equations over a finite field. The peculiarity of this system is that, when

  6. A lossy graph model for delay reduction in generalized instantly decodable network coding

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2014-01-01

    , arising from lossy feedback events, when the expected decoding delay of XORing them among themselves or with other certain packets is lower than that expected when sending these packets separately. We compare the decoding delay performance of LG-IDNC and G

  7. Error Recovery Properties and Soft Decoding of Quasi-Arithmetic Codes

    Directory of Open Access Journals (Sweden)

    Christine Guillemot

    2007-08-01

    Full Text Available This paper first introduces a new set of aggregated state models for soft-input decoding of quasi arithmetic (QA codes with a termination constraint. The decoding complexity with these models is linear with the sequence length. The aggregation parameter controls the tradeoff between decoding performance and complexity. It is shown that close-to-optimal decoding performance can be obtained with low values of the aggregation parameter, that is, with a complexity which is significantly reduced with respect to optimal QA bit/symbol models. The choice of the aggregation parameter depends on the synchronization recovery properties of the QA codes. This paper thus describes a method to estimate the probability mass function (PMF of the gain/loss of symbols following a single bit error (i.e., of the difference between the number of encoded and decoded symbols. The entropy of the gain/loss turns out to be the average amount of information conveyed by a length constraint on both the optimal and aggregated state models. This quantity allows us to choose the value of the aggregation parameter that will lead to close-to-optimal decoding performance. It is shown that the optimum position for the length constraint is not the last time instant of the decoding process. This observation leads to the introduction of a new technique for robust decoding of QA codes with redundancy which turns out to outperform techniques based on the concept of forbidden symbol.

  8. Using convolutional decoding to improve time delay and phase estimation in digital communications

    Science.gov (United States)

    Ormesher, Richard C [Albuquerque, NM; Mason, John J [Albuquerque, NM

    2010-01-26

    The time delay and/or phase of a communication signal received by a digital communication receiver can be estimated based on a convolutional decoding operation that the communication receiver performs on the received communication signal. If the original transmitted communication signal has been spread according to a spreading operation, a corresponding despreading operation can be integrated into the convolutional decoding operation.

  9. The Relationship between Reading Comprehension, Decoding, and Fluency in Greek: A Cross-Sectional Study

    Science.gov (United States)

    Padeliadu, Susana; Antoniou, Faye

    2014-01-01

    Experts widely consider decoding and fluency as the basis of reading comprehension, while at the same time consistently documenting problems in these areas as major characteristics of students with learning disabilities. However, scholars have developed most of the relevant research within phonologically deep languages, wherein decoding problems…

  10. Applying the Decoding the Disciplines Process to Teaching Structural Mechanics: An Autoethnographic Case Study

    Science.gov (United States)

    Tingerthal, John Steven

    2013-01-01

    Using case study methodology and autoethnographic methods, this study examines a process of curricular development known as "Decoding the Disciplines" (Decoding) by documenting the experience of its application in a construction engineering mechanics course. Motivated by the call to integrate what is known about teaching and learning…

  11. Elevated expression of ribosomal protein genes L37, RPP-1, and S2 in the presence of mutant p53.

    Science.gov (United States)

    Loging, W T; Reisman, D

    1999-11-01

    The wild-type p53 protein is a DNA-binding transcription factor that activates genes such as p21, MDM2, GADD45, and Bax that are required for the regulation of cell cycle progression or apoptosis in response to DNA damage. Mutant forms of p53, which are transforming oncogenes and are expressed at high levels in tumor cells, generally have a reduced binding affinity for the consensus DNA sequence. Interestingly, some p53 mutants that are no longer effective at binding to the consensus DNA sequence and transactivating promoters containing this target site have acquired the ability to transform cells in culture, in part through their ability to transactivate promoters of a number of genes that are not targets of the wild-type protein. Certain p53 mutants are therefore considered to be gain-of-function mutants and appear to be promoting proliferation or transforming cells through their ability to alter the expression of novel sets of genes. Our goal is to identify genes that have altered expression in the presence of a specific mutant p53 (Arg to Trp mutation at codon 248) protein. Through examining differential gene expression in cells devoid of p53 expression and in cells that express high levels of mutant p53 protein, we have identified three ribosomal protein genes that have elevated expression in response to mutant p53. Consistent with these findings, the overexpression of a number of ribosomal protein genes in human tumors and evidence for their contribution to oncogenic transformation have been reported previously, although the mechanism leading to this overexpression has remained elusive. We show results that indicate that expression of these specific ribosomal protein genes is increased in the presence of the R248W p53 mutant, which provides a mechanism for their overexpression in human tumors.

  12. Using the Ribodeblur pipeline to recover A-sites from yeast ribosome profiling data.

    Science.gov (United States)

    Wang, Hao; Kingsford, Carl; McManus, C Joel

    2018-03-15

    Ribosome profiling has emerged as a powerful technique to study mRNA translation. Ribosome profiling has the potential to determine the relative quantities and locations of ribosomes on mRNA genome wide. Taking full advantage of this approach requires accurate measurement of ribosome locations. However, experimental inconsistencies often obscure the positional information encoded in ribosome profiling data. Here, we describe the Ribodeblur pipeline, a computational analysis tool that uses a maximum likelihood framework to infer ribosome positions from heterogeneous datasets. Ribodeblur is simple to install, and can be run on an average modern Mac or Linux-based laptop. We detail the process of applying the pipeline to high-coverage ribosome profiling data in yeast, and discuss important considerations for potential extension to other organisms. Copyright © 2018 Elsevier Inc. All rights reserved.

  13. In vivo labelling of functional ribosomes reveals spatial regulation during starvation in Podospora anserina

    Directory of Open Access Journals (Sweden)

    Silar Philippe

    2000-11-01

    Full Text Available Abstract Background To date, in eukaryotes, ribosomal protein expression is known to be regulated at the transcriptional and/or translational levels. But other forms of regulation may be possible. Results Here, we report the successful tagging of functional ribosomal particles with a S7-GFP chimaeric protein, making it possible to observe in vivo ribosome dynamics in the filamentous fungus Podospora anserina. Microscopic observations revealed a novel kind of ribosomal protein regulation during the passage between cell growth and stationary phases, with a transient accumulation of ribosomal proteins and/or ribosome subunits in the nucleus, possibly the nucleolus, being observed at the beginning of stationary phase. Conclusion Nuclear sequestration can be another level of ribosomal protein regulation in eukaryotic cells.This may contribute to the regulation of cell growth and division.

  14. In vivo labelling of functional ribosomes reveals spatial regulation during starvation in Podospora anserina

    Science.gov (United States)

    Lalucque, Hervé; Silar, Philippe

    2000-01-01

    Background To date, in eukaryotes, ribosomal protein expression is known to be regulated at the transcriptional and/or translational levels. But other forms of regulation may be possible. Results Here, we report the successful tagging of functional ribosomal particles with a S7-GFP chimaeric protein, making it possible to observe in vivo ribosome dynamics in the filamentous fungus Podospora anserina. Microscopic observations revealed a novel kind of ribosomal protein regulation during the passage between cell growth and stationary phases, with a transient accumulation of ribosomal proteins and/or ribosome subunits in the nucleus, possibly the nucleolus, being observed at the beginning of stationary phase. Conclusion Nuclear sequestration can be another level of ribosomal protein regulation in eukaryotic cells.This may contribute to the regulation of cell growth and division. PMID:11112985

  15. An Optimized Three-Level Design of Decoder Based on Nanoscale Quantum-Dot Cellular Automata

    Science.gov (United States)

    Seyedi, Saeid; Navimipour, Nima Jafari

    2018-03-01

    Quantum-dot Cellular Automata (QCA) has been potentially considered as a supersede to Complementary Metal-Oxide-Semiconductor (CMOS) because of its inherent advantages. Many QCA-based logic circuits with smaller feature size, improved operating frequency, and lower power consumption than CMOS have been offered. This technology works based on electron relations inside quantum-dots. Due to the importance of designing an optimized decoder in any digital circuit, in this paper, we design, implement and simulate a new 2-to-4 decoder based on QCA with low delay, area, and complexity. The logic functionality of the 2-to-4 decoder is verified using the QCADesigner tool. The results have shown that the proposed QCA-based decoder has high performance in terms of a number of cells, covered area, and time delay. Due to the lower clock pulse frequency, the proposed 2-to-4 decoder is helpful for building QCA-based sequential digital circuits with high performance.

  16. Row Reduction Applied to Decoding of Rank Metric and Subspace Codes

    DEFF Research Database (Denmark)

    Puchinger, Sven; Nielsen, Johan Sebastian Rosenkilde; Li, Wenhui

    2017-01-01

    We show that decoding of ℓ-Interleaved Gabidulin codes, as well as list-ℓ decoding of Mahdavifar–Vardy (MV) codes can be performed by row reducing skew polynomial matrices. Inspired by row reduction of F[x] matrices, we develop a general and flexible approach of transforming matrices over skew...... polynomial rings into a certain reduced form. We apply this to solve generalised shift register problems over skew polynomial rings which occur in decoding ℓ-Interleaved Gabidulin codes. We obtain an algorithm with complexity O(ℓμ2) where μ measures the size of the input problem and is proportional...... to the code length n in the case of decoding. Further, we show how to perform the interpolation step of list-ℓ-decoding MV codes in complexity O(ℓn2), where n is the number of interpolation constraints....

  17. Locating and decoding barcodes in fuzzy images captured by smart phones

    Science.gov (United States)

    Deng, Wupeng; Hu, Jiwei; Liu, Quan; Lou, Ping

    2017-07-01

    With the development of barcodes for commercial use, people's requirements for detecting barcodes by smart phone become increasingly pressing. The low quality of barcode image captured by mobile phone always affects the decoding and recognition rates. This paper focuses on locating and decoding EAN-13 barcodes in fuzzy images. We present a more accurate locating algorithm based on segment length and high fault-tolerant rate algorithm for decoding barcodes. Unlike existing approaches, location algorithm is based on the edge segment length of EAN -13 barcodes, while our decoding algorithm allows the appearance of fuzzy region in barcode image. Experimental results are performed on damaged, contaminated and scratched digital images, and provide a quite promising result for EAN -13 barcode location and decoding.

  18. Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Ahmed Azouaoui

    2012-01-01

    Full Text Available A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.

  19. Iterative Decoding for an Optical CDMA based Laser communication System

    International Nuclear Information System (INIS)

    Kim, Jin Young; Kim, Eun Cheol; Cha, Jae Sang

    2008-01-01

    An optical CDMA(code division multiple access)based Laser communication system has attracted much attention since it requires minimal optical Laser signal processing and it is virtually delay free, while from the theoretical point of view, its performance depends on the auto and cross correlation properties of employed sequences. Various kinds of channel coding schemes for optical CDMA based Laser communication systems have been proposed and analyzed to compensate nonideal channel and receiver conditions in impaired photon channels. In this paper, we propose and analyze an iterative decoding of optical CDMA based Laser communication signals for both shot noise limited and thermal noise limited systems. It is assumed that optical channel is an intensity modulated (IM)channel and direct detection scheme is employed to detect the received optical signal. The performance is evaluated in terms of bit error probability and throughput. It is demonstrated that the BER and throughput performance is substantially improved with interleaver length for a fixed code rate and with alphabet size of PPM (pulse position modulation). Also, the BER and throughput performance is significantly enhanced with the number of iterations for decoding process. The results in this paper can be applied to the optical CDMA based Laser communication network with multiple access applications

  20. Neural signatures of attention: insights from decoding population activity patterns.

    Science.gov (United States)

    Sapountzis, Panagiotis; Gregoriou, Georgia G

    2018-01-01

    Understanding brain function and the computations that individual neurons and neuronal ensembles carry out during cognitive functions is one of the biggest challenges in neuroscientific research. To this end, invasive electrophysiological studies have provided important insights by recording the activity of single neurons in behaving animals. To average out noise, responses are typically averaged across repetitions and across neurons that are usually recorded on different days. However, the brain makes decisions on short time scales based on limited exposure to sensory stimulation by interpreting responses of populations of neurons on a moment to moment basis. Recent studies have employed machine-learning algorithms in attention and other cognitive tasks to decode the information content of distributed activity patterns across neuronal ensembles on a single trial basis. Here, we review results from studies that have used pattern-classification decoding approaches to explore the population representation of cognitive functions. These studies have offered significant insights into population coding mechanisms. Moreover, we discuss how such advances can aid the development of cognitive brain-computer interfaces.

  1. Iterative Decoding for an Optical CDMA based Laser communication System

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Jin Young; Kim, Eun Cheol [Kwangwoon Univ., Seoul (Korea, Republic of); Cha, Jae Sang [Seoul National Univ. of Technology, Seoul (Korea, Republic of)

    2008-11-15

    An optical CDMA(code division multiple access)based Laser communication system has attracted much attention since it requires minimal optical Laser signal processing and it is virtually delay free, while from the theoretical point of view, its performance depends on the auto and cross correlation properties of employed sequences. Various kinds of channel coding schemes for optical CDMA based Laser communication systems have been proposed and analyzed to compensate nonideal channel and receiver conditions in impaired photon channels. In this paper, we propose and analyze an iterative decoding of optical CDMA based Laser communication signals for both shot noise limited and thermal noise limited systems. It is assumed that optical channel is an intensity modulated (IM)channel and direct detection scheme is employed to detect the received optical signal. The performance is evaluated in terms of bit error probability and throughput. It is demonstrated that the BER and throughput performance is substantially improved with interleaver length for a fixed code rate and with alphabet size of PPM (pulse position modulation). Also, the BER and throughput performance is significantly enhanced with the number of iterations for decoding process. The results in this paper can be applied to the optical CDMA based Laser communication network with multiple access applications.

  2. Discrete decoding based ultrafast multidimensional nuclear magnetic resonance spectroscopy

    International Nuclear Information System (INIS)

    Wei, Zhiliang; Lin, Liangjie; Ye, Qimiao; Li, Jing; Cai, Shuhui; Chen, Zhong

    2015-01-01

    The three-dimensional (3D) nuclear magnetic resonance (NMR) spectroscopy constitutes an important and powerful tool in analyzing chemical and biological systems. However, the abundant 3D information arrives at the expense of long acquisition times lasting hours or even days. Therefore, there has been a continuous interest in developing techniques to accelerate recordings of 3D NMR spectra, among which the ultrafast spatiotemporal encoding technique supplies impressive acquisition speed by compressing a multidimensional spectrum in a single scan. However, it tends to suffer from tradeoffs among spectral widths in different dimensions, which deteriorates in cases of NMR spectroscopy with more dimensions. In this study, the discrete decoding is proposed to liberate the ultrafast technique from tradeoffs among spectral widths in different dimensions by focusing decoding on signal-bearing sites. For verifying its feasibility and effectiveness, we utilized the method to generate two different types of 3D spectra. The proposed method is also applicable to cases with more than three dimensions, which, based on the experimental results, may widen applications of the ultrafast technique

  3. Discrete decoding based ultrafast multidimensional nuclear magnetic resonance spectroscopy

    Science.gov (United States)

    Wei, Zhiliang; Lin, Liangjie; Ye, Qimiao; Li, Jing; Cai, Shuhui; Chen, Zhong

    2015-07-01

    The three-dimensional (3D) nuclear magnetic resonance (NMR) spectroscopy constitutes an important and powerful tool in analyzing chemical and biological systems. However, the abundant 3D information arrives at the expense of long acquisition times lasting hours or even days. Therefore, there has been a continuous interest in developing techniques to accelerate recordings of 3D NMR spectra, among which the ultrafast spatiotemporal encoding technique supplies impressive acquisition speed by compressing a multidimensional spectrum in a single scan. However, it tends to suffer from tradeoffs among spectral widths in different dimensions, which deteriorates in cases of NMR spectroscopy with more dimensions. In this study, the discrete decoding is proposed to liberate the ultrafast technique from tradeoffs among spectral widths in different dimensions by focusing decoding on signal-bearing sites. For verifying its feasibility and effectiveness, we utilized the method to generate two different types of 3D spectra. The proposed method is also applicable to cases with more than three dimensions, which, based on the experimental results, may widen applications of the ultrafast technique.

  4. Artificial spatiotemporal touch inputs reveal complementary decoding in neocortical neurons.

    Science.gov (United States)

    Oddo, Calogero M; Mazzoni, Alberto; Spanne, Anton; Enander, Jonas M D; Mogensen, Hannes; Bengtsson, Fredrik; Camboni, Domenico; Micera, Silvestro; Jörntell, Henrik

    2017-04-04

    Investigations of the mechanisms of touch perception and decoding has been hampered by difficulties in achieving invariant patterns of skin sensor activation. To obtain reproducible spatiotemporal patterns of activation of sensory afferents, we used an artificial fingertip equipped with an array of neuromorphic sensors. The artificial fingertip was used to transduce real-world haptic stimuli into spatiotemporal patterns of spikes. These spike patterns were delivered to the skin afferents of the second digit of rats via an array of stimulation electrodes. Combined with low-noise intra- and extracellular recordings from neocortical neurons in vivo, this approach provided a previously inaccessible high resolution analysis of the representation of tactile information in the neocortical neuronal circuitry. The results indicate high information content in individual neurons and reveal multiple novel neuronal tactile coding features such as heterogeneous and complementary spatiotemporal input selectivity also between neighboring neurons. Such neuronal heterogeneity and complementariness can potentially support a very high decoding capacity in a limited population of neurons. Our results also indicate a potential neuroprosthetic approach to communicate with the brain at a very high resolution and provide a potential novel solution for evaluating the degree or state of neurological disease in animal models.

  5. Decoding Problem Gamblers' Signals: A Decision Model for Casino Enterprises.

    Science.gov (United States)

    Ifrim, Sandra

    2015-12-01

    The aim of the present study is to offer a validated decision model for casino enterprises. The model enables those users to perform early detection of problem gamblers and fulfill their ethical duty of social cost minimization. To this end, the interpretation of casino customers' nonverbal communication is understood as a signal-processing problem. Indicators of problem gambling recommended by Delfabbro et al. (Identifying problem gamblers in gambling venues: final report, 2007) are combined with Viterbi algorithm into an interdisciplinary model that helps decoding signals emitted by casino customers. Model output consists of a historical path of mental states and cumulated social costs associated with a particular client. Groups of problem and non-problem gamblers were simulated to investigate the model's diagnostic capability and its cost minimization ability. Each group consisted of 26 subjects and was subsequently enlarged to 100 subjects. In approximately 95% of the cases, mental states were correctly decoded for problem gamblers. Statistical analysis using planned contrasts revealed that the model is relatively robust to the suppression of signals performed by casino clientele facing gambling problems as well as to misjudgments made by staff regarding the clients' mental states. Only if the last mentioned source of error occurs in a very pronounced manner, i.e. judgment is extremely faulty, cumulated social costs might be distorted.

  6. Hardwarearchitektur für einen universellen LDPC Decoder

    Directory of Open Access Journals (Sweden)

    C. Beuschel

    2009-05-01

    Full Text Available Im vorliegenden Beitrag wird eine universelle Decoderarchitektur für einen Low-Density Parity-Check (LDPC Code Decoder vorgestellt. Anders als bei den in der Literatur häufig beschriebenen Architekturen für strukturierte Codes ist die hier vorgestellte Architektur frei programmierbar, so dass jeder beliebige LDPC Code durch eine Änderung der Initialisierung des Speichers für die Prüfmatrix mit derselben Hardware decodiert werden kann. Die größte Herausforderung beim Entwurf von teilparallelen LDPC Decoder Architekturen liegt im konfliktfreien Datenaustausch zwischen mehreren parallelen Speichern und Berechnungseinheiten, wozu ein Mapping und Scheduling Algorithmus benötigt wird. Der hier vorgestellte Algorithmus stützt sich auf Graphentheorie und findet für jeden beliebigen LDPC Code eine für die Architektur optimale Lösung. Damit sind keine Wartezyklen notwendig und die Parallelität der Architektur wird zu jedem Zeitpunkt voll ausgenutzt.

  7. Frame Decoder for Consultative Committee for Space Data Systems (CCSDS)

    Science.gov (United States)

    Reyes, Miguel A. De Jesus

    2014-01-01

    GNU Radio is a free and open source development toolkit that provides signal processing to implement software radios. It can be used with low-cost external RF hardware to create software defined radios, or without hardware in a simulation-like environment. GNU Radio applications are primarily written in Python and C++. The Universal Software Radio Peripheral (USRP) is a computer-hosted software radio designed by Ettus Research. The USRP connects to a host computer via high-speed Gigabit Ethernet. Using the open source Universal Hardware Driver (UHD), we can run GNU Radio applications using the USRP. An SDR is a "radio in which some or all physical layer functions are software defined"(IEEE Definition). A radio is any kind of device that wirelessly transmits or receives radio frequency (RF) signals in the radio frequency. An SDR is a radio communication system where components that have been typically implemented in hardware are implemented in software. GNU Radio has a generic packet decoder block that is not optimized for CCSDS frames. Using this generic packet decoder will add bytes to the CCSDS frames and will not permit for bit error correction using Reed-Solomon. The CCSDS frames consist of 256 bytes, including a 32-bit sync marker (0x1ACFFC1D). This frames are generated by the Space Data Processor and GNU Radio will perform the modulation and framing operations, including frame synchronization.

  8. Mapping of MPEG-4 decoding on a flexible architecture platform

    Science.gov (United States)

    van der Tol, Erik B.; Jaspers, Egbert G.

    2001-12-01

    In the field of consumer electronics, the advent of new features such as Internet, games, video conferencing, and mobile communication has triggered the convergence of television and computers technologies. This requires a generic media-processing platform that enables simultaneous execution of very diverse tasks such as high-throughput stream-oriented data processing and highly data-dependent irregular processing with complex control flows. As a representative application, this paper presents the mapping of a Main Visual profile MPEG-4 for High-Definition (HD) video onto a flexible architecture platform. A stepwise approach is taken, going from the decoder application toward an implementation proposal. First, the application is decomposed into separate tasks with self-contained functionality, clear interfaces, and distinct characteristics. Next, a hardware-software partitioning is derived by analyzing the characteristics of each task such as the amount of inherent parallelism, the throughput requirements, the complexity of control processing, and the reuse potential over different applications and different systems. Finally, a feasible implementation is proposed that includes amongst others a very-long-instruction-word (VLIW) media processor, one or more RISC processors, and some dedicated processors. The mapping study of the MPEG-4 decoder proves the flexibility and extensibility of the media-processing platform. This platform enables an effective HW/SW co-design yielding a high performance density.

  9. A method for decoding the neurophysiological spike-response transform.

    Science.gov (United States)

    Stern, Estee; García-Crescioni, Keyla; Miller, Mark W; Peskin, Charles S; Brezina, Vladimir

    2009-11-15

    Many physiological responses elicited by neuronal spikes-intracellular calcium transients, synaptic potentials, muscle contractions-are built up of discrete, elementary responses to each spike. However, the spikes occur in trains of arbitrary temporal complexity, and each elementary response not only sums with previous ones, but can itself be modified by the previous history of the activity. A basic goal in system identification is to characterize the spike-response transform in terms of a small number of functions-the elementary response kernel and additional kernels or functions that describe the dependence on previous history-that will predict the response to any arbitrary spike train. Here we do this by developing further and generalizing the "synaptic decoding" approach of Sen et al. (1996). Given the spike times in a train and the observed overall response, we use least-squares minimization to construct the best estimated response and at the same time best estimates of the elementary response kernel and the other functions that characterize the spike-response transform. We avoid the need for any specific initial assumptions about these functions by using techniques of mathematical analysis and linear algebra that allow us to solve simultaneously for all of the numerical function values treated as independent parameters. The functions are such that they may be interpreted mechanistically. We examine the performance of the method as applied to synthetic data. We then use the method to decode real synaptic and muscle contraction transforms.

  10. Decoding rule search domain in the left inferior frontal gyrus

    Science.gov (United States)

    Babcock, Laura; Vallesi, Antonino

    2018-01-01

    Traditionally, the left hemisphere has been thought to extract mainly verbal patterns of information, but recent evidence has shown that the left Inferior Frontal Gyrus (IFG) is active during inductive reasoning in both the verbal and spatial domains. We aimed to understand whether the left IFG supports inductive reasoning in a domain-specific or domain-general fashion. To do this we used Multi-Voxel Pattern Analysis to decode the representation of domain during a rule search task. Thirteen participants were asked to extract the rule underlying streams of letters presented in different spatial locations. Each rule was either verbal (letters forming words) or spatial (positions forming geometric figures). Our results show that domain was decodable in the left prefrontal cortex, suggesting that this region represents domain-specific information, rather than processes common to the two domains. A replication study with the same participants tested two years later confirmed these findings, though the individual representations changed, providing evidence for the flexible nature of representations. This study extends our knowledge on the neural basis of goal-directed behaviors and on how information relevant for rule extraction is flexibly mapped in the prefrontal cortex. PMID:29547623

  11. Successful decoding of famous faces in the fusiform face area.

    Directory of Open Access Journals (Sweden)

    Vadim Axelrod

    Full Text Available What are the neural mechanisms of face recognition? It is believed that the network of face-selective areas, which spans the occipital, temporal, and frontal cortices, is important in face recognition. A number of previous studies indeed reported that face identity could be discriminated based on patterns of multivoxel activity in the fusiform face area and the anterior temporal lobe. However, given the difficulty in localizing the face-selective area in the anterior temporal lobe, its role in face recognition is still unknown. Furthermore, previous studies limited their analysis to occipito-temporal regions without testing identity decoding in more anterior face-selective regions, such as the amygdala and prefrontal cortex. In the current high-resolution functional Magnetic Resonance Imaging study, we systematically examined the decoding of the identity of famous faces in the temporo-frontal network of face-selective and adjacent non-face-selective regions. A special focus has been put on the face-area in the anterior temporal lobe, which was reliably localized using an optimized scanning protocol. We found that face-identity could be discriminated above chance level only in the fusiform face area. Our results corroborate the role of the fusiform face area in face recognition. Future studies are needed to further explore the role of the more recently discovered anterior face-selective areas in face recognition.

  12. The Well(s of Knowledge: The Decoding of Sustainability Claims in the UK and in Greece

    Directory of Open Access Journals (Sweden)

    Panayiota J. Alevizou

    2015-07-01

    Full Text Available Sustainability claims have existed on fast moving consumer goods (FMCGs for over four decades and there is evidence that they are increasing. Research suggests that consumers have a low level of knowledge and understanding of such labels. It has been found that environmental and labelling knowledge may influence consumption behaviour but the findings so far have been inconsistent. Furthermore, the issue of knowledge and particularly sense making of the variety of claims found on FMCGs today is somewhat under researched. In this paper we investigate the types of knowledge consumers draw upon in order to decode and make sense of different types of labels across two countries. We carried out a qualitative study in the UK and Greece with 12 focus groups and utilised concepts of knowledge to investigate consumer decoding of labelling. We found that overall consumers have limited labelling knowledge and understanding even though their environmental knowledge may vary. This limited labelling knowledge makes consumers feel unsettled and unsure about their shopping decisions. Finally, we identified areas where consumers demonstrated limited knowledge and requested further information and education. This has important implications for companies, marketers, and policy makers if sustainability claims are to promote and support sustainable consumption.

  13. Pactamycin binding site on archaebacterial and eukaryotic ribosomes

    International Nuclear Information System (INIS)

    Tejedor, F.; Amils, R.; Ballesta, J.P.G.

    1987-01-01

    The presence of a photoreactive acetophenone group in the protein synthesis inhibitor pactamycin and the possibility of obtaining active iodinated derivatives that retain full biological activity allow the antibiotic binding site on Saccharomyces cerevisiae and archaebacterium Sulfolobus solfataricus ribosomes to be photoaffinity labeled. Four major labeled proteins have been identified in the yeast ribosomes, i.e., YS10, YS18, YS21/24, and YS30, while proteins AL1a, AS10/L8, AS18/20, and AS21/22 appeared as radioactive spots in S. solfataricus. There seems to be a correlation between some of the proteins labeled in yeast and those previously reported in Escherichia coli indicating that the pactamycin binding sites of both species, which are in the small subunit close to the initiation factors and mRNA binding sites, must have similar characteristics

  14. Ribosome-catalyzed formation of an abnormal peptide analogue

    International Nuclear Information System (INIS)

    Roesser, J.R.; Chorghade, M.S.; Hecht, S.M.

    1986-01-01

    The peptidyl-tRNA analogue N-(chloracetyl) phenylalanyl-tRNA/sup Phe/ was prepared by chemical aminoacylation and prebound to the P site of Escherichia coli ribosomes in response to poly(uridylic acid). Admixture of phenylalanyl-tRNA/sup Phe/ to the A site resulted in the formation of two dipeptides, one of which was found by displacement of chloride ion from the peptidyl-tRNA. This constitutes the first example of ribosome-mediated formation of a peptide of altered connectivity and suggests a need for revision of the current model of peptide bond formation. Also suggested by the present finding is the feasibility of utilizing tRNAs to prepare polypeptides of altered connectivity in an in vitro protein biosynthesizing system. [ 32 P]-oligo(rA), [ 3 H]- and [ 14 C] phenylalanines were used in the assay of the peptidye-tRNA analogue

  15. Transcriptional activation of ribosomal RNA genes during compensatory renal hypertrophy

    International Nuclear Information System (INIS)

    Ouellette, A.J.; Moonka, R.; Zelenetz, A.; Malt, R.A.

    1986-01-01

    The overall rate of rDNA transcription increases by 50% during the first 24 hours of compensatory renal hypertrophy in the mouse. To study mechanisms of ribosome accumulation after uninephrectomy, transcription rates were measured in isolated kidneys by transcriptional runoff. 32 P-labeled nascent transcripts were hybridized to blots containing linearized, denatured cloned rDNA, and hybridization was quantitated autoradiographically and by direct counting. Overall transcriptional activity of rDNA was increased by 30% above control levels at 6 hrs after nephrectomy and by 50% at 12, 18, and 24 hrs after operation. Hybridizing RNA was insensitive to inhibiby alpha-amanitin, and no hybridization was detected to vector DNA. Thus, accelerated rDNA transcription is one regulatory element in the accretion of ribosomes in renal growth, and the regulatory event is an early event. Mechanisms of activation may include enhanced transcription of active genes or induction of inactive DNA

  16. Ribosomal protein S14 transcripts are edited in Oenothera mitochondria.

    Science.gov (United States)

    Schuster, W; Unseld, M; Wissinger, B; Brennicke, A

    1990-01-01

    The gene encoding ribosomal protein S14 (rps14) in Oenothera mitochondria is located upstream of the cytochrome b gene (cob). Sequence analysis of independently derived cDNA clones covering the entire rps14 coding region shows two nucleotides edited from the genomic DNA to the mRNA derived sequences by C to U modifications. A third editing event occurs four nucleotides upstream of the AUG initiation codon and improves a potential ribosome binding site. A CGG codon specifying arginine in a position conserved in evolution between chloroplasts and E. coli as a UGG tryptophan codon is not edited in any of the cDNAs analysed. An inverted repeat 3' of an unidentified open reading frame is located upstream of the rps14 gene. The inverted repeat sequence is highly conserved at analogous regions in other Oenothera mitochondrial loci. Images PMID:2326162

  17. The subcellular distribution of the human ribosomal "stalk" components: P1, P2 and P0 proteins

    DEFF Research Database (Denmark)

    Tchórzewski, Marek; Krokowski, Dawid; Rzeski, Wojciech

    2003-01-01

    The ribosomal "stalk" structure is a distinct lateral protuberance located on the large ribosomal subunit in prokaryotic, as well as in eukaryotic cells. In eukaryotes, this ribosomal structure is composed of the acidic ribosomal P proteins, forming two hetero-dimers (P1/P2) attached...

  18. Assembly constraints drive co-evolution among ribosomal constituents.

    Science.gov (United States)

    Mallik, Saurav; Akashi, Hiroshi; Kundu, Sudip

    2015-06-23

    Ribosome biogenesis, a central and essential cellular process, occurs through sequential association and mutual co-folding of protein-RNA constituents in a well-defined assembly pathway. Here, we construct a network of co-evolving nucleotide/amino acid residues within the ribosome and demonstrate that assembly constraints are strong predictors of co-evolutionary patterns. Predictors of co-evolution include a wide spectrum of structural reconstitution events, such as cooperativity phenomenon, protein-induced rRNA reconstitutions, molecular packing of different rRNA domains, protein-rRNA recognition, etc. A correlation between folding rate of small globular proteins and their topological features is known. We have introduced an analogous topological characteristic for co-evolutionary network of ribosome, which allows us to differentiate between rRNA regions subjected to rapid reconstitutions from those hindered by kinetic traps. Furthermore, co-evolutionary patterns provide a biological basis for deleterious mutation sites and further allow prediction of potential antibiotic targeting sites. Understanding assembly pathways of multicomponent macromolecules remains a key challenge in biophysics. Our study provides a 'proof of concept' that directly relates co-evolution to biophysical interactions during multicomponent assembly and suggests predictive power to identify candidates for critical functional interactions as well as for assembly-blocking antibiotic target sites. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

  19. Photoaffinity labeling of the pactamycin binding site on eubacterial ribosomes

    International Nuclear Information System (INIS)

    Tejedor, F.; Amils, R.; Ballesta, J.P.

    1985-01-01

    Pactamycin, an inhibitor of the initial steps of protein synthesis, has an acetophenone group in its chemical structure that makes the drug a potentially photoreactive molecule. In addition, the presence of a phenolic residue makes it easily susceptible to radioactive labeling. Through iodination, one radioactive derivative of pactamycin has been obtained with biological activities similar to the unmodified drug when tested on in vivo and cell-free systems. With the use of [ 125 I]iodopactamycin, ribosomes of Escherichia coli have been photolabeled under conditions that preserve the activity of the particles and guarantee the specificity of the binding sites. Under these conditions, RNA is preferentially labeled when free, small ribosomal subunits are photolabeled, but proteins are the main target in the whole ribosome. This indicates that an important conformational change takes place in the binding site on association of the two subunits. The major labeled proteins are S2, S4, S18, S21, and L13. These proteins in the pactamycin binding site are probably related to the initiation step of protein synthesis

  20. Further characterization of ribosome binding to thylakoid membranes

    International Nuclear Information System (INIS)

    Hurewitz, J.; Jagendorf, A.T.

    1987-01-01

    Previous work indicated more polysomes bound to pea (Pisum sativum cv Progress No. 9) thylakoids in light than in the dark, in vivo. With isolated intact chloroplasts incubated in darkness, addition of MgATP had no effect but 24 to 74% more RNA was thylakoid-bound at pH 8.3 than at pH 7. Thus, the major effect of light on ribosome-binding in vivo may be due to higher stroma pH. In isolated pea chloroplasts, initiation inhibitors (pactamycin and kanamycin) decreased the extent of RNA binding, and elongation inhibitors (lincomycin and streptomycin) increased it. Thus, cycling of ribosomes is controlled by translation, initiation, and termination. Bound RNA accounted for 19 to 24% of the total chloroplast RNA and the incorporation of [ 3 H]leucine into thylakoids was proportional to the amount of this bound RNA. These data support the concept that stroma ribosomes are recruited into thylakoid polysomes, which are active in synthesizing thylakoid proteins

  1. A new version of the RDP (Ribosomal Database Project)

    Science.gov (United States)

    Maidak, B. L.; Cole, J. R.; Parker, C. T. Jr; Garrity, G. M.; Larsen, N.; Li, B.; Lilburn, T. G.; McCaughey, M. J.; Olsen, G. J.; Overbeek, R.; hide

    1999-01-01

    The Ribosomal Database Project (RDP-II), previously described by Maidak et al. [ Nucleic Acids Res. (1997), 25, 109-111], is now hosted by the Center for Microbial Ecology at Michigan State University. RDP-II is a curated database that offers ribosomal RNA (rRNA) nucleotide sequence data in aligned and unaligned forms, analysis services, and associated computer programs. During the past two years, data alignments have been updated and now include >9700 small subunit rRNA sequences. The recent development of an ObjectStore database will provide more rapid updating of data, better data accuracy and increased user access. RDP-II includes phylogenetically ordered alignments of rRNA sequences, derived phylogenetic trees, rRNA secondary structure diagrams, and various software programs for handling, analyzing and displaying alignments and trees. The data are available via anonymous ftp (ftp.cme.msu. edu) and WWW (http://www.cme.msu.edu/RDP). The WWW server provides ribosomal probe checking, approximate phylogenetic placement of user-submitted sequences, screening for possible chimeric rRNA sequences, automated alignment, and a suggested placement of an unknown sequence on an existing phylogenetic tree. Additional utilities also exist at RDP-II, including distance matrix, T-RFLP, and a Java-based viewer of the phylogenetic trees that can be used to create subtrees.

  2. Simulation and analysis of single-ribosome translation

    International Nuclear Information System (INIS)

    Tinoco, Ignacio Jr; Wen, Jin-Der

    2009-01-01

    In the cell, proteins are synthesized by ribosomes in a multi-step process called translation. The ribosome translocates along the messenger RNA to read the codons that encode the amino acid sequence of a protein. Elongation factors, including EF-G and EF-Tu, are used to catalyze the process. Recently, we have shown that translation can be followed at the single-molecule level using optical tweezers; this technique allows us to study the kinetics of translation by measuring the lifetime the ribosome spends at each codon. Here, we analyze the data from single-molecule experiments and fit the data with simple kinetic models. We also simulate the translation kinetics based on a multi-step mechanism from ensemble kinetic measurements. The mean lifetimes from the simulation were consistent with our experimental single-molecule measurements. We found that the calculated lifetime distributions were fit in general by equations with up to five rate-determining steps. Two rate-determining steps were only obtained at low concentrations of elongation factors. These analyses can be used to design new single-molecule experiments to better understand the kinetics and mechanism of translation

  3. Mutations in ribosomal proteins, RPL4 and RACK1, suppress the phenotype of a thermospermine-deficient mutant of Arabidopsis thaliana.

    Directory of Open Access Journals (Sweden)

    Jun-ichi Kakehi

    Full Text Available Thermospermine acts in negative regulation of xylem differentiation and its deficient mutant of Arabidopsis thaliana, acaulis5 (acl5, shows excessive xylem formation and severe dwarfism. Studies of two dominant suppressors of acl5, sac51-d and sac52-d, have revealed that SAC51 and SAC52 encode a transcription factor and a ribosomal protein L10 (RPL10, respectively, and these mutations enhance translation of the SAC51 mRNA, which contains conserved upstream open reading frames in the 5' leader. Here we report identification of SAC53 and SAC56 responsible for additional suppressors of acl5. sac53-d is a semi-dominant allele of the gene encoding a receptor for activated C kinase 1 (RACK1 homolog, a component of the 40S ribosomal subunit. sac56-d represents a semi-dominant allele of the gene for RPL4. We show that the GUS reporter activity driven by the CaMV 35S promoter plus the SAC51 5' leader is reduced in acl5 and restored by sac52-d, sac53-d, and sac56-d as well as thermospermine. Furthermore, the SAC51 mRNA, which may be a target of nonsense-mediated mRNA decay, was found to be stabilized in these ribosomal mutants and by thermospermine. These ribosomal proteins are suggested to act in the control of uORF-mediated translation repression of SAC51, which is derepressed by thermospermine.

  4. Heterogeneous Ribosomes Preferentially Translate Distinct Subpools of mRNAs Genome-wide.

    Science.gov (United States)

    Shi, Zhen; Fujii, Kotaro; Kovary, Kyle M; Genuth, Naomi R; Röst, Hannes L; Teruel, Mary N; Barna, Maria

    2017-07-06

    Emerging studies have linked the ribosome to more selective control of gene regulation. However, an outstanding question is whether ribosome heterogeneity at the level of core ribosomal proteins (RPs) exists and enables ribosomes to preferentially translate specific mRNAs genome-wide. Here, we measured the absolute abundance of RPs in translating ribosomes and profiled transcripts that are enriched or depleted from select subsets of ribosomes within embryonic stem cells. We find that heterogeneity in RP composition endows ribosomes with differential selectivity for translating subpools of transcripts, including those controlling metabolism, cell cycle, and development. As an example, mRNAs enriched in binding to RPL10A/uL1-containing ribosomes are shown to require RPL10A/uL1 for their efficient translation. Within several of these transcripts, this level of regulation is mediated, at least in part, by internal ribosome entry sites. Together, these results reveal a critical functional link between ribosome heterogeneity and the post-transcriptional circuitry of gene expression. Copyright © 2017 Elsevier Inc. All rights reserved.

  5. Joint Carrier-Phase Synchronization and LDPC Decoding

    Science.gov (United States)

    Simon, Marvin; Valles, Esteban

    2009-01-01

    A method has been proposed to increase the degree of synchronization of a radio receiver with the phase of a suppressed carrier signal modulated with a binary- phase-shift-keying (BPSK) or quaternary- phase-shift-keying (QPSK) signal representing a low-density parity-check (LDPC) code. This method is an extended version of the method described in Using LDPC Code Constraints to Aid Recovery of Symbol Timing (NPO-43112), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 54. Both methods and the receiver architectures in which they would be implemented belong to a class of timing- recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. The proposed method calls for the use of what is known in the art as soft decision feedback to remove the modulation from a replica of the incoming signal prior to feeding this replica to a phase-locked loop (PLL) or other carrier-tracking stage in the receiver. Soft decision feedback refers to suitably processed versions of intermediate results of iterative computations involved in the LDPC decoding process. Unlike a related prior method in which hard decision feedback (the final sequence of decoded symbols) is used to remove the modulation, the proposed method does not require estimation of the decoder error probability. In a basic digital implementation of the proposed method, the incoming signal (having carrier phase theta theta (sub c) plus noise would first be converted to inphase (I) and quadrature (Q) baseband signals by mixing it with I and Q signals at the carrier frequency [wc/(2 pi)] generated by a local oscillator. The resulting demodulated signals would be processed through one-symbol-period integrate and- dump filters, the outputs of which would be sampled and held, then multiplied by a soft-decision version of the baseband modulated signal. The resulting I and Q products consist of terms proportional to the cosine

  6. Low Complexity List Decoding for Polar Codes with Multiple CRC Codes

    Directory of Open Access Journals (Sweden)

    Jong-Hwan Kim

    2017-04-01

    Full Text Available Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths.

  7. On the decoding process in ternary error-correcting output codes.

    Science.gov (United States)

    Escalera, Sergio; Pujol, Oriol; Radeva, Petia

    2010-01-01

    A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successful framework to deal with these type of problems. Recent works in the ECOC framework showed significant performance improvements by means of new problem-dependent designs based on the ternary ECOC framework. The ternary framework contains a larger set of binary problems because of the use of a "do not care" symbol that allows us to ignore some classes by a given classifier. However, there are no proper studies that analyze the effect of the new symbol at the decoding step. In this paper, we present a taxonomy that embeds all binary and ternary ECOC decoding strategies into four groups. We show that the zero symbol introduces two kinds of biases that require redefinition of the decoding design. A new type of decoding measure is proposed, and two novel decoding strategies are defined. We evaluate the state-of-the-art coding and decoding strategies over a set of UCI Machine Learning Repository data sets and into a real traffic sign categorization problem. The experimental results show that, following the new decoding strategies, the performance of the ECOC design is significantly improved.

  8. Cellular automaton decoders of topological quantum memories in the fault tolerant setting

    International Nuclear Information System (INIS)

    Herold, Michael; Eisert, Jens; Kastoryano, Michael J; Campbell, Earl T

    2017-01-01

    Active error decoding and correction of topological quantum codes—in particular the toric code—remains one of the most viable routes to large scale quantum information processing. In contrast, passive error correction relies on the natural physical dynamics of a system to protect encoded quantum information. However, the search is ongoing for a completely satisfactory passive scheme applicable to locally interacting two-dimensional systems. Here, we investigate dynamical decoders that provide passive error correction by embedding the decoding process into local dynamics. We propose a specific discrete time cellular-automaton decoder in the fault tolerant setting and provide numerical evidence showing that the logical qubit has a survival time extended by several orders of magnitude over that of a bare unencoded qubit. We stress that (asynchronous) dynamical decoding gives rise to a Markovian dissipative process. We hence equate cellular-automaton decoding to a fully dissipative topological quantum memory, which removes errors continuously. In this sense, uncontrolled and unwanted local noise can be corrected for by a controlled local dissipative process. We analyze the required resources, commenting on additional polylogarithmic factors beyond those incurred by an ideal constant resource dynamical decoder. (paper)

  9. Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

    Science.gov (United States)

    Hashemi, Seyyed Ali; Condo, Carlo; Gross, Warren J.

    2017-11-01

    Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL) decoding provides a reasonable trade-off between the error-correction performance and hardware implementation complexity when used to decode polar codes, at the cost of limited throughput. The simplified SCL (SSCL) and its extension SSCL-SPC increase the speed of decoding by removing redundant calculations when encountering particular information and frozen bit patterns (rate one and single parity check codes), while keeping the error-correction performance unaltered. In this paper, we improve SSCL and SSCL-SPC by proving that the list size imposes a specific number of bit estimations required to decode rate one and single parity check codes. Thus, the number of estimations can be limited while guaranteeing exactly the same error-correction performance as if all bits of the code were estimated. We call the new decoding algorithms Fast-SSCL and Fast-SSCL-SPC. Moreover, we show that the number of bit estimations in a practical application can be tuned to achieve desirable speed, while keeping the error-correction performance almost unchanged. Hardware architectures implementing both algorithms are then described and implemented: it is shown that our design can achieve 1.86 Gb/s throughput, higher than the best state-of-the-art decoders.

  10. ESVD: An Integrated Energy Scalable Framework for Low-Power Video Decoding Systems

    Directory of Open Access Journals (Sweden)

    Wen Ji

    2010-01-01

    Full Text Available Video applications using mobile wireless devices are a challenging task due to the limited capacity of batteries. The higher complex functionality of video decoding needs high resource requirements. Thus, power efficient control has become more critical design with devices integrating complex video processing techniques. Previous works on power efficient control in video decoding systems often aim at the low complexity design and not explicitly consider the scalable impact of subfunctions in decoding process, and seldom consider the relationship with the features of compressed video date. This paper is dedicated to developing an energy-scalable video decoding (ESVD strategy for energy-limited mobile terminals. First, ESVE can dynamically adapt the variable energy resources due to the device aware technique. Second, ESVD combines the decoder control with decoded data, through classifying the data into different partition profiles according to its characteristics. Third, it introduces utility theoretical analysis during the resource allocation process, so as to maximize the resource utilization. Finally, it adapts the energy resource as different energy budget and generates the scalable video decoding output under energy-limited systems. Experimental results demonstrate the efficiency of the proposed approach.

  11. Prior Knowledge Improves Decoding of Finger Flexion from Electrocorticographic (ECoG Signals

    Directory of Open Access Journals (Sweden)

    Zuoguan eWang

    2011-11-01

    Full Text Available Brain-computer interfaces (BCIs use brain signals to convey a user's intent. Some BCI approaches begin by decoding kinematic parameters of movements from brain signals, and then proceed to using these signals, in absence of movements, to allow a user to control an output. Recent results have shown that electrocorticographic (ECoG recordings from the surface of the brain in humans can give information about kinematic parameters (eg{} hand velocity or finger flexion. The decoding approaches in these studies usually employed classical classification/regression algorithms that derive a linear mapping between brain signals and outputs. However, they typically only incorporate little prior information about the target movement parameter. In this paper, we incorporate prior knowledge using a Bayesian decoding method, and use it to decode finger flexion from ECoG signals. Specifically, we exploit the anatomic constraints and dynamic constraints that govern finger flexion and incorporate these constraints in the construction, structure, and the probabilistic functions of the prior model of a switched non-parametric dynamic system (SNDS. Given a measurement model resulting from a traditional linear regression method, we decoded finger flexion using posterior estimation that combined the prior and measurement models. Our results show that the application of the Bayesian decoding model, which incorporates prior knowledge, improves decoding performance compared to the application of a linear regression model, which does not incorporate prior knowledge. Thus, the results presented in this paper may ultimately lead to neurally controlled hand prostheses with full fine-grained finger articulation.

  12. Interconversion of active and inactive 30 S ribosomal subunits is accompanied by a conformational change in the decoding region of 16 S rRNA

    DEFF Research Database (Denmark)

    Moazed, D; Van Stolk, B J; Douthwaite, S

    1986-01-01

    of native structure, such as that which is observed under conditions of more severe ion depletion. Instead, it has the appearance of a reciprocal interconversion between two differently structured states; some bases become more reactive toward the probes, whilst others become less reactive as a result...... show reciprocal behavior at their N-1 versus N-7 positions. G926 loses its reactivity at N-1, but becomes highly reactive at N-7 as a result of the transition of the inactive state. In contrast, A1398 and G1401 become reactive at N-1, but lose their hyper-reactivity at N-7. The possible structural...

  13. Clusterless Decoding of Position From Multiunit Activity Using A Marked Point Process Filter

    Science.gov (United States)

    Deng, Xinyi; Liu, Daniel F.; Kay, Kenneth; Frank, Loren M.; Eden, Uri T.

    2016-01-01

    Point process filters have been applied successfully to decode neural signals and track neural dynamics. Traditionally, these methods assume that multiunit spiking activity has already been correctly spike-sorted. As a result, these methods are not appropriate for situations where sorting cannot be performed with high precision such as real-time decoding for brain-computer interfaces. As the unsupervised spike-sorting problem remains unsolved, we took an alternative approach that takes advantage of recent insights about clusterless decoding. Here we present a new point process decoding algorithm that does not require multiunit signals to be sorted into individual units. We use the theory of marked point processes to construct a function that characterizes the relationship between a covariate of interest (in this case, the location of a rat on a track) and features of the spike waveforms. In our example, we use tetrode recordings, and the marks represent a four-dimensional vector of the maximum amplitudes of the spike waveform on each of the four electrodes. In general, the marks may represent any features of the spike waveform. We then use Bayes’ rule to estimate spatial location from hippocampal neural activity. We validate our approach with a simulation study and with experimental data recorded in the hippocampus of a rat moving through a linear environment. Our decoding algorithm accurately reconstructs the rat’s position from unsorted multiunit spiking activity. We then compare the quality of our decoding algorithm to that of a traditional spike-sorting and decoding algorithm. Our analyses show that the proposed decoding algorithm performs equivalently or better than algorithms based on sorted single-unit activity. These results provide a path toward accurate real-time decoding of spiking patterns that could be used to carry out content-specific manipulations of population activity in hippocampus or elsewhere in the brain. PMID:25973549

  14. Involvement of ribosomal protein L6 in assembly of functional 50S ribosomal subunit in Escherichia coli cells

    International Nuclear Information System (INIS)

    Shigeno, Yuta; Uchiumi, Toshio; Nomura, Takaomi

    2016-01-01

    Ribosomal protein L6, an essential component of the large (50S) subunit, primarily binds to helix 97 of 23S rRNA and locates near the sarcin/ricin loop of helix 95 that directly interacts with GTPase translation factors. Although L6 is believed to play important roles in factor-dependent ribosomal function, crucial biochemical evidence for this hypothesis has not been obtained. We constructed and characterized an Escherichia coli mutant bearing a chromosomal L6 gene (rplF) disruption and carrying a plasmid with an arabinose-inducible L6 gene. Although this ΔL6 mutant grew more slowly than its wild-type parent, it proliferated in the presence of arabinose. Interestingly, cell growth in the absence of arabinose was biphasic. Early growth lasted only a few generations (LI-phase) and was followed by a suspension of growth for several hours (S-phase). This suspension was followed by a second growth phase (LII-phase). Cells harvested at both LI- and S-phases contained ribosomes with reduced factor-dependent GTPase activity and accumulated 50S subunit precursors (45S particles). The 45S particles completely lacked L6. Complete 50S subunits containing L6 were observed in all growth phases regardless of the L6-depleted condition, implying that the ΔL6 mutant escaped death because of a leaky expression of L6 from the complementing plasmid. We conclude that L6 is essential for the assembly of functional 50S subunits at the late stage. We thus established conditions for the isolation of L6-depleted 50S subunits, which are essential to study the role of L6 in translation. - Highlights: • We constructed an in vivo functional assay system for Escherichia coli ribosomal protein L6. • Growth of an E. coli ΔL6 mutant was biphasic when L6 levels were depleted. • The ΔL6 mutant accumulated 50S ribosomal subunit precursors that sedimented at 45S. • L6 is a key player in the late stage of E. coli 50S subunit assembly.

  15. Involvement of ribosomal protein L6 in assembly of functional 50S ribosomal subunit in Escherichia coli cells

    Energy Technology Data Exchange (ETDEWEB)

    Shigeno, Yuta [Division of Applied Biology, Faculty of Textile Science and Technology, Shinshu University, Ueda 386-8567 (Japan); Uchiumi, Toshio [Department of Biology, Faculty of Science, Niigata University, Niigata 950-2181 (Japan); Nomura, Takaomi, E-mail: nomurat@shinshu-u.ac.jp [Division of Applied Biology, Faculty of Textile Science and Technology, Shinshu University, Ueda 386-8567 (Japan)

    2016-04-22

    Ribosomal protein L6, an essential component of the large (50S) subunit, primarily binds to helix 97 of 23S rRNA and locates near the sarcin/ricin loop of helix 95 that directly interacts with GTPase translation factors. Although L6 is believed to play important roles in factor-dependent ribosomal function, crucial biochemical evidence for this hypothesis has not been obtained. We constructed and characterized an Escherichia coli mutant bearing a chromosomal L6 gene (rplF) disruption and carrying a plasmid with an arabinose-inducible L6 gene. Although this ΔL6 mutant grew more slowly than its wild-type parent, it proliferated in the presence of arabinose. Interestingly, cell growth in the absence of arabinose was biphasic. Early growth lasted only a few generations (LI-phase) and was followed by a suspension of growth for several hours (S-phase). This suspension was followed by a second growth phase (LII-phase). Cells harvested at both LI- and S-phases contained ribosomes with reduced factor-dependent GTPase activity and accumulated 50S subunit precursors (45S particles). The 45S particles completely lacked L6. Complete 50S subunits containing L6 were observed in all growth phases regardless of the L6-depleted condition, implying that the ΔL6 mutant escaped death because of a leaky expression of L6 from the complementing plasmid. We conclude that L6 is essential for the assembly of functional 50S subunits at the late stage. We thus established conditions for the isolation of L6-depleted 50S subunits, which are essential to study the role of L6 in translation. - Highlights: • We constructed an in vivo functional assay system for Escherichia coli ribosomal protein L6. • Growth of an E. coli ΔL6 mutant was biphasic when L6 levels were depleted. • The ΔL6 mutant accumulated 50S ribosomal subunit precursors that sedimented at 45S. • L6 is a key player in the late stage of E. coli 50S subunit assembly.

  16. Decoding the Nature of Emotion in the Brain.

    Science.gov (United States)

    Kragel, Philip A; LaBar, Kevin S

    2016-06-01

    A central, unresolved problem in affective neuroscience is understanding how emotions are represented in nervous system activity. After prior localization approaches largely failed, researchers began applying multivariate statistical tools to reconceptualize how emotion constructs might be embedded in large-scale brain networks. Findings from pattern analyses of neuroimaging data show that affective dimensions and emotion categories are uniquely represented in the activity of distributed neural systems that span cortical and subcortical regions. Results from multiple-category decoding studies are incompatible with theories postulating that specific emotions emerge from the neural coding of valence and arousal. This 'new look' into emotion representation promises to improve and reformulate neurobiological models of affect. Copyright © 2016 Elsevier Ltd. All rights reserved.

  17. Probabilistic Amplitude Shaping With Hard Decision Decoding and Staircase Codes

    Science.gov (United States)

    Sheikh, Alireza; Amat, Alexandre Graell i.; Liva, Gianluigi; Steiner, Fabian

    2018-05-01

    We consider probabilistic amplitude shaping (PAS) as a means of increasing the spectral efficiency of fiber-optic communication systems. In contrast to previous works in the literature, we consider probabilistic shaping with hard decision decoding (HDD). In particular, we apply the PAS recently introduced by B\\"ocherer \\emph{et al.} to a coded modulation (CM) scheme with bit-wise HDD that uses a staircase code as the forward error correction code. We show that the CM scheme with PAS and staircase codes yields significant gains in spectral efficiency with respect to the baseline scheme using a staircase code and a standard constellation with uniformly distributed signal points. Using a single staircase code, the proposed scheme achieves performance within $0.57$--$1.44$ dB of the corresponding achievable information rate for a wide range of spectral efficiencies.

  18. Coding and decoding for code division multiple user communication systems

    Science.gov (United States)

    Healy, T. J.

    1985-01-01

    A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.

  19. Efficiency turns the table on neural encoding, decoding and noise.

    Science.gov (United States)

    Deneve, Sophie; Chalk, Matthew

    2016-04-01

    Sensory neurons are usually described with an encoding model, for example, a function that predicts their response from the sensory stimulus using a receptive field (RF) or a tuning curve. However, central to theories of sensory processing is the notion of 'efficient coding'. We argue here that efficient coding implies a completely different neural coding strategy. Instead of a fixed encoding model, neural populations would be described by a fixed decoding model (i.e. a model reconstructing the stimulus from the neural responses). Because the population solves a global optimization problem, individual neurons are variable, but not noisy, and have no truly invariant tuning curve or receptive field. We review recent experimental evidence and implications for neural noise correlations, robustness and adaptation. Copyright © 2016. Published by Elsevier Ltd.

  20. Brief report: decoding representations: how children with autism understand drawings.

    Science.gov (United States)

    Allen, Melissa L

    2009-03-01

    Young typically developing children can reason about abstract depictions if they know the intention of the artist. Children with autism spectrum disorder (ASD), who are notably impaired in social, 'intention monitoring' domains, may have great difficulty in decoding vague representations. In Experiment 1, children with ASD are unable to use another person's eye gaze as a cue for figuring out what an abstract picture represents. In contrast, when the participants themselves are the artists (Experiment 2), children with ASD are equally proficient as controls at identifying their own perceptually identical pictures (e.g. lollipop and balloon) after a delay, based upon what they intended them to be. Results are discussed in terms of intention and understanding of visual representation in autism.