GFA Kaleidos

	Digraph	BidirectedGraph	BiedgedGraph
GFA

File size
The number of segments
The number of links
The number of paths
The number of single direction segment
The number of bidirectional direction segment
Growth

The number of vertices
Vertex size			/
Total length			/
N50
L50
U50
Degree distribution
The number of dead ends
The number of start ends
Coverage			/
The number of edges
The number of loops
Loop length
The number of cycles
Minimum weight cycle
Cycle distribution		/	/
The number of cuts
The number of connected components
The number of weak connected components
The number of strongly connected components
The number of supperbubbles $A subgraph between a source node $s$ and a sink node $t$ is defined as a superbubble (Onodera et al., 2013) if and only if this subgraph is directed, acyclic and the set of nodes reachable from the source $s$ is the same set of nodes from where $t$ can be reached. Moreover, no other node in the superbubble should satisfy these conditions with either $s$ or $t$.$
The number of simplebubbles
Nested bubbles level	/		/
Bubble chains distribution	/		/
Sequence coverage of chains
Node coverage of chains
Longest chain seq wise
Longest chain bubble wise

MENU