Skip to main content
Bioinformatics Advances logoLink to Bioinformatics Advances
editorial
. 2026 Oct 16;6(1):vbag290. doi: 10.1093/bioadv/vbag290

Critical assessment in the age of AI: challenges and opportunities for computational biology

Russell Schwartz 1,2,✉, Xuegong Zhang 3, Jian Ma 4, Yana Bromberg 5, Robert F Murphy 6, Lawrence E Hunter 7, Laxmi Parida 8, Julio Saez-Rodriguez 9,10, Gustavo Stolovitzky 11, Mihai Pop 12, Shoba Ranganathan 13, Donna K Slonim 14, Terry Gaasterland 15
Editor: Thomas Lengauer
PMCID: PMC13675102  PMID: 42891499

Abstract

Motivation

Effective computational tool development depends on our ability to measure progress with rigorous benchmarking, allowing developers to showcase advances and users to select the best of the available options. Computational biology has developed a robust infrastructure of benchmarking standards, tools/resources, and best practices to allow for rigorous and unbiased assessment. This infrastructure, however, faces growing challenges as modern artificial intelligence (AI) methods move to the forefront of computational analysis. The field has imperfectly adapted to issues problematic for benchmarking AI methods, including data entanglement, data leakage, problem-specific performance, limited theoretical guarantees, elusive ground-truth, opaque and often closed models that make reproducibility of results difficult, and dependence on impermanent data sources.

Results

In this paper, we consider how the field should tackle benchmarking in the AI era. We revisit why benchmarking matters and its history in computational biology, examine emerging AI-specific challenges, and outline practical paths forward. We argue that benchmarks should be treated as long-lived community infrastructure rather than one-off artifacts bundled with individual papers. We envision a future of critical assessment i.e. dynamic and responsive to evolving use cases, sustaining progress for advancing science in the age of AI.

Availability and implementation

N/A

1 Introduction

Benchmarking, the process of evaluating a method’s accuracy, computational efficiency, and other performance characteristics using real or synthetic datasets, plays a crucial role in the scientific enterprise (Stapenhurst 2017). Benchmarking depends on one or more benchmarks, combinations of datasets and evaluation protocols used to assess performance of a class of methods. Benchmarking is a key part of critical assessment, which involves evaluation of performance on benchmarks together with critical evaluation of the benchmark itself and the mechanisms for conducting it in an effort to derive rigorous and objective comparisons. Benchmarking has a long history in computational tool development, leading to a general understanding of best practices across computational domains. For more background on benchmarking, see, e.g. (Mangul et al. 2019, Weber et al. 2019, Brooks et al. 2024, Mallona et al. 2025) which provide earlier reviews of major issues in benchmarking computational tools for biological data, historical challenges to accomplishing this, guidelines for success, and practices by which this may be carried out. Sound benchmarking allows developers to assess proposed new methods and ensure that they are fairly compared to the state-of-the-art. It allows users to select the methods that are best suited to a given task. It gives reviewers and editors of publications the ability to assess the degree, if any, to which a new method improves on the prior art and thus partially judge the significance of its contribution to the scientific literature. Funding agencies benefit when applicants, demonstrating methodological rigor and realistic awareness of assessment criteria, clearly articulate the specific benchmarks against which their proposed methods will be evaluated. Benchmarking is ultimately a key part of a social contract by which communities must agree not only on metrics and datasets, but also on norms for disclosure and access to models and data, and on how to interpret performance claims under uncertainty. Note that we are not using the term ‘metric’ here in its strict mathematical sense but rather as the standard term of art for an evaluation measure in the machine learning (ML) literature. See Table 1 for a list of key terminology and brief definitions to assist the reader in following discussion of this topic.

Table 1.

Key concepts useful for following this paper.a

Term Definition
AI A subdiscipline of computer science focused on mimicking human reasoning through computational models
Benchmark A combination of datasets and evaluation protocols used to assess performance of a class of methods
Benchmarking The process of measuring method accuracy and efficiency in evaluating real or realistic data sets
Challenge A competition-based model for benchmarking using data with a known but hidden ground truth
Critical assessment An extension of benchmarking with critical evaluation of the benchmark itself and the mechanisms for conducting
Cross validation Controlling for overfitting by ensuring that ML models are tested on data independent from that used to train them
Data leakage Unknowingly validating an ML method on data used in its training leading to biased assessment
Deep learning An application of neural networks distinguished by its use of large networks with many layers
FM A deep learning model trained on a broad, general data set allowing it to be specialized to diverse applications
LLM A deep learning model for text or text-like streams of structured data
Leaderboard effect Excessive focus of a field on success on benchmarks that imperfectly represent actual practice
ML A subdiscipline of computer science focused on training explanatory models from data
Neural network A class of ML model inspired by biological neurons
Overfitting Poor generalizability of an ML model resulting from an overly complex model and/or insufficient training data
a

This table lists some important concepts for the subject matter of this paper and provides brief definitions.

Thе need for benchmarking has proven particularly important in the field of computational biology as the life sciences have become critically dependent on computational tools for modeling, data analysis, and prediction (Markowetz 2017). This is an important need given concerns about reproducibility and replicability (National Academies of Sciences, Engineering, and Medicine et al., 2019) that cannot be addressed without trustworthy data analyses. Reliable benchmarking is especially necessary in interdisciplinary areas like computational biology (Hua and Zhang 2019), where key stakeholders may not themselves be experts in all sides of the discipline (here, wet-lab or compute aspects) but nevertheless must make high-stakes decisions about which tools to use, allow in a publication, or support with funding. It has become widely accepted in computational biology that publishable work must be open, properly evaluated for data leakage, and assessed in comparison to leading alternative methods to show a clear advance on prior art. In some disciplines, standard benchmark datasets and measures of success have been formalized to allow fair comparison across available tools for a given task.

However, benchmark datasets developed in conjunction with new analytical methods can lead to bias. The publication of such datasets on their own without biological or analytical innovations can be challenging; improved resources may not be reviewed as favorably as the discoveries they can enable. Such contradictions have led at least two domain-specific journals to create new benchmarking article types and collections, encouraging benchmarking submissions that follow rigorous standards (Peters et al. 2018, Robinson and Vitek 2019). The frequent use even of publicly available and acknowledged benchmark datasets can itself become a problem as well, as developers learn to ‘tune to the test’ (Norel et al. 2011) and optimize their methods for the standard benchmarks in ways that may generalize poorly to real applications.

In computational biology, a particularly successful and influential type of benchmarking was developed to prevent this problem: the challenge model, where test data with a known but hidden ground truth form the basis for a competition between tool developers who are evaluated on a shared set of benchmarks with agreed-upon evaluation criteria to provide a fair and unbiased assessment. The challenge model was first implemented by the U. S. National Institute of Standards and Technology Text REtrieval Conference (Harman 1992). It came to prominence in computational biology with the Critical Assessment of Structure Prediction (CASP; Shortle 1995, Zhang et al. 2026), a challenge focused on predicting protein three-dimensional structures from sequence data, using as the gold standard proteins whose structures had been recently solved experimentally but could be temporarily kept secret. CASP came to be widely accepted by the structure prediction community and is credited with providing a major impetus for progress in the discipline by making it possible to identify methods that made real practical improvements in the state-of-the-art. CASP facilitated dramatic improvements in structure prediction, such as when it marked the Rosetta method (Das and Baker 2008) as far ahead of competitors in de novo prediction and then, eventually, heralded the replacement of Rosetta-like methods with AlphaFold2 (Jumper et al. 2021) and its deep learning progeny. The success of CASP led to many similar challenges such as the Grand Challenges in medical image analysis (https://grand-challenge.org/), the Genetic Analysis Workshops that for 20 years conducted similar challenges for the statistical genetics community (MacCluer et al. 1984, Witte et al. 2007), the Dialogue for Reverse Engineering Assessment and Methods (DREAM) Challenges (Saez-Rodriguez et al. 2016, Meyer and Saez-Rodriguez 2021) that have covered many tasks in genomic data analysis and translational biomedicine, and the various Critical Assessment challenges (Critical Assessment of Genome Interpretation (Hoskins et al. 2017), Critical Assessment of Function Annotation (Zhou et al. 2019), Critical Assessment of Massive Data Analysis (Labaj et al. 2023), Critical Assessment of Protein Interactions (Wodak et al. 2023), Critical Assessment of Hit-Finding Experiments (CACHE; Ackloo et al. 2022), Critical Assessment of Metagenome Interpretation (Sczyrba et al. 2017), etc. as well as numerous more specialized one-off challenges. Table 2 provides a reference to a few of the important challenges used for critical assessment in computational biology.

Table 2.

Some important benchmarking challenges in computational biology.a

Challenge Methods assessed Citation(s) and link(s)
CASP Predicting molecular (primarily protein) structures (Shortle 1995, Zhang et al. 2026)
Grand Challenges in Medical Image Analysis Various applications of machine learning in medical image analysis https://grand-challenge.org/
GAW) GWAS https://grand-challenge.org/
DREAM Challenges Changing topics covering a diverse collection of current hard problems in computational biology https://dreamchallenges.org/ (Meyer and Saez-Rodriguez 2021)
CAGI Interpreting functional impact of genetic variations https://genomeinterpretation.org/ (Hoskins et al. 2017)
CAFA Predicting biological function from sequence and/or structure https://biofunctionprediction.org/cafa/ (Zhou et al. 2019)
CAMDA Diverse topics in analysis of big data in biology (Labaj et al. 2023)
CAPRI Predicting protein interactions, complexes, and assemblies (Wodak et al. 2023)
CACHE Small-molecule binding to disease association targets https://cache-challenge.org/ (Ackloo et al. 2022)
CAMI Interpreting the output of metagenomic sequencing experiments https://cami-challenge.org/—(Meyer et al. 2022, Sczyrba et al. 2017)
a

The table provides examples of influential challenges, providing the name, a brief description, and references or links to information about the challenge.

The challenge model and similar best practices have served computational biology well for decades but, as we show in Section 2, they are increasingly proving insufficient for a new landscape of method development in the era of big-data artificial intelligence (AI) and other data-intensive ML methods. Here, we will use the term AI to refer collectively to these data-intensive ML methods, including the deep learning-based methods underlying much modern AI, although we recognize that not all AI is ML and not all ML requires large amounts of data. AI methods trained on vast and heterogeneous data sets, which might include newer transformer-based foundation models (FMs) or prior deep neural network approaches, face a much harder challenge compared to classic algorithmic and statistical methods in finding truly independent test sets that do not unfairly inflate assessments of some competitors through unintentional data leakage (Kapoor and Narayanan 2023). Opaque training data and closed, application programming interface (API)-only model access make it difficult to evaluate competitors fairly and can make it at all but impossible for methods built on general FMs to be evaluated on a common platform with more traditional methods that do not present the same risks of undetected data leakage. Issues of hyperparameter sensitivity, complex multimodal data sources, and agentic workflows further complicate the problem of providing a fair, objective, and uniform test of progress that will allow the community to find what are truly the best methods for any given space of applications.

