Results 61 to 70 of about 6,691,397 (341)
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
Parallel construction of binary tree based on sorting
Advanced Engineering Research, 2018 Introduction. Algorithms for the parallel binary tree construction are developed. The algorithms are based on sorting and described in a constructive form. For the Nelement set, the time complexity has T(R) = O(1) and T(R) = O(log2 N) estimates, where R =
Ya. E. Romm, D. A. Chabanyuk
doaj +1 more source
Data structures for retrieval on integer grids [PDF]
, 1984 A family of data structures is presented for retrieval of the sum of values of points within a half-plane or polygon, given that the points are on integer coordinates in the plane.
Katz, Martin David, Volper, Dennis J.
core +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
FEBS Letters, EarlyView.B cells sense external mechanical forces and convert them into biochemical signals through mechanotransduction. Understanding how malignant B cells respond to physical stimuli represents a groundbreaking area of research. This review examines the key mechano‐related molecules and pathways in B lymphocytes, highlights the most relevant techniques to ...
Marta Sampietro +2 more
wiley +1 more source
FASTSET: A Fast Data Structure for the Representation of Sets of Integers
Algorithms, 2019 We describe a simple data structure for storing subsets of { 0 , … , N − 1 } , with N a given integer, which has optimal time performance for all the main set operations, whereas previous data structures are non-optimal for at least ...
Giuseppe Lancia, Marcello Dalpasso
doaj +1 more source
An alternative efficient chessboard representation based on 4-bit piece coding [PDF]
Yugoslav Journal of Operations Research, 2012 This paper describes theoretical and practical aspects of an alternative efficient chessboard representation based on 4-bit piece coding technique. There are two main approaches used by the majority of computer chess programs: arrays and bitboards ...
Vučković Vladan
doaj +1 more source
Deterministic sub-linear space LCE data structures with efficient construction [PDF]
, 2016 Given a string $S$ of $n$ symbols, a longest common extension query $\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps
Bannai, Hideo +5 more
core +2 more sources
Purification tags markedly affect self‐aggregation of CPEB3
FEBS Letters, EarlyView.Although recombinant proteins are used to study protein aggregation in vitro, uncleaved tags can interfere with accurate interpretation. Our findings demonstrate that His₆‐GFP and His₁₂ tags significantly affect liquid droplet and amyloid fibril formation in the intrinsically disordered region (IDR) of mouse cytoplasmic polyadenylation element‐binding ...
Harunobu Saito +6 more
wiley +1 more source
A novel two‐stage method to detect non‐technical losses in smart grids
IET Smart CitiesNumerous strategies have been proposed for the detection and prevention of non‐technical electricity losses due to fraudulent activities. Among these, machine learning algorithms and data‐driven techniques have gained prominence over traditional ...
Sufian A. Badawi +10 more
doaj +1 more source