Packaged: 2017-03-27 14:14:58 UTC; sachaepskamp

person("Eren", "Asena", role = c("ctb"))

Title: Quality Control for Graphics in R
Description: The package provides functions to generate
graphics files, compare them with ``model'' files,
Packaged: Mon Dec 15 10:09:30 2008; paul

Author: Stephen Gardiner and Paul Murrell
Packaged: Wed Feb 11 10:15:15 2009; paul

Description: The package provides functions to generate graphics files,
compare them with ``model'' files, and report the results.

and report the results, including visual and textual

graphics files, compare them with "model" files,

Packaged: Tue Dec  9 10:32:29 2008; paul

Title: GRAPH Interaction from pathway Topological Environment
Author: Gabriele Sales <gabriele.sales@unipd.it>, Enrica Calura
Description: Graph objects from pathway topology derived from NCI,

Depends: R (>= 2.10), methods, graph, AnnotationDbi, org.Hs.eg.db
Suggests: DEGraph (>= 1.4), hgu133plus2.db, RCytoscape (>= 1.2), SPIA

Description: A fast C++ implementation of various graph kernels.

Description: A fast C++ implementation for computing various graph kernels including (1) simple kernels between vertex and/or edge label histograms, (2) random walk kernels (popular baselines), and (3) the Weisfeiler-Lehman graph kernel (state-of-the-art).

Description: A fast C++ implementation for computing various graph kernels including (1) simple kernels between vertex and/or edge label histograms, (2) graphlet kernels, (3) random walk kernels (popular baselines), and (4) the Weisfeiler-Lehman graph kernel (state-of-the-art).

person(given = "The development of the graphkernels open access software package was financially supported by the Horizon 2020/CDS-QUAMRI/634541 project. This support is gratefully acknowledged.",
The development of the graphkernels open access software package was
financially supported by the Horizon 2020/CDS-QUAMRI/634541
project. This support is gratefully acknowledged. [fnd]

Title: Additional Layout Algorithms for Network Visualizations
Authors@R: person("David", "Schoch", email = "david.schoch@manchester.ac.uk", role = c("aut", "cre"))
Description: Several new layout algorithms to visualize networks are provided which are not part of 'igraph'.
Most are based on the concept of stress majorization by Gansner et al. (2004) <doi:10.1007/978-3-540-31843-9_25>.
Some more specific algorithms allow to emphasize hidden group structures in networks or focus on specific nodes.
Imports: igraph, Rcpp, oaqc, gbp, scales
Suggests: testthat, ggraph, ggplot2, knitr, rmarkdown