Abstract
Protein function prediction has advanced from homology-based annotation transfer to deep learning, protein language models, and multimodal foundation models. Yet improved benchmark performance does not resolve a more basic problem: these systems learn from biological knowledge that is incomplete, heterogeneous in evidential support, and strongly structured by evolutionary relationships. We organize this problem as two sequentially dependent epistemological levels. The first concerns biological knowledge: what functional states become observable, with what evidential support and evolutionary structure. The second concerns what models can legitimately infer from that supervision, including representation sufficiency, uncertainty, generalization, and the scope of a universal computational blueprint for protein function inference. Because limitations at the first level enter the learning problem before model fitting, benchmark performance and model uncertainty cannot by themselves establish certainty about latent biological function. Trustworthy protein AI therefore requires explicit attention to applicability domains, distribution shift, uncertainty, and the limits of inference from available biological knowledge.
1 Introduction
Protein function prediction (PFP) has undergone four major methodological transitions over the past 3 decades: homology-based annotation transfer, benchmark-driven machine learning, deep supervised prediction, and, most recently, protein language models (PLMs) and multimodal foundation models. Each transition has expanded functional inference from explicit sequence similarity and engineered features to learned sequence representations increasingly complemented by structural, network, and ontology-derived information (; ; ; ; ; ). These advances have substantially improved the accuracy and scope of computational protein annotation.
However, as predictive performance has improved, the field has also become confronted with questions that benchmark performance alone cannot answer. Many of these questions are epistemological rather than algorithmic, arising from the interaction between incomplete biological knowledge and increasingly powerful learning algorithms. Protein function annotation is inherently an open-world problem: annotations are incomplete, the absence of annotation does not imply the absence of function, and negative instances are poorly defined (; ). These limitations become particularly important under distribution shift, when predictors encounter novel families or divergent proteins that differ substantially from their training data.
Because homology pervades the inference and propagation of functional annotations, an equally important question is whether deep learning truly overcomes homology bias or merely learns more sophisticated representations of evolutionary relatedness (; ). This success sharpens rather than resolves the underlying question: how much of a model’s predictive performance derives from evolutionary and other statistical regularities present in protein sequences, and to what extent does it support functional generalization beyond familiar regions of protein space? Increasingly powerful models may still fail silently on proteins that depart from their training distribution, which makes uncertainty estimation, calibration, and selective abstention important for determining when their predictions can be trusted.
Earlier work has addressed open-world annotation and negative selection (; ; ), incomplete knowledge in evaluation (), evolutionary relatedness in PLM-based inference (; ), and predictive uncertainty under distribution shift (; ). We connect these as two sequentially dependent epistemological levels. The first concerns what biological function becomes observable, with what evidence and evolutionary structure; the second, what models can infer from that supervision. Our contribution is to trace how limitations at the first level carry through dataset construction, training, evaluation, and prediction, restricting the claims that benchmark results can support.
This dependency also points to characteristic failure modes. Incomplete or unevenly supported annotations can distort supervision, including through mislabeled operational negatives; evolutionary overlap can inflate apparent generalization; and distribution shift can degrade performance and calibration. Better models may reduce downstream error, but do not show that uncertainty in supervision has been resolved. Predictions should therefore be interpreted relative to the evidence, assumptions, and applicability domain supporting them. Supplementary Material S1 formalizes this relationship.
2 The epistemology of biological knowledge
2.1 The open-world nature of protein function annotation
A central epistemic limitation of protein function prediction is the distinction between biological function and observed annotation. Annotation resources capture only a subset of a protein’s functional repertoire, including functions that may emerge under specific cellular or environmental conditions. Under the open-world assumption (OWA), absence of annotation therefore does not imply absence of the corresponding function ().
This incompleteness directly complicates supervised learning because negative instances are difficult to define. An unannotated protein–function relationship may represent either a function that is truly absent or one that has not yet been observed or characterized, while evidence demonstrating functional absence is considerably scarcer than evidence supporting functional presence (). The unannotated space therefore cannot generally be interpreted as a reliable negative class.
Binary and multilabel classifiers nevertheless require operational negatives, commonly constructed heuristically from unlabeled data. These choices can materially alter supervision. By restricting negative examples to genes annotated within the same GO branch, reduced verifiable positives incorrectly assigned to the negative class by 91.5% in yeast and 22.5% in mouse. The problem is therefore not merely class imbalance, but class indeterminacy: unlabeled data contain an unknown mixture of truly negative and yet undiscovered positive relationships.
This has motivated positive–unlabeled (PU) formulations of protein function prediction. PU-GO, for example, formulated the task as positive–unlabeled ranking and reported improved robustness on similarity based and time based benchmarks (). From an epistemic perspective, negative labels derived from unlabeled data are assumptions introduced by the learning framework rather than direct observations of biological absence. The annotation space should therefore be understood as a partially observed functional state, not a complete positive–negative representation of biological reality.
2.2 The uncertainty embedded in biological annotations
Even positively annotated protein–function relationships do not necessarily have equivalent epistemic status. Functional annotations are supported by heterogeneous evidence, including experimental assays, phylogenetic inference, sequence or structural similarity, computational analysis, curator interpretation, and automated annotation. The Gene Ontology represents these differences through evidence codes grouped into experimental, phylogenetic, computational, author, curatorial, and automatically generated categories (). A positive annotation should therefore be understood not simply as a binary statement of biological truth, but as a functional assertion supported by particular evidence.
Transforming annotations into categorical labels for machine learning can obscure differences in provenance and evidential support. Errors may also arise from incorrect functional transfer or excessive specificity. In 7,255 sequences from 37 well-characterized enzyme families, found substantial variation in misannotation across databases and enzyme superfamilies; in NCBI non-redundant protein database (NR), 85% of identified misannotations correspond to overannotation. Although these estimates reflect specific families and historical database versions, they demonstrate that functional labels can contain systematic uncertainty rather than purely random noise.
The problem is broader than conventional label noise. Annotations differ not only in whether they are correct, but also in how strongly and directly the available evidence supports them. Ignoring these differences during training can leave models with heterogeneous supervision while their predictions appear uniformly certain. Confidence in a prediction must therefore be distinguished from confidence in the biological knowledge used to supervise it. Model uncertainty and annotation uncertainty are related, but they are not the same epistemic quantity.
2.3 Can deep learning escape homology?
Homology occupies a distinctive position in protein function prediction. It is not an epistemic defect: evolutionary relationships provide biological evidence, and homology-based transfer remains a foundation of computational annotation (). The relevant question is not whether deep learning eliminates homology, but what form of generalization an evaluation design supports.
PLMs support remote homology detection at low sequence identity (; ). In a zero-shot remote homology task, not direct functional annotation, reported that ProtT5 AUPRC decreased from approximately 56%–35% as the maximum sequence identity threshold decreased from 95% to 10%. Although this is not a function-prediction result, it is relevant because evolutionary relationships are an important source of evidence for function transfer, and their detectability changes as sequence identity decreases.
Three levels of generalization should be distinguished. First, sequence-identity filtering tests generalization beyond the similarity criterion used to construct the benchmark, not evolutionary independence. Second, a low-identity test protein may still belong to a family or superfamily represented in supervised training and remain detectable by profile-based methods; performance then shows transfer across sequence divergence, but within detectable evolutionary relationships. Third, a stricter design excludes the same family or superfamily and screens for residual relationships with profile-based or structure-aware methods. If none is detected, performance supports generalization beyond the detection capacity of those methods, not proof that no evolutionary relationship exists. Homology bias arises when unaccounted evolutionary overlap supports a stronger generalization claim than the evaluation design warrants.
Family-level separation reduces close evolutionary overlap but depends on family definitions and can leave deeper relationships. Structural comparison can reveal relationships missed by sequence similarity, but structural similarity does not by itself establish common ancestry. Temporal separation approximates prospective evaluation and avoids training on annotations that appeared after the cutoff, but it does not remove evolutionary relatedness. For PLMs, downstream supervised overlap must also be distinguished from self-supervised pretraining exposure. Sequence exposure during pretraining is not equivalent to functional-label leakage, but an evaluation protein or close relative may not be unseen at the representation-learning stage. Evaluation should state the controls used and the claims they support.
Figure 1 summarizes these limitations. For example, treating an unannotated protein–function pair as a negative can make a prediction later supported by evidence count as a false positive, although biological absence was never established. Supplementary Section 1.9 develops this case, and Supplementary Table S1 maps this and four further failure modes to their controls and residual limitations.
FIGURE 1
3 The epistemology of protein function learning
3.1 What are deep learning models actually learning?
The increasing predictive capacity of deep learning raises a broader epistemic question: what information do these models learn about protein function? PLMs trained on large sequence collections develop representations associated with evolutionary relationships, structure, and functional properties even when these attributes are not explicitly provided during pretraining (; ). Yet biologically meaningful representations should not be interpreted as complete representations of biological function. In supervised protein function prediction, the immediate learning target is typically an operational label constructed from the observable annotation state, which itself is only a partially observed and epistemically heterogeneous approximation of biological function.
Sequence based predictors show that protein sequence contains substantial information for functional inference. DeepGOPlus combines sequence derived features with sequence similarity to predict Gene Ontology annotations (). Modern predictors, however, increasingly incorporate structure, interaction networks, ontology derived information, and other modalities. DeepFRI combines sequence derived features with structural information through graph convolutional networks and improves prediction relative to sequence based convolutional models (). Contemporary approaches increasingly integrate multiple biological information sources ().
Multimodal models make visible a distinction between information contained in a biological system and information recoverable by a particular representation and learning algorithm. Improved prediction after incorporating structure or biological context does not necessarily mean that the corresponding information is absent from sequence. It may instead be difficult to recover from sequence alone, insufficiently represented by the learned embedding, or more directly accessible through another modality. The practical question is whether a representation provides sufficient information for the functional inference being attempted, rather than simply whether sequence “contains” protein function.
Predictive sufficiency should also not be confused with mechanistic understanding. A model may learn statistical regularities strongly associated with functional annotations without recovering the biological mechanisms that generate those functions, while additional modalities may improve prediction without resolving uncertainty in the annotations themselves. Successful prediction shows that a representation contains information useful for functional inference, but not that it provides a complete or mechanistic model of biological function.
3.2 Uncertainty and trustworthy protein AI
Predictive accuracy alone is insufficient to determine when a protein function prediction should be trusted. A predictor may perform well on average while remaining overconfident on individual errors. Calibration addresses this by asking whether predictive confidence corresponds to empirical correctness, rather than merely whether predictions are accurate (). The challenge becomes more pronounced under distribution shift, where both predictive performance and uncertainty estimates may deteriorate as test data depart from the training distribution (), for instance when models encounter divergent sequences or remote protein families poorly represented during training.
Predictive uncertainty is commonly separated into aleatoric uncertainty, associated with variability in the observed prediction problem, and epistemic uncertainty, associated with limited model knowledge (; ). Biological knowledge uncertainty arises upstream from incomplete annotations, heterogeneous evidence, and missing context. It is not a separate component estimated by the model, although it shapes the data from which predictive uncertainty is estimated, and has no one-to-one correspondence with either category. For example, epistemic uncertainty may increase for a protein family poorly represented in training, whereas inconsistent labels among otherwise similar proteins may contribute to apparent aleatoric variability in a fixed dataset even when that inconsistency originates from the annotation process. The same unresolved annotation may behave as irreducible label noise relative to the dataset as given yet become reducible biologically through additional evidence.
This distinction also complicates the interpretation of apparent prediction errors. Under the open-world assumption, disagreement between a prediction and the current annotation corpus does not necessarily imply biological incorrectness. showed that incomplete experimental annotations can affect performance estimates, with the magnitude and direction depending on the prediction method, evaluation metric, and ontology structure, though large-scale evaluations can remain informative despite incomplete knowledge. The epistemic limitation is therefore not that current benchmarks are invalid, but that their outcomes quantify agreement with the currently observable functional state, not with a complete biological ground truth.
Methods act at different levels: positive–unlabeled or evidence-aware supervision can make assumptions about the annotation process explicit or reduce their influence on training, whereas calibration, out-of-distribution detection, and selective prediction characterize model behavior and applicability. , for example, applied conformal prediction and conformal risk control to protein search and functional annotation, transforming raw model scores into calibrated probabilities and retrieval sets with user-specified statistical risk guarantees. These guarantees depend on assumptions linking calibration data to future observations. Their value lies in extending the question from what function a model predicts to the conditions and statistical guarantees under which that prediction can be trusted.
A trustworthy predictor should communicate both its functional prediction and the limits of the inference supporting it. Uncertainty quantification is useful not because it eliminates epistemic uncertainty, but because it can make the boundaries of predictive knowledge explicit. Beyond those boundaries, abstention is preferable to silent failure.
3.3 Toward a universal computational blueprint for protein function inference
The preceding limitations raise a broader question: what would universality mean in protein function prediction? Here, universality does not denote a single architecture that assigns every possible function to every protein. We use the term to describe a universal computational blueprint for inference: one that identifies which molecular and contextual variables are sufficient for a specified functional target, generalizes beyond familiar evolutionary and statistical relationships, and recognizes when available information is insufficient for prediction.
The required information may differ across functional scopes. A molecular function assignment may sometimes be supported predominantly by sequence and structure, whereas biological process or cellular component assignments may require interaction, localization, or condition-specific information. Individual proteins can also perform different functions across contexts (), and localization can alter which interactions and activities are available (). Universality therefore should not assume that the same modalities are sufficient for every functional question.
Under this definition, progress toward universality should be evaluated by the scope and limits of justified inference rather than coverage alone. A more general predictor should degrade gracefully, or abstain, across increasingly distinct evolutionary and statistical regimes, and use additional context when it contributes information not recoverable from the available molecular representation. Progress could be assessed by coverage at a fixed risk level under defined shifts, together with target-specific gains from adding relevant contextual information. Abstention when information or support is absent is therefore part of this notion of universality, not evidence against it.
Whether a finite, learnable representation can support this form of inference remains open. If relevant molecular and contextual variables can be observed, increasingly general models may approximate the mapping to functional state. If essential context remains unobserved, a universal blueprint would instead need to recognize non-identifiability.
These relationships among representation, context, applicability domains, and a universal computational blueprint are summarized in Figure 2.
FIGURE 2
4 Discussion
Advances in deep learning and protein foundation models have substantially expanded the capacity to infer protein function from biological data. Yet increasing predictive performance does not eliminate the epistemic limitations of the knowledge from which these models learn. Protein function annotation remains incomplete, negative instances are intrinsically difficult to establish, functional assertions differ in evidential support, and evolutionary relationships shape both the construction of biological knowledge and its computational inference. Together, these properties form the epistemic substrate on which protein function predictors are trained and evaluated.
Several practical decisions follow from this view. Benchmark designers should report how operational negatives were constructed, how evolutionary overlap between training and evaluation data was controlled, and, where evidence metadata permit, results by evidence type. Model developers should report calibration against the operational target used, evaluate performance under relevant distribution shifts, and define an applicability domain outside which the model abstains. Users should interpret benchmark results as evidence about the currently annotated state, not as validation against complete biological truth. Predictive success does not establish mechanistic understanding, and low sequence similarity does not establish evolutionary independence.
A near-term agenda has three priorities. First, calibration should be reported against a stated operational target and, where evidence permits, stratified by evidence provenance. Second, applicability domains should be tested under defined evolutionary and statistical shifts, including selective prediction when support is insufficient. Third, context sufficiency should be tested for each functional target by comparing molecular-only and context-augmented models.
A longer-term question is whether these principles can converge into a universal computational blueprint for protein function inference. Progress would then depend less on identifying a single architecture than on determining which molecular and contextual variables are sufficient for a specified functional target, how models generalize beyond supported regimes, and when available information is insufficient for prediction. Whether such a blueprint exists remains unresolved. Its pursuit, however, reframes progress in protein function prediction: the objective is not only to predict more functions, but to establish what can be inferred from available biological knowledge, why that inference is justified, and where its limits lie.
Statements
Data availability statement
The original contributions presented in the study are included in the article/Supplementary Material, further inquiries can be directed to the corresponding author.
Author contributions
LL-D: Conceptualization, Writing – original draft, Writing – review and editing, Project administration. EC-D: Formal Analysis, Writing – review and editing. EP-R: Writing – review and editing. RC-E: Writing – review and editing, Funding acquisition.
Funding
The author(s) declared that financial support was received for this work and/or its publication. This work was supported by the Instituto Tecnológico y de Estudios Superiores de Monterrey through the Publications Support Fund (FAP, by its initials in Spanish) to RCE, and funded by the Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México (IN206326) to EPR.
Conflict of interest
The author(s) declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
Generative AI statement
The author(s) declared that generative AI was used in the creation of this manuscript. Generative artificial intelligence tools, including ChatGPT (GPT-5.6 Sol, OpenAI) and Claude Sonnet 5 (Anthropic), were used during manuscript preparation to assist with language editing, synthesis, organization, and reference checking. All AI-assisted content, scientific claims, interpretations, citations, and references were critically reviewed by the authors, who take full responsibility for the accuracy, integrity, and final content of the manuscript.
Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.
Publisher’s note
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.
Supplementary material
The Supplementary Material for this article can be found online at: https://www.frontiersin.org/articles/10.3389/fbinf.2026.2010708/full#supplementary-material
References
1
AltschulS. F.GishW.MillerW.MyersE. W.LipmanD. J. (1990). Basic local alignment search tool. J. Mol. Biol.215, 403–410. 10.1016/S0022-2836(05)80360-2
2
BileschiM. L.BelangerD.BryantD. H.SandersonT.CarterB.SculleyD.et al (2022). Using deep learning to annotate the protein universe. Nat. Biotechnol.40, 932–937. 10.1038/s41587-021-01179-w
3
BoaduF.LeeA.ChengJ. (2025). Deep learning methods for protein function prediction. Proteomics25, e2300471. 10.1002/pmic.202300471
4
BogerR. S.ChithranandaS.AngelopoulosA. N.YoonP. H.JordanM. I.DoudnaJ. A. (2025). Functional protein mining with conformal guarantees. Nat. Commun.16, 85. 10.1038/s41467-024-55676-y
5
DessimozC.ŠkuncaN.ThomasP. D. (2013). CAFA and the Open World of protein function predictions. Trends Genet.29, 609–610. 10.1016/j.tig.2013.09.005
6
ElnaggarA.HeinzingerM.DallagoC.RehawiG.WangY.JonesL.et al (2022). ProtTrans: toward understanding the language of life through self-supervised learning. IEEE Trans. Pattern Anal. Mach. Intell.44, 7112–7127. 10.1109/TPAMI.2021.3095381
7
GligorijevićV.RenfrewP. D.KosciolekT.LemanJ. K.BerenbergD.VatanenT.et al (2021). Structure-based protein function prediction using graph convolutional networks. Nat. Commun.12, 3168. 10.1038/s41467-021-23303-9
8
GuoC.PleissG.SunY.WeinbergerK. Q. (2017). On calibration of modern neural networks. Proc. Mach. Learn. Res.70, 1321–1330.
9
HüllermeierE.WaegemanW. (2021). Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods. Mach. Learn.110, 457–506. 10.1007/s10994-021-05946-3
10
JiangY.ClarkW. T.FriedbergI.RadivojacP. (2014). The impact of incomplete knowledge on the evaluation of protein function prediction: a structured-output learning perspective. Bioinformatics30, i609–i616. 10.1093/bioinformatics/btu472
11
KabirA.MoldwinA.BrombergY.ShehuA. (2024). In the twilight zone of protein sequence homology: do protein language models learn protein structure? Bioinform. Adv4, vbae119. 10.1093/bioadv/vbae119
12
KendallA.GalY. (2017). What uncertainties do we need in Bayesian deep learning for computer vision?Adv. Neural Inf. Process. Syst.30, 5574–5584.
13
KilincM.JiaK.JerniganR. L. (2025). Major advances in protein function assignment by remote homolog detection with protein language models—a review. Curr. Opin. Struct. Biol.90, 102984. 10.1016/j.sbi.2025.102984
14
KulmanovM.HoehndorfR. (2020). DeepGOPlus: improved protein function prediction from sequence. Bioinformatics36, 422–429. 10.1093/bioinformatics/btz595
15
KulmanovM.KhanM. A.HoehndorfR.WrenJ. (2018). DeepGO: predicting protein functions from sequence and interactions using a deep ontology-aware classifier. Bioinformatics34, 660–668. 10.1093/bioinformatics/btx624
16
LiuW.WangZ.YouR.XieC.WeiH.XiongY.et al (2024). PLMSearch: protein language model powers accurate and fast sequence search for remote homology. Nat. Commun.15, 2775. 10.1038/s41467-024-46808-5
17
LoewensteinY.RaimondoD.RedfernO. C.WatsonJ.FrishmanD.LinialM.et al (2009). Protein function annotation by homology-based inference. Genome Biol.10, 207. 10.1186/gb-2009-10-2-207
18
OvadiaY.FertigE.RenJ.NadoZ.SculleyD.NowozinS.et al (2019). Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift. Adv. Neural Inf. Process. Syst.32, 13991–14002.
19
RadivojacP.ClarkW. T.OronT. R.SchnoesA. M.WittkopT.SokolovA.et al (2013). A large-scale evaluation of computational protein function prediction. Nat. Methods10, 221–227. 10.1038/nmeth.2340
20
RivesA.MeierJ.SercuT.GoyalS.LinZ.LiuJ.et al (2021). Biological structure and function emerge from scaling unsupervised learning to 250 million protein sequences. Proc. Natl. Acad. Sci. U.S.A.118, e2016239118. 10.1073/pnas.2016239118
21
SchnoesA. M.BrownS. D.DodevskiI.BabbittP. C. (2009). Annotation error in public databases: misannotation of molecular function in enzyme superfamilies. PLoS Comput. Biol.5, e1000605. 10.1371/journal.pcbi.1000605
22
SigaevaA.HutchingsC.CesnikA.LilleyK. S.LundbergE. (2026). Subcellular localization as a driver of protein function. Nat. Rev. Mol. Cell Biol.27, 493–510. 10.1038/s41580-026-00947-3
23
SinghN.BhallaN. (2020). Moonlighting proteins. Annu. Rev. Genet.54, 265–285. 10.1146/annurev-genet-030620-102906
24
The Gene Ontology Consortium (2021). The Gene Ontology resource: enriching a GOld mine. Nucleic Acids Res.49, D325–D334. 10.1093/nar/gkaa1113
25
YoungsN.Penfold-BrownD.DrewK.ShashaD.BonneauR. (2013). Parametric Bayesian priors and better choice of negative examples improve protein function prediction. Bioinformatics29, 1190–1198. 10.1093/bioinformatics/btt110
26
YoungsN.Penfold-BrownD.BonneauR.ShashaD. (2014). Negative example selection for protein function prediction: the NoGO database. PLoS Comput. Biol.10, e1003644. 10.1371/journal.pcbi.1003644
27
Zhapa-CamachoF.TangZ.KulmanovM.HoehndorfR. (2024). Predicting protein functions using positive-unlabeled ranking with ontology-based priors. Bioinformatics40, i401–i409. 10.1093/bioinformatics/btae237
Summary
Keywords
calibration, homology bias, open-world learning, protein function prediction, protein language models, trustworthy AI, uncertainty
Citation
Ledesma-Dominguez L, Carbajal-Degante E, Perez-Rueda E and Cortes-Espinosa R (2026) Epistemic blind spots in protein function prediction: uncertainty, homology bias and failure modes in deep learning models. Front. Bioinform. 6:2010708. doi: 10.3389/fbinf.2026.2010708
Received
26 September 2026
Revised
20 October 2026
Accepted
28 October 2026
Published
20 November 2026
Volume
6 - 2026
Edited by
Rita Casadio, University of Bologna, Italy
Reviewed by
Yiquan Wang, Shenzhen Bay Laboratory, China
Updates
Copyright
© 2026 Ledesma-Dominguez, Carbajal-Degante, Perez-Rueda and Cortes-Espinosa.
This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
*Correspondence: Leonardo Ledesma-Dominguez, leonardo.ledesma@tec.mx
Disclaimer
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.