This article is intended primarily for readers who may need to assess computational biology methods, their own or third-party, or to critically evaluate the results of such assessments. In the remainder of this paper, we evaluate the challenges and propose potential solutions to the problem of benchmarking computational biology methods in the age of AI. We next summarize some of the particular difficulties of adapting past practices to current AI models. We then propose potential approaches for addressing these challenges going forward. Finally, we conclude with some consideration of unsolved problems, future opportunities, and a call to action for the research community.

2 Challenges of benchmarking for AI models

2.1 The challenges of classic benchmarking in an era of AI

Evaluation of computational methods traditionally relies on two key assumptions: (i) that there is a ground truth known through experimental evidence or theory and (ii) that this ground truth or ‘gold standard’ data fairly represent the real biological systems of interest, independent of design or tuning. The rise of powerful AI models promises to solve increasingly sophisticated biological problems, but as we push AI into more nuanced biological domains, these two assumptions are increasingly untenable. This creates significant challenges for fair and meaningful evaluation and increases the risk of false discoveries that are not easily detectable.

2.1.1 Data leakage and overfitting

Classic benchmarking assumes that method design is independent of the test data. In ML models, performance is typically highly dependent on the data on which a model is trained. Assuring comparable independence can thus be more problematic if there is unrecognized reuse between training and benchmarking data, which has been termed data leakage. Minimizing this leakage and requiring that only well-defined training data are used for model fitting reduces this problem (Kapoor and Narayanan 2023), although it can be challenging to choose a stratification of the data for cross validation that will prevent similar data points from appearing in train and test splits. Model performance is also typically sensitive to choices in architecture and hyperparameters, which may be tuned using training and validation data through a process i.e. often opaque and poorly documented (and thus hard to reproduce), creating a source of data leakage i.e. easy to produce even inadvertently and difficult to detect post hoc. For example, pioneering transformer-based models pretrained on massive single-cell RNA-seq data show great promise as early prototypes of AI virtual cell modeling (Cui et al., 2024; Hao et al. 2024b; Theodoris et al. 2023), yet they reflect only narrow slices of a massive hyperparameter space (Bian et al. 2024; Hao et al. 2024a; Theodoris 2024). Assessment of overfitting can itself be surprisingly challenging, as overfitting to training data can paradoxically lead to better generalization to seemingly independent test data if data distributions are not carefully managed (Recht et al. 2019). These problems are amplified with extensively pre-trained AI models whose training data may be unknown to a developer retraining the model for a new task.

While independent test sets from community challenges help mitigate direct data leakage, the more subtle problem of the leaderboard effect arises: participants iteratively submit predictions to the test set, effectively performing implicit multiple testing across a vast combinatorial space of model variations. Similar to alpha inflation failures of early Genotype-phenotype correlation analysis and genome-wide association studies analyses, where the probability of finding a (false) positive association increases with every additional test performed (Chen et al. 2021), multiple re-testing of methods on benchmark data can lead to overfitting to the benchmark itself, inflating perceived performances without guaranteeing generalizability (Dwork et al. 2017). This problem can be mitigated by limiting the number of submissions to a leaderboard, as is typically done, e.g., in the DREAM challenges (Meyer and Saez-Rodriguez 2021). Techniques from privacy-preserving data analysis (Dwork et al. 2015) provide another potential mitigation strategy by which one might enable validation on a data set with provable limits on information leaks that could unfairly bias performance on future tests. These difficulties of data leakage and overfitting intensify, however, with advanced deep learning and transformer-based models, which operate in extremely high-dimensional hyperparameter spaces that create many opportunities for overfitting a model to its training data. For large pre-training models, it is also particularly difficult to ensure that benchmarking data is truly independent of the vast corpora used for pre-training, raising concerns about data leakage through experiments drawing on common systems, protocols, or experimental conditions in addition to direct reuse of shared data points.

2.1.2 Biases in design of datasets

Reliable benchmarking demands experimental designs that reflect true biological variability, and ideally represent a random sample of the relevant space. However, the sample distributions of available datasets are often dictated by practical constraints—biological, technical, financial, ethical, and so on—rather than ideal experimental design. Consequently, a model’s performance is often idiosyncratic, tied to a specific problem, dataset, or technology platform. Moreover, biological data analysis often involves many expert-driven steps—such as pre-processing and clustering, not to mention the choice of what data to gather—that rely on subjective judgement. These practices can also mislead AI researchers into over-optimizing aspects of a model that may be peripheral to the actual biological discovery. Consider, e.g. a benchmark for detecting functional genomic variants that lacks examples of some important variant classes. If a model predicts that a genomic variant has functional impact while the benchmark suggests otherwise, then tuning the model to the benchmark may bury real biological findings that would be considered relevant if identified by an experiment (Bromberg et al. 2013, Mahlich et al. 2017, Zeng et al. 2021). Such choices shape conclusions profoundly but are often underreported in publications, leading to irreproducible results and misleading interpretations of AI contributions (Chen et al. 2024).

Another manifestation of bias in the biomedical data corpus is the disproportionate concentration of research on a relatively small subset of potential objects of study. Bias in data is not a problem exclusive to AI methods, but the use of AI and other data-intensive ML methods compounds the problem. Models trained on biased data learn to reflect those biases in ways that can be difficult to anticipate or analyze after the fact, a problem of growing concern as models become ever larger, more opaque, and more costly to train and audit. For example, biomedical research is highly skewed toward a small fraction of genes; an analysis of nearly 600 000 publications annotated to ∼20 000 human protein-coding genes revealed a scale-free, ‘Matthew effect’ distribution, in which a handful of proteins accumulate thousands of publications while hundreds have none (Carter et al. 2019). This imbalance persists despite genetic evidence linking many understudied genes to disease, suggesting that research attention is driven less by biological importance than by familiarity with particular systems and existing tools and funding incentives that result in a self-reinforcing ecosystem in which cumulative visibility begets further study.

Another example of this bias can be found in the protein structure world. Until the Protein Structure Initiative (2000–2015) pressed for emphasis on novelty in the world of protein structure determination, the vast majority of proteins in the PDB reflected specific field interests; over 70% of the newly determined structures were at least 95% sequence-similar to previously determined ones (Liu et al. 2007, Norvell and Berg 2007, Nair et al. 2009). If all prediction models were evaluated on this set of proteins, they would have only reflected less than three quarters of the currently known structural variety, which itself may be a small fraction of what is truly represented in nature. This is particularly problematic for protein families that only have a small set of PDB structures, e.g. insect odorant receptors, where AI models are not yet biologically accurate (Jabeen et al. 2024, Chidambara Thanu et al. 2025). When such uneven corpora are used to train AI, predictive performance is likely to be strongest for well-studied genes and weakest precisely where new discovery is most needed. This issue leads to systematic epistemic bias and cannot be solved by adding a few more datasets.

2.1.3 Biases of evaluation metrics

The choice of evaluation metrics presents another layer of complexity (Baldi et al. 2000). Evaluation typically relies on measures comparing model outputs to human-defined ground truths. Therefore, state-of-the-art claims based on these metrics must be viewed cautiously, as such benchmarks assess only specific, constrained scenarios and may not translate to real-world biological utility. The organizers of the challenge models have continuous discussions about applicable metrics and their usefulness (Cokelaer et al. 2015, Kryshtafovych et al. 2021, Wodak et al. 2023, Critical Assessment of Genome Interpretation Consortium, 2024, Piovesan et al. 2024). These problems can also be mitigated, but not completely avoided, by the use of multiple independent metrics that may at least reflect different biases and assumptions [e.g. (Nielsen et al. 1996)] and make it more difficult to tune a method specifically to the benchmark’s evaluation metric, thus avoiding falling in the trap articulated in Goodhart’s law (Muller 2018). Strict definitions of applicable metrics of success, arguably, facilitate and disproportionately benefit advances in AI-based methods, which require continuously scored optimization end goals. Proper evaluation of many predictions may require predictions themselves to be standardized into a limited set of, e.g. ontology labels, which might limit expressiveness of experimental outputs, e.g. to the terms in the Rhea (Bansal et al. 2022), Enzyme Commission (Tipton and Boyce 2000), or Gene Ontology (Ashburner et al. 2000) nomenclatures. The choice of a suitable ontology thus also becomes part of the evaluation decision-making.

Second, many prediction tasks are built on unverified assumptions that may lead to circular reasoning and poorly chosen metrics may lead to tests of fidelity to the field’s assumptions rather than an actual biological ground truth. For instance, a common benchmark for multi-omic integration assumes that different omics data share an identical latent distribution, and that the ‘best’ model is the one that forces them to overlap most completely in the latent space (Ashuach et al. 2023, Heumos et al. 2023, Hu et al. 2024, Xiao et al. 2024) strong assumption that risks discarding important information uniquely inherent to different omic data types (Baião et al. 2025). Similarly, models that integrate single-cell and spatial transcriptomic data to translate between gene expression and spatial location, while highly useful, operate on a principle—that gene expression deterministically associates with location—that itself requires systematic validation (Biancalani et al. 2021, Hao et al. 2024c, Cao et al. 2025). Across many tasks, metrics and human-assigned ground truths reflect a bias for current understandings and for the outcomes researchers expect to find, which may unfairly penalize those methods that are most effective at challenging dominant paradigms and discovering new biology. This is not a problem unique to biology, but of learning-based methods in general.

Furthermore, standard performance metrics like mean squared error or correlations, may not reflect biological fidelity (Schäfer et al. 2026). They fail to account, e.g. for varying dynamic ranges of genes, their different sensitivities to sequencing technologies, and their different implications for cell fates. A numerically small error for a key regulator could be biologically more catastrophic than a large error for a stable housekeeping gene. In evaluating protein structure prediction, e.g. standard measures of accuracy such as root mean square deviation (RMSD) may be useless in evaluating structures that differ by position of a single hinge between rigid domains. Conventional measures of classifier performance, such as accuracy, precision/recall, or F-score may be highly misleading if test cases are unrepresentative of the real space of hard problems. Similarly, the silhouette score is frequently used for data integration, even though its simple model of clustering consistency is poorly suited for this purpose and may in fact penalize effective data integration that relies on differences in how complementary data sources cluster the same entities. Current evaluation frameworks are not yet sophisticated enough to capture such crucial distinctions.

