Results 101 to 110 of about 245,617 (365)
FEBS Letters, EarlyView.LHCPs are transported to the thylakoid membrane via the (cp)SRP pathway. This process involves a transit complex of (cp)SRP43, (cp)SRP54 and LHCP, which interacts with (cp)FtsY and Alb3 at the membrane. GTP hydrolysis by (cp)SRP54 and (cp)FtsY triggers complex dissociation.
Victor Zegarra +7 more
wiley +1 more source
European Journal of Combinatorics, 2001 AbstractIn this paper, we will study enumeration of hypergraphs. Let Spbe a symmetric group acting on ap-setX. It induces the permutation group Sp*acting on the set of all subsets ofX. Our problem is reduced to finding a good formula for the cycle index ofSp* .
openaire +2 more sources
Journal of Combinatorial Theory, Series A, 2001 AbstractIn this paper we examine the enumeration of alternating trees. We give a bijective proof of the fact that the number of alternating unrooted trees with n vertices is given by (1/n2n−1) ∑nk=1(nk)kn−1, a problem first posed by A. Postnikov (1997, J. Combin. Theory Ser. A79, 360–366).
Chauve, Cedric +2 more
openaire +4 more sources
FEBS Letters, EarlyView.The NlpC_P60 superfamily of peptidases is recognised by its key role in bacterial cell wall homeostasis. Recently, studies have also described the involvement of NlpC_P60‐like enzymes in bacterial competitive mechanisms and pathogenesis across several lineages.
Catharina dos Santos Silva +1 more
wiley +1 more source
Enumeration Complexity: Incremental Time, Delay and Space [PDF]
arXiv, 2023 This habilitation thesis is intended to be a good introduction to enumeration, the problem of listing solutions. It focuses on the different ways of measuring complexity in enumeration, with a particular emphasis on my contributions to the field.
arxiv
Fast Lattice Point Enumeration with Minimal Overhead
ACM-SIAM Symposium on Discrete Algorithms, 2015 Enumeration algorithms are the best currently known methods to solve lattice problems, both in theory (within the class of polynomial space algorithms), and in practice (where they are routinely used to evaluate the concrete security of lattice ...
Daniele Micciancio, Michael Walter
semanticscholar +1 more source
Making tau amyloid models in vitro: a crucial and underestimated challenge
FEBS Letters, EarlyView.This review highlights the challenges of producing in vitro amyloid assemblies of the tau protein. We review how accurately the existing protocols mimic tau deposits found in the brain of patients affected with tauopathies. We discuss the important properties that should be considered when forming amyloids and the benchmarks that should be used to ...
Julien Broc, Clara Piersson, Yann Fichou
wiley +1 more source
Constant Delay Enumeration for Conjunctive Queries
SGMD, 2015 We survey some of the recent results about enumerating the answers to queries over a database. We focus on the case where the enumeration is performed with a constant delay between any two consecutive solutions, after a linear time preprocessing.
L. Segoufin
semanticscholar +1 more source
FEBS Letters, EarlyView.The S1025 peptide is the major antidote to the YrzI toxin, which we renamed here as SpyT (Small Peptide YrzI Toxin) and SpyA (Small Peptide YrzI Antitoxin) (1). Degradation of the toxin–antitoxin spyTA mRNA, either by a translation‐dependent cleavage by the endoribonuclease Rae1 (2) or by direct attack by 3′‐exoribonucleases (3), also contributes to ...
Laetitia Gilet +4 more
wiley +1 more source
On the enumeration of polyhedra
Discrete Mathematics, 1982 AbstractAn algorithm for the enumeration of all combinatorial types of three-dimensional polyhedra is described and the respective numbers of polyhedra with f faces, 4⩽f⩽11, are listed.
openaire +2 more sources