Fast K-Mer Counting and Clustering for Biological Sequence Analysis
Released May 20, 2019 by Shaun Wilkinson
Contains tools for rapidly computing distance matrices and clustering large sequence datasets using fast alignment-free k-mer counting and recursive k-means partitioning. See Vinga and Almeida (2003)
This package can be included as a dependency from a Java or Scala project by including
the following your project's
about embedding Renjin in JVM-based projects.
<dependencies> <dependency> <groupId>org.renjin.cran</groupId> <artifactId>kmer</artifactId> <version>1.1.2-b1</version> </dependency> </dependencies> <repositories> <repository> <id>bedatadriven</id> <name>bedatadriven public repo</name> <url>https://nexus.bedatadriven.com/content/groups/public/</url> </repository> </repositories>
If you're using Renjin from the command line, you load this library by invoking:
This package was last tested against Renjin 0.9.2726 on Jul 13, 2019.