Pith. sign in

REVIEW 4 major objections 5 minor 29 references

On Quantum Random Walks in Biomolecular Networks

T0 review · 4 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A quantum random walk ranks disease genes at the top more often than a classical walk, and reveals a cell path classical diffusion misses.

desk verdict A useful extension undermined by an unfair baseline comparison. read the letter →

arxiv 2506.06514 v2 pith:YECDXPJ2 submitted 2025-06-06 quant-ph q-bio.MNq-bio.QM

Viacheslav Dubovitskii , Aritra Bose , Filippo Utro , Laxmi Parida This is my paper
classification quant-phq-bio.MNq-bio.QM
keywords quantumrandomwalksnetworkpropagationdiseasegeneprioritizationbiomolecularnetworkscell-cellinteractioncontinuous-timewalkdiscrete-timebrownadiposetissue
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that quantum random walks—the interference-based, unitary analogues of classical diffusion on a graph—are a workable tool for analyzing real biomolecular networks, not just a theoretical construct. It reports that a continuous-time quantum walk ranks known disease-associated genes higher than a classical random walk with restart in the top-20 lists for asthma, autism, and schizophrenia across most of five gene networks. It also reports that a discrete-time quantum walk on a mouse brown-adipose cell-cell interaction network recovers a path from CD8+ T cells to malignant cells through L-glutamine and the SLC3A2 transporter, a route the classical walk does not find. If these results hold, quantum walks would give network medicine a concrete way to sharpen gene prioritization and to generate cell-communication hypotheses.

What carries the argument

The load-bearing object is the quantum random walk on a graph whose Hamiltonian is the network itself. In continuous time, the walker evolves by the Schrödinger equation with $H=A$ or $H=L$, the initial amplitudes are normalized gene scores, and a gene's rank score is the squared transition amplitude $|\langle j|e^{-iHt}|k\rangle|^2$; because amplitudes add before being squared, paths interfere, which is the mechanism that makes the quantum ranking differ from classical diffusion. In discrete time, the walker lives on directed edge states $|j\to k\rangle$ and moves by a coin-and-shift unitary $U=SC$, making the dynamics deterministic and reversible on a superposition of paths. The continuous time parameter $t$ is the free knob the paper turns to select the maximum AP@K used in the comparison.

What would settle it

Re-run the five-network comparison with RWR's restart probability optimized over a grid and with CTQRW's time parameter either averaged or selected by cross-validation; if the top-20 AP@K advantage over RWR shrinks below the reported margins or reverses, the central claim fails. A permutation test that shuffles the seed/target assignment and recomputes the maximum AP@K difference would show whether the reported gap is larger than chance, since the paper provides no error bars or significance test.

Watch

Extended reading notes

Core claim

The paper's central claim is that replacing classical diffusion with a unitary quantum walk changes which nodes of a biological network are highlighted, and that the change is biologically informative. For disease-gene prioritization, the paper compares a continuous-time quantum random walk (CTQRW), defined by $|\psi(t)\rangle=e^{-iHt}|\psi(0)\rangle$ with transition probability $p_{j\to k}(t)=|\langle j|e^{-iHt}|k\rangle|^2$ and $H$ the adjacency or Laplacian matrix, against a classical random walk with restart (RWR) on the giant components of five gene networks. The paper reports that, allowing the evolution time $t$ to vary, CTQRW reaches higher mean AP@K at $K=20$ on most networks for all three diseases (for example about 0.7 versus a lower RWR value for asthma on HumanNet, and about 0.3 versus 0.14 for autism on PCNet), while the gap narrows at $K=100$. For the cell-cell interaction setting, the paper reports that a discrete-time quantum random walk (DTQRW) on a four-partite graph derived from mouse brown adipose tissue does not settle into the same community structure as the classical discrete-time walk, and that it finds a short path from CD8+ T cells to malignant cells via L-glutamine and SLC3A2 that the classical walk does not.

Load-bearing premise

The load-bearing premise is that comparing the quantum walk's best performance over its time parameter with the classical walk's default restart setting is a fair head-to-head; if the classical walk were tuned as generously, the reported advantage could disappear.

Editorial extensions

