Results 101 to 110 of about 115,299 (267)
Generation of cycle permutation graphs and permutation snarks
Mathematics of ComputationWe present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a $2$-factor consisting of two chordless cycles, non-hamiltonian cycle permutation graphs and permutation snarks, i.e. cycle permutation graphs that do not admit a $3$-edge-colouring.
Jan Goedgebeur +2 more
openaire +3 more sources
Synergistic perspectives—How single‐molecule biophysics complement biochemical understanding
FEBS Letters, EarlyView.In this review, we discuss how ensemble biochemistry and single‐molecule approaches are complementary, outline commonly used single‐molecule techniques, and illustrate their relevance through two representative case studies: chromatin organization by SMC complexes and pathway choice during DNA double‐strand break repair.
Sara De Bragança +2 more
wiley +1 more source
Structural and biochemical analysis of a B12 superbinder
FEBS Letters, EarlyView.BtuG proteins are vitamin B12 scavengers in Bacteroides thetaiotaomicron, a dominant human gut bacterium. We present crystal structures of three BtuG homologs bound to cobalamin and its precursor cobinamide, revealing picomolar binding affinities, among the highest known for any natural protein.
Jose M. Martinez Felices +3 more
wiley +1 more source
Permutation and local permutation polynomials of maximum degree
Afrika MatematikaAbstract Let $$\mathbb {F}_q$$ F q be the finite field with q elements and $$\mathbb {F}_q[x_1,\ldots , x_n]$$
Gutierrez Gutierrez, Jaime +1 more
openaire +6 more sources
FEBS Letters, EarlyView.How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source
Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s) [PDF]
Enumerative Combinatorics and Applications, 2023 George Spahn, Doron Zeilberger
doaj +1 more source
The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation
FEBS Letters, EarlyView.Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge +6 more
wiley +1 more source
Counting parking sequences and parking assortments through permutations [PDF]
Enumerative Combinatorics and Applications, 2023 Spencer J. Franks +4 more
doaj +1 more source
Minimizing the Height of Simple Tangles
Journal of Graph Algorithms and ApplicationsA tangle $T$ of height $h$ describes the ordering of $n$ elements called wires on each of $h$ levels. A pair of wires $ab$ is called a swap. Between any two adjacent levels only the ordering of adjacent wires may swap and each wire may participate in ...
Jakob Baumann, Ignaz Rutter
doaj +1 more source
Prospecting the protein design landscape
FEBS Letters, EarlyView.This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona +4 more
wiley +1 more source