Results 91 to 100 of about 37,788,190 (381)
Ion channel function of polycystin‐2/polycystin‐1 heteromer revealed by structure‐guided mutagenesis
FEBS Letters, EarlyView.Mutations in polycystin‐1 (PC1) or polycystin‐2 (PC2) cause autosomal‐dominant polycystic kidney disease (ADPKD). We generated a novel gain‐of‐function PC2/PC1 heteromeric ion channel by mutating pore‐blocking residues. Moreover, we demonstrated that PC2 will preferentially assemble with PC1 to form heteromeric complexes when PC1 is co‐expressed ...
Tobias Staudner +7 more
wiley +1 more source
Study of Constrained Network Structures for WGANs on Numeric Data Generation [PDF]
, 2019 Some recent studies have suggested using GANs for numeric data generation such as to generate data for completing the imbalanced numeric data. Considering the significant difference between the dimensions of the numeric data and images, as well as the strong correlations between features of numeric data, the conventional GANs normally face an ...
arxiv +1 more source
Succinct data structures for representing equivalence classes
, 2013 Given a partition of an n element set into equivalence classes, we consider time-space tradeoffs for representing it to support the query that asks whether two given elements are in the same equivalence class.
Lewenstein, Moshe +2 more
core +1 more source
Autophagy in cancer and protein conformational disorders
FEBS Letters, EarlyView.Autophagy plays a crucial role in numerous biological processes, including protein and organelle quality control, development, immunity, and metabolism. Hence, dysregulation or mutations in autophagy‐related genes have been implicated in a wide range of human diseases.
Sergio Attanasio
wiley +1 more source
arXiv, 2018 We formalize the construction of decentralized data markets by introducing the mathematical construction of tokenized data structures, a new form of incentivized data structure. These structures both specialize and extend past work on token curated registries and distributed data structures. They provide a unified model for reasoning about complex data
arxiv
Lower Bounds on Retroactive Data Structures [PDF]
arXiv, 2022 We prove essentially optimal fine-grained lower bounds on the gap between a data structure and a partially retroactive version of the same data structure. Precisely, assuming any one of three standard conjectures, we describe a problem that has a data structure where operations run in $O(T(n,m))$ time per operation, but any partially retroactive ...
arxiv
Specific "scientific" data structures, and their processing
, 2011 Programming physicists use, as all programmers, arrays, lists, tuples, records, etc., and this requires some change in their thought patterns while converting their formulae into some code, since the "data structures" operated upon, while elaborating ...
Carl M. Bender +14 more
core +3 more sources
FEBS Letters, EarlyView.The enzyme 5‐lipoxygenase (5‐LOX) catalyzes the first step in the biosynthesis of leukotrienes (LTs) involved in inflammatory pathophysiology. After cellular stimulation, 5‐LOX translocates to the nucleus, interacting with the 5‐LOX‐activating protein (FLAP) to form LTA4 from arachidonic acid (AA).
Erik Romp +5 more
wiley +1 more source
Theories of Hypergraph-Graph (HG(2)) Data Structure [PDF]
arXiv, 2013 Current paper introduces a Hypergraph Graph model of data storage which can be represented as a hybrid data structure based on Hypergraph and Graph. The pro-posed data structure is claimed to realize complex combinatorial structures. The formal definition of the data structure is presented along with the proper justification from real world scenarios ...
arxiv
Unexpected Scaling in Path Copying Trees [PDF]
arXiv, 2022 Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (henceforth called Universal Constructions or UCs) for building concurrent data structures. These approaches (semi-)automatically convert a sequential data structure into a concurrent one.
arxiv