If this is right

  • At $K=20$, CTQRW gives higher mean AP@K than RWR on most of the five networks across asthma, autism, and schizophrenia, and the advantage shrinks as $K$ grows to 100, so the practical gain is concentrated in the highest-ranked genes.
  • Because the comparison runs on the giant component of each network, the quantum walker's advantage is not an artifact of a single network size or density; it appears on both densely connected networks like PCNet and fragment-prone networks like BioPlex3 and STRING.
  • In the CCI network, DTQRW identifies L-glutamine, SLC3A2, and GABA as key metabolites in pathways the classical walk misses, which means quantum walks can be used to propose specific, literature-checkable cell-communication hypotheses.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural stress test is to average CTQRW's AP@K over time instead of taking its maximum; if the averaged curve still beats RWR, the ranking advantage is robust, whereas if it does not, the practical gain hinges on choosing $t$ well in advance.
  • The reported CD8+ T-cell to malignant-cell path through L-glutamine and SLC3A2 is a concrete experiment: perturb SLC3A2 expression or glutamine availability in an adipose-tumor co-culture and ask whether the signaling route inferred from the network changes as the quantum walk predicts.
  • The time dependence of CTQRW's ranking quality could itself be a signal: peaks in AP@K over $t$ may mark characteristic propagation scales of a disease module, giving a new way to compare module geometry across diseases.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper investigates the use of quantum random walks (QRWs) in two biomolecular network analysis tasks: continuous-time quantum random walks (CTQRW) for disease gene prioritization on five interactome networks across asthma, autism, and schizophrenia; and discrete-time quantum random walks (DTQRW) for analyzing a cell-cell interaction (CCI) network from mouse brown adipose tissue. The central claims are that CTQRW ranks disease-associated genes more accurately than classical random walk with restart (RWR), and that DTQRW identifies biological pathways (e.g., CD8+ T-cell to malignant-cell signaling) that classical discrete-time random walks overlook. The paper reports mean AP@20 improvements, maximum AP@K comparisons, and a qualitative community analysis of the CCI network.

Significance. If the claims were properly established, this would be a meaningful contribution to the emerging literature on quantum walk applications in network medicine, extending earlier work on quantum disease-gene prioritization (e.g., Saarinen et al.) to a broader set of interactomes and a novel multipartite CCI setting. The use of publicly available GWAS-derived networks and a real scRNA-seq-based CCI network is a strength, and the paper explicitly acknowledges some limitations (e.g., dead ends in multipartite walks). However, the current evaluation methodology is not sound enough to support the headline claims: the central quantitative comparison is unfair, the CCI analysis is anecdotal, and no reproducibility artifacts (code, parameter grids, or statistical tests) are provided. The potential significance is therefore moderate, contingent on a substantially revised evaluation.

major comments (4)
  1. [Section III-A and Figs. 1–2] The central performance comparison is unfair and the claim that CTQRW 'significantly outperformed' RWR is not established. CTQRW's evolution time t is swept and the maximum mean AP@K over t is reported, while RWR uses the NetworkX default restart probability (presumably the standard PageRank α = 0.85) without any tuning. Moreover, the time t is selected on the same target genes that are used as ground truth for evaluation, so the comparison includes a form of test-set tuning. No error bars, replicate seeds, or significance tests accompany the reported differences (e.g., the Autism AP@20 values of 0.30 vs. 0.14 could be within noise). A fair comparison would tune RWR's α over a comparable range, choose both hyperparameters using a validation set or internal cross-validation, and report means and variances across repeats.
  2. [Section III-A] The 'maximum metric AP@K' is an oracle metric that inflates apparent performance. Reporting the best AP@K at any time t does not describe the behavior of a fixed, usable algorithm, and it is not a standard evaluation protocol. The paper should either report performance as a function of t (as in Fig. 1) with a principled selection criterion, or average over a reasonable range of t; if a maximum is retained, it must be compared against a classically tuned baseline selected under identical conditions.
  3. [Section III-B] The CCI analysis is qualitative and anecdotal. The claim that DTQRW identifies 'key driver genes' overlooked by classical walks is based on a single example (the CD8+ T to malignant-cell path via L-Glutamine and SLC3A2) and a visual inspection of heatmaps. No quantitative metric, null model, or statistical test is applied to the transition-probability matrices or the resulting communities, so the claim that DTQRW is more sensitive to network structure is not supported. The analysis should define an evaluation criterion (e.g., enrichment of validated ligands/receptors, or a comparison of recovered communities against known biology) and evaluate both methods under identical conditions.
  4. [Section II-E and Section III-A] The implementation of CTQRW is underspecified, which prevents reproducibility and makes the comparison opaque. The paper does not state whether the Hamiltonian is the adjacency matrix A or the Laplacian L, whether the periodic wave-function collapse described in Section II-E is actually implemented, or whether the chiral Hamiltonian of Eq. (6) is used. The range and resolution of the time parameter t in the sweep are also not given. These details are essential for interpreting the results and for allowing others to repeat the experiments.
