线性归一化哈希函数用于基因序列聚类和从多个序列比对中识别参考序列。

Manal Helal, Fanrong Kong, Sharon Ca Chen, Fei Zhou, Dominic E Dwyer, John Potter, Vitali Sintchenko
{"title":"线性归一化哈希函数用于基因序列聚类和从多个序列比对中识别参考序列。","authors":"Manal Helal,&nbsp;Fanrong Kong,&nbsp;Sharon Ca Chen,&nbsp;Fei Zhou,&nbsp;Dominic E Dwyer,&nbsp;John Potter,&nbsp;Vitali Sintchenko","doi":"10.1186/2042-5783-2-2","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>Comparative genomics has put additional demands on the assessment of similarity between sequences and their clustering as means for classification. However, defining the optimal number of clusters, cluster density and boundaries for sets of potentially related sequences of genes with variable degrees of polymorphism remains a significant challenge. The aim of this study was to develop a method that would identify the cluster centroids and the optimal number of clusters for a given sensitivity level and could work equally well for the different sequence datasets.</p><p><strong>Results: </strong>A novel method that combines the linear mapping hash function and multiple sequence alignment (MSA) was developed. This method takes advantage of the already sorted by similarity sequences from the MSA output, and identifies the optimal number of clusters, clusters cut-offs, and clusters centroids that can represent reference gene vouchers for the different species. The linear mapping hash function can map an already ordered by similarity distance matrix to indices to reveal gaps in the values around which the optimal cut-offs of the different clusters can be identified. The method was evaluated using sets of closely related (16S rRNA gene sequences of Nocardia species) and highly variable (VP1 genomic region of Enterovirus 71) sequences and outperformed existing unsupervised machine learning clustering methods and dimensionality reduction methods. This method does not require prior knowledge of the number of clusters or the distance between clusters, handles clusters of different sizes and shapes, and scales linearly with the dataset.</p><p><strong>Conclusions: </strong>The combination of MSA with the linear mapping hash function is a computationally efficient way of gene sequence clustering and can be a valuable tool for the assessment of similarity, clustering of different microbial genomes, identifying reference sequences, and for the study of evolution of bacteria and viruses.</p>","PeriodicalId":18538,"journal":{"name":"Microbial Informatics and Experimentation","volume":"2 1","pages":"2"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/2042-5783-2-2","citationCount":"2","resultStr":"{\"title\":\"Linear normalised hash function for clustering gene sequences and identifying reference sequences from multiple sequence alignments.\",\"authors\":\"Manal Helal,&nbsp;Fanrong Kong,&nbsp;Sharon Ca Chen,&nbsp;Fei Zhou,&nbsp;Dominic E Dwyer,&nbsp;John Potter,&nbsp;Vitali Sintchenko\",\"doi\":\"10.1186/2042-5783-2-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Background: </strong>Comparative genomics has put additional demands on the assessment of similarity between sequences and their clustering as means for classification. However, defining the optimal number of clusters, cluster density and boundaries for sets of potentially related sequences of genes with variable degrees of polymorphism remains a significant challenge. The aim of this study was to develop a method that would identify the cluster centroids and the optimal number of clusters for a given sensitivity level and could work equally well for the different sequence datasets.</p><p><strong>Results: </strong>A novel method that combines the linear mapping hash function and multiple sequence alignment (MSA) was developed. This method takes advantage of the already sorted by similarity sequences from the MSA output, and identifies the optimal number of clusters, clusters cut-offs, and clusters centroids that can represent reference gene vouchers for the different species. The linear mapping hash function can map an already ordered by similarity distance matrix to indices to reveal gaps in the values around which the optimal cut-offs of the different clusters can be identified. The method was evaluated using sets of closely related (16S rRNA gene sequences of Nocardia species) and highly variable (VP1 genomic region of Enterovirus 71) sequences and outperformed existing unsupervised machine learning clustering methods and dimensionality reduction methods. This method does not require prior knowledge of the number of clusters or the distance between clusters, handles clusters of different sizes and shapes, and scales linearly with the dataset.</p><p><strong>Conclusions: </strong>The combination of MSA with the linear mapping hash function is a computationally efficient way of gene sequence clustering and can be a valuable tool for the assessment of similarity, clustering of different microbial genomes, identifying reference sequences, and for the study of evolution of bacteria and viruses.</p>\",\"PeriodicalId\":18538,\"journal\":{\"name\":\"Microbial Informatics and Experimentation\",\"volume\":\"2 1\",\"pages\":\"2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-01-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1186/2042-5783-2-2\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Microbial Informatics and Experimentation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/2042-5783-2-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Microbial Informatics and Experimentation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/2042-5783-2-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

背景:比较基因组学对序列之间的相似性评估及其聚类作为分类手段提出了额外的要求。然而,定义具有不同程度多态性的潜在相关基因序列集的最佳簇数、簇密度和边界仍然是一个重大挑战。本研究的目的是开发一种方法,该方法可以在给定的灵敏度水平下识别聚类质心和最佳聚类数量,并且可以同样地适用于不同的序列数据集。结果:提出了一种结合线性映射哈希函数和多序列比对(MSA)的新方法。该方法利用MSA输出的相似性序列进行排序,确定了代表不同物种参考基因凭证的最佳簇数、簇截断点和簇质心。线性映射哈希函数可以将已经排序的相似距离矩阵映射到索引,以显示值中的间隙,从而可以识别不同聚类的最佳截止点。该方法利用诺卡菌属的16S rRNA基因序列和肠病毒71的VP1基因组区等密切相关的序列进行评估,优于现有的无监督机器学习聚类方法和降维方法。该方法不需要预先知道簇的数量或簇之间的距离,可以处理不同大小和形状的簇,并与数据集线性扩展。结论:MSA与线性映射哈希函数的结合是一种计算效率高的基因序列聚类方法,可用于不同微生物基因组的相似性评估、聚类、参考序列鉴定以及细菌和病毒进化研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Linear normalised hash function for clustering gene sequences and identifying reference sequences from multiple sequence alignments.

Linear normalised hash function for clustering gene sequences and identifying reference sequences from multiple sequence alignments.

Linear normalised hash function for clustering gene sequences and identifying reference sequences from multiple sequence alignments.

Linear normalised hash function for clustering gene sequences and identifying reference sequences from multiple sequence alignments.

Background: Comparative genomics has put additional demands on the assessment of similarity between sequences and their clustering as means for classification. However, defining the optimal number of clusters, cluster density and boundaries for sets of potentially related sequences of genes with variable degrees of polymorphism remains a significant challenge. The aim of this study was to develop a method that would identify the cluster centroids and the optimal number of clusters for a given sensitivity level and could work equally well for the different sequence datasets.

Results: A novel method that combines the linear mapping hash function and multiple sequence alignment (MSA) was developed. This method takes advantage of the already sorted by similarity sequences from the MSA output, and identifies the optimal number of clusters, clusters cut-offs, and clusters centroids that can represent reference gene vouchers for the different species. The linear mapping hash function can map an already ordered by similarity distance matrix to indices to reveal gaps in the values around which the optimal cut-offs of the different clusters can be identified. The method was evaluated using sets of closely related (16S rRNA gene sequences of Nocardia species) and highly variable (VP1 genomic region of Enterovirus 71) sequences and outperformed existing unsupervised machine learning clustering methods and dimensionality reduction methods. This method does not require prior knowledge of the number of clusters or the distance between clusters, handles clusters of different sizes and shapes, and scales linearly with the dataset.

Conclusions: The combination of MSA with the linear mapping hash function is a computationally efficient way of gene sequence clustering and can be a valuable tool for the assessment of similarity, clustering of different microbial genomes, identifying reference sequences, and for the study of evolution of bacteria and viruses.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信