雅卡索引
计算机科学
相似性(几何)
序列(生物学)
计算
代表(政治)
理论计算机科学
数据挖掘
人工智能
作者
Vincenzo Bonnici,Andrea Cracco,Giuditta Franco
标识
DOI:10.1007/978-3-030-95470-3_3
摘要
In this work we propose an approach to improve the performance of a current methodology, computing k-mer based sequence similarity via Jaccard index, for pangenomic analyses. Recent studies have shown a good performance of such a measure for retrieving homology among genetic sequences belonging to a group of genomes.Our improvement is obtained by exploiting a suitable k-mer representation, which enables a fast and memory-cheap computation of sequence similarity. Experimental results on genomes of living organisms of different species give an evidence that a state of the art methodology is here improved, in terms of running time and memory requirements.
科研通智能强力驱动
Strongly Powered by AbleSci AI