minor comments (5)
  1. [Section I] The last paragraph of the introduction contains a sentence fragment: 'Recently, with the advent of quantum algorithms in pre-fault tolerant quantum hardware and their applications in biomedicine [3], clinical trials [4], and single-cell analyses [5], among others.' This should be completed or merged with the following sentence.
  2. [Eq. (8)] In Eq. (8), the summation index k conflicts with the free target index in p_{j->k}(t); the expression should be rewritten, for example as p_{j->k}(t) = Σ_{k'=1}^{d_j} |ψ_{j,k'}(t)|^2.
  3. [Fig. 4 caption] The caption contains a typographical error: 'IS' in 'The l2 distance ... IS represented' should be lowercase 'is'.
  4. [Table I] The name 'Bioplex3' should be spelled consistently as 'BioPlex3' throughout the table and text.
  5. [Section III-A] The phrase 'significantly better' is used colloquially without any statistical significance test; please replace it with a quantitative statement or add appropriate statistical tests.

Circularity Check

1 steps flagged · score 6.0 of 10

CTQRW's claimed ranking advantage is partly constructed: the maximum-AP@K comparison tunes the quantum-walk time parameter on the same ground truth used for evaluation while fixing RWR's restart parameter, so the headline performance is a test-set fit rather than an independent prediction.

  1. fitted input called prediction [Section III-A (Biomolecular Networks), Figs. 1-2; metric defined in Section II-G, Eq. (9)]
    "We observe that CTQRW had far more fluctuations across time, frequently changing mean AP@K with more variance, which also led to it reaching the maximum mean AP@K of 0.7 in HumanNet network for Asthma, 0.3 in PCNet network for Autism, and around 0.55 in BioPlex3 network for Schizophrenia. ... When we compared CTQRW with RWR with varying K from 20 to 100, we note that in the maximum metric AP@K, CTQRW significantly outperformed RWR for most of the networks in all three diseases (Fig. 2)."

    The headline performance metric is the maximum AP@K over CTQRW's continuous time parameter t, and AP@K is computed against the same disease-target ground truth that defines the prediction target (Eq. 9). By reporting 'the maximum mean AP@K' and 'in the maximum metric AP@K', the paper selects t to maximize the evaluation metric and then presents that selected maximum as CTQRW's predictive performance. RWR's restart parameter is not similarly tuned: 'The hyperparameter alpha is fixed' (Section II-D). Thus the claimed 'significantly outperformed' advantage at K=20 is the best value of a fit to the test labels, not an out-of-sample prediction.

full rationale

The paper's mathematical sections are not circular: the CTQRW evolution follows the standard Schrödinger equation, the transition probabilities are defined by the unitary matrix exponential, and the AP@K metric is defined in the usual way. No equation derives its conclusion from itself by construction. Self-citations, such as [9] and the contextual references to quantum-walk work, are not load-bearing for the central comparison: the classical RWR baseline is implemented via NetworkX, and the cell-cell interaction findings are checked against external literature. However, the primary empirical claim in Section III-A is partially circular in the fitted-input sense. The paper sweeps the continuous time parameter t, reports 'the maximum mean AP@K', and then concludes 'in the maximum metric AP@K, CTQRW significantly outperformed RWR'. Since AP@K is evaluated against the same target-gene ground truth that is the prediction target, taking the maximum over t is equivalent to fitting t to the test labels. RWR's counterpart parameter is not tuned ('The hyperparameter alpha is fixed'), making the comparison asymmetric. The claimed superiority is therefore the selected maximum of a test-set fit rather than a prediction at a predetermined parameter value. The CCI application and the formal QRW definitions do not exhibit this issue. Because the main disease-ranking claim reduces in part to a test-set-tuned comparison, a moderate circularity score is warranted.

Assumptions & free parameters 3 free parameters · 3 assumptions · 0 invented entities

The paper introduces no new theoretical entities; it applies existing quantum walk formalism. The main ledger items are the hyperparameters controlling the walks, one of which is fitted to the test set.

free parameters (3)
  • CTQRW evolution time t
    Swept over a range and the maximum AP@K is reported, effectively fitting t to the ground truth.
  • RWR restart probability alpha = 0.85 (NetworkX default)
    Used as a fixed baseline without tuning, making the comparison asymmetric.
  • DTQRW step count = 5
    Fixed at five steps for the CCI network without justification.
