Abstract
Motivation Clustering is a fundamental task in the analysis of nucleotide sequences. Despite the exponential increase in the size of sequence databases of homologous genes, few methods exist to cluster divergent sequences. Traditional clustering methods have mostly focused on optimizing high speed clustering of highly similar sequences. We develop a phylogenetic clustering method which infers ancestral sequences for a set of initial clusters and then uses a greedy algorithm to cluster sequences.
Results We describe a clustering program AncestralClust, which is developed for clustering divergent sequences. We compare this method with other state-of-the-art clustering methods using datasets of homologous sequences from different species. We show that, in divergent datasets, AncestralClust has higher accuracy and more even cluster sizes than current popular methods.
Availability and implementation AncestralClust is an Open Source program available at https://github.com/lpipes/ancestralclust
Contact lpipes{at}berkeley.edu
Supplementary information Supplementary figures and table are available online.
Competing Interest Statement
The authors have declared no competing interest.
Footnotes
