Results 61 to 70 of about 321,292 (267)

Complexity Hierarchies and Higher-order Cons-free Term Rewriting [PDF]

open access: yes, 2017
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of the left-hand sides; the computational intuition is that rules cannot build new data structures.
Kop, Cynthia, Simonsen, Jakob Grue
core   +2 more sources

Phosphatidylinositol 4‐kinase as a target of pathogens—friend or foe?

open access: yesFEBS Letters, EarlyView.
This graphical summary illustrates the roles of phosphatidylinositol 4‐kinases (PI4Ks). PI4Ks regulate key cellular processes and can be hijacked by pathogens, such as viruses, bacteria and parasites, to support their intracellular replication. Their dual role as essential host enzymes and pathogen cofactors makes them promising drug targets.
Ana C. Mendes   +3 more
wiley   +1 more source

« Et ils ne vécurent pas heureux » : la fin de Jane Eyre réécrite dans Charlotte de D.M. Thomas

open access: yesRevue LISA, 2006
D.M. Thomas’s rewriting of Jane Eyre in Charlotte (2000) takes the shape of a transformation of the ending which enables the second Mrs Rochester’s story to be continued in the West Indies, thus also acknowledging Jean Rhys’s Wide Sargasso Sea as another
Armelle Parey
doaj   +1 more source

Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation [PDF]

open access: yes, 2011
Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a new notion of
Duval, Dominique   +2 more
core   +4 more sources

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

open access: yesFEBS Letters, EarlyView.
This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley   +1 more source

Heterogenesis in Musical Rewriting and (Re)Performance

open access: yesMusica Theorica, 2019
In the music of the Twentieth Century, Luciano Berio perhaps is one of the most concerned composers with musical rewriting, intercrossing several traditions, from either European music or traditional cultures.
Silvio Ferraz Mello Filho   +1 more
doaj   +1 more source

Rewriting Modulo SMT and Open System Analysis [PDF]

open access: yes, 2018
Rewriting modulo SMT is a new technique that combines the power of SMT solving, rewriting modulo theories, and model checking. Rewriting modulo SMT is ideally suited to model and analyze reachability properties of infinite-state open systems, i.e ...
Rocha, Camilo
core  

Rewriting Flash Memories by Message Passing [PDF]

open access: yes, 2015
This paper constructs WOM codes that combine rewriting and error correction for mitigating the reliability and the endurance problems in flash memory. We consider a rewriting model that is of practical interest to flash applications where only the second
Bruck, Jehoshua   +3 more
core   +4 more sources

Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing

open access: yesFEBS Letters, EarlyView.
Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley   +1 more source

Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems [PDF]

open access: yes, 2006
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size based termination and initially developed for ML-like programs.
Blanqui, Frédéric, Riba, Colin
core   +4 more sources

Home - About - Disclaimer - Privacy