Package: BiRewire
Version: 2.2.3
Date: 2015-07-09
Title: High-performing routines for the randomization of a bipartite
        graph (or a binary event matrix) and directed signed graph
        preserving degree distribution (or marginal totals).
Maintainer: Andrea Gobbi <gobbi.andrea@mail.com>
Description: Fast functions for bipartite network rewiring through N
        consecutive switching steps (See References) and for the
        computation of the minimal number of switching steps to be
        performed in order to maximise the dissimilarity with respect
        to the original network. Includes function for the analysis of
        the introduced randomness across the switching and several
        other routines to analyse the resulting networks and their
        natural projections. 
	Extension to undirected networks (not bipartite) is also provided. 
        Starting from version 1.9.7 a more precise bound (especially for small network) 
	has been implemented. Starting from version 2.2.0 the analysis routine is more 
	useful and a visual montioring of the underlying Markov Chain has been implemented.
License: GPL-3
Depends: igraph, slam, tsne
Suggests: RUnit, BiocGenerics
Author: Andrea Gobbi [aut], Davide Albanese [cbt], Francesco Iorio
        [cbt], Giuseppe Jurman [cbt], Julio Saez-Rodriguez [cbt] .
URL: http://www.ebi.ac.uk/~iorio/BiRewire
biocViews: Network
NeedsCompilation: yes
Packaged: 2015-07-19 04:26:27 UTC; biocbuild
Built: R 3.2.1; i386-w64-mingw32; 2015-07-19 06:38:40 UTC; windows
Archs: i386, x64
