Packaged: 2020-09-18 16:46:43 UTC; loktingyuen

Title: Bayesian Nonparametric Modeling in R
Description: Germline and somatic locus data which contain the total read depth and B allele
read depth using Bayesian model (Dirichlet Process) to cluster. Meanwhile, the cluster
model can deal with the SNVs mutation and the CNAs mutation.
Depends: lpSolve, mcclust, moments, DNAcopy, stats, R (>= 2.10)
Packaged: 2016-11-11 17:13:34 UTC; Administrator

Title: Frequent Contiguous Sequential Pattern Mining of Text
Description: Mines contiguous sequential patterns in text.
Packaged: 2017-03-19 20:08:03 UTC; anantharamanjanakiraman

Title: Interactive Application for Working with Contingency Tables
Description: An interactive application for working with contingency Tables. The application has a template for solving contingency table problems like chisquare test of independence,association plot between two categorical variables. Runtime examples are provided in the package function as well as at  <https://jarvisatharva.shinyapps.io/CategoricalDataAnalysis/>.
Packaged: 2019-04-12 08:47:04 UTC; KARTIKEYA

Title: A Method for 'Connecting The Dots' in Weighted Graphs
Authors@R: person("Lillian", "Thistlethwaite", email="lillian.thistlethwaite@bcm.edu", role=c("aut", "cre"))
Description: A method for pattern discovery in weighted graphs. Two use cases are achieved: 1) Given a weighted graph and a subset of its nodes, do the nodes show significant connectedness? 2) Given a weighted graph and two subsets of its nodes, are the subsets close neighbors or distant?
Depends: R (>= 4.0), gmp, igraph, stats, grDevices, graphics
Suggests: knitr, rmarkdown, huge, ggplot2, gplots, RColorBrewer,
Packaged: 2020-10-08 18:52:06 UTC; lillian.rosa
Author: Lillian Thistlethwaite [aut, cre]

Authors@R: person("Lillian", "Thistlethwaite", email="lillian.thistlethwaite@gmail.com", role=c("aut", "cre"))
Description: A method for pattern discovery in weighted graphs as outlined in Thistlethwaite et al. (2021) <doi:10.1371/journal.pcbi.1008550>. Two use cases are achieved: 1) Given a weighted graph and a subset of its nodes, do the nodes show significant connectedness? 2) Given a weighted graph and two subsets of its nodes, are the subsets close neighbors or distant?
Packaged: 2021-03-09 01:38:28 UTC; lillian.rosa