OSCR

AUKAT: Conditional VAE-Driven Augmentation and Neural Modeling of Enzyme Turnover Numbers.

Code ↔ Paper

7 matches between paragraphs of the paper and lines of its authors' code, computed by the harvester (lexical-v1). Click a colored paragraph or line to see its counterpart.

5 blocks of code here have a permanent identifier (oscr:b:…), listed with the matches below: citable for good, with a page of its own. Select a match and press Cite to copy it. What a block identifier is.

The 7 matches
  1. [1] § 2. Materials and Methods › 2.8. Implementation Details and Reproducibility ↔ train.py, lines 120 to 236 · score 0.86 · AdamW, weight decay, squared error, neural network, NumPy, epochs · block oscr:b:WWJ2DEH22ZFWR-T · Report a mismatch
  2. [2] § 2. Materials and Methods › 2.7. Evaluation Metrics ↔ predict_kcat.py, lines 155 to 175 · score 0.62 · squared error, ground truth, power, sum, linear, metric · block oscr:b:4G01ST6YMA1S1-H · Report a mismatch
  3. [3] § 2. Materials and Methods › 2.4. Neural Network Architecture for Prediction ↔ predict_kcat.py, lines 37 to 90 · score 0.55 · Conv1d, flattened, ReLU, module, linear, layers · block oscr:b:15YK3NHN6D60C-G · Report a mismatch
  4. [4] § 2. Materials and Methods › 2.4. Neural Network Architecture for Prediction ↔ predict_kcat.py, lines 37 to 90 · score 0.54 · transformer encoder layers, flattened, module, Network, Neural, embeddings · block oscr:b:15YK3NHN6D60C-G · Report a mismatch
  5. [5] § 2. Materials and Methods › 2.1. Datasets and Preprocessing › 2.1.1. Curated Dataset ↔ train.py, lines 30 to 67 · score 0.54 · ec2vec, mol2vec, blocks, concatenated, species, embeddings · block oscr:b:A3VRR0JCXQPET-K · Report a mismatch
  6. [6] § 2. Materials and Methods › 2.6. Feature Importance Analysis ↔ train.py, lines 30 to 67 · score 0.50 · ec2vec, mol2vec, block, species, embeddings, training · block oscr:b:A3VRR0JCXQPET-K · Report a mismatch
  7. [7] § 2. Materials and Methods › 2.4. Neural Network Architecture for Prediction ↔ model.py, lines 7 to 51 · score 0.50 · Conv1d, ReLU, module, linear, layers, network · block oscr:b:0Y0A050VVMY48-2 · Report a mismatch

Paper

Loaded from Europe PMC by your browser; OSCR does not store it: doi.org · Europe PMC

The paper is loaded when this pane is shown.

The authors' code