assumptions (3)
  • domain assumption Network propagation assumption: biomolecules involved in similar biological functions tend to interact within the same network.
    Section I: the premise that disease genes cluster in network neighborhoods.
  • domain assumption CTQW evolution follows the Schrodinger equation with Hamiltonian equal to the adjacency or Laplacian matrix.
    Section II-E: standard continuous-time quantum walk definition used as the model.
  • domain assumption Ground truth target genes are correctly defined by GWAS p-value threshold (<5e-8) and seed genes by p<0.01.
    Section III-A: the evaluation depends on these thresholds being biologically valid.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On Quantum Random Walks in Biomolecular Networks." pith.science (2026). https://pith.science/paper/YECDXPJ2

@misc{pith2026250606514,
  author       = {Pith},
  title        = {Pith review of: On Quantum Random Walks in Biomolecular Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YECDXPJ2}},
  note         = {Machine review of arXiv:2506.06514}
}
read the original abstract

Biomolecular networks, such as protein-protein interactions, gene-gene associations, and cell-cell interactions, offer valuable insights into the complex organization of biological systems. These networks are key to understanding cellular functions, disease mechanisms, and identifying therapeutic targets. However, their analysis is challenged by the high dimensionality, heterogeneity, and sparsity of multi-omics data. Random walk algorithms are widely used to propagate information through disease modules, helping to identify disease-associated genes and uncover relevant biological pathways. In this work, we investigate the limitations of classical random walks and explore the potential of quantum random walks (QRWs) for biomolecular network analysis. We evaluate QRWs in two network-based applications. First, in a gene-gene interaction network associated with asthma, autism, and schizophrenia, QRWs more accurately rank disease-associated genes compared to classical methods. Second, in a structured multi-partite cell-cell interaction network derived from mouse brown adipose tissue, QRWs identify key driver genes in malignant cells that are overlooked by classical random walks. Our findings suggest that quantum random walks offer a promising alternative to classical approaches, with improved sensitivity to network structure and better performance in identifying biologically relevant features. This highlights their potential in advancing network medicine and systems biology.

Figures

Figures reproduced from arXiv: 2506.06514 by the authors.

