We lifted 4 functions out of this paper's own repositories and ran 4 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| mucdk/genot | canonical | 4 of 4 |
| Function | Status | Where it lives |
|---|---|---|
| compute_directional_statistics_from_samples | Ran | mucdk/genot/genot/metrics/metrics.py code served (permissive licence) · get_code("45b8526c4e609688") |
| compute_statistics_from_samples | Ran | mucdk/genot/genot/metrics/metrics.py code served (permissive licence) · get_code("5475d792a21919df") |
| sample_conditional_indices_from_tmap | Ran | mucdk/genot/genot/models/model.py code served (permissive licence) · get_code("3701dc9326e6c024") |
| sample_velocities_from_transport_matrix | Ran | mucdk/genot/genot/metrics/metrics.py code served (permissive licence) · get_code("5962bc11878ea7f5") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Single-cell genomics has significantly advanced our understanding of cellular behavior, catalyzing innovations in treatments and precision medicine. However, single-cell sequencing technologies are inherently destructive and can only measure a limited array of data modalities simultaneously. This limitation underscores the need for new methods capable of realigning cells. Optimal transport (OT) has emerged as a potent solution, but traditional discrete solvers are hampered by scalability, privacy, and out-of-sample estimation issues. These challenges have spurred the development of neural network-based solvers, known as neural OT solvers, that parameterize OT maps. Yet, these models often lack the flexibility needed for broader life science applications. To address these deficiencies, our approach learns stochastic maps (i.e. transport plans), allows for any cost function, relaxes mass conservation constraints and integrates quadratic solvers to tackle the complex challenges posed by the (Fused) Gromov-Wasserstein problem. Utilizing flow matching as a backbone, our method offers a flexible and effective framework. We demonstrate its versatility and robustness through applications in cell development studies, cellular drug response modeling, and cross-modality cell translation, illustrating significant potential for enhancing therapeutic strategies.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2310.09254")
get_code_for_paper("2310.09254")
have("2310.09254")
Connect an agent — have() is free.