Package: RPatternJoin
Type: Package
Title: String Similarity Joins for Hamming and Levenshtein Distances
Version: 1.0.0
Date: 2024-10-11
Authors@R: c(
    person(given = "Daniil",
           family = "Matveev",
           role = c("aut", "cre"),
           email = "dmatveev@sfsu.edu"),
    person(given = "Martin",
           family = "Leitner-Ankerl",
           role = c("ctb", "cph"),
           email = "martin.ankerl@gmail.com"),
    person(given = "Gene",
           family = "Harvey",
           role = c("ctb", "cph"),
           email = "gharveymn@gmail.com"))
Description: 
  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).
License: MIT + file LICENSE
Suggests: Matrix, testthat, stringdist
Imports: Rcpp (>= 1.0.13), stats
LinkingTo: Rcpp, RcppArmadillo
RoxygenNote: 7.3.2
Language: en-US
NeedsCompilation: yes
Packaged: 2024-10-22 17:11:41 UTC; daniil
Author: Daniil Matveev [aut, cre],
  Martin Leitner-Ankerl [ctb, cph],
  Gene Harvey [ctb, cph]
Maintainer: Daniil Matveev <dmatveev@sfsu.edu>
Repository: CRAN
Date/Publication: 2024-10-25 07:30:10 UTC
Built: R 4.6.0; x86_64-apple-darwin20; 2026-04-27 02:17:12 UTC; unix
Archs: RPatternJoin.so.dSYM
