and generates phylogenetic trees annotated with the taxonomies of the predicted

Description: Identifies potential target sequences for a given
set of primers and generates phylogenetic trees annotated with the
taxonomies of the predicted amplification products.
Depends: R (>= 3.5.0), directlabels, gridExtra
Imports: ape, foreach, ggplot2, grid, httr, lubridate, plyr, reshape2,
Packaged: 2022-04-04 23:28:09 UTC; MattDellLaptop

Title: Generate and Test for Prime Numbers
Description: Functions to test whether a number is prime and generate the prime numbers within a specified range. Based around
an implementation of Wilson's theorem for testing for an integer's primality.
Packaged: 2015-06-22 17:05:25 UTC; ironholds

person("Os", "Keyes", email = "ironholds@gmail.com", role = c("aut", "cre")),
person("Paul", "Egeler", email = "paulegeler@gmail.com", role = c("aut"))
Description: Functions for dealing with prime numbers, such as testing whether a
number is prime and generating a sequence prime numbers.
Packaged: 2020-07-26 17:19:53 UTC; ironholds

person("Paul", "Egeler", email = "paulegeler@gmail.com", role = c("aut"), comment = c(ORCID = "0000-0001-6948-9498"))
number is prime and generating a sequence prime numbers. Additional functions
include finding prime factors and Ruth-Aaron pairs, finding next and previous
prime numbers in the series, finding or estimating the nth prime, estimating
the number of primes less than or equal to an arbitrary number, computing
primorials, and prime k-tuples (e.g., twin primes).
Packaged: 2020-07-28 19:00:04 UTC; ironholds

Description: Fast functions for dealing with prime numbers, such as testing
whether a number is prime and generating a sequence prime numbers.
Additional functions include finding prime factors and Ruth-Aaron pairs,
finding next and previous prime numbers in the series, finding or estimating
the nth prime, estimating the number of primes less than or equal to an
arbitrary number, computing primorials, prime k-tuples (e.g., twin primes),
finding the greatest common divisor and smallest (least) common multiple,
testing whether two numbers are coprime, and computing Euler's totient
function. Most functions are vectorized for speed and convenience.
Packaged: 2020-09-02 15:28:23 UTC; ironholds