Results 71 to 80 of about 5,011,430 (289)
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Integrated multiple sequence alignment [PDF]
, 2005 Sammeth M. Integrated multiple sequence alignment. Bielefeld (Germany): Bielefeld University; 2005.The thesis presents enhancements for automated and manual multiple sequence alignment: existing alignment algorithms are made more easily accessible and ...
Sammeth, Michael
core
FEBS Letters, EarlyView.Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura +2 more
wiley +1 more source
Generating graphs from degree sequence [PDF]
, 2021 A graph consists of vertices and edges, connecting pairs of vertices. The subject of graph generation has a long history. Initial research focused on creating catalogues of graphs of small size.
Nagarajan, Amreeth Rajan
core
CoRR, 2012 8 pages, 2 figures, 2 algorithms, 2 models, 1 ...
Alice Miller 0001, Patrick Prosser
openaire +4 more sources
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Minimum-Loop Realization of Degree Sequences
, 1982 Given a finite sequence D of nonnegative integers, let M(D) denote its maximum element and S(D) its sum. It is known that D is realizable as a degree sequence by some graph if and only if S(D) is even, and by a loopless graph if and only if the even ...
Goldman, A.J.; Byrd, R.H.
core +1 more source
Degree sequence of the generalized Sierpiński graph [PDF]
, 2020 Sierpiński graphs are studied in fractal theory and have applications in diverse areas including dynamic systems, chemistry, psychology, probability, and computer science.
Attarzadeh, Fatemeh +2 more
core +1 more source
Weighted hypersoft configuration model
Physical Review Research, 2020 Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration models.
Ivan Voitalov +4 more
doaj +1 more source
Reduced criteria for degree sequences
Discrete Mathematics, 2013 For many types of graphs, criteria have been discovered that give necessary and sufficient conditions for an integer sequence to be the degree sequence of such a graph. These criteria tend to take the form of a set of inequalities, and in the case of the Erdős-Gallai criterion (for simple undirected graphs) and the Gale-Ryser criterion (for bipartite ...
openaire +3 more sources