Package: seqtrie
Title: Radix Tree and Trie-Based String Distances
Version: 0.2.5
Date: 2023-8-31
Authors@R: c(
    person("Travers", "Ching", email = "traversc@gmail.com", role = c("aut", "cre", "cph")),
    person("Martin", "Moene", role = c("ctb", "cph"), comment = "span-lite C++ library"),
    person("Hanov", "Steve", role = c("ctb"), comment = "Trie levenshtein implementation in Python")
	)
Description: A collection of Radix Tree and Trie algorithms for finding similar sequences and calculating sequence distances (Levenshtein and other distance metrics). This work was inspired by a trie implementation in Python: "Fast and Easy Levenshtein distance using a Trie." Hanov (2011) <http://stevehanov.ca/blog/index.php?id=114>.
License: GPL-3
Biarch: true
Encoding: UTF-8
Depends: R (>= 3.5.0)
LazyData: true
SystemRequirements: GNU make
LinkingTo: Rcpp, RcppParallel, BH
Imports: Rcpp (>= 0.12.18.3), RcppParallel (>= 5.1.3), R6
Suggests: knitr, rmarkdown, stringdist, stringfish, qs, dplyr,
        Biostrings, igraph, ggplot2
VignetteBuilder: knitr
RoxygenNote: 7.2.3
Copyright: This package includes code from the 'span-lite' library
        owned by Martin Moene under Boost Software License 1.0. This
        package contains data derived from Adaptive Biotechnologies
        "ImmuneCODE" dataset under Creative Commons Attribution 4.0.
URL: https://github.com/traversc/seqtrie
BugReports: https://github.com/traversc/seqtrie/issues
NeedsCompilation: yes
Packaged: 2023-08-31 16:59:08 UTC; tching
Author: Travers Ching [aut, cre, cph],
  Martin Moene [ctb, cph] (span-lite C++ library),
  Hanov Steve [ctb] (Trie levenshtein implementation in Python)
Maintainer: Travers Ching <traversc@gmail.com>
Repository: CRAN
Date/Publication: 2023-09-01 11:00:02 UTC
Built: R 4.2.0; x86_64-apple-darwin17.0; 2023-09-02 11:20:07 UTC; unix
Archs: seqtrie.so.dSYM
