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).
- Version1.0.0
- R versionunknown
- LicenseMIT
- LicenseLICENSE
- Needs compilation?Yes
- Languageen-US
- Last release10/25/2024
Documentation
Team
Daniil Matveev
Martin Leitner-Ankerl
Show author detailsRolesContributor, Copyright holderGene Harvey
Show author detailsRolesContributor, Copyright holder
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports1 package
- Suggests3 packages
- Linking To2 packages