In standard machine learning, we assume that training and testing datasets are independent and identically distributed (i.i.d.). However, biology fundamentally violates this assumption due to evolution. Because organisms share common ancestors, biological sequences—whether DNA, RNA, or proteins—frequently cluster into highly conserved families.
If a machine learning model is trained on raw sequence data scraped directly from public repositories, it will inevitably be dominated by a few massive, heavily studied sequence families. This creates an evolutionary trap: the model does not need to learn the underlying biophysical, chemical, or structural rules governing a biological function. Instead, it can achieve deceptively high accuracy simply by memorizing specific sequence fragments or over-represented evolutionary motifs.
To build models that truly understand biology, researchers use sequence identity filtering (also known as homology-based redundancy reduction). By systematically removing near-duplicate sequences before training, this technique forces models to generalize rather than memorize.
The Intuition: Denying the Shortcut
Imagine trying to teach a model to recognize the general concept of an "antioxidant protein," but 80% of your positive training examples are closely related variants of a single well-studied enzyme family. The model will quickly discover a shortcut: instead of learning the complex physicochemical properties that neutralize reactive oxygen species, it can simply look for the exact amino acid sub-sequences unique to that one family.
When evaluated on a naive test set that contains other members of that same family, the model will appear highly accurate. But when presented with a completely novel, non-homologous antioxidant protein, it will fail entirely.
Sequence identity filtering removes this shortcut. By setting a strict similarity threshold, any sequence that is too close to an existing entry is discarded or grouped into a single representative cluster. This process alters the optimization landscape:
Naive Dataset:
[Family A1] [Family A2] [Family A3] [Family A4] [Family B1]
Shortcut available: Memorize the "Family A" signature.
Filtered Dataset (e.g., <40% identity):
[Family A1] [Family B1] [Family C1] [Family D1]
Shortcut denied: Model must learn universal biophysical features.
By enforcing a low residue overlap, the learning algorithm is forced to identify broader structural, chemical, or geometric signatures common to a functional class.
Setting the Threshold: Granularity vs. Diversity
The strictness of the filter depends heavily on the specific biological task. Researchers must balance the need to eliminate evolutionary bias with the need to retain enough data for effective training.
Strict Filtering for Functional Generalization
When predicting broad functional classes or genes, researchers often use highly stringent thresholds (typically between 30% and 40% pairwise identity). At this level, direct sequence matching becomes nearly impossible, forcing the model to rely on higher-level patterns.
- Ion Channels: Han et al. applied a strict 40% similarity threshold in Predicting Ion Channels Genes and Their Types With Machine Learning Techniques to ensure their model identified broad chemical signatures common to functional classes rather than memorizing homologous proteins.
- Micro-Indels: In DDIG-in: discriminating between disease-associated and neutral non-frameshifting micro-indels, Zhao et al. curated non-redundant datasets by removing sequences sharing more than 35% identity, eliminating potential family-specific biases in genetic variant interpretation.
- Transcription Regulators: Zou et al. utilized alignment-based clustering in Pretata: predicting TATA binding proteins with novel features and dimensionality reduction strategy to filter out highly similar instances, ensuring that evaluation metrics reflected true generalization to distinct biological sequences.
Permissive Filtering for Structural Diversity
For tasks focused on structural mapping or broad domain definitions, higher thresholds (such as 95% identity) are used. Here, the goal is not to eliminate all homology, but rather to strip away exact duplicates and over-represented identical sequences that would statistically skew the dataset.
- Domain Classification: In Comparative mapping of sequence-based and structure-based protein domains, Zhang et al. filtered protein sequences to less than 95% identity. This step prevented the over-representation of highly similar sequences while preserving the structural diversity needed to compare classification systems.
Preventing Data Leakage in Benchmarks
Beyond training, sequence identity filtering is critical for rigorous evaluation. If a benchmark dataset contains redundant sequences, a model can achieve inflated performance metrics through data leakage—where information from the training set effectively leaks into the test set via highly similar homologous pairs.
The danger of naive benchmarks was clearly demonstrated by ELM-Manzalawy et al. in On Evaluating MHC-II Binding Peptide Prediction Methods. The authors showed that many top-performing MHC-II prediction algorithms failed to generalize when evaluated on similarity-reduced datasets, exposing the fact that their apparent high performance was an artifact of residual sequence redundancy.
To prevent this, modern biological predictors build independent test sets using strict sequence-identity boundaries. For example, in SIMLIN: a bioinformatics tool for prediction of S-sulphenylation in the human proteome based on multi-stage ensemble-learning models, Wang et al. filtered their benchmark dataset using a specified identity threshold before splitting it into training and independent test sets, ensuring an un-biased evaluation of their ensemble model.
A Universal Prerequisite Across Biological Domains
Whether working with support vector machines, random forests, or deep neural networks, homology filtering serves as a universal preprocessing step across diverse biological prediction tasks:
- Peptide Binding: In Prediction of MHC class I binding peptides, using SVMHC, Dönnes cleaned training datasets by ensuring low residue overlap between examples, preventing the predictive model from overfitting to specific sequence clusters.
- Druggability Prediction: Rehman et al. utilized sequence identity filtering in ELM-APDPs: An Explainable Ensemble Learning Method for Accurate Prediction of Druggable Proteins to ensure their ensemble model learned generalizable structural and chemical patterns rather than memorizing specific training examples.
- Binding Site Identification: In predicting which specific residues touch other molecules, both Yan et al. (Predicting DNA-binding sites of proteins from amino acid sequence) and Terribilini et al. (Prediction of RNA binding sites in proteins from amino acid sequence) filtered their datasets to include only non-redundant sequences with low pairwise similarity, forcing their classifiers to rely on local biophysical environments rather than evolutionary relationships.
- Subcellular Localization: When mapping the cellular destinations of proteins and RNAs, Guo et al. (Human Protein Subcellular Localization with Integrated Source and Multi-label Ensemble Classifier) and Wang et al. (Identify RNA-associated subcellular localizations based on multi-label learning using Chou’s 5-steps rule) leveraged similarity reduction to expand category coverage while preventing performance inflation.
By stripping away the evolutionary redundancy inherent to biological data, sequence identity filtering transforms machine learning models from simple lookup tables into tools capable of genuine biological discovery.
Key Foundational Work
Prediction of MHC class I binding peptides, using SVMHC (2002) — contributed 2 concept elements to this direction.
Comparative mapping of sequence-based and structure-based protein domains (2005) — contributed 1 concept elements to this direction.
Development and production of an oligonucleotide MuscleChip: use for validation of ambiguous ESTs (2002) — contributed 1 concept elements to this direction.