Results 131 to 140 of about 4,256 (307)
Importin 7 mediates the nuclear import of HIV‐1 integrase via a specific interacting interface
FEBS Open Bio, EarlyView.HIV‐1 integrase enables viral DNA integration into the host genome. By binding to the core domain of the host protein Importin 7 via its C‐terminal domain, the integrase is transported across the nuclear membrane into the nucleus, where integration of the viral genome into host DNA takes place. This translocation is a critical step for subsequent viral
Juana Bana +5 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 2012 27 pages, small revisions from previous version, this version appears in Journal of Combinatorial Theory Series ...
John Engbers, David J. Galvin
openaire +3 more sources
Autotopism stabilized colouring games on rook's graphs [PDF]
, 2017 Based on the fact that every partial colouring of the rook’s graph Kr✷Ks is uniquely related to an r × s partial Latin rectangle, this work deals with the Θ-stabilized colouring game on the graph Kr✷Ks.
Falcón Ganfornina, Raúl Manuel +1 more
core
Generating a Graph Colouring Heuristic with Deep Q-Learning and Graph Neural Networks [PDF]
, 2023 The graph colouring problem consists of assigning labels, or colours, to the vertices of a graph such that no two adjacent vertices share the same colour.
Montana, Giovanni +2 more
core +1 more source
In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols
FEBS Open Bio, EarlyView.Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton +6 more
wiley +1 more source
Hardness of 4-Colouring 𝐺-Colourable Graphs
Proceedings of the 57th Annual ACM Symposium on Theory of ComputingWe study the complexity of a class of promise graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H. By a result of Hell and Nešetřil, this problem is NP-hard for any non-bipartite loop-less graph H.
Sergey Avvakumov +4 more
openaire +2 more sources
GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING [PDF]
, 2003 Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring ...
Marx, Dániel, Dániel Marx
core +1 more source
Protocol for quantifying miRNA trafficking across the endosomal membrane
FEBS Open Bio, EarlyView.An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh +2 more
wiley +1 more source
Heterotropic regulation and negative homotropic cooperativity
FEBS Open Bio, EarlyView.We identified a structural module common to some proteins that couple negative cooperativity with heterotropic regulation, two features that rarely coexist. These proteins are ring‐like and present an ordered asymmetry whereby noncontacting subunits are symmetric, and their tertiary structure differs from that of contacting subunits.
Veronica Morea +5 more
wiley +1 more source
Defective and clustered graph colouring [PDF]
, 2018 Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has defect d if each monochromatic component has maximum degree at most d.
Wood, David R
core