Python · 240 lines · 7.4 KB · no license · 3 matches

  1. # train.py
  2. import argparse
  3. import os
  4. from typing import List, Tuple
  5. import numpy as np
  6. import pandas as pd
  7. import torch
  8. import torch.nn as nn
  9. import torch.optim as optim
  10. from scipy.stats import pearsonr
  11. from sklearn.model_selection import train_test_split
  12. from sklearn.metrics import mean_squared_error, r2_score
  13. from torch.utils.data import DataLoader, TensorDataset
  14. from model_for_github import NeuralNetwork
  15. def natural_sort_key(s: str):
  16. """
  17. Sort keys like mol2vec_0, mol2vec_1, ..., mol2vec_10 numerically.
  18. Falls back to string sort if no trailing integer is found.
  19. """
  20. try:
  21. return (0, int(s.split("_")[-1]))
  22. except Exception:
  23. return (1, s)
  24. def detect_feature_columns(df: pd.DataFrame) -> List[str]:
  25. """
  26. Auto-detect feature columns in the canonical order:
  27. mol2vec_* then ec2vec_* then Embedding_*
  28. This matches your original concatenation order (metabolite-EC-species).
  29. """
  30. mol_cols = [c for c in df.columns if c.startswith("mol2vec_")]
  31. ec_cols = [c for c in df.columns if c.startswith("ec2vec_")]
  32. emb_cols = [c for c in df.columns if c.startswith("Embedding_")]
  33. mol_cols = sorted(mol_cols, key=natural_sort_key)
  34. ec_cols = sorted(ec_cols, key=natural_sort_key)
  35. emb_cols = sorted(emb_cols, key=natural_sort_key)
  36. feature_columns = mol_cols + ec_cols + emb_cols
  37. if len(feature_columns) == 0:
  38. raise ValueError(
  39. "No feature columns found. Expected columns starting with "
  40. "'mol2vec_', 'ec2vec_', and/or 'Embedding_'."
  41. )
  42. print("Detected feature columns:")
  43. print(f" mol2vec_* : {len(mol_cols)}")
  44. print(f" ec2vec_* : {len(ec_cols)}")
  45. print(f" Embedding_* : {len(emb_cols)}")
  46. print(f" TOTAL : {len(feature_columns)}")
  47. # Helpful warning if one block is missing (still allowed)
  48. if len(mol_cols) == 0:
  49. print("WARNING: No mol2vec_* columns detected.")
  50. if len(ec_cols) == 0:
  51. print("WARNING: No ec2vec_* columns detected.")
  52. if len(emb_cols) == 0:
  53. print("WARNING: No Embedding_* columns detected.")
  54. return feature_columns
  55. def make_loaders(
  56. X_train: np.ndarray,
  57. y_train: np.ndarray,
  58. X_val: np.ndarray,
  59. y_val: np.ndarray,
  60. batch_size: int,
  61. ) -> Tuple[DataLoader, DataLoader]:
  62. X_train_t = torch.tensor(X_train, dtype=torch.float32)
  63. y_train_t = torch.tensor(y_train, dtype=torch.float32)
  64. X_val_t = torch.tensor(X_val, dtype=torch.float32)
  65. y_val_t = torch.tensor(y_val, dtype=torch.float32)
  66. train_loader = DataLoader(
  67. TensorDataset(X_train_t, y_train_t),
  68. batch_size=batch_size,
  69. shuffle=True,
  70. drop_last=False,
  71. )
  72. val_loader = DataLoader(
  73. TensorDataset(X_val_t, y_val_t),
  74. batch_size=batch_size,
  75. shuffle=False,
  76. drop_last=False,
  77. )
  78. return train_loader, val_loader
  79. def parse_args():
  80. p = argparse.ArgumentParser(
  81. description="Train CNN+Transformer kcat predictor (single train/val split, no pseudo data)."
  82. )
  83. p.add_argument("--data_csv", type=str, required=True, help="CSV path.")
  84. p.add_argument("--target_column", type=str, default="kcat")
  85. p.add_argument("--save_dir", type=str, default="saved_NN_models")
  86. p.add_argument("--ckpt_name", type=str, default="best_model.pth")
  87. p.add_argument("--val_ratio", type=float, default=0.2)
  88. p.add_argument("--seed", type=int, default=42)
  89. p.add_argument("--epochs", type=int, default=300)
  90. p.add_argument("--batch_size", type=int, default=32)
  91. p.add_argument("--lr", type=float, default=2e-4)
  92. p.add_argument("--weight_decay", type=float, default=5e-3)
  93. p.add_argument("--no_cuda", action="store_true")
  94. return p.parse_args()
  95. def main():
  96. args = parse_args()
  97. device = torch.device("cpu" if args.no_cuda or not torch.cuda.is_available() else "cuda")
  98. print(f"Using device: {device}")
  99. # reproducibility
  100. torch.manual_seed(args.seed)
  101. np.random.seed(args.seed)
  102. df = pd.read_csv(args.data_csv)
  103. # auto-detect features in metabolite-EC-species order
  104. feature_columns = detect_feature_columns(df)
  105. # required target
  106. if args.target_column not in df.columns:
  107. raise KeyError(f"Target column '{args.target_column}' not found in CSV.")
  108. # drop NaNs in features + target
  109. df = df.dropna(subset=feature_columns + [args.target_column]).reset_index(drop=True)
  110. # split
  111. train_df, val_df = train_test_split(
  112. df, test_size=args.val_ratio, random_state=args.seed, shuffle=True
  113. )
  114. print(f"Split: train={len(train_df)} val={len(val_df)}")
  115. # numpy arrays
  116. X_train = train_df[feature_columns].values
  117. y_train = train_df[args.target_column].astype(np.float64).values
  118. X_val = val_df[feature_columns].values
  119. y_val = val_df[args.target_column].astype(np.float64).values
  120. # log10 transform (consistent with your original code)
  121. # NOTE: kcat must be > 0
  122. if np.any(y_train <= 0) or np.any(y_val <= 0):
  123. raise ValueError("Found non-positive kcat values. log10 requires kcat > 0.")
  124. y_train_log = np.log10(y_train)
  125. y_val_log = np.log10(y_val)
  126. train_loader, val_loader = make_loaders(X_train, y_train_log, X_val, y_val_log, args.batch_size)
  127. # model
  128. input_size = X_train.shape[1]
  129. model = NeuralNetwork(input_size).to(device)
  130. optimizer = optim.AdamW(model.parameters(), lr=args.lr, weight_decay=args.weight_decay)
  131. criterion = nn.MSELoss()
  132. os.makedirs(args.save_dir, exist_ok=True)
  133. ckpt_path = os.path.join(args.save_dir, args.ckpt_name)
  134. best_val_loss = float("inf")
  135. best_metrics = None
  136. for epoch in range(args.epochs):
  137. # train
  138. model.train()
  139. train_loss_sum = 0.0
  140. for xb, yb in train_loader:
  141. xb = xb.to(device)
  142. yb = yb.to(device)
  143. optimizer.zero_grad(set_to_none=True)
  144. pred = model(xb).squeeze()
  145. loss = criterion(pred, yb)
  146. loss.backward()
  147. optimizer.step()
  148. train_loss_sum += loss.detach().cpu().item()
  149. avg_train_loss = train_loss_sum / max(len(train_loader), 1)
  150. # val
  151. model.eval()
  152. val_loss_sum = 0.0
  153. preds = []
  154. with torch.no_grad():
  155. for xb, yb in val_loader:
  156. xb = xb.to(device)
  157. yb = yb.to(device)
  158. pred = model(xb).squeeze()
  159. loss = criterion(pred, yb)
  160. val_loss_sum += loss.detach().cpu().item()
  161. preds.extend(pred.detach().cpu().numpy())
  162. avg_val_loss = val_loss_sum / max(len(val_loader), 1)
  163. y_pred = np.array(preds, dtype=np.float64)
  164. mse = mean_squared_error(y_val_log, y_pred)
  165. r2 = r2_score(y_val_log, y_pred)
  166. pear = pearsonr(y_val_log, y_pred)[0]
  167. if (epoch + 1) % 10 == 0 or epoch == 0:
  168. print(
  169. f"epoch {epoch+1:4d}/{args.epochs} "
  170. f"train_loss={avg_train_loss:.6f} val_loss={avg_val_loss:.6f} "
  171. f"MSE={mse:.6f} R2={r2:.6f} Pearson={pear:.6f}"
  172. )
  173. if avg_val_loss < best_val_loss:
  174. best_val_loss = avg_val_loss
  175. best_metrics = (mse, r2, pear)
  176. torch.save(model.state_dict(), ckpt_path)
  177. print("\n=== Best checkpoint (by lowest val loss) ===")
  178. print(f"Saved to: {ckpt_path}")
  179. if best_metrics is not None:
  180. mse, r2, pear = best_metrics
  181. print(f"Val MSE: {mse:.6f}")
  182. print(f"Val R2: {r2:.6f}")
  183. print(f"Val Pearson: {pear:.6f}")
  184. if __name__ == "__main__":
  185. main()

