# Computing equilibrium concentrations for large heterodimerization networks

Source: [Computing equilibrium concentrations for large heterodimerization networks](<https://www.sota2.com/research/paper/68fa2ad01e209131ce840f7d>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T13:48:00.928Z

Authors: M. G. A. van Dorp, F. Berger, E. Carlon

Published: 2011-10-12T09:39:58.000Z

## Abstract

We consider a chemical reaction network governed by mass action kinetics and composed of N different species which can reversibly form heterodimers. A fast iterative algorithm is introduced to compute the equilibrium concentrations of such networks. We show that the convergence is guaranteed by the Banach fixed point theorem. As a practical example, of relevance for a quantitative analysis of microarray data, we consider a reaction network formed by N~10^6 mutually hybridizing different mRNA sequences. We show that, despite the large number of species involved, the convergence to equilibrium is very rapid for most species. The origin of slow convergence for some specific subnetworks is discussed. This provides some insights for improving the performance of the algorithm.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1110.2616>)

[PDF](<https://arxiv.org/pdf/1110.2616.pdf>)