Figure 1
Figure 1. Mean AP @20 performance for Asthma, Autism, and Schizophrenia comparing CTQRW and RWR with varying time. effective way to investigate and represent network propaga￾tion [23]. Network connectivity is essential for algorithms such as random walks or quantum random walks, as they rely on traversing the network to spread information. Notably, three networks: ProteomeHD, BioPlex3, and STRING resulted in fragments with ma… view at source ↗
Figure 2
Figure 2. Comparing CTQRW againt RWR across all three diseases and networks with maximum [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Cell-cell interaction network obtained from single-cell RNA-seq data [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (1 more)
Figure 5
Figure 5. Figure 5: Sub-graph spanned by selecting Myofibroblast and Malignant cells as target nodes and applying DTRW and DTQRW from random source nodes. [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

29 extracted references · 26 canonical work pages

  1. [1]

    Network propagation: a universal amplifier of genetic associations

    Lenore Cowen, Trey Ideker, Benjamin J Raphael, and Roded Sharan. Network propagation: a universal amplifier of genetic associations. Nat. Rev. Genet., 18(9):551–562, September 2017

    work page 2017

  2. [2]

    The power of protein interac- tion networks for associating genes with diseases

    Saket Navlakha and Carl Kingsford. The power of protein interac- tion networks for associating genes with diseases. Bioinformatics, 26(8):1057–1063, April 2010

    work page 2010

  3. [3]

    Towards quantum tensor decomposition in biomedical applications

    Myson Burch, Jiasen Zhang, Gideon Idumah, Hakan Doga, Richard Lartey, Lamis Yehia, Mingrui Yang, Murat Yildirim, Mihriban Karaay- vaz, Omar Shehab, et al. Towards quantum tensor decomposition in biomedical applications. arXiv preprint arXiv:2502.13140 , 2025

    arXiv 2025

  4. [4]

    How can quantum computing be applied in clinical trial design and optimization? Trends in Pharmacological Sciences, 2024

    Hakan Doga, Aritra Bose, M Emre Sahin, Joao Bettencourt-Silva, Anh Pham, Eunyoung Kim, Alan Andress, Sudhir Saxena, Laxmi Parida, Jan Lukas Robertus, et al. How can quantum computing be applied in clinical trial design and optimization? Trends in Pharmacological Sciences, 2024

    work page 2024

  5. [5]

    Towards quantum-enabled cell-centric therapeutics

    Saugata Basu, Jannis Born, Aritra Bose, Sara Capponi, Dimitra Chalkia, Timothy A Chan, Hakan Doga, Frederik F Flother, Gad Getz, Mark Goldsmith, et al. Towards quantum-enabled cell-centric therapeutics. arXiv preprint arXiv:2307.05734 , 2023

    arXiv 2023

  6. [6]

    Sabrina Maniscalco, Elsi-Mari Borrelli, Daniel Cavalcanti, Caterina Foti, Adam Glos, Mark Goldsmith, Stefan Knecht, Keijo Korhonen, Joonas Malmi, Anton Nyk ¨anen, Matteo A. C. Rossi, Harto Saarinen, Boris Sokolov, N. Walter Talarico, Jussi Westergren, Zolt ´an Zimbor ´as, and Guillermo Garc ´ıa-P´erez. Quantum network medicine: rethinking medicine with ne...

    work page 2022

  7. [7]

    Mark Goldsmith, Harto Saarinen, Guillermo Garc ´ıa-P´erez, Joonas Malmi, Matteo A. C. Rossi, and Sabrina Maniscalco. Link prediction with continuous-time classical and quantum walks. Entropy, 25(5), 2023

    work page 2023

  8. [8]

    Disease gene prioritization with quantum walks

    Harto Saarinen, Mark Goldsmith, Rui-Sheng Wang, Joseph Loscalzo, and Sabrina Maniscalco. Disease gene prioritization with quantum walks. Bioinformatics, 40(8):btae513, 08 2024

    work page 2024

Show all 29 references
  1. [9]

    A perspective on quantum computing for analyzing cell- cell communication networks

    Filippo Utro, Aritra Bose, Rui-sheng Wang, Viacheslav Dubovitskii, and Laxmi Parida. A perspective on quantum computing for analyzing cell- cell communication networks. In Conference on Intelligent Systems for Molecular Biology, 2024

    2024

  2. [10]

    Quantum random walks: An introductory overview

    J Kempe. Quantum random walks: An introductory overview. Contem- porary Physics, 44(4):307–327, July 2003

    2003

  3. [11]

    Network propagation for gwas analysis: a practical guide to leveraging molecular networks for disease gene discovery

    Giovanni Vison `a, Emmanuelle Bouzigon, Florence Demenais, and Gabriele Schweikert. Network propagation for gwas analysis: a practical guide to leveraging molecular networks for disease gene discovery. Briefings in Bioinformatics , 25(2):bbae014, 02 2024

    2024

  4. [12]

    Humannet v3: an improved database of human gene networks for disease research

    Chan Yeong Kim, Seungbyn Baek, Junha Cha, Sunmo Yang, Eiru Kim, Edward M Marcotte, Traver Hart, and Insuk Lee. Humannet v3: an improved database of human gene networks for disease research. Nucleic acids research, 50(D1):D632–D639, 2022

    2022

  5. [13]

    Dual proteome-scale networks reveal cell-specific remodeling of the human interactome

    Edward L Huttlin, Raphael J Bruckner, Jose Navarrete-Perea, Joe R Cannon, Kurt Baltier, Fana Gebreab, Melanie P Gygi, Alexandra Thornock, Gabriela Zarraga, Stanley Tam, et al. Dual proteome-scale networks reveal cell-specific remodeling of the human interactome. Cell, 184(11):...

    2021

  6. [14]

    Co-regulation map of the human proteome enables identification of protein functions

    Georg Kustatscher, Piotr Grabowski, Tina A Schrader, Josiah B Pass- more, Michael Schrader, and Juri Rappsilber. Co-regulation map of the human proteome enables identification of protein functions. Nature biotechnology, 37(11):1361–1371, 2019

    2019

  7. [15]

    Systematic evaluation of molecular networks for discovery of disease genes

    Justin K Huang, Daniel E Carlin, Michael Ku Yu, Wei Zhang, Jason F Kreisberg, Pablo Tamayo, and Trey Ideker. Systematic evaluation of molecular networks for discovery of disease genes. Cell systems , 6(4):484–495, 2018

    2018

  8. [16]

    String: known and predicted protein–protein associations, integrated and transferred across organisms

    Christian V on Mering, Lars J Jensen, Berend Snel, Sean D Hooper, Markus Krupp, Mathilde Foglierini, Nelly Jouffre, Martijn A Huynen, and Peer Bork. String: known and predicted protein–protein associations, integrated and transferred across organisms. Nucleic acids research , ...

    2005

  9. [17]

    Mebocost: Metabolite-mediated cell communication modeling by single cell transcriptome

    Rongbin Zheng, Yang Zhang, Tadataka Tsuji, Xinlei Gao, Allon Wagner, Nir Yosef, Hong Chen, Lili Zhang, Yu-Hua Tseng, and Kaifu Chen. Mebocost: Metabolite-mediated cell communication modeling by single cell transcriptome. bioRxiv, 2022

    2022

  10. [18]

    Quantum random walks

    Yakir Aharonov, Luiz Davidovich, and Nicim Zagury. Quantum random walks. Physical Review A , 48(2):1687, 1993

    1993

  11. [19]

    Enhanced quantum transport in chiral quantum walks

    Emilio Annoni, Massimo Frigerio, and Matteo GA Paris. Enhanced quantum transport in chiral quantum walks. Quantum Information Processing, 23(4):117, 2024

    2024

  12. [20]

    Chiral quantum walks

    Dawei Lu, Jacob D Biamonte, Jun Li, Hang Li, Tomi H Johnson, Ville Bergholm, Mauro Faccin, Zolt ´an Zimbor ´as, Raymond Laflamme, Jonathan Baugh, et al. Chiral quantum walks. Physical Review A , 93(4):042302, 2016

    2016

  13. [21]

    Thomas M. Fischer. On the algorithm by al-mohy and higham for computing the action of the matrix exponential: A posteriori roundoff error estimation. Linear Algebra and its Applications , 531:141–168, 2017

    2017

  14. [22]

    Random walks: A review of algorithms and applications

    Feng Xia, Jiaying Liu, Hansong Nie, Yonghao Fu, Liangtian Wan, and Xiangjie Kong. Random walks: A review of algorithms and applications. IEEE Transactions on Emerging Topics in Computational Intelligence , 4(2):95–107, 2019

    2019

  15. [23]

    Random walk with restart: fast solutions and applications

    Hanghang Tong, Christos Faloutsos, and Jia-Yu Pan. Random walk with restart: fast solutions and applications. Knowledge and Information Systems, 14:327–346, 2008

    2008

  16. [24]

    Gene and network analysis of common variants reveals novel associations in multiple complex diseases

    Priyanka Nakka, Benjamin J Raphael, and Sohini Ramachandran. Gene and network analysis of common variants reveals novel associations in multiple complex diseases. Genetics, 204(2):783–798, 2016

    2016

  17. [25]

    Exploring network structure, dynamics, and function using networkx

    Aric Hagberg, Pieter J Swart, and Daniel A Schult. Exploring network structure, dynamics, and function using networkx. Technical report, Los Alamos National Laboratory (LANL), Los Alamos, NM (United States), 2008

    2008

  18. [26]

    Cd8+ t cell metabolism in infection and cancer

    Miguel Reina-Campos, Nicole E Scharping, and Ananda W Goldrath. Cd8+ t cell metabolism in infection and cancer. Nature Reviews Immunology, 21(11):718–738, 2021

    2021

  19. [27]

    Cd8+ t cells regulate tumour ferroptosis during cancer immunotherapy

    Weimin Wang, Michael Green, Jae Eun Choi, Miguel Gij ´on, Paul D Kennedy, Jeffrey K Johnson, Peng Liao, Xueting Lang, Ilona Kryczek, Amanda Sell, et al. Cd8+ t cells regulate tumour ferroptosis during cancer immunotherapy. Nature, 569(7755):270–274, 2019

    2019

  20. [28]

    Differential effects of glutamine inhibition strategies on antitumor cd8 t cells

    Matthew Z Madden, Xiang Ye, Channing Chi, Emilie L Fisher, Melissa M Wolf, Gabriel A Needle, Jackie E Bader, Andrew R Patterson, Bradley I Reinfeld, Madelyn D Landis, et al. Differential effects of glutamine inhibition strategies on antitumor cd8 t cells. The Journal of Immuno...

    2023

  21. [29]

    Gamma-aminobutyric acid signaling in brown adipose tissue promotes systemic metabolic derangement in obesity

    Ryutaro Ikegami, Ippei Shimizu, Takeshi Sato, Yohko Yoshida, Yuka Hayashi, Masayoshi Suda, Goro Katsuumi, Ji Li, Takayuki Wakasugi, Yasuhiko Minokoshi, et al. Gamma-aminobutyric acid signaling in brown adipose tissue promotes systemic metabolic derangement in obesity. Cell rep...

    2018

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.