RPatternJoin: String Similarity Joins for Hamming and Levenshtein Distances
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 |
| Author: |
Daniil Matveev [aut, cre],
Martin Leitner-Ankerl [ctb, cph],
Gene Harvey [ctb, cph] |
| Maintainer: |
Daniil Matveev <dmatveev at sfsu.edu> |
| License: |
MIT + file LICENSE |
| NeedsCompilation: |
yes |
| Language: |
en-US |
| Materials: |
NEWS |
| CRAN checks: |
RPatternJoin results |
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=RPatternJoin
to link to this page.