paper-with-me

Papers

Clustering pipeline for determining consensus sequences in targeted next-generation sequencing

2016-02-13

Analyses of targeted genomic sequencing data from next-generation-sequencing (NGS) technologies typically involves mapping reads to a reference sequence or clustering reads. For a number of species a reference genome is not available so the analyses of targeted sequencing data, for example polymorphic structural variation caused by mobile elements is difficult; clustering methods are preferred for such data analysis. Clustering of reads requires a clustering threshold parameter, which is used to compare and group reads. However, determining the optimal clustering threshold for a read dataset is challenging because of different sequence composition, the number of sequences present, and also the amount of sequencing errors in the dataset. High values of the clustering threshold parameter can falsely inflate the number of recovered genomic regions, while low values of clustering threshold can merge reads from distinct regions into a single cluster. Thus, an algorithm that can empirically determine clustering threshold is needed. We propose a pipeline for clustering genomic sequences wherein the clustering threshold is empirically determined from the NGS data. The optimal threshold is decided based on two internal clustering measures which assess clusters for small intra-cluster diameters and large inter-cluster distances. We evaluate the pipeline on two simulated datasets derived from human genome sequence simulating different genomic regions and sequencing depth. The total number of clusters obtained from our pipeline is closer to the actual number of reference sequences when compared to single round of clustering. Also, the number of clusters whose consensus sequence matches a corresponding reference sequence is higher in our pipeline. We observe that the presence of repeat regions affects clustering accuracy.

📄 PDF Abstract BibTeX arXiv:1410.1608

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

A Flexible Iterative Framework for Consensus Clustering

2014-08-05 · Shaina Race, Carl Meyer

A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensem…

ClusteringDimensionality Reduction

Parameter-Free Clustering via Self-Supervised Consensus Maximization (Extended Version)

2025-11-12 · Lijun Zhang, Suyuan Liu, Siwei Wang, Shengju Yu 외 arxiv

Clustering is a fundamental task in unsupervised learning, but most existing methods heavily rely on hyperparameters such as the number of clusters or other sensitive settings, limiting their applicability in real-world …

Self-Supervised Learning

Determining the Number of Clusters via Iterative Consensus Clustering

2014-08-05 · Shaina Race, Carl Meyer, Kevin Valakuzhy

We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced…

Clustering

Consensus Clustering of Free-Viewing Gaze Data: New Insights into Human-Information Interaction

2026-06-29 · Beryl Gnanaraj, Jaya Sreevalsan-Nair, Saqib Alam Ansari, Maanasa Rajaraman arxiv

Free-viewing gaze data provides a rich, task-free window into human visual attention. Conventional exploratory data analysis of the data provides user attention patterns through fixations and areas of interest. However, …

Feature EngineeringEnsemble Learning

Weighted Clustering Ensemble: A Review

2019-10-06 · Mimi Zhang

Clustering ensemble, or consensus clustering, has emerged as a powerful tool for improving both the robustness and the stability of results from individual clustering methods. Weighted clustering ensemble arises naturall…

ClusteringClustering Ensemble