2.1.4 The elusive ground truth

Reliable benchmarking hinges on verifiable ground truth. While this might seem straightforward, it is a major bottleneck in real-world applications and perhaps especially in biology. Biological concepts like cell type or protein coding are often subjective and blurry at the boundaries, and the complexity is amplified by technical biases in data collection and historical artifacts in how data labels were defined, by whom, from what evidence, and for what purpose. Metrics that work on well-defined vision or language tasks may not fully capture biological realities, where tasks may be ill-defined and correct answers unknowable with certainty.

Consider the task of in-silico cellular perturbation prediction as an example. Large-scale perturbation datasets are invaluable [c.f. (Liberali et al. 2015)], but they are imperfect as ground truth due to multiple limitations. Cellular responses to a perturbation in experiments are a mixture of true perturbation effects and artifacts from the perturbation technology itself, such as DNA damage repair triggered by CRISPR-based gene perturbation. The destructive nature of many measurement technologies may make it virtually impossible to extract several channels of information about the same entity (e.g. to measure full transcriptomes and other omics data from the same cell both before and after perturbation) so predictions can only be evaluated at the population level. Many experiments can only be performed in cell cultures or other laboratory environments, which may differ from cells’ real responses in the complex physiology of an in vivo microenvironment.

Even a seemingly straightforward application like protein structure prediction—where X-ray crystallography, nuclear magnetic resonance, and now cryo-electron microscopy (cryo-EM) have provided what were treated as definitive ground truths for assessment—can yield subtle complications. A ligand-binding protein may have a set of plausible structures, flexible regions, or even completely disordered domains, so experimental data is only a snapshot of dynamic binding activity. Protein preparation for crystallography requires a highly unnatural environment for proteins or alterations of the native sequence that can yield subtle, or sometimes dramatic, changes in structure relative to native solution conditions (DePristo et al. 2004). Cryo-EM provides in principle structural information closer to that in the natural environment, yet even it may struggle when dealing with issues such as flexible, partially disordered, or polymorphic proteins (Punjani and Fleet 2021). Method developers and users of those methods both need to be familiar with the often-hidden assumptions and limitations of the technologies producing the data behind their benchmarks.

Furthermore, AI classification or prediction in biological studies often serves as an intermediate step toward new scientific insights and discoveries. Validating or refuting these findings may ultimately require additional prospective wet-lab experiments or even clinical trials, where biases in what is feasible create further problems. New experiments are often ad hoc and costly. For some findings, there may not exist any feasible way to validate them because of technical or ethical constraints. There is a pressing need for developing objective, standardized frameworks that incorporate feedback to assess and refine AI-driven discoveries, and that draw on both retrospective and prospectively generated data within technical and ethical limits.

Synthetic benchmark data can provide a partial answer to these problems, offering a source of ground truth in applications where it may otherwise be unknowable, such as in evolutionary biology. Synthetic data can be especially powerful in conjunction with real data. However, synthetic generation brings its own biases in producing data i.e. inherently tied to a specific model i.e. necessarily a highly simplified representation of the true biology. In addition, true data is often highly imbalanced, creating particular challenges to accurate benchmarking when synthetic data is disproportionately needed to augment negative examples typically lacking in published data resources.

2.1.5 Gaps in theoretical foundations

All of the above challenges are amplified by gaps in our theoretical basis for making rigorous decisions in model design, training, and benchmarking tasks. AI methods are often highly heuristic in their application and dependent on empirical assessments of performance. This is in contrast to more traditional algorithmic methods, for which it is often possible to provide firm guarantees on measures of efficiency, complexity, accuracy, or data needs, and for which there are often few arbitrary decisions left to the method designer. This dependence on intuition and potentially arbitrary design choices has only become more true as deep-learning methods have displaced more straightforward ‘classic ML’ and led to highly complex models requiring numerous design decisions and hyperparameter settings. When these are set by intuition or often poorly documented empirical adjustments, rather than by agreed-upon algorithms backed by clear theoretical guidance, it creates an opportunity to amplify aforementioned problems of data leakage. This is not to demean the knowledge and expertise that can go into making these choices, but only to note that they create challenges for fair assessment.

The task of benchmarking itself is unlikely to be precisely defined in a formal theoretical sense, creating further opportunities for bias to enter into evaluation and in turn making it difficult to control for the sources of bias noted above. We are unaware of a sound theoretical foundation for rigorously defining the problem a benchmark is meant to solve, much less for providing guarantees on how well a given choice of benchmark solves that problem or designing algorithms for optimizing a benchmark to its formal problem statement.

2.2 The new AI: LLMs and foundation models

The promise of FMs offers a potential boon for making powerful AI available to those who lack the resources to train a model de novo as well as for extending data-hungry AI technologies to problems where data is too sparse to train sophisticated models or where zero-shot prediction is required (Moor et al. 2023). However, the large size of these models and the cost of training them raise their own special concerns for assessment (Saez-Rodriguez et al. 2026, Shu et al. 2026). This section considers a few of the particular challenges posed by assessment that these models raise.

The high cost of training these models and the large amount of data they require has generally meant that they are trained infrequently, often by private entities under proprietary conditions, creating inherent problems for transparency and reproducibility. These conditions can make straightforward benchmarking nearly impossible in practice. The training corpora used to produce these models are often proprietary themselves and guarded as trade secrets. This problem is amplified by the fact that new releases of these models occur regularly on updated training data i.e. too large to explicitly describe or back up for purposes of reproducibility. Extensive work in data preprocessing and hyperparameter selection is typically needed to get good performance from these models, and this process too may be treated as proprietary, providing hidden ways in which prior knowledge is subtly encoded into the design. This lack of transparency can propagate problems for downstream validation, as users of these models cannot be certain of the data on which they were trained or prevent data leakage.

A separate concern is that it is hard to evaluate the ability of FMs to accurately represent biological data even prior to any downstream data-driven analysis. For example, how good are the numeric vectors that replace amino acid sequences or structures when representing a protein? Protein language models (pLMs) vary in their ability to represent proteins, and while some metrics for representation evaluation have been proposed (Senoner et al. 2025, Prabakaran and Bromberg 2026), there is no generally accepted way to pinpoint the best pLM (or even if there exists a best amongst many possible representations) for every question that one can ask about proteins. In evaluating novel method performance on downstream tasks, the contribution of the final model cannot be disentangled from the input pLM’s abilities. Because downstream performance reflects the combined effects of both a pretrained model and the task-specific adaptation, it does not provide a direct measure of the pretrained model’s standalone quality independent of the added value of its task-specific fine-tuning. Independently benchmarking pLMs and FMs through their performance on zero-shot learning without fine tuning, can provide a partial answer. This prompts a deeper methodological question: what constitutes a sufficient and principled set of downstream evaluations to meaningfully assess a pLM or FM?

Similar issues arise in separating the contributions of a method from the data on which it is built. Even with full transparency on the architecture of an AI model and process by which it is trained, the high cost and proprietary nature of typical FMs means that there is no opportunity to assess how much of the improvement of a new model is due to changes in the model itself versus changes in its training data. Ablation testing strategies that have become commonplace, if not fully standardized, for addressing these issues with smaller-scale AI models (Meyes et al. 2019) are simply not feasible for large FMs. This further challenges good validation practice by making it difficult to protect against problems of data leakage that still plague validation even for older ML models.

These challenges to assessing the FMs’ training data can leak into assessment of downstream applications. Even an academic user seeking to follow best practices for openness and appropriate cross-validation may be limited by the lack of transparency if they seek to build on leading FMs. Truly open models, with open parameters and training data, provide a path forward but may raise difficult tradeoffs if they do not match the state-of-the-art performance of closed commercial models. This makes it difficult to assess the technical contribution of any new method building on an FM. Does improved performance of a specialized application of an FM relative to prior art reflect technical improvements in the FM, technical improvements in its specialization to the downstream task, better data underlying the FM, or better data available to it for retraining? Sorting out these possibilities is important to deciding whether a model offers innovations that should be picked up by others in future work. Yet the scientist retraining an FM for a new task may have only limited ability themselves to distinguish between these possibilities.

Bringing what were classically considered best practices for model assessment to this domain also raises new practical and ethical concerns (Ferdaus et al. 2026). Following accepted best practices for validation, with appropriate ablation testing and cross-validation on independent data sources, may be so costly that it is beyond the reach of the academic community. Questions of the carbon footprint of carrying out these tests further complicate the calculus of how to set responsible best practices (Liu and Yin 2024, Ferdaus et al. 2026).

2.3 Assessing intellectual merit in the era of AI

A more profound and critical issue for assessment is how we judge the promise of a new method beyond what is revealed by its quantitative performance. Is a model eking out performance improvements through conceptually trivial parameter tweaking and fine-tuning that may be made obsolete by the next data set, or are there big ideas behind it from which the field can learn? This philosophical question concerns the epistemological value of FMs (what they truly reveal about biology beyond predictive accuracy) and is a crucial practical question for such considerations as whether a new idea warrants publication, grant funding, or attention from the community. This is not to dismiss the importance of other bases by which a model may achieve superior performance to its predecessors, such as through investment in generating better data or through effective one-off engineering. Rather, it is to recognize as well that the intrinsic intellectual merit of a model is an important consideration in judging its significance and likely impact that may not be immediately apparent from its performance on a straightforward benchmark alone. In other words, models that achieve better fit to a target outcome possibly by virtue of their sheer number of parameters are not necessarily more illuminating from a conceptual standpoint or more likely to lead a path to further advances (Fernandez Slezak et al. 2010).

Classic algorithmic methods were frequently judged by a quasi-aesthetic sense of the elegance of the contribution and the sense of surprise it evoked (Sinclair 2011). The neural network models currently dominating AI are frequently distinguished from one another by engineering design choices as opposed to truly new theoretical ideas. Engineering has its own aesthetic (Schummer et al. 2009), but one difficult for engineers themselves to articulate and even more difficult to balance against the hard numbers one seeks in a quantitative assessment. However, when improved performance of a new model may itself be a product of improvements in the data available to it or in an FM it uses as a base, it becomes particularly important to be able to assess what new value the model adds to the field strictly on its own intellectual merits.

