同源(生物学)
计算生物学
计算机科学
分拆(数论)
持久同源性
序列同源性
序列分析
序列(生物学)
生物
算法
数学
DNA
基序列
遗传学
组合数学
基因
作者
Felix Teufel,Magnús Halldór Gíslason,José Juan Almagro Armenteros,Alexander Rosenberg Johansen,Ole Winther,Henrik Nielsen
标识
DOI:10.1093/nargab/lqad088
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI