Description: Using HTS data, clusters mutations in order to recreate putative clones from the data provided. It requires genotype at the location of the variant as well as the depth of coverage and number of reads supporting the mutation. Additional information may be provided, such as the contamination in the tumor sample. This package also provides a function QuantumCat() which simulates data obtained from tumor sequencing.
Depends: R (>= 3.1.0), fpc,doSNOW,parallel,foreach,

Depends: R (>= 3.1.0), compiler, foreach
Imports: doParallel, parallel, gridExtra, ggplot2, NbClust, DEoptim,

Title: Performs Common Linear Algebra Operations Used in Quantum
Description: Contains basic structures and operations used frequently in quantum
computing. Intended to be a convenient tool to help in practicing the linear
algebra involved in quantum operations. Has functionality for the creation of
kets, bras, matrices and implements quantum gates, inner products, and tensor

algebra involved in quantum operations. Has functionality for the creation of arbitrarily sized
products. Can convert functions into equivalent quantum gates.

Description: Contains basic structures and operations used frequently in quantum computing. Intended to be a convenient tool to help in practicing the linear algebra involved in quantum operations. Has functionality for the creation of arbitrarily sized kets, bras, matrices and implements quantum gates, inner products, and tensor products. Contains all commonly used quantum gates and the Quantum Fourier Transform developed by Shor (1999). Implements modular arithmetic commonly found in quantum algorithms and can convert functions into equivalent quantum gates.

Description: Contains basic structures and operations used frequently in quantum computing. Intended to be a convenient tool to help in practicing the linear algebra involved in quantum operations. Has functionality for the creation of arbitrarily sized kets, bras, matrices and implements quantum gates, inner products, and tensor products. Contains all commonly used quantum gates and can simulate complete or partial measurements of kets. Can simulate the Quantum Fourier Transform developed by Shor (1999) and implements Shor's algorithm, factoring numbers up to 21. Implements modular arithmetic commonly found in quantum algorithms and can convert functions into equivalent quantum gates.