RPatternJoin: String Similarity Joins for Hamming and Levenshtein Distances (original) (raw)
This project is a tool for words edit similarity joins (a.k.a. all-pairs similarity search) under small (< 3) edit distance constraints. It works for Levenshtein/Hamming distances and words from any alphabet. The software was originally developed for joining amino-acid/nucleotide sequences from Adaptive Immune Repertoires, where the number of words is relatively large (10^5-10^6) and the average length of words is relatively small (10-100).
| Version: | 1.0.0 |
|---|---|
| Imports: | Rcpp (≥ 1.0.13), stats |
| LinkingTo: | Rcpp, RcppArmadillo |
| Suggests: | Matrix, testthat, stringdist |
| Published: | 2024-10-25 |
| DOI: | 10.32614/CRAN.package.RPatternJoin |
| Author: | Daniil Matveev [aut, cre], Martin Leitner-Ankerl [ctb, cph], Gene Harvey [ctb, cph] |
| Maintainer: | Daniil Matveev |
| License: | MIT + file |
| NeedsCompilation: | yes |
| Language: | en-US |
| Materials: | NEWS |
| CRAN checks: | RPatternJoin results |
Documentation:
Downloads:
Linking:
Please use the canonical formhttps://CRAN.R-project.org/package=RPatternJointo link to this page.