train.py at commit 78a2a6c, no license · at the source

Overview

  1. Center for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803, USA
  2. Department of Biological Sciences, Louisiana State University, Baton Rouge, LA 70803, USA
Institutions: Louisiana State University (United States)
Journal: Biomolecules, volume 16, issue 7, article 1049
Dates: received 27 May 2026; accepted 16 July 2026; published online 18 July 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.3390/biom16071049 · PMID 42509841 · PMCID PMC13406586 · OpenAlex W7169723205
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: human (organism)
Methods: Statistics, Machine learning, Connectivity
Keywords: kcat prediction, enzyme kinetics, conditional variational autoencoder, synthetic data augmentation, deep learning, transformer models
MeSH: Enzymes*, Neural Networks, Computer*, Autoencoder, Generative Artificial Intelligence, Kinetics (* major topic)
Topic: Bioinformatics and Genomic Networks (Molecular Biology, Biochemistry, Genetics and Molecular Biology), according to OpenAlex
Citations: not cited yet (Europe PMC); 34 references in the paper

Abstract

Accurate prediction of enzyme turnover numbers (kcat) is essential for applications in systems biology, metabolic engineering, and drug discovery, yet remains challenging due to the limited availability and uneven distribution of experimental data. Here, we present AUKAT, an integrated framework that combines conditional generative modeling with deep neural prediction to improve kcat estimation. A conditional variational autoencoder generates synthetic training instances in embedding space, followed by a selection pipeline that retains samples with strong agreement across independent evaluators, thereby ensuring data reliability. A hybrid convolutional neural network and transformer-based architecture is then used to predict kcat from substrate, enzyme functional, and species embeddings. Incorporating synthetic data improved predictive performance for both random forest and neural network models in five-fold cross-validation, with larger gains observed for the neural network architecture. Benchmarking against DLKcat demonstrated comparable predictive accuracy on the standard test set, while evaluation on stricter unseen subsets indicated improved generalization for low-similarity substrates and enzymes. Feature importance analysis further showed that AUKAT leverages substrate, enzyme functional, and species information in a more balanced manner rather than relying predominantly on a single feature source. In addition, AUKAT-human, a specialized model trained using a pre-training and fine-tuning strategy, achieved improved prediction accuracy for human enzyme kinetics. Overall, AUKAT provides a scalable approach for enzyme kinetics prediction and offers a practical solution to data scarcity in biochemical modeling.

