output
20012026
most citedRobustly estimating the flow direction of information in complex physical systems

628 citations

Showing 2014Show all

6 papers · 1 filter

physics.med-ph2014★ 77 cited

Spherical deconvolution of multichannel diffusion MRI data with non-Gaussian noise models and spatial regularization

Erick J. Canales-Rodríguez, Alessandro Daducci, Stamatios N. Sotiropoulos +11

Spherical deconvolution (SD) methods are widely used to estimate the intra-voxel white-matter fiber orientations from diffusion MRI data. However, while some of these methods assum…

cs.CC2014★ 3 cited

Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method

Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano +1

Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \emph…

physics.bio-ph2014

Isotopic Resonance Hypothesis: Experimental Verification by Escherichia coli Growth Measurements

Xueshu Xie, Roman A. Zubarev

Isotopic composition of reactants affects the rates of chemical and biochemical reactions. As a rule, enrichment of heavy stable isotopes leads to slower reactions. But the recent…

q-bio.MN2014★ 53 cited

Expression proteomics reveals protein targets and highlights mechanisms of action of small molecule drugs

Alexey Chernobrovkin, Consuelo Marin Vicente, Neus Visa +1

Phenomenological screening of small molecule libraries for anticancer activity yields potentially interesting candidate molecules, with a bottleneck in the determination of drug ta…

q-bio.QM2014★ 31 cited

Effects of low-level deuterium enrichment on bacterial growth

Xueshu Xie, Roman A. Zubarev

Using very precise (up to 0.05%) measurements of the growth parameters for bacteria E. coli grown on minimal media, we aimed to determine the lowest deuterium concentration at whic…

physics.soc-ph2014★ 73 cited

Random walk centrality for temporal networks

Luis Enrique Correa Rocha, Naoki Masuda

Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and…