BOL

github.com - GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.  

github.com - Implementation of the Pairwise Sequentially Markovian Coalescent (PSMC) model

PhD opportunity at Université de Liège - Belgium The Bioinformatics and Systems Biology Unit of Université de Liège (Belgium) is looking for a highly motivated master student with programming skills for a PhD thesis project (4 years, fully...

142.150.188.236 - NAViGaTOR – Network Analysis, Visualization, & Graphing TORonto is a software system for scaleable visualizing and analyzing networks. The current version, NAViGaTOR 3, increases modularity, improves scaleability, extends input/output...

github.com - This tool is used to merge structural variants (SVs) across samples. Each sample has a number of SV calls, consisting of position information (chromosome, start, end, length), type and strand information, and a number of other values. Jasmine...

lce.biohpc.swmed.edu - GeNeCK (Gene Network Construction Kit) is a comprehensive online tool kit that integrate various statistical methods to construct gene networks based on gene expression data and optional hub gene information. It efficiently constructs gene...

github.com - netGO is an R/Shiny package for network-integrated pathway enrichment analysis.netGO provides user-interactive visualization of enrichment analysis results and related networks. Currently, netGO supports analysis for four species...

github.com - Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an Excel template or KronaTools, which includes support for several bioinformatics tools and raw data formats. The interactive...

github.com - Reference free SNP search for comparative population genomics: multiple samples run simultanously. **experimental phase, compiles and runs with OpenMPI-1.8.8 with Intel Compiler only Cycles enumeration (aka Bubbles) as part of de novo de bruijn...

In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". String graphs were first proposed by E. W. Myers in a 2005 publication.