GraphPart: homology partitioning for biological sequence analysis

34Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

When splitting biological sequence data for the development and testing of predictive models, it is necessary to avoid too-closely related pairs of sequences ending up in different partitions. If this is ignored, performance of prediction methods will tend to be overestimated. Several algorithms have been proposed for homology reduction, where sequences are removed until no too-closely related pairs remain. We present GraphPart, an algorithm for homology partitioning that divides the data such that closely related sequences always end up in the same partition, while keeping as many sequences as possible in the dataset. Evaluation of GraphPart on Protein, DNA and RNA datasets shows that it is capable of retaining a larger number of sequences per dataset, while providing homology separation on a par with reduction approaches.

Cite

CITATION STYLE

APA

Teufel, F., Gíslason, M. H., Almagro Armenteros, J. J., Johansen, A. R., Winther, O., & Nielsen, H. (2023). GraphPart: homology partitioning for biological sequence analysis. NAR Genomics and Bioinformatics, 5(4). https://doi.org/10.1093/nargab/lqad088

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free