The history of de novo protein folding prediction provides a useful case study. Here, early computational work using classic physics-based methods provided useful conceptual insights into protein folding processes [e.g. (Sali et al. 1994)]. Neural networks helped the analysis of protein evolutionary profiles to predict folding of sequences into secondary structure (Rost and Sander 1993) but true, reasonably accurate folding prediction was only possible for specialized classes of proteins with highly restricted structure spaces, such as coiled coils (Lupas et al. 1991). The Rosetta method (Das and Baker 2008) proved groundbreaking, both in a conceptually new approach combining statistical and physical methods and in a striking improvement in performance in CASP assessments relative to anything that came before (Simons et al. 1999). In 2012, using amino acid co-variation computed from extremely large multiple sequence alignments (MSAs), Marks et al. (2012) were able to reproduce protein structures for a set of very common proteins. Four years later, Golkov et al. (2016) showed that analyzing MSAs with Convolutional Neural Nets, instead of hand-crafted features, allowed for superb performance. AlphaFold2 (Jumper et al. 2021, Chang and Perez 2025) represented a major leap in empirical performance, replacing earlier learning strategies with transformer models able to train on the large repositories of known structures and MSAs the structural biology community had been assembling for decades (Sussman et al. 1998, Berman et al. 2000). While AlphaFold2 did not completely solve the protein folding problem—e.g. it continued to struggle with predicting structures of fold-switching proteins (Chakravarty et al. 2024)—it yielded a dramatic improvement over the prior art. Here, a conceptual leap in the design of the AlphaFold2 transformer model was followed by a large investment in compute resources needed to train and test the model and the two together ultimately led to a massive improvement in quality of prediction, assessed with quantitative metrics. A similar example can be seen in dramatic advances in language recognition technologies that were fueled by major investments in data generation that could pay dividends once the foundational ML methods had been developed (Alspector and Dietterich 2020).

Such histories raise the question of whether there was anything about the conceptual leap itself from which the community could have concluded in advance that the large investment needed to capitalize on it would ultimately be justified. There are case studies of traditional science funders balking at outsider ideas or the investments needed to capitalize on them, only for non-traditional sources to step in and prove their value. Celera Genomics provided a seminal example of private investment driving a revolution in genome sequencing by enabling a computationally intensive shotgun sequencing strategy, a key intellectual advance for the field at which traditional public funders had balked (Weber and Myers 1997, Venter et al. 2001, Cozzarelli 2003). Nevertheless, picking out good ideas before they are proven empirically is difficult but it is also crucial to advancing science when there are finite resources to spare to support scientific progress. That is only more true in an era of big AI models, when massive investments may be needed to train state-of-the-art models or to collect the data they require and hard decisions must be made regarding how much investment should be put into researching fundamentally new ideas versus capitalizing on the best current ones.

One of the reasons this kind of assessment is difficult in the era of modern AI is that, despite a great deal of work on the theoretical foundations of AI, we generally lack hard guarantees of performance that allow us to compare usefully between distinct deep learning models for a given task. Classic algorithms typically lent themselves to proofs of theoretical advantage over their predecessors. Even spaces where heuristic methods came to dominate, such as sequence searching and alignment, were backed up by extensive bodies of theory able to give guaranteed performance bounds under suitable assumptions. While AI-based methods are also backed by extensive theory, that theory has not led to comparable performance guarantees, and so the field must rely more heavily on empirical assessments with the problematic issues they raise about test generalizability and fairness.

Once again, history provides some models for how the field might need to evolve going forward. There is a long tradition of computational problems transitioning from being seen as AI to be solved by clever heuristics when the problems are poorly understood, moving to the domain of theory as the problem statements become better defined and yield to precise methods with provable performance guarantees, and finally coming to be seen as questions in computational system-building when both the problem and the theory behind solving them become settled. One example would be tasks in searching and planning that were once viewed as AI (Newell and Simon 1972), later replaced by rigorous graph theoretical formulations (Dijkstra 2022), and eventually became standard algorithms taught in introductory algorithms classes (Cormen et al. 2022) and routinely called from algorithm libraries. Another would be core problems in machine vision such as edge detection, that were once seen as a hard problem of classic AI (Roberts 1963), gradually yielded to more rigorous mathematical formulations (Marr and Hildreth 1980), and now have accepted methods (Canny 1986) that are standard parts of image analysis toolkits. We can at least conjecture that the kinds of problems typically solved by LLMs today may follow a similar trajectory of yielding to more rigorous problem formulations, which in turn lead to standard algorithms with provable guarantees that might look quite different from the currently prevailing neural network approaches and which will no longer be seen as AI.

3 Towards best practices for benchmarking AI

In this section, we recommend some best practices for benchmarking AI methods, as well as steps by which they can evolve with the field going forward. Our intention is to provide guidelines for those running benchmarks, users participating in benchmarks, and other stakeholders who need to make decisions based on their assessments. We also conclude with some consideration of areas in need of further research as future AI develops.

3.1 Defining formalized assessment criteria

Ensuring fair and rigorous benchmarking will require new standards for openness and reproducibility as well as mechanisms to ensure practitioners in the field are prepared to follow those standards. We recommend the following practices, summarized in Fig. 1:

Figure 1.

Graphical summary of standards for rigorous benchmarking, showing standards for model openness, standards for when openness is not feasbile, standards for data openness, and standards for benchmark users and reviewers as supporting elements of rigorous benchmarking.

Summary of best practices for benchmarking AI models. The flowchart summarizes some of the principal recommendations of the paper for improving practices of benchmarking in the AI age. These include Standards for Model Openness (upper left) identifying model features necessary to rigorously assessing model training and performance; Standards when Full Openness is Not Feasible (upper right) for certifying data and evaluation protocols and auditing to ensure sufficient protection against data leakage during training and assessment; Standards for Data Openness (lower left) establishing what needs to be known about data used in AI models to allow for robust assessment; and Standards for Benchmark Users/Reviewers (lower right) to ensure model assessment is informed by the necessary expertise. Icons in the images are free for reuse and sourced from https://openclipart.org/detail/340524/artificial-neural-network (model openness), https://openclipart.org/detail/167103/binary-data-stream-2 (data openness), and https://openclipart.org/detail/35563/abstract-people (users/reviewers).

  1. Explicit standards for openness of models, including open code, weights, configs, seeds, and metadata describing how the model was trained and validated. The details of these standards may evolve with technology, but we believe that they should be explicitly stated and regularly revisited and updated. This would include specific standards in the instructions for authors of journals and conferences publishing in the field. Standards should similarly be part of grant evaluations as part of review criteria to ensure rigor and reproducibility. In addition, minimum reporting standards for AI-enabled biological analyses (model cards, data statements, and evaluation traceability) can reduce ambiguity about what was actually tested and under what conditions.

  2. For API-only models, providing training-data certification, evaluation logs, and leakage audits. We recognize that the field has moved to the point where it may no longer be possible to maintain expectations that models are fully open and available for independent review. New expectations are thus needed for how we ensure reproducibility under these circumstances.

  3. Explicit standards for openness of data used in model training, including identifying specific data sources and certified releases of living data sources at the moment of training. Just as fully open models may not always be possible, likewise for fully open training data, where use of dynamic data sets too large to archive individually and make available for independent review is becoming standard for large models. Time-stamped data snapshots and clear data cut policies dictating the criteria by which data are removed from a benchmark can help make evaluation comparable across model versions and across groups.

  4. Securing appropriately qualified reviewers. A necessary addition to the prior point is that review of materials that include computational biology tools, whether i.e. for publication, funding, awards, or other opportunities, must be done by reviewers competent to evaluate whether the above criteria have been followed. That is, those making decisions on deployment of computational tools should be expected to have competency in computational biology and benchmarking. It has long been recognized in the computational biology community that work that depends on computational analysis—i.e. nearly all work in biomedical science today—requires reviewers competent to review those analyses, and that extends to reviewers having sufficient understanding of benchmarking practice to make appropriate use of their results. AI itself may provide partial solutions, e.g. via human reviewers whose expertise is augmented by AI agents, although that raises other concerns.

3.2 Connecting assessment to data generation

