Previous topic

bioa.DecliquedAmpliconReadGraph.split_fork

Next topic

bioa.DecliquedAmpliconReadGraph.read_frequency_correlation

This Page

bioa.DecliquedAmpliconReadGraph.split_edge

DecliquedAmpliconReadGraph.split_edge(fork, left, right, minmax)

Split a fork as well as the left and right nodes into new nodes with the given minmax. The original nodes will have their counts reduced

Parameters :

fork : Vertex

Fork vertex in the graph.

left : Vertex

Read that is an immediate predecessor of the fork.

right : Vertex

Read that is an immediate successor of the fork.

minmax : float/int

Frequency/count to assign over new edge.

Returns :

double_edge : Tuple

(NewLeft, NewFork, NewRight) tuple that was just added.