Min-k unsplittable flows method. This tries to find k paths in the graph that cover the reads with minimum amount of flow.
Parameters : | graph : DecliquedAmpliconReadGraph
flow_num : int
nthreads : int, optional default=0
timeout : int, optional default=300
threshold : float, optional default=1e-5
|
---|---|
Returns : | quasispecies : dict
|
Notes
Requires CPLEX and CPLEX Python module to be installed. http://www.cplex.com