String Similarity Joins for Hamming and Levenshtein Distances R package RPatternJoin version 1.0.0 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). Software Imports: Rcpp (>= 1.0.13), stats LinkingTo: Rcpp, RcppArmadillo Suggests: Matrix, testthat, stringdist Daniil Matveev <dmatveev@sfsu.edu> Comprehensive R Archive Network (CRAN) Daniil Matveev [aut, cre], Martin Leitner-Ankerl [ctb, cph], Gene Harvey [ctb, cph] MIT + file LICENSE (https://CRAN.R-project.org/package=RPatternJoin/LICENSE) 2024-10-25 application/tgz https://CRAN.R-project.org/package=RPatternJoin doi:10.32614/CRAN.package.RPatternJoin en-US