Reproduced under the paper's license (CC BY), from the paper cited above.

Repository

Its files are read in the Code ↔ Paper reader above, with 7 matches between paragraphs and lines of code.

MengLiu90/AUKCAT-Neural-Network-Model-for-Kcat-Prediction

License: none: the authors keep all their rights
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Commit: 78a2a6c14cfb4a4b805544d20cfec0fb8a7072ce, 24 June 2026
Languages: Python (3)
Size: 27 files, 3 scripts
Software Heritage: not archived
Found in: “Data Availability Statement”
Holds: README
Not found: license file, CITATION.cff, environment file, tests, continuous integration, documentation
Tools: PyTorch (3 files), NumPy (2 files), pandas (2 files), scikit-learn (2 files), SciPy (2 files)
Availability: 1 check, the latest on 27 September 2026: the link answers
  • 27 September 2026: the link answers
4 files

The paper's code and data availability statement is in the Data section.

Tracing map

Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.

What the map holds:

  • 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 3 scripts, each with its path and the digest of its content;
  • 7 matches between paragraphs of the paper and lines of the code (method lexical-v1);
  • neither the text of the paper nor the code itself.

Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.

Data

No dataset and no data link were found in the paper.

Data Availability Statement

The code and data are available at https://github.com/MengLiu90/AUKCAT-Neural-Network-Model-for-Kcat-Prediction, (accessed on 24 June 2026).

