Man pages for matthiasheinig/QTLnetwork
Basic package to apply random walks for QTL candidate gene priorization
| add.to.graphs | —————— Augment grahs |
| eig.decomp | —————— Get eigenvalue decomposition |
| get_candidate_gene | —————— Get the candidate gene of a locus using... |
| get.nodes.by.type | —————— Get nodes by type |
| graph2sparseMatrix | —————— Convert graph to a sparse matrix |
| hitting.time | —————— Alternative approach to prioritize genes |
| min.node.weight.path | —————— Find the shortest path with minimal node... |
| plot.propagation.network | —————— Convenience function to plot networks |
| prioritization.table | —————— Prioritization summary table |
| prioritze.by.randomwalk | —————— Candidate prioritization by random walk... |
| propagation | —————— Approximate the infinite sum |