A growing problem, alluded to several times above, is that modern AI models typically depend on training data that may itself be impossible to describe or evaluate directly. Much like the models, if data cannot be fully open then at a minimum the process that produced it should be fully documented, auditable, and in principle reproducible; data and metadata standards should be followed; and the data itself should be rigorously assessed. Meeting these expectations presents technical challenges to incorporating assessment directly into the data generation process, and even more so for community data generation efforts that depend on happenstance of data submissions rather than a central plan. It also requires a sea change in thinking about data generation, with rigorous thought to the computational uses of data incorporated into the process of data generation from conception through all stages of experimentation and validation. Steps in this direction are, e.g. being taken by initiatives such as the U.S. National Institutes of Health’s Bridge2AI Consortium (https://bridge2ai.org/). However, challenges remain in figuring out how to bridge the gap between often opaque industry practices and the need for openness in the scientific community as a whole.

Systematic efforts to gather more unbiased data sources can also help. A compelling example of how one might counter structural bias in data sources used in model training and benchmarking is Target 2035 (https://www.thesgc.org/target2035), which seeks to systematically generate high-quality chemical probes and large-scale protein–ligand datasets across the broader proteome (Carter et al. 2019). Its roadmap emphasizes standardized, openly accessible binding data at scale, including both positive and negative results, to enable robust and generalizable ML development (Edwards et al. 2025). By producing curated, AI-ready datasets and organizing benchmarking challenges with experimental validation, Target 2035 seeks not only to illuminate understudied proteins but also to reframe hit discovery as a more equitable, data-driven, and computationally accelerated enterprise. The first of what is expected to be a series of crowd-sourced challenges enabled by this effort has recently been launched through a collaboration between the DREAM and CACHE platforms, with support from the Structural Genomics Consortium (Sage Bionetworks).

Past assessment efforts have relied on expert evaluation and/or preprocessing of experimental datasets, despite no clear evidence that this improves the assessment process and significant concerns that models may not capture the inherent variation in such data. More deliberate strategies for planning effective generation of large data sets are also needed. As biomedical discovery has come to rely more on inference over complex multimodal data sources, there is a growing need for data generation itself to be recognized as a problem space over which one can optimize (Jin et al. 2005, Tarazona et al. 2020, Srivatsa and Schwartz 2024), a realization i.e. even more urgently needed for the large-scale data collection efforts powering sophisticated AI models today. Increasing moves towards self-driving and automated science [c.f. (Sparkes et al. 2010, Naik et al. 2016, Canty et al. 2025)], where AI training is tightly integrated with experimental design and data generation, offer both opportunities and further challenges. Approaches based on autonomous science and active learning, a class of ML in which model learning and data generation are interleaved to allow the model to select data points most informative to it, can potentially create a new paradigm for assessment i.e. independent of expert evaluation. Here, we start with the decision to make assessments based solely on the ability of models to predict novel experimental measurements for specified experimental conditions, rely on active-learning driven assessment cycles to query existing models to identify those combinations of conditions and predicted measurements in which the models themselves have the least confidence, design experiments to test those predictions and execute them using laboratory automation with minimal human intervention, and evaluate all models using the results. The benchmark data can then be released to allow model retraining, and another assessment cycle begun.

Progress on these problems is in turn likely to require reform in educational and administrative practices that go beyond computational biology. This includes ensuring that those planning or leading data collection efforts have the necessary knowledge and expertise in how those data will be used. It will also require new consideration for how funding is allocated to ensure that benchmarking efforts are not only supported but have the resources where needed for novel data generation.

3.3 Assessing innovation in the era of AI

Future benchmarking of AI methods will also be complicated by the need to disentangle the many factors that can contribute to improved empirical performance, so that we can separate assessment of the intrinsic merits of a model from the data and other models on which it depends. Future assessment of AI models will require robust ablation strategies to explore independently the influence of training data, fine details of model design, hyperparameter choices in model architecture and training, and genuinely new innovations in AI models or algorithms. The field will need to define how this is handled when domain-specific models depend on opaque FMs or proprietary training data. Analysis is further compounded by the difficulties of rigorous cross-validation noted above when models draw on vast and heterogeneous training data resources that may themselves be of uncertain provenance (Pop et al. 2025). Quantitative benchmarks cannot fully replace human judgement and an appreciation for the elegance of a solution (Sinclair 2011) when assessing genuinely new and innovative ideas with promise that may take time to develop.

3.4 Evaluating interpretability

A related question is interpretability of the outputs of complex models that seemingly perform well in benchmarking assessments (Linardatos 2020). The lack of interpretability has been a frequent criticism of neural-network-based AI models, although it has been tolerated as users have developed more confidence in assessing AI performances on natural language understanding or computer vision tasks. Interpretability is arguably particularly important on computational biology tasks (Chen et al. 2024), where users are often not experts in AI methods but want to understand their results and evaluate them according to their own professional judgement. Interpretability can help us to assess models’ reliability based on their consistency with prior knowledge before we have solid theories to endorse them, providing a valuable adjunct to current benchmarking practices. Interpretability can also give us a sounder basis for believing that a seemingly effective prediction model will generalize to new data sets and does not achieve good results through fitting to data artifacts. Furthermore, a major goal of biological research is often to gain understanding of underlying mechanisms, and not simply to solve an engineering issue.

3.5 Allowing standards to evolve with the technology

The challenge model remains the gold standard for rigorous benchmarking, but it requires updating for the era of generative AI. For example, multi-track challenges can explore distinct categories designed to separate the influences of data, model advances, and compute resources on performance, such as through open-weight, API-only, or resource limiting tracks. There is no easy fix, however, and complexity of distinguishing these factors will require an ongoing commitment to an evolving, community-driven assessment ecosystem, where living benchmarks and shared evaluation services are regularly discussed and refreshed to keep ahead of advances in AI methods and new ways of unfairly gaming the assessments. A living benchmark would involve ongoing data generation alongside benchmarking, with a data architecture to timestamp data releases and careful accounting for independence to ensure that new benchmarking data is regularly available for independent assessments of models that may have trained on earlier releases of the benchmark. To limit the leaderboard effect, these systems could restrict submission frequency, report rounded or thresholded scores, and separate a public development leaderboard from periodically refreshed, sequestered evaluation sets used for infrequent assessment. Incorporating reusable-holdout methods (Blum and Hardt 2015, Dwork et al. 2015) and continuously adding new data would further reduce adaptive overfitting while allowing benchmarks to evolve as models, datasets, and scientific questions change. In an ideal case, benchmarking might be integrated with data generation in a process of active learning, with new experiments planned to probe most effectively areas of uncertainty of the current models and thus evolve with the challenges of the field. In this way, benchmarking can become a more effective driver of novel advances and mitigate the leaderboard effect that can lead to models excessively tuned to popular benchmarks. Doing so could be accomplished by a significant commitment to novel data generation as part of an existing ongoing challenge, such as CASP, or, conversely, rethinking major data generation efforts to incorporate continuous benchmarking of the tools those data are meant to feed and corresponding course correction of experimental plans based on the results of the benchmarking.

3.6 Putting modern AI on a firmer theoretical footing

We can anticipate these standards evolving as the theoretical foundations of modern AI develop, whether that comes from developing frameworks to provide better theoretical guarantees for the currently prevailing deep learning models or from replacing deep learning with other model types that lend themselves better to more efficient algorithms and more rigorous performance guarantees. Theoretical and empirical benchmarking will each have a role to play in assessing improvements in model design or wholly new ideas in modeling and comparing them to prior art. However, before we have answers we need to ask the right questions. What formal computational problem are we actually solving when we train an AI model? By what criteria are we testing that model relative to alternatives and with reference to a benchmark data set?

These are more subtle questions than might be apparent at first glance. The history of theoretical computer science teaches us that formulating the problems correctly can have enormous impact on how they are solved. When we have more rigorous answers to these questions, then we can begin to answer such follow-up questions as whether a method gives formal guarantees of performance, whether one method is provably better than another under a given set of criteria and assumptions, or whether a given method is theoretically optimal for a given problem statement. A focus on more rigorously posing questions of assessment is a first step towards answering those questions more rigorously.

3.7 Engaging the community

Bringing better benchmarking standards into practice will require organized support and community engagement beyond what can be accomplished by individual researchers. There is a necessary role for funders in recognizing that sound benchmarking is needed for progress in the field and that this requires support, including committing multi-year support to maintain living benchmarks. Expectations are also needed for sound benchmarking as a condition of consideration for funding, although with the caveats that benchmarking artifacts must be sufficiently lightweight to be accessible to small labs and not just major corporations and that funding will continue to be needed for new directions in research before they have reached the stage where community benchmarks become possible. Similar expectations are needed in other venues, such as publications, to adopt best practices for sound benchmarking of AI methods with similar caveats about the need to ensure that innovations from small labs are not priced out of challenge and that a focus on empirical benchmarks does not block work on innovative new approaches that might need time to compete with more conventional but highly engineered alternatives. The importance and growing complexity of benchmarking suggests a need for ongoing stewardship by neutral authorities; the International Society for Computational Biology or other relevant professional societies might be best positioned to meet this need. Efforts at organizing within the critical assessment community, such as the recently launched Benchmarking, Assessment, and Evaluation Consortium for Science (BEACON: The Benchmarking, Evaluation, and Assessment Consortium for Science 2026) provide a model for such community engagement.

4 Conclusions and discussion

As computational tools have become critical to biological discovery, our ability to assess such tools and recognize advances in them has become essential to the practice of rigorous science, whether for the individual user deciding which tools to use, a reviewer or editor assessing significance of advances under review, or a funding agency deciding which research directions will make best use of limited funds. The age of AI has created profound new challenges to the infrastructure of assessment. As we saw above, modern AI poses difficult new problems in scale and character for rigorously assessing methods, comparing them to one another, and judging their likely impact and future promise. Nevertheless, past experience offers some guidance for how we might revise our best practices to give clear guidance to method developers and users. This paper has sought to lay out some of the major challenges and provide potential solutions or at least a path to them.

There are substantial risks to mishandling this issue and, conversely, great opportunities if it is handled well. Biological research today is a data science and the research enterprise depends on computational tools to manage and interpret data. The risk of assessing poorly is that the field will end up using suboptimal tools that lead to suboptimal results—missed discoveries from false negatives and effort wasted on failed validations due to false positives. Even a small difference in effectiveness of a tool for a foundational task, like predicting a regulatory interaction or a functional mutation, might correspond to massive waste in researcher effort and funding by groups that follow up predictions that do not pan out, delaying the path to true discoveries. Even a well-meaning and knowledgeable user today might wade through numerous tools for basic bioinformatic tasks with no sound basis for determining which are truly state-of-the-art and which do not work at all. Poor assessment can also result in the community investing time and limited resources in less promising directions with an opportunity cost to numerous follow-on projects. It can mean failing to invest in potentially groundbreaking technologies because we have no way to distinguish them from the crowd. The opportunities to be gained by more rigorous assessment of AI-driven methodological advances include better finding groundbreaking advances no matter where they originate, targeting them for visibility, supporting their continued development, and bringing them to the applications that will benefit from them.

We close with a consideration of some broader issues for the community in moving forward on this issue. It is a challenge not just to develop guidelines but to bring them into practice in the operation of bioinformatics tool developers, labs using bioinformatics tools, journal editors and reviewers, and funding agencies and their reviewers. The field will also need to grapple with the question of how we will know when AI methods warrant trust comparable to what we might place in a human expert and whether that might eventually displace the need for explainability i.e. often expected today by users of AI in biomedical applications. Furthermore, the technology behind AI continues to evolve in ways that are difficult to predict. For example, quantum computing paradigms (Bose et al. 2026) have potentially substantial advantages over conventional computing in AI, including in the life sciences (Caro et al. 2022) and may offer novel solutions to other challenges mentioned above by promoting model compactness and efficiency, mitigating inductive bias (Gan et al. 2023) allowing for substantially reduced parameter spaces. Other alternatives to conventional computing platforms, perhaps yet to be conceived, could similarly offer both complications and possible solutions as benchmarking continues to evolve with the technologies it assesses. The rise of agentic AI and co-scientists creates new challenges of how to design rigorous quantitative assessments of methods whose goal is complex scientific reasoning rather than more straightforward prediction or classification tasks. Projects like community benchmarks that depend on openness and data sharing are also likely to have to grapple with legal restrictions on data sharing and collaboration that are beyond scientists’ control. These problems also may exacerbate disparities due to differences in infrastructures available to computational juggernauts versus, e.g. academic competitors in developing countries. Finally, adopting our recommendations will require more than just computational biologists following a list of best practices; developers and users of computational biology tools will need to be sufficiently educated in the foundations of modern AI and its uses in biology to apply those standards and verify that they have been applied. That, in turn, requires thinking about how we will update our standards for educating future life scientists who need to make decisions about deploying computational tools to include competence in these topics (Welch et al. 2014, Brooksbank et al. 2024).

Acknowledgements

We are grateful to the International Society for Computational Biology (ISCB) and its staff for providing a forum at the Intelligent Systems for Molecular Biology (ISMB) 2025 meeting for the discussion that became the nucleus of this paper. We thank Søren Brunak, Roded Sharan, and Shoshana J. Wodak for helpful comments.

Contributor Information

Russell Schwartz, Ray & Stephanie Lane Computational Biology Department, Carnegie Mellon University, Pittsburgh, PA 15213, United States; Department of Biological Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, United States.

Xuegong Zhang, Department of Automation/BNRIST and School of Life Sciences, Tsinghua University, Beijing 100084, China.

Jian Ma, Ray & Stephanie Lane Computational Biology Department, Carnegie Mellon University, Pittsburgh, PA 15213, United States.

Yana Bromberg, Department of Biology and Department of Computer Science, Emory University, Atlanta, GA 30322, United States.

Robert F Murphy, Ray & Stephanie Lane Computational Biology Department, Carnegie Mellon University, Pittsburgh, PA 15213, United States.

Lawrence E Hunter, Department of Pediatrics, University of Chicago, Chicago, IL 60637, United States.

Laxmi Parida, IBM Research, Yorktown Heights, NY 10598, United States.

Julio Saez-Rodriguez, European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI), Hinxton, Cambridgeshire, United Kingdom; Faculty of Medicine, and Heidelberg University Hospital, Institute for Computational Biomedicine, Heidelberg University, Heidelberg, Germany.

Gustavo Stolovitzky, Department of Pathology, NYU Grossman School of Engineering, New York, NY 10016, United States.

Mihai Pop, Department of Computer Science, University of Maryland, College Park, MD 20742, United States.

Shoba Ranganathan, Applied Biosciences, Macquarie University, Sydney, NSW 2109, Australia.

Donna K Slonim, Department of Computer Science, Tufts University, Medford, MA 02155, United States.

Terry Gaasterland, Bioinformatics & Systems Biology Program, UC San Diego, La Jolla, CA 92093, United States.

Conflicts of interest

RS reports in the last three years funding from the University of Pittsburgh Medical Center Enterprises. JSR reports in the last 3 years funding from GSK and Pfizer & fees/honoraria from Travere Therapeutics, Stadapharm, Astex Pharmaceuticals, Owkin, Pfizer, Vera Therapeutics, Grunenthal, Tempus and Moderna.

Funding

The authors report no specific funding for this work.

Data availability

There is no data associated with this manuscript.

References

  1. Ackloo S, Al-Awar R, Amaro RE  et al.  CACHE (critical assessment of computational hit-finding experiments): a public-private partnership benchmarking initiative to enable the development of computational methods for hit-finding. Nat Rev Chem  2022;6:287–95. 10.1038/s41570-022-00363-z [DOI] [PMC free article] [PubMed] [Google Scholar]
  2. Alspector J, Dietterich TG.  DARPA’s role in machine learning. AI Mag  2020;42:36–48. [Google Scholar]
  3. Ashburner M, Ball CA, Blake JA  et al.  Gene ontology: tool for the unification of biology. Nat Genet  2000;25:25–9. 10.1038/75556 [DOI] [PMC free article] [PubMed] [Google Scholar]
  4. Ashuach T, Gabitto MI, Koodli RV  et al.  MultiVI: deep generative model for the integration of multimodal data. Nat Methods  2023;20:1222–31. 10.1038/s41592-023-01909-9 [DOI] [PMC free article] [PubMed] [Google Scholar]
  5. Baião AR, Cai Z, Poulos RC  et al.  A technical review of multi-omics data integration methods: from classical statistical to deep generative approaches. Brief Bioinform  2025;26:bbaf355. 10.1093/bib/bbaf355 [DOI] [PMC free article] [PubMed] [Google Scholar]
  6. Baldi P, Brunak S, Chauvin Y  et al.  Assessing the accuracy of prediction algorithms for classification: an overview. Bioinformatics  2000;16:412–24. 10.1093/bioinformatics/16.5.412 [DOI] [PubMed] [Google Scholar]
  7. Bansal P, Morgat A, Axelsen KB  et al.  Rhea, the reaction knowledgebase in 2022. Nucleic Acids Res  2022;50:D693–D700. 10.1093/nar/gkab1016 [DOI] [PMC free article] [PubMed] [Google Scholar]
  8. BEACON: The Benchmarking, Evaluation, and Assessment Consortium for Science  2026. Conscience.
  9. Berman HM, Westbrook J, Feng Z  et al.  The protein data bank. Nucleic Acids Res  2000;28:235–42. 10.1093/nar/28.1.235 [DOI] [PMC free article] [PubMed] [Google Scholar]
  10. Bian H, Chen Y, Luo E  et al.  General-purpose pre-trained large cellular models for single-cell transcriptomics. Natl Sci Rev  2024;11:nwae340. 10.1093/nsr/nwae340 [DOI] [PMC free article] [PubMed] [Google Scholar]
  11. Biancalani T, Scalia G, Buffoni L  et al.  Deep learning and alignment of spatially resolved single-cell transcriptomes with Tangram. Nat Methods  2021;18:1352–62. 10.1038/s41592-021-01264-7 [DOI] [PMC free article] [PubMed] [Google Scholar]
  12. Blum A, Hardt M.  2015. The Ladder: a reliable leaderboard for machine learning competitions, arXiv, preprint: not peer reviewed.
  13. Bose A, Rhrissorrakrai K, Utro F  et al.  Advancing single-cell omics and cell-based therapeutics with quantum computing. Nat Rev Mol Cell Biol  2026;27:394–408. 10.1038/s41580-025-00918-0 [DOI] [PubMed] [Google Scholar]
  14. Bromberg Y, Kahn PC, Rost B  et al.  Neutral and weakly nonneutral sequence variants may define individuality. Proc Natl Acad Sci USA  2013;110:14255–60. 10.1073/pnas.1216613110 [DOI] [PMC free article] [PubMed] [Google Scholar]
  15. Brooks TG, Lahens NF, Mrčela A  et al.  Challenges and best practices in omics benchmarking. Nat Rev Genet  2024;25:326–39. 10.1038/s41576-023-00679-6 [DOI] [PubMed] [Google Scholar]
  16. Brooksbank C, Brazas MD, Mulder N  et al.  The ISCB competency framework v. 3: a revised and extended standard for bioinformatics education and training. Bioinform Adv  2024;4:vbae166. 10.1093/bioadv/vbae166 [DOI] [PMC free article] [PubMed] [Google Scholar]
  17. Canny J.  A computational approach to edge detection. IEEE Trans Pattern Anal Mach Intell  1986;8:679–98. 10.1109/TPAMI.1986.4767851 [DOI] [PubMed] [Google Scholar]
  18. Canty RB, Bennett JA, Brown KA  et al.  Science acceleration and accessibility with self-driving labs. Nat Commun  2025;16:3856. 10.1038/s41467-025-59231-1 [DOI] [PMC free article] [PubMed] [Google Scholar]
  19. Cao Y, Yu L, Torkel M  et al.  The current landscape and emerging challenges of benchmarking single-cell methods. Brief Bioinform  2025;26:bbaf380. 10.1093/bib/bbaf380 [DOI] [PMC free article] [PubMed] [Google Scholar]
  20. Caro MC, Huang H-Y, Cerezo M  et al.  Generalization in quantum machine learning from few training data. Nat Commun  2022;13:4919. 10.1038/s41467-022-32550-3 [DOI] [PMC free article] [PubMed] [Google Scholar]
  21. Carter AJ, Kraemer O, Zwick M  et al.  Target 2035: probing the human proteome. Drug Discov Today  2019;24:2111–5. 10.1016/j.drudis.2019.06.020 [DOI] [PubMed] [Google Scholar]
  22. Chakravarty D, Schafer JW, Chen EA  et al.  AlphaFold predictions of fold-switched conformations are driven by structure memorization. Nat Commun  2024;15:7296. 10.1038/s41467-024-51801-z [DOI] [PMC free article] [PubMed] [Google Scholar]
  23. Chang L, Perez A.  Rapid estimation of protein folding pathways from sequence alone using AlphaFold2. Nat Commun  2025;17:170. 10.1038/s41467-025-66870-x [DOI] [PMC free article] [PubMed] [Google Scholar]
  24. Chen Z, Boehnke M, Wen X  et al.  Revisiting the genome-wide significance threshold for common variant GWAS. 2021;11:jkaa056. 10.1093/g3journal/jkaa056 [DOI] [PMC free article] [PubMed] [Google Scholar]
  25. Chen V, Yang M, Cui W  et al.  Applying interpretable machine learning in computational biology-pitfalls, recommendations and opportunities for new developments. Nat Methods  2024;21:1454–61. 10.1038/s41592-024-02359-7 [DOI] [PMC free article] [PubMed] [Google Scholar]
  26. Chidambara Thanu V, Jabeen A, Zographos SE  et al.  TBM preferred to AlphaFold 3 for functional models of insect odorant receptors. Comput Struct Biotechnol J  2025;27:3908–18. 10.1016/j.csbj.2025.08.028 [DOI] [PMC free article] [PubMed] [Google Scholar]
  27. Cokelaer T, Bansal M, Bare C  et al.  DREAMTools: a python package for scoring collaborative challenges. F1000Res  2015;4:1030. 10.12688/f1000research.7118.1 [DOI] [PMC free article] [PubMed] [Google Scholar]
  28. Cormen TH, Leiserson CE, Rivest RL  et al.  2022. Introduction to algorithms. MIT press.
  29. Cozzarelli NR.  Revisiting the independence of the publicly and privately funded drafts of the human genome. Proc Natl Acad Sci USA  2003;100:3021. 10.1073/pnas.0830968100 [DOI] [PMC free article] [PubMed] [Google Scholar]
  30. Critical Assessment of Genome Interpretation Consortium. CAGI, the critical assessment of genome interpretation, establishes progress and prospects for computational genetic variant interpretation methods. Genome Biol  2024;25:53. 10.1186/s13059-023-03113-6 [DOI] [PMC free article] [PubMed] [Google Scholar]
  31. Cui H, Wang C, Maan H  et al.  scGPT: toward building a foundation model for single-cell multi-omics using generative AI. Nat Methods  2024;21:1470–80. 10.1038/s41592-024-02201-0 [DOI] [PubMed] [Google Scholar]
  32. Das R, Baker D.  Macromolecular modeling with rosetta. Annu Rev Biochem  2008;77:363–82. 10.1146/annurev.biochem.77.062906.171838 [DOI] [PubMed] [Google Scholar]
  33. DePristo MA, de Bakker PIW, Blundell TL  et al.  Heterogeneity and inaccuracy in protein structures solved by X-ray crystallography. Structure  2004;12:831–8. 10.1016/j.str.2004.02.031 [DOI] [PubMed] [Google Scholar]
  34. Dijkstra EW.  A note on two problems in connexion with graphs. Numer Math  2022;1:287–90. [Google Scholar]
  35. Dwork C, Feldman V, Hardt M  et al.  STATISTICS. The reusable holdout: preserving validity in adaptive data analysis. Science  2015;349:636–8. 10.1126/science.aaa9375 [DOI] [PubMed] [Google Scholar]
  36. Dwork C, Feldman V, Hardt M  et al.  Guilt-free data reuse. Commun ACM  2017;60:86–93. 10.1145/3051088 [DOI] [Google Scholar]
  37. Edwards AM, Owen DR, Structural Genomics Consortium Target 2035 Working Group. Protein-ligand data at scale to support machine learning. Nat Rev Chem  2025;9:634–45. 10.1038/s41570-025-00737-z [DOI] [PubMed] [Google Scholar]
  38. Ferdaus MM, Abdelguerfi M, Loup E  et al.  Towards trustworthy AI: a review of ethical and robust large language models. ACM Comput Surv  2026;58:1–43. 10.1145/3777382 [DOI] [Google Scholar]
  39. Fernandez Slezak D, Suárez C, Cecchi GA  et al.  When the optimal is not the best: parameter estimation in complex biological models. PLoS One  2010;5:e13283. [DOI] [PMC free article] [PubMed] [Google Scholar]
  40. Gan BY, Leykam D, Thanasilp S.  2023. A unified framework for trace-induced quantum kernels.
  41. Golkov V, Skwark MJ, Golkov A  et al.  Protein contact prediction from amino acid co-evolution using convolutional networks for graph-valued images. Adv Neural Inf Process Syst  2016;29. [Google Scholar]
  42. Hao M, Gong J, Zeng X  et al.  Large-scale foundation model on single-cell transcriptomics. Nat Methods  2024b;21:1481–91. 10.1038/s41592-024-02305-7 [DOI] [PubMed] [Google Scholar]
  43. Hao M, Luo E, Chen Y  et al.  STEM enables mapping of single-cell and spatial transcriptomics data with transfer learning. Commun Biol  2024c;7:56. 10.1038/s42003-023-05640-1 [DOI] [PMC free article] [PubMed] [Google Scholar]
  44. Hao M, Wei L, Yang F  et al.  Current opinions on large cellular models. Quant Biol  2024a;12:433–43. 10.1002/qub2.65 [DOI] [PMC free article] [PubMed] [Google Scholar]
  45. Harman DK.  1992. NIST Special Publication 500-207: The first text REtrieval conference (TREC-1). U.S. National Institute of Standards and Technology (NIST).
  46. Heumos L, Schaar AC, Lance C, et al.  Best practices for single-cell analysis across modalities. Nat Rev Genet  2023;24:550–72. 10.1038/s41576-023-00586-w [DOI] [PMC free article] [PubMed] [Google Scholar]
  47. Hoskins RA, Repo S, Barsky D  et al.  Reports from CAGI: the critical assessment of genome interpretation. Hum Mutat  2017;38:1039–41. 10.1002/humu.23290 [DOI] [PMC free article] [PubMed] [Google Scholar]
  48. Hu Y, Wan S, Luo Y  et al.  Benchmarking algorithms for single-cell multi-omics prediction and integration. Nat Methods  2024;21:2182–94. 10.1038/s41592-024-02429-w [DOI] [PubMed] [Google Scholar]
  49. Hua K, Zhang X.  A case study on the detailed reproducibility of a human cell atlas project. Quant Biol  2019;7:162–9. 10.1007/s40484-018-0164-3 [DOI] [Google Scholar]
  50. Jabeen A, Oakeshott JG, Lee SF  et al.  Template-based modeling of insect odorant receptors outperforms AlphaFold3 for ligand binding predictions. Sci Rep  2024;14:29084. 10.1038/s41598-024-80094-x [DOI] [PMC free article] [PubMed] [Google Scholar]
  51. Jin R, Chen W, Sudjianto A  et al.  An efficient algorithm for constructing optimal design of computer experiments. J Stat Plan Inference  2005;134:268–87. 10.1016/j.jspi.2004.02.014 [DOI] [Google Scholar]
  52. Jumper J, Evans R, Pritzel A  et al.  Highly accurate protein structure prediction with AlphaFold. Nature  2021;596:583–9. 10.1038/s41586-021-03819-2 [DOI] [PMC free article] [PubMed] [Google Scholar]
  53. Kapoor S, Narayanan A.  Leakage and the reproducibility crisis in machine-learning-based science. Patterns (N Y)  2023;4:100804. 10.1016/j.patter.2023.100804 [DOI] [PMC free article] [PubMed] [Google Scholar]
  54. Kryshtafovych A, Schwede T, Topf M  et al.  Critical assessment of methods of protein structure prediction (CASP)-round XIV. Proteins  2021;89:1607–17. 10.1002/prot.26237 [DOI] [PMC free article] [PubMed] [Google Scholar]
  55. Labaj PP, Dopazo J, Xiao W  et al.  2023. Critical assessment of massive data analysis (CAMDA) annual conference 2021. Frontiers in Genetics, 14, 1154398. [DOI] [PMC free article] [PubMed]
  56. Liang W, Izzo Z, Zhang Y  et al.  2024. Monitoring AI-modified content at scale: a case study on the impact of ChatGPT on AI conference peer reviews. In: Proceedings of the 41st International Conference on Machine Learning, PMLR 235:29575-29620, 2024.
  57. Liberali P, Snijder B, Pelkmans L  et al.  Single-cell and multivariate approaches in genetic perturbation screens. Nat Rev Genet  2015;16:18–32. 10.1038/nrg3768 [DOI] [PubMed] [Google Scholar]
  58. Linardatos P, Papastefanopoulos V, Kotsiantis S.  Explainable AI: a review of machine learning interpretability methods. Entropy  2020;23:18. [DOI] [PMC free article] [PubMed] [Google Scholar]
  59. Liu J, Montelione GT, Rost B  et al.  Novel leverage of structural genomics. Nat Biotechnol  2007;25:849–51. 10.1038/nbt0807-849 [DOI] [PubMed] [Google Scholar]
  60. Liu V, Yin Y.  Green AI: exploring carbon footprints, mitigation strategies, and trade offs in large language model training. Discov Artif Intell  2024;4:49. 10.1007/s44163-024-00149-w [DOI] [Google Scholar]
  61. Lupas A, Van Dyke M, Stock J  et al.  Predicting coiled coils from protein sequences. Science  1991;252:1162–4. 10.1126/science.252.5009.1162 [DOI] [PubMed] [Google Scholar]
  62. Maccluer JW, Falk CT, Spielman RS  et al.  Genetic analysis workshop II: summary. Genet Epidemiol  1984;1:145–59. 10.1002/gepi.1370010206 [DOI] [PubMed] [Google Scholar]
  63. Mahlich Y, Reeb J, Hecht M  et al.  Common sequence variants affect molecular function more than rare variants?  Sci Rep  2017;7:1608. 10.1038/s41598-017-01054-2 [DOI] [PMC free article] [PubMed] [Google Scholar]
  64. Mallona I, Soneson C, Carrillo B  et al.  Building a continuous benchmarking ecosystem in bioinformatics. PLoS Comput Biol  2025;21:e1013658. 10.1371/journal.pcbi.1013658 [DOI] [PMC free article] [PubMed] [Google Scholar]
  65. Mangul S, Martin LS, Hill BL  et al.  Systematic benchmarking of omics computational tools. Nat Commun  2019;10:1393. 10.1038/s41467-019-09406-4 [DOI] [PMC free article] [PubMed] [Google Scholar]
  66. Markowetz F.  All biology is computational biology. PLoS Biol  2017;15:e2002050. 10.1371/journal.pbio.2002050 [DOI] [PMC free article] [PubMed] [Google Scholar]
  67. Marks DS, Hopf TA, Sander C  et al.  Protein structure prediction from sequence variation. Nat Biotechnol  2012;30:1072–80. 10.1038/nbt.2419 [DOI] [PMC free article] [PubMed] [Google Scholar]
  68. Marr D, Hildreth E.  Theory of edge detection. Proc Royal Soc London Ser B. Biol Sci  1980;207:187–217. [DOI] [PubMed] [Google Scholar]
  69. Meyer F, Fritz A, Deng Z-L  et al.  Critical assessment of metagenome interpretation: the second round of challenges. Nat Methods  2022;19:429–40. 10.1038/s41592-022-01431-4 [DOI] [PMC free article] [PubMed] [Google Scholar]
  70. Meyer P, Saez-Rodriguez J.  Advances in systems biology modeling: 10 years of crowdsourcing DREAM challenges. Cell Syst  2021;12:636–53. 10.1016/j.cels.2021.05.015 [DOI] [PubMed] [Google Scholar]
  71. Meyes R  et al.  2019. Ablation studies in artificial neural networks.
  72. Moor M, Banerjee O, Abad ZSH  et al.  Foundation models for generalist medical artificial intelligence. Nature  2023;616:259–65. 10.1038/s41586-023-05881-4 [DOI] [PubMed] [Google Scholar]
  73. Muller J.  2018. The Tyranny of Metrics. Princeton University Press. [Google Scholar]
  74. Naddaf M.  Major AI conference flooded with peer reviews written fully by AI. Nature  2025;648:256–7. 10.1038/d41586-025-03506-6 [DOI] [PubMed] [Google Scholar]
  75. Naik AW, Kangas JD, Sullivan DP  et al.  Active machine learning-driven experimentation to determine compound effects on protein patterns. Elife  2016;5:e10047. 10.7554/eLife.10047 [DOI] [PMC free article] [PubMed] [Google Scholar]
  76. Nair R, Liu J, Soong T-T  et al.  Structural genomics is the largest contributor of novel structural leverage. J Struct Funct Genomics  2009;10:181–91. 10.1007/s10969-008-9055-6 [DOI] [PMC free article] [PubMed] [Google Scholar]
  77. National Academies of Sciences, Engineering, and Medicine  et al.  2019. Reproducibility and Replicability in Science. National Academies Press. [PubMed]
  78. National Research Council (US) Committee on Undergraduate Biology Education to Prepare Research Scientists for the 21st Century  2003. Bio2010: Transforming Undergraduate Education for Future Research Biologists. Washington, DC: National Academies Press (US). [PubMed]
  79. Newell A, Simon HA.  1972. Human Problem Solving. Englewood Cliffs, NJ: Prentice-Hall. [Google Scholar]
  80. Nielsen H, Engelbrecht J, von Heijne G  et al.  Defining a similarity threshold for a functional protein sequence pattern: the signal peptide cleavage site. Proteins  1996;24:165–77. 10.1002/(SICI)1097-0134(199602)24:2<165::AID-PROT4>3.0.CO; 2-I [DOI] [PubMed] [Google Scholar]
  81. Norel R, Rice JJ, Stolovitzky G  et al.  The self‐assessment trap: can we all be better than average?  Mol Syst Biol  2011;7:537. 10.1038/msb.2011.70 [DOI] [PMC free article] [PubMed] [Google Scholar]
  82. Norvell JC, Berg JM.  Update on the protein structure initiative. Structure  2007;15:1519–22. 10.1016/j.str.2007.11.004 [DOI] [PubMed] [Google Scholar]
  83. Peters B, Brenner SE, Wang E  et al.  Putting benchmarks in their rightful place: the heart of computational biology. PLoS Comput Biol  2018;14:e1006494. 10.1371/journal.pcbi.1006494 [DOI] [PMC free article] [PubMed] [Google Scholar]
  84. Piovesan D, Zago D, Joshi P  et al.  CAFA-evaluator: a python tool for benchmarking ontological classification methods. Bioinform Adv  2024;4:vbae043. 10.1093/bioadv/vbae043 [DOI] [PMC free article] [PubMed] [Google Scholar]
  85. Pop M, Attwood TK, Blake JA  et al.  Biological databases in the age of generative artificial intelligence. Bioinform Adv  2025;5:vbaf044. 10.1093/bioadv/vbaf044 [DOI] [PMC free article] [PubMed] [Google Scholar]
  86. Prabakaran R, Bromberg Y.  Quantifying uncertainty in protein representations across models and tasks. Nat Methods  2026;23:796–804. 10.1038/s41592-026-03028-7 [DOI] [PMC free article] [PubMed] [Google Scholar]
  87. Punjani A, Fleet DJ.  3D variability analysis: resolving continuous flexibility and discrete heterogeneity from single particle cryo-EM. J Struct Biol  2021;213:107702. 10.1016/j.jsb.2021.107702 [DOI] [PubMed] [Google Scholar]
  88. Recht B, Roelofs R, Schmidt L  et al.  2019. Do ImageNet classifiers generalize to ImageNet? In: Proceedings of the 36th International Conference on Machine Learning. 97:5389–5400. [Google Scholar]
  89. Roberts LG.  1963. Machine Perception of Three-Dimensional Solids.
  90. Robinson MD, Vitek O.  Benchmarking comes of age. Genome Biol  2019;20:205. 10.1186/s13059-019-1846-5 [DOI] [PMC free article] [PubMed] [Google Scholar]
  91. Rost B, Sander C.  Improved prediction of protein secondary structure by use of sequence profiles and neural networks. Proc Natl Acad Sci USA  1993;90:7558–62. 10.1073/pnas.90.16.7558 [DOI] [PMC free article] [PubMed] [Google Scholar]
  92. Saez-Rodriguez J, Costello JC, Friend SH  et al.  Crowdsourcing biomedical research: leveraging communities as innovation engines. Nat Rev Genet  2016;17:470–86. 10.1038/nrg.2016.69 [DOI] [PMC free article] [PubMed] [Google Scholar]
  93. Saez-Rodriguez J, Schäfer PSL, Kalavros N  et al.  Benchmarking biomedical foundation models. Nat Methods  2026;23:1724–33. 10.1038/s41592-026-03182-y [DOI] [PubMed] [Google Scholar]
  94. Sage Bionetworks. First DREAM Target 2035 Drug Discovery Challenge.
  95. Sali A, Shakhnovich E, Karplus M  et al.  How does a protein fold?  Nature  1994;369:248–51. 10.1038/369248a0 [DOI] [PubMed] [Google Scholar]
  96. Schäfer PSL, Reid KA, Boldyga Z  et al.  2026. Towards principled evaluation of single-cell perturbation prediction models. bioRxiv.
  97. Schummer J, MacLennan B, Taylor N.  2009. Aesthetic values in technology and engineering design. In: Philosophy of Technology and Engineering Sciences. North-Holland, pp. 1031–68.
  98. Sczyrba A, Hofmann P, Belmann P  et al.  Critical assessment of metagenome interpretation—a benchmark of metagenomics software. Nat Methods  2017;14:1063–71. 10.1038/nmeth.4458 [DOI] [PMC free article] [PubMed] [Google Scholar]
  99. Senoner T, Koludarov I, Günther J  et al.  2025. Which pLM to choose? bioRxiv, 2025.10.30.685515.
  100. Shortle D.  Protein fold recognition. Nat Struct Biol  1995;2:91–3. 10.1038/nsb0295-91 [DOI] [PubMed] [Google Scholar]
  101. Shu L, Tang J, Guan X  et al.  A comprehensive survey of genome language models in bioinformatics. Brief Bioinform  2026;27:bbaf724. 10.1093/bib/bbaf724 [DOI] [PMC free article] [PubMed] [Google Scholar]
  102. Simons KT, Bonneau R, Ruczinski I  et al.  Ab initio protein structure prediction of CASP III targets using ROSETTA. Proteins  1999;37:171–6. 10.1002/(SICI)1097-0134(1999)37:3+<171::AID-PROT21>3.0.CO; 2-Z [DOI] [PubMed] [Google Scholar]
  103. Sinclair N.  Aesthetic considerations in mathematics. J. Humanist. Math  2011;1:2–32. 10.5642/jhummath.201101.03 [DOI] [Google Scholar]
  104. Sparkes A, Aubrey W, Byrne E  et al.  Towards robot scientists for autonomous scientific discovery. Autom Exp  2010;2:1. 10.1186/1759-4499-2-1 [DOI] [PMC free article] [PubMed] [Google Scholar]
  105. Srivatsa A, Schwartz R.  Optimizing design of genomics studies for clonal evolution analysis. Bioinform Adv  2024;4:vbae193. 10.1093/bioadv/vbae193 [DOI] [PMC free article] [PubMed] [Google Scholar]
  106. Stapenhurst T.  2017. The Benchmarking Book. Routledge.
  107. Sussman JL, Lin D, Jiang J  et al.  Protein data bank (PDB): database of three-dimensional structural information of biological macromolecules. Acta Crystallogr D Biol Crystallogr  1998;54:1078–84. 10.1107/s0907444998009378 [DOI] [PubMed] [Google Scholar]
  108. Tarazona S, Balzano-Nogueira L, Gómez-Cabrero D  et al.  Harmonization of quality metrics and power calculation in multi-omic studies. Nat Commun  2020;11:3092. 10.1038/s41467-020-16937-8 [DOI] [PMC free article] [PubMed] [Google Scholar]
  109. Theodoris CV.  Perspectives on benchmarking foundation models for network biology. Quant Biol  2024;12:335–8. 10.1002/qub2.68 [DOI] [PMC free article] [PubMed] [Google Scholar]
  110. Theodoris CV, Xiao L, Chopra A  et al.  Transfer learning enables predictions in network biology. Nature  2023;618:616–24. 10.1038/s41586-023-06139-9 [DOI] [PMC free article] [PubMed] [Google Scholar]
  111. Tipton K, Boyce S.  History of the enzyme nomenclature system. Bioinformatics  2000;16:34–40. 10.1093/bioinformatics/16.1.34 [DOI] [PubMed] [Google Scholar]
  112. Venter JC, Adams MD, Myers EW  et al.  The sequence of the human genome. Science  2001;291:1304–51. 10.1126/science.1058040 [DOI] [PubMed] [Google Scholar]
  113. Weber JL, Myers EW.  Human whole-genome shotgun sequencing. Genome Res  1997;7:401–9. 10.1101/gr.7.5.401 [DOI] [PubMed] [Google Scholar]
  114. Weber LM, Saelens W, Cannoodt R  et al.  Essential guidelines for computational method benchmarking. Genome Biol  2019;20:125. 10.1186/s13059-019-1738-8 [DOI] [PMC free article] [PubMed] [Google Scholar]
  115. Welch L, Lewitter F, Schwartz R  et al.  Bioinformatics curriculum guidelines: toward a definition of core competencies. PLoS Comput Biol  2014;10:e1003496. 10.1371/journal.pcbi.1003496 [DOI] [PMC free article] [PubMed] [Google Scholar]
  116. Williams JJ, Drew JC, Galindo-Gonzalez S  et al.  Barriers to integration of bioinformatics into undergraduate life sciences education: a national study of US life sciences faculty uncover significant barriers to integrating bioinformatics into undergraduate instruction. PLoS One  2019;14:e0224288. 10.1371/journal.pone.0224288 [DOI] [PMC free article] [PubMed] [Google Scholar]
  117. Witte JS, Schnell AH, Cordell HJ  et al.  Introduction to genetic analysis workshop 15 summaries. Genet Epidemiol  2007;31 Suppl 1:S1–6. 10.1002/gepi.20274 [DOI] [PubMed] [Google Scholar]
  118. Wodak SJ, Vajda S, Lensink MF  et al.  Critical assessment of methods for predicting the 3D structure of proteins and protein complexes. Annu Rev Biophys  2023;52:183–206. 10.1146/annurev-biophys-102622-084607 [DOI] [PMC free article] [PubMed] [Google Scholar]
  119. Xiao C, Chen Y, Meng Q  et al.  Benchmarking multi-omics integration algorithms across single-cell RNA and ATAC data. Brief Bioinform  2024;25 bbae095. 10.1093/bib/bbae095 [DOI] [PMC free article] [PubMed] [Google Scholar]
  120. Zeng Z, Aptekmann AA, Bromberg Y  et al.  Decoding the effects of synonymous variants. Nucleic Acids Res  2021;49:12673–91. 10.1093/nar/gkab1159 [DOI] [PMC free article] [PubMed] [Google Scholar]
  121. Zhang J, Yuan R, Kryshtafovych A  et al.  Assessment of protein complex predictions in CASP16: are We making progress?  Proteins  2026;94:106–30. 10.1002/prot.70068 [DOI] [PMC free article] [PubMed] [Google Scholar]
  122. Zhou N, Jiang Y, Bergquist TR  et al.  The CAFA challenge reports improved protein function prediction and new functional annotations for hundreds of genes through experimental screens. Genome Biol  2019;20:244. 10.1186/s13059-019-1835-8 [DOI] [PMC free article] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

There is no data associated with this manuscript.


Articles from Bioinformatics Advances are provided here courtesy of Oxford University Press

RESOURCES