Reproduced under the paper's license (CC BY), from the paper cited above.

Versions

The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.

Version 1, 27 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 3 authors, 6 keywords, 5 MeSH terms, 1 funder, 29 references.

Cite

This paper

Liu, M., Ni, X., & Brylinski, M. (2026). AUKAT: Conditional VAE-Driven Augmentation and Neural Modeling of Enzyme Turnover Numbers. Biomolecules, 16(7), 1049. https://doi.org/10.3390/biom16071049

BibTeX

@article{liu2026aukat,
author = {Liu, Mengmeng and Ni, Xialong and Brylinski, Michal},
title = {{AUKAT: Conditional VAE-Driven Augmentation and Neural Modeling of Enzyme Turnover Numbers}},
journal = {Biomolecules},
year = {2026},
month = jul,
volume = {16},
number = {7},
pages = {1049},
publisher = {Multidisciplinary Digital Publishing Institute (MDPI)},
issn = {2218-273X},
doi = {10.3390/biom16071049},
url = {https://doi.org/10.3390/biom16071049},
pmid = {42509841},
pmcid = {PMC13406586}
}

RIS

TY - JOUR
AU - Liu, Mengmeng
AU - Ni, Xialong
AU - Brylinski, Michal
TI - AUKAT: Conditional VAE-Driven Augmentation and Neural Modeling of Enzyme Turnover Numbers
T2 - Biomolecules
J2 - Biomolecules
PY - 2026
DA - 2026/07/18
VL - 16
IS - 7
SP - 1049
SN - 2218-273X
PB - Multidisciplinary Digital Publishing Institute (MDPI)
DO - 10.3390/biom16071049
UR - https://doi.org/10.3390/biom16071049
LA - en
ER -

CSL-JSON

{
"id": "10.3390/biom16071049",
"type": "article-journal",
"title": "AUKAT: Conditional VAE-Driven Augmentation and Neural Modeling of Enzyme Turnover Numbers",
"container-title": "Biomolecules",
"author": [
{
"family": "Liu",
"given": "Mengmeng"
},
{
"family": "Ni",
"given": "Xialong"
},
{
"family": "Brylinski",
"given": "Michal"
}
],
"container-title-short": "Biomolecules",
"volume": "16",
"issue": "7",
"page": "1049",
"DOI": "10.3390/biom16071049",
"PMID": "42509841",
"PMCID": "PMC13406586",
"ISSN": "2218-273X",
"publisher": "Multidisciplinary Digital Publishing Institute (MDPI)",
"URL": "https://doi.org/10.3390/biom16071049",
"language": "en",
"issued": {
"date-parts": [
[
2026,
7,
18
]
]
}
}

The tracing map gets a citation of its own once an author has validated it and it has a DOI.

Similar papers

The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.

[1] doi:10.1093/nargab/lqae021 [code]
Detecting anomalous proteins using deep representations.
Journal: NAR genomics and bioinformatics
In common: PyTorch, scikit-learn, pandas, 2 other tools, 2 references
[2] doi:10.1002/pro.70695 [code]
MIF-MAPMS: Enhancing identification of myelin autoantigenic peptides in multiple sclerosis through multimodal information fusion.
Journal: Protein science : a publication of the Protein Society
In common: PyTorch, scikit-learn, pandas, 1 other tool, 2 references
[3] doi:10.3389/fnmol.2021.604559 [code]
A Standardized Brain Molecular Atlas: A Resource for Systems Modeling and Simulation.
Journal: Frontiers in molecular neuroscience
In common: scikit-learn, pandas, SciPy, 1 other tool, 2 references
[4] doi:10.1016/j.csbj.2025.03.043 [code]
iNClassSec-ESM: Discovering potential non-classical secreted proteins through a novel protein language model.
Journal: Computational and structural biotechnology journal
In common: PyTorch, scikit-learn, pandas, 1 other tool, 2 references
[5] doi:10.1002/advs.202523984 [code]
INB&lt;sup&gt;3&lt;/sup&gt;P: A Multi-Modal and Interpretable Co-Attention Framework Integrating Property-Aware Explanations and Memory-Bank Contrastive Fusion for Blood-Brain Barrier Penetrating Peptide Discovery.
Journal: Advanced science (Weinheim, Baden-Wurttemberg, Germany)
In common: PyTorch, scikit-learn, pandas, 2 other tools, 1 reference
[6] doi:10.1186/s40246-025-00898-4 [code]
Prioritizing missense mutations via a deep learning phosphorylation prediction model.
Journal: Human genomics
In common: PyTorch, scikit-learn, pandas, 2 other tools, 1 reference
[7] doi:10.1021/acsomega.4c07078 [code]
Deep Learning for Odor Prediction on Aroma-Chemical Blends.
Journal: ACS omega
In common: PyTorch, scikit-learn, pandas, 2 other tools, 1 reference
[8] doi:10.1038/s41467-025-64392-0 [code]
Structure-guided discovery of Otopetrin 1 inhibitors reveals druggable binding sites at the intrasubunit interface.
Journal: Nature communications
In common: PyTorch, scikit-learn, pandas, 2 other tools, 1 reference
[9] doi:10.1093/narcan/zcaf029 [code]
Neural interaction explainable AI predicts drug response across cancers.
Journal: NAR cancer
In common: PyTorch, scikit-learn, pandas, 2 other tools, 1 reference
[10] doi:10.3390/e25020257 [code]
A Novel Temporal Network-Embedding Algorithm for Link Prediction in Dynamic Networks.
Journal: Entropy (Basel, Switzerland)
In common: PyTorch, scikit-learn, pandas, 2 other tools, 1 reference

Contribute

The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.

Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.

Add the badge to the code's README

OSCR: the badge of this paper

If you are an author or a maintainer of this paper's code, you can add this badge. It says what OSCR knows of the paper (its code, its validated tracing map) and links the code to this page. Paste one of these snippets under the README's title. Keep the two marks around it, so that the badge can be replaced in place and is never added twice. OSCR changes nothing in your repository.

Markdown
<!-- oscr-badge:start -->
[![OSCR](https://openscicode.org/badge/doi/10.3390/biom16071049.svg)](https://openscicode.org/badge/doi/10.3390/biom16071049)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

.. image:: https://openscicode.org/badge/doi/10.3390/biom16071049.svg
   :target: https://openscicode.org/badge/doi/10.3390/biom16071049
   :alt: OSCR

.. oscr-badge:end
HTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.3390/biom16071049"><img src="https://openscicode.org/badge/doi/10.3390/biom16071049.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->

On GitHub, open the README, choose Edit (the pencil), paste the snippet under the title, then "Commit changes".

If you choose to, you can have the badge kept up to date for you, with oscr badge --write from the command line or with the GitHub Action in your repository's workflows. Every other form and option (a card, AsciiDoc, LaTeX, shields.io) is on the badge page.

Request its removal

To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).

Discussion, reproductions, activity

Discussion: code errors and mismatches between the code and the paper about this paper and its code, from readers and its authors, beside the paper and its tracing map.

Report a mismatch between the code and the paper · Report a code error (signed in)

Reproductions: reports from readers who ran the authors' code and did not get the paper's result, what they ran, with which environment, commit and data.

Report a reproduction failure (signed in)

Versions of its code: the releases of its code tied to a version of this paper (the preprint, the accepted manuscript, the version of record…), each with the tracing map versioned with it.

Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.