Fast, optimal, and reproducible clustering algorithms for circular, periodic, or framed data. The algorithms introduced here are based on a core algorithm for optimal framed clustering the authors have developed (Debnath & Song 2021) <doi:10.1109/TCBB.2021.3077573>. The runtime of these algorithms is O(K N log^2 N), where K is the number of clusters and N is the number of circular data points. On a desktop computer using a single processor core, millions of data points can be grouped into a few clusters within seconds. One can apply the algorithms to characterize events along circular DNA molecules, circular RNA molecules, and circular genomes of bacteria, chloroplast, and mitochondria. One can also cluster climate data along any given longitude or latitude. Periodic data clustering can be formulated as circular clustering. The algorithms offer a general high-performance solution to circular, periodic, or framed data clustering.
Version: 0.0.4 Imports: Ckmeans.1d.dp, graphics, plotrix, Rcpp, Rdpack, stats, reshape2 LinkingTo: Rcpp Suggests: ape, ggplot2, knitr, rmarkdown, testthat Published: 2021-07-28 DOI: 10.32614/CRAN.package.OptCirClust Author: Tathagata Debnath [aut], Joe Song [aut, cre] Maintainer: Joe Song <joemsong at cs.nmsu.edu> License: LGPL (≥ 3) NeedsCompilation: yes Citation: OptCirClust citation info Materials: README NEWS In views: Omics CRAN checks: OptCirClust results Documentation: Downloads: Reverse dependencies: Linking:Please use the canonical form https://CRAN.R-project.org/package=OptCirClust to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4