import basepair
import modisco
Using TensorFlow backend. Can not use cuDNN on context None: cannot compile with cuDNN. We got this error: b'/usr/bin/ld: cannot find -lcudnn\ncollect2: error: ld returned 1 exit status\n' Mapped name None to device cuda: GeForce GTX TITAN X (0000:09:00.0)
from keras.models import Model, load_model
from basepair.losses import twochannel_multinomial_nll
# Use gpus 3, 5
import os
os.environ["CUDA_VISIBLE_DEVICES"] = "3, 5"
model = load_model("model.h5", custom_objects={"twochannel_multinomial_nll": twochannel_multinomial_nll})
WARNING:tensorflow:From /users/amr1/miniconda3/envs/basepair/lib/python3.6/site-packages/tensorflow/python/util/deprecation.py:497: calling conv1d (from tensorflow.python.ops.nn_ops) with data_format=NHWC is deprecated and will be removed in a future version. Instructions for updating: `NHWC` for data_format is deprecated, use `NWC` instead
2018-08-19 16:37:10,889 [WARNING] From /users/amr1/miniconda3/envs/basepair/lib/python3.6/site-packages/tensorflow/python/util/deprecation.py:497: calling conv1d (from tensorflow.python.ops.nn_ops) with data_format=NHWC is deprecated and will be removed in a future version. Instructions for updating: `NHWC` for data_format is deprecated, use `NWC` instead
WARNING:tensorflow:From /users/amr1/miniconda3/envs/basepair/lib/python3.6/site-packages/tensorflow/contrib/learn/python/learn/datasets/base.py:198: retry (from tensorflow.contrib.learn.python.learn.datasets.base) is deprecated and will be removed in a future version. Instructions for updating: Use the retry module or similar alternatives.
2018-08-19 16:37:19,198 [WARNING] From /users/amr1/miniconda3/envs/basepair/lib/python3.6/site-packages/tensorflow/contrib/learn/python/learn/datasets/base.py:198: retry (from tensorflow.contrib.learn.python.learn.datasets.base) is deprecated and will be removed in a future version. Instructions for updating: Use the retry module or similar alternatives.
from basepair.utils import read_pkl
train,valid,test = read_pkl("/users/avsec/workspace/basepair-workflow/models/0/data.pkl")
from basepair.eval import evaluate
evaluate(model, valid[0], valid[1])
{'loss': 953.9045610385498,
'profile/Oct4_loss': 271.63486264911495,
'profile/Sox2_loss': 162.5192502521077,
'profile/Klf4_loss': 228.8282409395277,
'profile/Nanog_loss': 265.30063137148727,
'counts/Oct4_loss': 0.612707477322428,
'counts/Sox2_loss': 0.5658578240037332,
'counts/Klf4_loss': 0.8421652589296793,
'counts/Nanog_loss': 0.5414273575545541}
task_names = ["profile/Oct4", "profile/Sox2", "profile/Klf4", "profile/Nanog",
"counts/Oct4", "counts/Sox2", "counts/Klf4", "counts/Nanog"]
import keras.backend as K
inp = model.inputs[0]
fn_pos = {}
fn_neg = {}
for task_id, task_name in enumerate(task_names):
if "counts" in task_name:
fn_pos[task_name] = K.function([inp], K.gradients(model.outputs[task_id][:, 0], inp))
fn_neg[task_name] = K.function([inp], K.gradients(model.outputs[task_id][:, 1], inp))
else:
fn_pos[task_name] = K.function([inp], K.gradients(K.sum(K.stop_gradient(K.softmax(
model.outputs[task_id][:, :, 0])) * model.outputs[task_id][:, :, 0], axis=-1), inp))
fn_neg[task_name] = K.function([inp], K.gradients(K.sum(K.stop_gradient(K.softmax(
model.outputs[task_id][:, :, 1])) * model.outputs[task_id][:, :, 1], axis=-1), inp))
import numpy as np
from basepair.data import numpy_minibatch
grads_pos = {}
grads_neg = {}
for task_name in task_names:
grads_pos[task_name] = np.concatenate([np.array(fn_pos[task_name]([batch])).squeeze()
for batch in numpy_minibatch(valid[0], 512)])
grads_neg[task_name] = np.concatenate([np.array(fn_neg[task_name]([batch])).squeeze()
for batch in numpy_minibatch(valid[0], 512)])
2018-08-19 16:37:42,441 [WARNING] git-lfs not installed 2018-08-19 16:37:42,616 [WARNING] git-lfs not installed
# Setup different scores
hyp_scores = {}
scores = {}
for task_name in task_names:
hyp_scores[task_name] = grads_pos[task_name] + grads_neg[task_name]
hyp_scores[task_name] = hyp_scores[task_name] - hyp_scores[task_name].mean(-1, keepdims=True)
scores[task_name] = hyp_scores[task_name] * valid[0]
onehot_data = valid[0]
task_to_scores = scores
task_to_hyp_scores = hyp_scores
import h5py
import modisco
import modisco.util
import modisco.core
import modisco.tfmodisco_workflow.seqlets_to_patterns
from modisco.tfmodisco_workflow import workflow
tfmodisco_results = modisco.tfmodisco_workflow.workflow.TfModiscoWorkflow(
#Slight modifications from the default settings
sliding_window_size=15,
flank_size=5,
target_seqlet_fdr=0.01,
min_seqlets_per_task=1000,
seqlets_to_patterns_factory=
modisco.tfmodisco_workflow.seqlets_to_patterns.TfModiscoSeqletsToPatternsFactory(
trim_to_window_size=15,
initial_flank_to_add=5,
kmer_len=5, num_gaps=1,
num_mismatches=0,
final_min_cluster_size=60)
)(
task_names=task_names,
contrib_scores=task_to_scores,
hypothetical_contribs=task_to_hyp_scores,
one_hot=onehot_data)
On task profile/Oct4 Computing windowed sums Computing threshold peak(mu)= 0.06276555971801281 Mu: 6.276556e-02 +/- 5.909070e-06 Lablace_b: 0.139662450995146 and 0.26768297362318977 Thresholds: -2.282341041997075 and 2.3123230548352005 #fdrs pass: 0 and 52224 CDFs: 0.9999999489901056 and 0.9997759883296964 Est. FDRs: 0.0626664590409689 and 0.009998536975671766
Got 5362 coords On task profile/Sox2 Computing windowed sums Computing threshold peak(mu)= 0.04190081917122006 Mu: 4.190082e-02 +/- 8.923907e-06 Lablace_b: 0.18997234100246468 and 0.38309747398215255 Thresholds: -2.999906593929976 and 3.62982863746956 #fdrs pass: 0 and 20393 CDFs: 0.9999998887897856 and 0.999914378505272 Est. FDRs: 0.13096704643032808 and 0.00999979911681125
Got 2483 coords On task profile/Klf4 Computing windowed sums Computing threshold peak(mu)= 0.044450335949659345 Mu: 4.445034e-02 +/- 5.139410e-06 Lablace_b: 0.129423190632036 and 0.24263794268149524 Thresholds: -1.2058626884354116 and 3.8841040663421156 #fdrs pass: 7907 and 33 CDFs: 0.9999362573568685 and 0.9999998658922182 Est. FDRs: 0.00999604251532824 and 0.009426219409136976
Got 804 coords On task profile/Nanog Computing windowed sums Computing threshold peak(mu)= 0.05894492487795651 Manually adjusting thresholds to get desired num seqlets Mu: 5.894492e-02 +/- 9.355104e-06 Lablace_b: 0.2250517944452598 and 0.6103430685661245 Thresholds: -6.540546671343967 and 6.658436521099881 #fdrs pass: 3 and 87 CDFs: 0.999999999999816 and 0.9999798590903745 Est. FDRs: 0.0015856588303443016 and 0.009948188832590832
Got 240 coords On task counts/Oct4 Computing windowed sums Computing threshold peak(mu)= 0.012566710790619252 Mu: 1.256671e-02 +/- 1.162811e-05 Lablace_b: 0.3693071719980157 and 0.6606773467999582 Thresholds: -4.142623280206696 and 5.241926337560638 #fdrs pass: 0 and 83286 CDFs: 0.9999870097488164 and 0.9996348305182882 Est. FDRs: 1.0 and 0.009999506220365736
Got 7480 coords On task counts/Sox2 Computing windowed sums Computing threshold peak(mu)= 0.012341707596555352 Mu: 1.234171e-02 +/- 1.008116e-05 Lablace_b: 0.3565778686238186 and 0.7367579119032016 Thresholds: -4.614141255965456 and 6.935839861283079 #fdrs pass: 0 and 19954 CDFs: 0.999997681703296 and 0.9999170481150947 Est. FDRs: 1.0 and 0.009999303991058353
Got 2908 coords On task counts/Klf4 Computing windowed sums Computing threshold peak(mu)= 0.10090510392561555 Manually adjusting thresholds to get desired num seqlets Mu: 1.009051e-01 +/- 7.118348e-06 Lablace_b: 0.43305931247688123 and 0.6413692939038103 Thresholds: -4.394236402269453 and 4.596046610120684 #fdrs pass: 0 and 0 CDFs: 0.9999689517250595 and 0.9990959839251266 Est. FDRs: 0.280650626313502 and 1.0
Got 180 coords On task counts/Nanog Computing windowed sums Computing threshold peak(mu)= 0.3062464974075556 Manually adjusting thresholds to get desired num seqlets Mu: 3.062465e-01 +/- 8.409873e-06 Lablace_b: 0.39656970316185786 and 0.9808883116430085 Thresholds: -7.42988374017179 and 8.0423767349869 #fdrs pass: 0 and 0 CDFs: 0.9999999966275215 and 0.9996243532970951 Est. FDRs: 1.0 and 1.0
Got 252 coords
After resolving overlaps, got 9885 seqlets
Across all tasks, the weakest laplace threshold used was: 0.9990959839251266
9885 identified in total
13 activity patterns with support >= 100 out of 6561 possible patterns
Metacluster sizes: [4500, 1107, 791, 501, 454, 400, 386, 224, 218, 206, 196, 154, 114]
Idx to activities: {0: '1,1,0,0,1,1,0,0', 1: '1,0,0,0,1,1,0,0', 2: '1,0,0,0,1,0,0,0', 3: '1,1,0,0,1,1,0,1', 4: '-1,-1,-1,0,0,0,0,0', 5: '1,1,1,1,0,1,0,1', 6: '1,0,0,0,1,0,-1,0', 7: '1,1,0,1,1,1,0,0', 8: '0,1,0,0,1,1,0,1', 9: '0,1,0,0,0,1,0,1', 10: '0,0,-1,0,0,0,0,0', 11: '0,1,0,0,0,1,0,0', 12: '-1,0,-1,0,0,0,0,0'}
On metacluster 12
Metacluster size 114
Relevant tasks: ('profile/Oct4', 'profile/Klf4')
Relevant signs: (-1, -1)
(Round 1) num seqlets: 114
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.03 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.0 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 9.36 s
Launching nearest neighbors affmat calculation job
Job completed in: 0.44 s
(Round 1) Computed affinity matrix on nearest neighbors in 9.87 s
Filtered down to 102 of 114
(Round 1) Retained 102 rows out of 114 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 102 samples in 0.000s...
[t-SNE] Computed neighbors for 102 samples in 0.001s...
[t-SNE] Computed conditional probabilities for sample 102 / 102
[t-SNE] Mean sigma: 0.234632
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.02069568634033203 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.807751178741455 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.5s finished
Wrote graph to binary file in 0.032328128814697266 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.661101
Louvain completed 51 runs in 20.242775201797485 seconds
Preproc + Louvain took 22.12609601020813 s
Got 8 clusters after round 1
Counts:
{0: 26, 2: 18, 4: 7, 3: 18, 5: 5, 1: 20, 6: 5, 7: 3}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 26 seqlets
Trimmed 0 out of 26
Aggregating for cluster 1 with 20 seqlets
Trimmed 1 out of 20
Aggregating for cluster 2 with 18 seqlets
Trimmed 2 out of 18
Aggregating for cluster 3 with 18 seqlets
Trimmed 1 out of 18
Aggregating for cluster 4 with 7 seqlets
Trimmed 0 out of 7
Aggregating for cluster 5 with 5 seqlets
Trimmed 0 out of 5
Aggregating for cluster 6 with 5 seqlets
Trimmed 0 out of 5
Aggregating for cluster 7 with 3 seqlets
Trimmed 0 out of 3
(Round 2) num seqlets: 98
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.03 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.0 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 0.42 s
Launching nearest neighbors affmat calculation job
Job completed in: 0.34 s
(Round 2) Computed affinity matrix on nearest neighbors in 0.82 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 98 samples in 0.000s...
[t-SNE] Computed neighbors for 98 samples in 0.003s...
[t-SNE] Computed conditional probabilities for sample 98 / 98
[t-SNE] Mean sigma: 0.232228
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.026926040649414062 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.8479487895965576 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.5s finished
Wrote graph to binary file in 0.0321803092956543 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.501217
After 6 runs, maximum modularity is Q = 0.501486
Louvain completed 56 runs in 22.44956660270691 seconds
Preproc + Louvain took 24.380282640457153 s
Got 8 clusters after round 2
Counts:
{1: 33, 0: 38, 7: 2, 3: 6, 2: 9, 4: 4, 6: 3, 5: 3}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 38 seqlets
Trimmed 6 out of 38
Aggregating for cluster 1 with 33 seqlets
Trimmed 2 out of 33
Aggregating for cluster 2 with 9 seqlets
Trimmed 1 out of 9
Aggregating for cluster 3 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 4 with 4 seqlets
Trimmed 0 out of 4
Aggregating for cluster 5 with 3 seqlets
Trimmed 0 out of 3
Aggregating for cluster 6 with 3 seqlets
Trimmed 0 out of 3
Aggregating for cluster 7 with 2 seqlets
Trimmed 0 out of 2
Got 8 clusters
Splitting into subclusters...
Merging on 8 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 8 patterns after merging
Performing seqlet reassignment
Got 0 patterns after reassignment
Total time taken is 60.54s
On metacluster 11
Metacluster size 154
Relevant tasks: ('profile/Sox2', 'counts/Sox2')
Relevant signs: (1, 1)
(Round 1) num seqlets: 154
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.04 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.0 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 0.61 s
Launching nearest neighbors affmat calculation job
Job completed in: 0.63 s
(Round 1) Computed affinity matrix on nearest neighbors in 1.34 s
Filtered down to 115 of 154
(Round 1) Retained 115 rows out of 154 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 115 samples in 0.000s...
[t-SNE] Computed neighbors for 115 samples in 0.001s...
[t-SNE] Computed conditional probabilities for sample 115 / 115
[t-SNE] Mean sigma: 0.329003
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.024776220321655273 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.8628957271575928 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.5s finished
Wrote graph to binary file in 0.012923002243041992 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.789869
Louvain completed 51 runs in 20.284693241119385 seconds
Preproc + Louvain took 22.206434726715088 s
Got 11 clusters after round 1
Counts:
{5: 9, 9: 5, 0: 22, 7: 6, 3: 12, 8: 6, 2: 18, 1: 18, 4: 9, 6: 7, 10: 3}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 22 seqlets
Trimmed 0 out of 22
Aggregating for cluster 1 with 18 seqlets
Trimmed 0 out of 18
Aggregating for cluster 2 with 18 seqlets
Trimmed 0 out of 18
Aggregating for cluster 3 with 12 seqlets
Trimmed 0 out of 12
Aggregating for cluster 4 with 9 seqlets
Trimmed 0 out of 9
Skipped 1 seqlets
Aggregating for cluster 5 with 9 seqlets
Trimmed 0 out of 9
Aggregating for cluster 6 with 7 seqlets
Trimmed 1 out of 7
Aggregating for cluster 7 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 8 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 9 with 5 seqlets
Trimmed 0 out of 5
Aggregating for cluster 10 with 3 seqlets
Trimmed 0 out of 3
(Round 2) num seqlets: 113
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.03 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.0 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 0.46 s
Launching nearest neighbors affmat calculation job
Job completed in: 0.35 s
(Round 2) Computed affinity matrix on nearest neighbors in 0.87 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 113 samples in 0.000s...
[t-SNE] Computed neighbors for 113 samples in 0.002s...
[t-SNE] Computed conditional probabilities for sample 113 / 113
[t-SNE] Mean sigma: 0.321112
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.03810453414916992 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.798893690109253 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.5s finished
Wrote graph to binary file in 0.022066354751586914 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.785127
After 47 runs, maximum modularity is Q = 0.787253
Louvain completed 97 runs in 37.91083264350891 seconds
Preproc + Louvain took 39.79393172264099 s
Got 10 clusters after round 2
Counts:
{1: 20, 0: 25, 4: 10, 5: 9, 2: 17, 6: 7, 3: 11, 9: 3, 7: 6, 8: 5}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 25 seqlets
Trimmed 0 out of 25
Aggregating for cluster 1 with 20 seqlets
Trimmed 3 out of 20
Aggregating for cluster 2 with 17 seqlets
Trimmed 0 out of 17
Aggregating for cluster 3 with 11 seqlets
Trimmed 0 out of 11
Aggregating for cluster 4 with 10 seqlets
Trimmed 0 out of 10
Aggregating for cluster 5 with 9 seqlets
Trimmed 0 out of 9
Aggregating for cluster 6 with 7 seqlets
Trimmed 0 out of 7
Aggregating for cluster 7 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 8 with 5 seqlets
Trimmed 0 out of 5
Aggregating for cluster 9 with 3 seqlets
Trimmed 0 out of 3
Got 10 clusters
Splitting into subclusters...
Merging on 10 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 2 & 5 with prob 0.0003456136921248824 and sim 1.9355027963885338
Collapsing 5 & 6 with prob 0.00010699437852886864 and sim 1.8999057704638862
Collapsing 0 & 1 with prob 5.3567884542750634e-05 and sim 1.8910184184544383
Collapsing 1 & 5 with prob 3.319816536303039e-06 and sim 1.8781631860003514
Collapsing 2 & 6 with prob 0.00024514387363828316 and sim 1.8771836557145423
Collapsing 1 & 2 with prob 8.477182690676716e-06 and sim 1.8681238166735035
Collapsing 1 & 6 with prob 5.2601137644588735e-06 and sim 1.846493322900284
Collapsing 0 & 5 with prob 0.00012629936292007362 and sim 1.838367283836478
Collapsing 0 & 6 with prob 0.0003741170071655163 and sim 1.80745609354822
Collapsing 0 & 2 with prob 0.0003950717649772793 and sim 1.7971528941077797
Trimmed 0 out of 26
Trimmed 0 out of 33
Trimmed 0 out of 42
Trimmed 0 out of 75
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 6 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.02 s
Cross contin jaccard time taken: 0.02 s
Got 1 patterns after reassignment
Total time taken is 69.3s
On metacluster 10
Metacluster size 196
Relevant tasks: ('profile/Klf4',)
Relevant signs: (-1,)
(Round 1) num seqlets: 196
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.05 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.03 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.04 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.01 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 0.58 s
Launching nearest neighbors affmat calculation job
Job completed in: 0.63 s
(Round 1) Computed affinity matrix on nearest neighbors in 1.31 s
Filtered down to 187 of 196
(Round 1) Retained 187 rows out of 196 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 187 samples in 0.000s...
[t-SNE] Computed neighbors for 187 samples in 0.001s...
[t-SNE] Computed conditional probabilities for sample 187 / 187
[t-SNE] Mean sigma: 0.241411
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.03885793685913086 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.7535316944122314 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.5s finished
Wrote graph to binary file in 0.06420111656188965 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.695848
After 3 runs, maximum modularity is Q = 0.711013
Louvain completed 53 runs in 21.439456701278687 seconds
Preproc + Louvain took 23.322883129119873 s
Got 10 clusters after round 1
Counts:
{7: 13, 0: 32, 4: 19, 2: 24, 5: 19, 1: 30, 8: 9, 3: 19, 6: 17, 9: 5}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 32 seqlets
Trimmed 4 out of 32
Aggregating for cluster 1 with 30 seqlets
Trimmed 0 out of 30
Aggregating for cluster 2 with 24 seqlets
Trimmed 2 out of 24
Aggregating for cluster 3 with 19 seqlets
Trimmed 1 out of 19
Aggregating for cluster 4 with 19 seqlets
Trimmed 0 out of 19
Aggregating for cluster 5 with 19 seqlets
Trimmed 0 out of 19
Aggregating for cluster 6 with 17 seqlets
Trimmed 3 out of 17
Aggregating for cluster 7 with 13 seqlets
Trimmed 0 out of 13
Aggregating for cluster 8 with 9 seqlets
Trimmed 0 out of 9
Aggregating for cluster 9 with 5 seqlets
Trimmed 0 out of 5
(Round 2) num seqlets: 177
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.05 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.01 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 0.64 s
Launching nearest neighbors affmat calculation job
Job completed in: 0.58 s
(Round 2) Computed affinity matrix on nearest neighbors in 1.3 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 177 samples in 0.000s...
[t-SNE] Computed neighbors for 177 samples in 0.002s...
[t-SNE] Computed conditional probabilities for sample 177 / 177
[t-SNE] Mean sigma: 0.244258
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.05357933044433594 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.9060664176940918 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.6s finished
Wrote graph to binary file in 0.042569875717163086 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.692982
After 2 runs, maximum modularity is Q = 0.696029
After 8 runs, maximum modularity is Q = 0.696348
Louvain completed 58 runs in 23.71593999862671 seconds
Preproc + Louvain took 25.745716094970703 s
Got 11 clusters after round 2
Counts:
{0: 31, 4: 16, 3: 18, 2: 23, 1: 24, 7: 12, 9: 10, 8: 11, 6: 13, 10: 5, 5: 14}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 31 seqlets
Trimmed 5 out of 31
Aggregating for cluster 1 with 24 seqlets
Trimmed 0 out of 24
Aggregating for cluster 2 with 23 seqlets
Trimmed 7 out of 23
Aggregating for cluster 3 with 18 seqlets
Trimmed 0 out of 18
Aggregating for cluster 4 with 16 seqlets
Trimmed 0 out of 16
Aggregating for cluster 5 with 14 seqlets
Trimmed 3 out of 14
Aggregating for cluster 6 with 13 seqlets
Trimmed 0 out of 13
Aggregating for cluster 7 with 12 seqlets
Trimmed 1 out of 12
Aggregating for cluster 8 with 11 seqlets
Trimmed 0 out of 11
Aggregating for cluster 9 with 10 seqlets
Trimmed 0 out of 10
Aggregating for cluster 10 with 5 seqlets
Trimmed 0 out of 5
Got 11 clusters
Splitting into subclusters...
Merging on 11 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 1 & 2 with prob 6.7761544942702974e-06 and sim 0.9006824358057076
Collapsing 0 & 3 with prob 1.2331362395998899e-05 and sim 0.8953022836541957
Collapsing 5 & 6 with prob 4.182303785165226e-05 and sim 0.8845890001245055
Collapsing 0 & 1 with prob 3.3068991997647033e-05 and sim 0.8741308251996204
Aborting collapse as 0 & 2 have prob 4.698843786664626e-06 and sim 0.8084964717135964
Aborting collapse as 2 & 3 have prob 5.717009837797989e-07 and sim 0.805908721730737
Trimmed 3 out of 40
Trimmed 5 out of 44
Trimmed 1 out of 24
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 1 with prob 0.00026985906111814397 and sim 0.8777719194255873
Trimmed 1 out of 76
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 7 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.02 s
Cross contin jaccard time taken: 0.02 s
Discarded 6 seqlets
Got 1 patterns after reassignment
Total time taken is 57.8s
On metacluster 9
Metacluster size 206
Relevant tasks: ('profile/Sox2', 'counts/Sox2', 'counts/Nanog')
Relevant signs: (1, 1, 1)
(Round 1) num seqlets: 206
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.07 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.01 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 1.52 s
Launching nearest neighbors affmat calculation job
Job completed in: 1.41 s
(Round 1) Computed affinity matrix on nearest neighbors in 3.16 s
Filtered down to 172 of 206
(Round 1) Retained 172 rows out of 206 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 172 samples in 0.000s...
[t-SNE] Computed neighbors for 172 samples in 0.001s...
[t-SNE] Computed conditional probabilities for sample 172 / 172
[t-SNE] Mean sigma: 0.277533
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.05410122871398926 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.9710419178009033 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.6s finished
Wrote graph to binary file in 0.0354766845703125 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.789557
After 9 runs, maximum modularity is Q = 0.792704
After 11 runs, maximum modularity is Q = 0.792729
Louvain completed 61 runs in 24.768758296966553 seconds
Preproc + Louvain took 26.858972787857056 s
Got 13 clusters after round 1
Counts:
{8: 10, 2: 19, 7: 10, 5: 11, 0: 29, 3: 17, 1: 28, 4: 15, 9: 8, 6: 10, 11: 4, 12: 3, 10: 8}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 29 seqlets
Trimmed 1 out of 29
Aggregating for cluster 1 with 28 seqlets
Trimmed 0 out of 28
Skipped 1 seqlets
Aggregating for cluster 2 with 19 seqlets
Trimmed 2 out of 19
Aggregating for cluster 3 with 17 seqlets
Trimmed 0 out of 17
Aggregating for cluster 4 with 15 seqlets
Trimmed 0 out of 15
Aggregating for cluster 5 with 11 seqlets
Trimmed 0 out of 11
Aggregating for cluster 6 with 10 seqlets
Trimmed 0 out of 10
Aggregating for cluster 7 with 10 seqlets
Trimmed 0 out of 10
Aggregating for cluster 8 with 10 seqlets
Trimmed 1 out of 10
Aggregating for cluster 9 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 10 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 11 with 4 seqlets
Trimmed 0 out of 4
Aggregating for cluster 12 with 3 seqlets
Trimmed 0 out of 3
(Round 2) num seqlets: 167
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.05 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.0 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 0.9 s
Launching nearest neighbors affmat calculation job
Job completed in: 0.95 s
(Round 2) Computed affinity matrix on nearest neighbors in 2.05 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 167 samples in 0.000s...
[t-SNE] Computed neighbors for 167 samples in 0.002s...
[t-SNE] Computed conditional probabilities for sample 167 / 167
[t-SNE] Mean sigma: 0.267175
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.07928299903869629 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.8144292831420898 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.5s finished
Wrote graph to binary file in 0.03627419471740723 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.794138
Louvain completed 51 runs in 20.36331009864807 seconds
Preproc + Louvain took 22.32385516166687 s
Got 13 clusters after round 2
Counts:
{1: 28, 12: 3, 4: 15, 0: 31, 2: 17, 3: 16, 10: 7, 6: 10, 8: 8, 9: 7, 5: 12, 7: 9, 11: 4}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 31 seqlets
Trimmed 7 out of 31
Aggregating for cluster 1 with 28 seqlets
Trimmed 3 out of 28
Aggregating for cluster 2 with 17 seqlets
Trimmed 0 out of 17
Aggregating for cluster 3 with 16 seqlets
Trimmed 0 out of 16
Aggregating for cluster 4 with 15 seqlets
Trimmed 3 out of 15
Aggregating for cluster 5 with 12 seqlets
Trimmed 1 out of 12
Aggregating for cluster 6 with 10 seqlets
Trimmed 1 out of 10
Aggregating for cluster 7 with 9 seqlets
Trimmed 0 out of 9
Aggregating for cluster 8 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 9 with 7 seqlets
Trimmed 0 out of 7
Aggregating for cluster 10 with 7 seqlets
Trimmed 1 out of 7
Aggregating for cluster 11 with 4 seqlets
Trimmed 0 out of 4
Aggregating for cluster 12 with 3 seqlets
Trimmed 0 out of 3
Got 13 clusters
Splitting into subclusters...
Merging on 13 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 4 & 10 with prob 0.0003694849410171909 and sim 2.9292518414092372
Collapsing 0 & 4 with prob 0.001757090765941431 and sim 2.919852923498077
Collapsing 3 & 4 with prob 0.00028650202810900666 and sim 2.884682775024974
Collapsing 0 & 10 with prob 7.36370051786122e-05 and sim 2.8730200550038663
Collapsing 0 & 3 with prob 7.284355877951723e-05 and sim 2.850010913058106
Collapsing 3 & 10 with prob 0.0001085715822754968 and sim 2.839305422203055
Collapsing 1 & 6 with prob 3.7770692053900254e-06 and sim 2.797716554578971
Collapsing 1 & 9 with prob 2.800237173682307e-05 and sim 2.7774282645237616
Collapsing 6 & 9 with prob 1.9006547992263345e-06 and sim 2.7615010399118933
Collapsing 1 & 12 with prob 5.743842765840298e-05 and sim 2.7582760118187037
Aborting collapse as 6 & 12 have prob 4.6072872121234476e-15 and sim 2.579995078033595
Collapsing 4 & 6 with prob 1.0755285257489972e-05 and sim 2.751598574438206
Collapsing 1 & 10 with prob 0.00013511666380773614 and sim 2.748269402316094
Collapsing 0 & 1 with prob 0.000326222170016847 and sim 2.7457941631792004
Collapsing 4 & 9 with prob 3.168373561122533e-05 and sim 2.7438767171317986
Collapsing 9 & 10 with prob 2.07719699922259e-05 and sim 2.743097242954931
Collapsing 3 & 6 with prob 1.081993248219141e-06 and sim 2.7296502555462414
Collapsing 6 & 10 with prob 5.0484010617831905e-06 and sim 2.720100068481393
Collapsing 1 & 4 with prob 0.0003795965340222132 and sim 2.7119892576479887
Collapsing 1 & 3 with prob 3.8439959778719936e-05 and sim 2.6353739911930676
Trimmed 0 out of 18
Trimmed 0 out of 42
Trimmed 0 out of 58
Trimmed 0 out of 34
Trimmed 0 out of 41
Trimmed 0 out of 99
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 6 with prob 2.4200961884769282e-05 and sim 2.69530809148394
Trimmed 3 out of 102
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 6 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.03 s
Cross contin jaccard time taken: 0.03 s
Skipped 2 seqlets
Got 1 patterns after reassignment
Total time taken is 61.73s
On metacluster 8
Metacluster size 218
Relevant tasks: ('profile/Sox2', 'counts/Oct4', 'counts/Sox2', 'counts/Nanog')
Relevant signs: (1, 1, 1, 1)
(Round 1) num seqlets: 218
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.06 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.0 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 2.04 s
Launching nearest neighbors affmat calculation job
Job completed in: 1.91 s
(Round 1) Computed affinity matrix on nearest neighbors in 4.32 s
Filtered down to 172 of 218
(Round 1) Retained 172 rows out of 218 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 172 samples in 0.000s...
[t-SNE] Computed neighbors for 172 samples in 0.001s...
[t-SNE] Computed conditional probabilities for sample 172 / 172
[t-SNE] Mean sigma: 0.291057
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.028408288955688477 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.0126569271087646 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.7s finished
Wrote graph to binary file in 0.028092145919799805 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.775225
Louvain completed 51 runs in 20.22658944129944 seconds
Preproc + Louvain took 22.326728582382202 s
Got 15 clusters after round 1
Counts:
{5: 11, 10: 6, 14: 3, 12: 5, 1: 26, 7: 8, 8: 6, 0: 28, 4: 14, 2: 25, 3: 17, 9: 6, 6: 8, 13: 4, 11: 5}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 28 seqlets
Trimmed 0 out of 28
Aggregating for cluster 1 with 26 seqlets
Trimmed 1 out of 26
Aggregating for cluster 2 with 25 seqlets
Trimmed 0 out of 25
Aggregating for cluster 3 with 17 seqlets
Trimmed 1 out of 17
Aggregating for cluster 4 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 5 with 11 seqlets
Trimmed 0 out of 11
Aggregating for cluster 6 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 7 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 8 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 9 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 10 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 11 with 5 seqlets
Trimmed 0 out of 5
Aggregating for cluster 12 with 5 seqlets
Trimmed 0 out of 5
Aggregating for cluster 13 with 4 seqlets
Trimmed 0 out of 4
Aggregating for cluster 14 with 3 seqlets
Trimmed 0 out of 3
(Round 2) num seqlets: 170
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.05 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.0 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 1.28 s
Launching nearest neighbors affmat calculation job
Job completed in: 1.14 s
(Round 2) Computed affinity matrix on nearest neighbors in 2.65 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 170 samples in 0.000s...
[t-SNE] Computed neighbors for 170 samples in 0.002s...
[t-SNE] Computed conditional probabilities for sample 170 / 170
[t-SNE] Mean sigma: 0.283294
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.04968428611755371 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.8673932552337646 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.5s finished
Wrote graph to binary file in 0.02989816665649414 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.795562
After 7 runs, maximum modularity is Q = 0.797988
Louvain completed 57 runs in 22.889227628707886 seconds
Preproc + Louvain took 24.865850687026978 s
Got 12 clusters after round 2
Counts:
{0: 32, 2: 28, 1: 29, 9: 6, 8: 6, 3: 20, 6: 11, 5: 12, 11: 3, 7: 6, 10: 5, 4: 12}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 32 seqlets
Trimmed 2 out of 32
Aggregating for cluster 1 with 29 seqlets
Trimmed 4 out of 29
Aggregating for cluster 2 with 28 seqlets
Trimmed 3 out of 28
Aggregating for cluster 3 with 20 seqlets
Trimmed 2 out of 20
Aggregating for cluster 4 with 12 seqlets
Trimmed 0 out of 12
Aggregating for cluster 5 with 12 seqlets
Trimmed 1 out of 12
Aggregating for cluster 6 with 11 seqlets
Trimmed 0 out of 11
Aggregating for cluster 7 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 8 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 9 with 6 seqlets
Trimmed 0 out of 6
Aggregating for cluster 10 with 5 seqlets
Trimmed 0 out of 5
Aggregating for cluster 11 with 3 seqlets
Trimmed 0 out of 3
Got 12 clusters
Splitting into subclusters...
Merging on 12 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 1 with prob 0.00011072435372739359 and sim 3.7982057125457067
Collapsing 1 & 6 with prob 0.00017564779914501155 and sim 3.791367565607953
Collapsing 0 & 6 with prob 0.00012135730867148374 and sim 3.790239564072493
Collapsing 1 & 3 with prob 6.138640388533101e-05 and sim 3.7761347378789583
Aborting collapse as 0 & 3 have prob 5.820277520936997e-16 and sim 1.7283479975282274
Collapsing 1 & 8 with prob 2.5352542815294297e-05 and sim 3.7211689148459546
Aborting collapse as 0 & 8 have prob 1.4345162749636117e-11 and sim 3.540640711829814
Collapsing 1 & 2 with prob 3.693974996272598e-05 and sim 3.7107151579049162
Collapsing 6 & 10 with prob 8.25083982796621e-06 and sim 3.6774453945330166
Aborting collapse as 2 & 10 have prob 2.2392763230798463e-08 and sim 3.39973321461329
Collapsing 0 & 10 with prob 2.675902903693264e-05 and sim 3.632647263384217
Aborting collapse as 2 & 10 have prob 2.2392763230798463e-08 and sim 3.39973321461329
Collapsing 1 & 10 with prob 1.4217779184017363e-05 and sim 3.5249449419508516
Aborting collapse as 2 & 10 have prob 2.2392763230798463e-08 and sim 3.39973321461329
Trimmed 0 out of 55
Trimmed 0 out of 66
Trimmed 1 out of 91
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 7 with prob 9.355127567296697e-05 and sim 3.6422038400002745
Collapsing 0 & 5 with prob 0.00038734374876248366 and sim 3.6149008474800275
Aborting collapse as 5 & 7 have prob 2.5402798166938008e-05 and sim 3.312875988875915
Trimmed 0 out of 95
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 5 with prob 0.00038914919597713267 and sim 3.6151106308688994
Trimmed 6 out of 101
On merging iteration 4
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 7 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.04 s
Cross contin jaccard time taken: 0.06 s
Discarded 24 seqlets
Got 1 patterns after reassignment
Total time taken is 62.92s
On metacluster 7
Metacluster size 224
Relevant tasks: ('profile/Oct4', 'profile/Sox2', 'profile/Nanog', 'counts/Oct4', 'counts/Sox2')
Relevant signs: (1, 1, 1, 1, 1)
(Round 1) num seqlets: 224
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.06 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.01 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 2.5 s
Launching nearest neighbors affmat calculation job
Job completed in: 2.33 s
(Round 1) Computed affinity matrix on nearest neighbors in 5.31 s
Filtered down to 184 of 224
(Round 1) Retained 184 rows out of 224 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 184 samples in 0.000s...
[t-SNE] Computed neighbors for 184 samples in 0.002s...
[t-SNE] Computed conditional probabilities for sample 184 / 184
[t-SNE] Mean sigma: 0.350454
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 4.534235239028931 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.033287525177002 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.6s finished
Wrote graph to binary file in 0.04174017906188965 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.763097
After 3 runs, maximum modularity is Q = 0.797237
After 42 runs, maximum modularity is Q = 0.801931
Louvain completed 92 runs in 36.79068088531494 seconds
Preproc + Louvain took 43.424739360809326 s
Got 11 clusters after round 1
Counts:
{4: 20, 0: 30, 10: 6, 1: 28, 5: 19, 3: 20, 8: 8, 9: 7, 2: 24, 6: 14, 7: 8}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 30 seqlets
Trimmed 7 out of 30
Aggregating for cluster 1 with 28 seqlets
Trimmed 3 out of 28
Aggregating for cluster 2 with 24 seqlets
Trimmed 0 out of 24
Aggregating for cluster 3 with 20 seqlets
Trimmed 0 out of 20
Aggregating for cluster 4 with 20 seqlets
Trimmed 5 out of 20
Aggregating for cluster 5 with 19 seqlets
Trimmed 3 out of 19
Aggregating for cluster 6 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 7 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 8 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 9 with 7 seqlets
Trimmed 0 out of 7
Aggregating for cluster 10 with 6 seqlets
Trimmed 0 out of 6
(Round 2) num seqlets: 166
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.05 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.02 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.02 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.0 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 1.47 s
Launching nearest neighbors affmat calculation job
Job completed in: 1.34 s
(Round 2) Computed affinity matrix on nearest neighbors in 3.1 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 166 samples in 0.000s...
[t-SNE] Computed neighbors for 166 samples in 0.002s...
[t-SNE] Computed conditional probabilities for sample 166 / 166
[t-SNE] Mean sigma: 0.374297
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.051785945892333984 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 1.8724009990692139 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.6s finished
Wrote graph to binary file in 0.022536277770996094 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.811306
Louvain completed 51 runs in 20.180235862731934 seconds
Preproc + Louvain took 22.152500867843628 s
Got 10 clusters after round 2
Counts:
{3: 21, 0: 26, 7: 10, 2: 24, 1: 24, 6: 14, 4: 17, 5: 14, 9: 8, 8: 8}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 26 seqlets
Trimmed 2 out of 26
Aggregating for cluster 1 with 24 seqlets
Trimmed 0 out of 24
Aggregating for cluster 2 with 24 seqlets
Trimmed 0 out of 24
Aggregating for cluster 3 with 21 seqlets
Trimmed 0 out of 21
Aggregating for cluster 4 with 17 seqlets
Trimmed 1 out of 17
Aggregating for cluster 5 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 6 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 7 with 10 seqlets
Trimmed 0 out of 10
Aggregating for cluster 8 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 9 with 8 seqlets
Trimmed 0 out of 8
Got 10 clusters
Splitting into subclusters...
Merging on 10 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 10 patterns after merging
Performing seqlet reassignment
Got 0 patterns after reassignment
Total time taken is 79.13s
On metacluster 6
Metacluster size 386
Relevant tasks: ('profile/Oct4', 'counts/Oct4', 'counts/Klf4')
Relevant signs: (1, 1, -1)
(Round 1) num seqlets: 386
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.1 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.03 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.02 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 4.42 s
Launching nearest neighbors affmat calculation job
Job completed in: 4.42 s
(Round 1) Computed affinity matrix on nearest neighbors in 9.6 s
Filtered down to 322 of 386
(Round 1) Retained 322 rows out of 386 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 322 samples in 0.000s...
[t-SNE] Computed neighbors for 322 samples in 0.003s...
[t-SNE] Computed conditional probabilities for sample 322 / 322
[t-SNE] Mean sigma: 0.302542
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.09022402763366699 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.103989601135254 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.7s finished
Wrote graph to binary file in 0.10217761993408203 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.778384
After 3 runs, maximum modularity is Q = 0.784159
After 5 runs, maximum modularity is Q = 0.784333
Louvain completed 55 runs in 22.473653554916382 seconds
Preproc + Louvain took 24.81496286392212 s
Got 13 clusters after round 1
Counts:
{6: 22, 10: 8, 4: 34, 2: 37, 7: 21, 3: 35, 9: 14, 1: 46, 0: 47, 5: 30, 11: 8, 8: 14, 12: 6}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 47 seqlets
Trimmed 2 out of 47
Aggregating for cluster 1 with 46 seqlets
Trimmed 4 out of 46
Aggregating for cluster 2 with 37 seqlets
Trimmed 0 out of 37
Aggregating for cluster 3 with 35 seqlets
Trimmed 0 out of 35
Aggregating for cluster 4 with 34 seqlets
Trimmed 2 out of 34
Aggregating for cluster 5 with 30 seqlets
Trimmed 0 out of 30
Aggregating for cluster 6 with 22 seqlets
Trimmed 0 out of 22
Aggregating for cluster 7 with 21 seqlets
Trimmed 1 out of 21
Aggregating for cluster 8 with 14 seqlets
Trimmed 1 out of 14
Aggregating for cluster 9 with 14 seqlets
Trimmed 3 out of 14
Aggregating for cluster 10 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 11 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 12 with 6 seqlets
Trimmed 0 out of 6
(Round 2) num seqlets: 309
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.08 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Finished affinity matrix computations in 0.01 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.02 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 2.84 s
Launching nearest neighbors affmat calculation job
Job completed in: 2.94 s
(Round 2) Computed affinity matrix on nearest neighbors in 6.33 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 309 samples in 0.000s...
[t-SNE] Computed neighbors for 309 samples in 0.004s...
[t-SNE] Computed conditional probabilities for sample 309 / 309
[t-SNE] Mean sigma: 0.305946
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.1265256404876709 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.1303939819335938 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.7s finished
Wrote graph to binary file in 0.06290507316589355 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.799968
After 25 runs, maximum modularity is Q = 0.813347
Louvain completed 75 runs in 29.833870887756348 seconds
Preproc + Louvain took 32.19354844093323 s
Got 13 clusters after round 2
Counts:
{4: 31, 2: 39, 9: 14, 1: 42, 5: 25, 0: 59, 12: 4, 10: 12, 8: 14, 3: 31, 6: 16, 7: 14, 11: 8}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 59 seqlets
Trimmed 6 out of 59
Aggregating for cluster 1 with 42 seqlets
Trimmed 0 out of 42
Aggregating for cluster 2 with 39 seqlets
Trimmed 0 out of 39
Aggregating for cluster 3 with 31 seqlets
Trimmed 0 out of 31
Aggregating for cluster 4 with 31 seqlets
Trimmed 4 out of 31
Aggregating for cluster 5 with 25 seqlets
Trimmed 6 out of 25
Aggregating for cluster 6 with 16 seqlets
Trimmed 0 out of 16
Aggregating for cluster 7 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 8 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 9 with 14 seqlets
Trimmed 2 out of 14
Aggregating for cluster 10 with 12 seqlets
Trimmed 0 out of 12
Aggregating for cluster 11 with 8 seqlets
Trimmed 0 out of 8
Aggregating for cluster 12 with 4 seqlets
Trimmed 0 out of 4
Got 13 clusters
Splitting into subclusters...
Merging on 13 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 1 & 2 with prob 0.0001303182913825512 and sim 2.830556474732618
Collapsing 3 & 5 with prob 1.179683451556665e-05 and sim 2.7981228319878038
Collapsing 0 & 1 with prob 5.5607348748328926e-05 and sim 2.715005851933429
Collapsing 0 & 6 with prob 5.188237792768069e-05 and sim 2.6514875130723548
Aborting collapse as 1 & 6 have prob 1.937574054262187e-06 and sim 2.431666993566496
Aborting collapse as 2 & 6 have prob 7.442863715957787e-07 and sim 2.3038522317422307
Collapsing 0 & 2 with prob 5.581527501677299e-05 and sim 2.6305141216206933
Collapsing 0 & 3 with prob 0.00018629281846534808 and sim 2.563936581789665
Aborting collapse as 0 & 5 have prob 4.387837146454967e-07 and sim 2.290288604266212
Aborting collapse as 1 & 5 have prob 3.0791831203543254e-05 and sim 2.44938258167533
Aborting collapse as 2 & 3 have prob 2.2208861774097275e-05 and sim 2.4384257868822745
Trimmed 0 out of 81
Trimmed 0 out of 50
Trimmed 0 out of 134
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 1 with prob 0.0012031805664231776 and sim 2.5893697664038324
Trimmed 1 out of 184
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 9 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.05 s
Cross contin jaccard time taken: 0.04 s
Got 1 patterns after reassignment
Total time taken is 84.22s
On metacluster 5
Metacluster size 400
Relevant tasks: ('profile/Oct4', 'profile/Sox2', 'profile/Klf4', 'profile/Nanog', 'counts/Sox2', 'counts/Nanog')
Relevant signs: (1, 1, 1, 1, 1, 1)
(Round 1) num seqlets: 400
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.12 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.02 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.01 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 11.26 s
Launching nearest neighbors affmat calculation job
Job completed in: 11.02 s
(Round 1) Computed affinity matrix on nearest neighbors in 23.64 s
Filtered down to 355 of 400
(Round 1) Retained 355 rows out of 400 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 355 samples in 0.000s...
[t-SNE] Computed neighbors for 355 samples in 0.004s...
[t-SNE] Computed conditional probabilities for sample 355 / 355
[t-SNE] Mean sigma: 0.292187
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.09411501884460449 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.1403393745422363 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.7s finished
Wrote graph to binary file in 0.0959782600402832 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.789486
After 3 runs, maximum modularity is Q = 0.82683
Louvain completed 53 runs in 21.531070709228516 seconds
Preproc + Louvain took 23.907272815704346 s
Got 11 clusters after round 1
Counts:
{8: 17, 4: 30, 0: 64, 1: 62, 3: 38, 6: 25, 5: 27, 2: 47, 9: 14, 10: 9, 7: 22}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 64 seqlets
Trimmed 5 out of 64
Aggregating for cluster 1 with 62 seqlets
Trimmed 9 out of 62
Aggregating for cluster 2 with 47 seqlets
Trimmed 0 out of 47
Aggregating for cluster 3 with 38 seqlets
Trimmed 2 out of 38
Aggregating for cluster 4 with 30 seqlets
Trimmed 1 out of 30
Aggregating for cluster 5 with 27 seqlets
Trimmed 1 out of 27
Aggregating for cluster 6 with 25 seqlets
Trimmed 0 out of 25
Aggregating for cluster 7 with 22 seqlets
Trimmed 4 out of 22
Aggregating for cluster 8 with 17 seqlets
Trimmed 0 out of 17
Aggregating for cluster 9 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 10 with 9 seqlets
Trimmed 0 out of 9
(Round 2) num seqlets: 333
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.09 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.01 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.01 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 7.82 s
Launching nearest neighbors affmat calculation job
Job completed in: 7.61 s
(Round 2) Computed affinity matrix on nearest neighbors in 16.43 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 333 samples in 0.000s...
[t-SNE] Computed neighbors for 333 samples in 0.003s...
[t-SNE] Computed conditional probabilities for sample 333 / 333
[t-SNE] Mean sigma: 0.307513
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.10282373428344727 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.211256265640259 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.7s finished
Wrote graph to binary file in 0.06647419929504395 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.816419
After 8 runs, maximum modularity is Q = 0.824929
Louvain completed 58 runs in 23.415032625198364 seconds
Preproc + Louvain took 25.83146047592163 s
Got 10 clusters after round 2
Counts:
{0: 58, 1: 54, 3: 46, 2: 47, 4: 36, 5: 27, 7: 20, 6: 22, 8: 14, 9: 9}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 58 seqlets
Trimmed 3 out of 58
Aggregating for cluster 1 with 54 seqlets
Trimmed 4 out of 54
Aggregating for cluster 2 with 47 seqlets
Trimmed 0 out of 47
Aggregating for cluster 3 with 46 seqlets
Trimmed 1 out of 46
Aggregating for cluster 4 with 36 seqlets
Trimmed 0 out of 36
Aggregating for cluster 5 with 27 seqlets
Trimmed 1 out of 27
Aggregating for cluster 6 with 22 seqlets
Trimmed 0 out of 22
Aggregating for cluster 7 with 20 seqlets
Trimmed 0 out of 20
Aggregating for cluster 8 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 9 with 9 seqlets
Trimmed 0 out of 9
Got 10 clusters
Splitting into subclusters...
Merging on 10 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 1 with prob 0.0012173228722878527 and sim 5.875074390638587
Collapsing 0 & 9 with prob 0.002883433689717215 and sim 5.573088317167059
Collapsing 0 & 4 with prob 4.359899582793051e-05 and sim 5.523764395332506
Collapsing 1 & 9 with prob 8.223256910714593e-06 and sim 5.493455432504418
Collapsing 0 & 6 with prob 1.091682583449538e-05 and sim 5.428527915471504
Aborting collapse as 6 & 9 have prob 9.613821078995903e-07 and sim 4.862931127891931
Collapsing 4 & 6 with prob 0.0003270609808623072 and sim 5.320857511753544
Aborting collapse as 6 & 9 have prob 9.613821078995903e-07 and sim 4.862931127891931
Trimmed 0 out of 105
Trimmed 9 out of 114
Trimmed 0 out of 141
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 4 with prob 5.319665918144069e-05 and sim 5.5369855114805935
Trimmed 0 out of 163
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 6 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.14 s
Cross contin jaccard time taken: 0.13 s
Discarded 58 seqlets
Skipped 1 seqlets
Got 1 patterns after reassignment
Total time taken is 102.79s
On metacluster 4
Metacluster size 454
Relevant tasks: ('profile/Oct4', 'profile/Sox2', 'profile/Klf4')
Relevant signs: (-1, -1, -1)
(Round 1) num seqlets: 454
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.11 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.02 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.02 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 7.77 s
Launching nearest neighbors affmat calculation job
Job completed in: 7.84 s
(Round 1) Computed affinity matrix on nearest neighbors in 16.46 s
Filtered down to 409 of 454
(Round 1) Retained 409 rows out of 454 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 409 samples in 0.000s...
[t-SNE] Computed neighbors for 409 samples in 0.003s...
[t-SNE] Computed conditional probabilities for sample 409 / 409
[t-SNE] Mean sigma: 0.221484
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.08780455589294434 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.3108484745025635 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.8s finished
Wrote graph to binary file in 0.1100008487701416 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.788167
After 3 runs, maximum modularity is Q = 0.788469
After 12 runs, maximum modularity is Q = 0.78863
After 26 runs, maximum modularity is Q = 0.790729
Louvain completed 76 runs in 33.13585305213928 seconds
Preproc + Louvain took 35.697083473205566 s
Got 14 clusters after round 1
Counts:
{7: 28, 1: 49, 5: 32, 3: 43, 4: 34, 9: 16, 2: 46, 0: 76, 8: 18, 13: 4, 11: 14, 6: 30, 10: 15, 12: 4}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 76 seqlets
Trimmed 7 out of 76
Aggregating for cluster 1 with 49 seqlets
Trimmed 1 out of 49
Aggregating for cluster 2 with 46 seqlets
Trimmed 11 out of 46
Aggregating for cluster 3 with 43 seqlets
Trimmed 0 out of 43
Aggregating for cluster 4 with 34 seqlets
Trimmed 4 out of 34
Aggregating for cluster 5 with 32 seqlets
Trimmed 6 out of 32
Aggregating for cluster 6 with 30 seqlets
Trimmed 1 out of 30
Aggregating for cluster 7 with 28 seqlets
Trimmed 0 out of 28
Aggregating for cluster 8 with 18 seqlets
Trimmed 1 out of 18
Aggregating for cluster 9 with 16 seqlets
Trimmed 1 out of 16
Aggregating for cluster 10 with 15 seqlets
Trimmed 1 out of 15
Aggregating for cluster 11 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 12 with 4 seqlets
Trimmed 0 out of 4
Dropping cluster 12 with 4 seqlets due to sign disagreement
Aggregating for cluster 13 with 4 seqlets
Trimmed 0 out of 4
(Round 2) num seqlets: 372
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.12 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.0 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.01 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.02 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 3.83 s
Launching nearest neighbors affmat calculation job
Job completed in: 4.0 s
(Round 2) Computed affinity matrix on nearest neighbors in 8.48 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 372 samples in 0.000s...
[t-SNE] Computed neighbors for 372 samples in 0.006s...
[t-SNE] Computed conditional probabilities for sample 372 / 372
[t-SNE] Mean sigma: 0.217960
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.13010931015014648 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.058706283569336 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.6s finished
Wrote graph to binary file in 0.11371946334838867 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.769562
After 19 runs, maximum modularity is Q = 0.786231
Louvain completed 69 runs in 28.08131456375122 seconds
Preproc + Louvain took 30.43392777442932 s
Got 12 clusters after round 2
Counts:
{0: 64, 4: 35, 5: 29, 3: 45, 7: 19, 6: 27, 2: 57, 1: 60, 9: 13, 10: 6, 11: 3, 8: 14}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 64 seqlets
Trimmed 6 out of 64
Aggregating for cluster 1 with 60 seqlets
Trimmed 5 out of 60
Aggregating for cluster 2 with 57 seqlets
Trimmed 6 out of 57
Aggregating for cluster 3 with 45 seqlets
Trimmed 5 out of 45
Aggregating for cluster 4 with 35 seqlets
Trimmed 10 out of 35
Aggregating for cluster 5 with 29 seqlets
Trimmed 1 out of 29
Aggregating for cluster 6 with 27 seqlets
Trimmed 3 out of 27
Aggregating for cluster 7 with 19 seqlets
Trimmed 1 out of 19
Aggregating for cluster 8 with 14 seqlets
Trimmed 0 out of 14
Aggregating for cluster 9 with 13 seqlets
Trimmed 2 out of 13
Aggregating for cluster 10 with 6 seqlets
Trimmed 0 out of 6
Dropping cluster 10 with 6 seqlets due to sign disagreement
Aggregating for cluster 11 with 3 seqlets
Trimmed 0 out of 3
Got 11 clusters
Splitting into subclusters...
Merging on 11 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 3 with prob 0.0001358418169876331 and sim 2.7118275184524387
Collapsing 1 & 9 with prob 0.00011444996790295265 and sim 2.7021880849252335
Collapsing 0 & 1 with prob 5.296724238983686e-05 and sim 2.6446745558929745
Collapsing 0 & 2 with prob 3.57449966341928e-05 and sim 2.630146383355818
Aborting collapse as 2 & 9 have prob 4.509023440774475e-06 and sim 2.413097663154701
Collapsing 1 & 6 with prob 2.129489989615172e-05 and sim 2.6177451449603817
Aborting collapse as 6 & 9 have prob 2.4764606404574993e-07 and sim 2.34138621634697
Trimmed 24 out of 98
Trimmed 11 out of 66
Trimmed 8 out of 129
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 1 with prob 0.00011682654623451454 and sim 2.66253443544148
Collapsing 0 & 5 with prob 2.558776081783596e-05 and sim 2.6225464363213176
Trimmed 38 out of 172
Trimmed 18 out of 152
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 6 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.04 s
Cross contin jaccard time taken: 0.04 s
Got 1 patterns after reassignment
Total time taken is 103.0s
On metacluster 3
Metacluster size 501
Relevant tasks: ('profile/Oct4', 'profile/Sox2', 'counts/Oct4', 'counts/Sox2', 'counts/Nanog')
Relevant signs: (1, 1, 1, 1, 1)
(Round 1) num seqlets: 501
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.13 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.04 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.05 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.04 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 14.28 s
Launching nearest neighbors affmat calculation job
Job completed in: 14.32 s
(Round 1) Computed affinity matrix on nearest neighbors in 30.46 s
Filtered down to 387 of 501
(Round 1) Retained 387 rows out of 501 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 387 samples in 0.000s...
[t-SNE] Computed neighbors for 387 samples in 0.003s...
[t-SNE] Computed conditional probabilities for sample 387 / 387
[t-SNE] Mean sigma: 0.277914
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.17708635330200195 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.337451219558716 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.8s finished
Wrote graph to binary file in 0.08608841896057129 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.734241
After 2 runs, maximum modularity is Q = 0.741093
After 8 runs, maximum modularity is Q = 0.741733
Louvain completed 58 runs in 27.22933268547058 seconds
Preproc + Louvain took 29.88275408744812 s
Got 15 clusters after round 1
Counts:
{1: 68, 3: 25, 7: 17, 0: 71, 2: 53, 8: 16, 4: 23, 12: 13, 5: 23, 10: 14, 11: 13, 14: 7, 6: 22, 9: 15, 13: 7}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 71 seqlets
Trimmed 7 out of 71
Aggregating for cluster 1 with 68 seqlets
Trimmed 2 out of 68
Skipped 3 seqlets
Aggregating for cluster 2 with 53 seqlets
Trimmed 7 out of 53
Aggregating for cluster 3 with 25 seqlets
Trimmed 2 out of 25
Aggregating for cluster 4 with 23 seqlets
Trimmed 1 out of 23
Aggregating for cluster 5 with 23 seqlets
Trimmed 1 out of 23
Aggregating for cluster 6 with 22 seqlets
Trimmed 1 out of 22
Aggregating for cluster 7 with 17 seqlets
Trimmed 1 out of 17
Aggregating for cluster 8 with 16 seqlets
Trimmed 0 out of 16
Aggregating for cluster 9 with 15 seqlets
Trimmed 0 out of 15
Aggregating for cluster 10 with 14 seqlets
Trimmed 2 out of 14
Aggregating for cluster 11 with 13 seqlets
Trimmed 1 out of 13
Aggregating for cluster 12 with 13 seqlets
Trimmed 0 out of 13
Skipped 2 seqlets
Aggregating for cluster 13 with 7 seqlets
Trimmed 0 out of 7
Aggregating for cluster 14 with 7 seqlets
Trimmed 0 out of 7
(Round 2) num seqlets: 357
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.16 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.02 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.01 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 7.64 s
Launching nearest neighbors affmat calculation job
Job completed in: 7.55 s
(Round 2) Computed affinity matrix on nearest neighbors in 15.92 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 357 samples in 0.000s...
[t-SNE] Computed neighbors for 357 samples in 0.003s...
[t-SNE] Computed conditional probabilities for sample 357 / 357
[t-SNE] Mean sigma: 0.283471
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.12944364547729492 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.1679463386535645 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.8s finished
Wrote graph to binary file in 0.07832479476928711 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.776728
Louvain completed 51 runs in 20.566688537597656 seconds
Preproc + Louvain took 22.972902297973633 s
Got 13 clusters after round 2
Counts:
{2: 50, 8: 15, 4: 31, 1: 54, 7: 15, 0: 73, 12: 6, 3: 39, 5: 24, 9: 13, 6: 18, 10: 12, 11: 7}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 73 seqlets
Trimmed 2 out of 73
Aggregating for cluster 1 with 54 seqlets
Trimmed 14 out of 54
Aggregating for cluster 2 with 50 seqlets
Trimmed 0 out of 50
Aggregating for cluster 3 with 39 seqlets
Trimmed 0 out of 39
Aggregating for cluster 4 with 31 seqlets
Trimmed 0 out of 31
Aggregating for cluster 5 with 24 seqlets
Trimmed 1 out of 24
Aggregating for cluster 6 with 18 seqlets
Trimmed 2 out of 18
Aggregating for cluster 7 with 15 seqlets
Trimmed 2 out of 15
Aggregating for cluster 8 with 15 seqlets
Trimmed 1 out of 15
Aggregating for cluster 9 with 13 seqlets
Trimmed 0 out of 13
Aggregating for cluster 10 with 12 seqlets
Trimmed 0 out of 12
Aggregating for cluster 11 with 7 seqlets
Trimmed 0 out of 7
Aggregating for cluster 12 with 6 seqlets
Trimmed 0 out of 6
Got 13 clusters
Splitting into subclusters...
Inspecting for spurious merging
Wrote graph to binary file in 0.06771993637084961 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00728665
Louvain completed 21 runs in 8.194681882858276 seconds
Similarity is 0.9356191; is_dissimilar is False
Merging on 13 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 2 & 4 with prob 1.4153458267217793e-05 and sim 4.766632252374942
Collapsing 0 & 2 with prob 0.0016533918231195507 and sim 4.611797273512066
Collapsing 1 & 7 with prob 0.00012678501735286708 and sim 4.30723794831868
Trimmed 0 out of 81
Trimmed 1 out of 152
Trimmed 0 out of 53
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 10 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.11 s
Cross contin jaccard time taken: 0.1 s
Discarded 59 seqlets
Skipped 1 seqlets
Got 1 patterns after reassignment
Total time taken is 119.98s
On metacluster 2
Metacluster size 791
Relevant tasks: ('profile/Oct4', 'counts/Oct4')
Relevant signs: (1, 1)
(Round 1) num seqlets: 791
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.18 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.02 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.04 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 7.17 s
Launching nearest neighbors affmat calculation job
Job completed in: 7.12 s
(Round 1) Computed affinity matrix on nearest neighbors in 15.29 s
Filtered down to 565 of 791
(Round 1) Retained 565 rows out of 791 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 565 samples in 0.000s...
[t-SNE] Computed neighbors for 565 samples in 0.007s...
[t-SNE] Computed conditional probabilities for sample 565 / 565
[t-SNE] Mean sigma: 0.283811
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.18326997756958008 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers. [Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.9s finished
Louvain completed 200 runs in 2.5667428970336914 seconds
Wrote graph to binary file in 0.29304075241088867 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.755122
After 2 runs, maximum modularity is Q = 0.75519
After 25 runs, maximum modularity is Q = 0.764035
Louvain completed 75 runs in 30.922652006149292 seconds
Preproc + Louvain took 34.02500247955322 s
Got 10 clusters after round 1
Counts:
{1: 102, 2: 81, 0: 117, 8: 27, 3: 55, 5: 49, 4: 54, 6: 30, 7: 29, 9: 21}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 117 seqlets
Trimmed 15 out of 117
Skipped 2 seqlets
Aggregating for cluster 1 with 102 seqlets
Trimmed 21 out of 102
Skipped 1 seqlets
Aggregating for cluster 2 with 81 seqlets
Trimmed 5 out of 81
Aggregating for cluster 3 with 55 seqlets
Trimmed 2 out of 55
Skipped 1 seqlets
Aggregating for cluster 4 with 54 seqlets
Trimmed 4 out of 54
Aggregating for cluster 5 with 49 seqlets
Trimmed 1 out of 49
Aggregating for cluster 6 with 30 seqlets
Trimmed 3 out of 30
Aggregating for cluster 7 with 29 seqlets
Trimmed 2 out of 29
Aggregating for cluster 8 with 27 seqlets
Trimmed 2 out of 27
Aggregating for cluster 9 with 21 seqlets
Trimmed 0 out of 21
(Round 2) num seqlets: 506
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.12 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.02 s
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.01 s
Finished affinity matrix computations in 0.03 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.03 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 4.63 s
Launching nearest neighbors affmat calculation job
Job completed in: 4.78 s
(Round 2) Computed affinity matrix on nearest neighbors in 9.91 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 506 samples in 0.000s...
[t-SNE] Computed neighbors for 506 samples in 0.007s...
[t-SNE] Computed conditional probabilities for sample 506 / 506
[t-SNE] Mean sigma: 0.293194
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.13416123390197754 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers.
Louvain completed 200 runs in 2.4198107719421387 seconds
[Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.9s finished
Wrote graph to binary file in 0.23700428009033203 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.773018
After 21 runs, maximum modularity is Q = 0.774736
After 26 runs, maximum modularity is Q = 0.794771
Louvain completed 76 runs in 33.30098581314087 seconds
Preproc + Louvain took 36.15887141227722 s
Got 11 clusters after round 2
Counts:
{0: 104, 1: 82, 7: 27, 2: 66, 6: 29, 5: 39, 3: 53, 4: 52, 10: 11, 8: 23, 9: 20}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 104 seqlets
Trimmed 2 out of 104
Aggregating for cluster 1 with 82 seqlets
Trimmed 2 out of 82
Aggregating for cluster 2 with 66 seqlets
Trimmed 3 out of 66
Aggregating for cluster 3 with 53 seqlets
Trimmed 0 out of 53
Aggregating for cluster 4 with 52 seqlets
Trimmed 4 out of 52
Aggregating for cluster 5 with 39 seqlets
Trimmed 3 out of 39
Aggregating for cluster 6 with 29 seqlets
Trimmed 1 out of 29
Aggregating for cluster 7 with 27 seqlets
Trimmed 1 out of 27
Aggregating for cluster 8 with 23 seqlets
Trimmed 0 out of 23
Aggregating for cluster 9 with 20 seqlets
Trimmed 0 out of 20
Aggregating for cluster 10 with 11 seqlets
Trimmed 0 out of 11
Got 11 clusters
Splitting into subclusters...
Inspecting for spurious merging
Wrote graph to binary file in 0.04515528678894043 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00931289
After 5 runs, maximum modularity is Q = 0.0102233
After 6 runs, maximum modularity is Q = 0.0103743
Louvain completed 26 runs in 12.00829529762268 seconds
Similarity is 0.87800497; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.04680943489074707 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00590879
After 2 runs, maximum modularity is Q = 0.0109607
Louvain completed 22 runs in 10.095775842666626 seconds
Similarity is 0.8830459; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.02892017364501953 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00635817
After 9 runs, maximum modularity is Q = 0.00640568
After 14 runs, maximum modularity is Q = 0.00640569
Louvain completed 34 runs in 15.538919448852539 seconds
Similarity is 0.92806864; is_dissimilar is False
Merging on 11 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 1 & 8 with prob 0.00020841150739695698 and sim 1.8493944394199096
Collapsing 1 & 2 with prob 0.0001285455277933887 and sim 1.8478511862691323
Aborting collapse as 2 & 8 have prob 1.1771828512876494e-05 and sim 1.5789809703398985
Collapsing 1 & 5 with prob 3.393449451522871e-05 and sim 1.8248735759206824
Collapsing 0 & 4 with prob 1.5274352937379846e-05 and sim 1.802380351217378
Collapsing 5 & 8 with prob 1.3928832376521804e-05 and sim 1.747724782325938
Collapsing 1 & 4 with prob 4.212123559485495e-05 and sim 1.74570089570886
Aborting collapse as 0 & 1 have prob 0.00016982755997811328 and sim 1.594603332278651
Aborting collapse as 4 & 5 have prob 4.145323069069114e-08 and sim 1.4264539430964143
Trimmed 0 out of 103
Trimmed 0 out of 139
Trimmed 0 out of 150
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 3 with prob 2.000238492545723e-05 and sim 1.8127203198038098
Collapsing 1 & 2 with prob 0.0002257154547886293 and sim 1.8070128353789274
Trimmed 0 out of 203
Trimmed 3 out of 202
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 6 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.04 s
Cross contin jaccard time taken: 0.04 s
Skipped 2 seqlets
Skipped 2 seqlets
Skipped 1 seqlets
Skipped 1 seqlets
Got 2 patterns after reassignment
Total time taken is 147.82s
On metacluster 1
Metacluster size 1107
Relevant tasks: ('profile/Oct4', 'counts/Oct4', 'counts/Sox2')
Relevant signs: (1, 1, 1)
(Round 1) num seqlets: 1107
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.25 s
Starting affinity matrix computations
Normalization computed in 0.01 s
Cosine similarity mat computed in 0.04 s
Normalization computed in 0.01 s
Cosine similarity mat computed in 0.02 s
Finished affinity matrix computations in 0.06 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.07 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 20.5 s
Launching nearest neighbors affmat calculation job
Job completed in: 20.51 s
(Round 1) Computed affinity matrix on nearest neighbors in 43.31 s
Filtered down to 778 of 1107
(Round 1) Retained 778 rows out of 1107 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 778 samples in 0.000s...
[t-SNE] Computed neighbors for 778 samples in 0.010s...
[t-SNE] Computed conditional probabilities for sample 778 / 778
[t-SNE] Mean sigma: 0.271661
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.19539213180541992 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers. [Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 2.2s finished
Louvain completed 200 runs in 2.996304750442505 seconds
Wrote graph to binary file in 0.52707839012146 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.71722
After 2 runs, maximum modularity is Q = 0.733065
After 4 runs, maximum modularity is Q = 0.745467
After 7 runs, maximum modularity is Q = 0.761968
After 34 runs, maximum modularity is Q = 0.765155
Louvain completed 84 runs in 42.08622074127197 seconds
Preproc + Louvain took 45.90263295173645 s
Got 12 clusters after round 1
Counts:
{2: 90, 4: 77, 8: 36, 5: 70, 3: 87, 10: 28, 0: 122, 9: 34, 6: 56, 1: 107, 7: 55, 11: 16}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 122 seqlets
Trimmed 6 out of 122
Skipped 3 seqlets
Aggregating for cluster 1 with 107 seqlets
Trimmed 9 out of 107
Skipped 2 seqlets
Aggregating for cluster 2 with 90 seqlets
Trimmed 15 out of 90
Skipped 1 seqlets
Aggregating for cluster 3 with 87 seqlets
Trimmed 24 out of 87
Skipped 1 seqlets
Aggregating for cluster 4 with 77 seqlets
Trimmed 0 out of 77
Skipped 2 seqlets
Aggregating for cluster 5 with 70 seqlets
Trimmed 12 out of 70
Skipped 2 seqlets
Aggregating for cluster 6 with 56 seqlets
Trimmed 13 out of 56
Aggregating for cluster 7 with 55 seqlets
Trimmed 8 out of 55
Skipped 1 seqlets
Aggregating for cluster 8 with 36 seqlets
Trimmed 0 out of 36
Skipped 1 seqlets
Aggregating for cluster 9 with 34 seqlets
Trimmed 1 out of 34
Skipped 1 seqlets
Aggregating for cluster 10 with 28 seqlets
Trimmed 0 out of 28
Aggregating for cluster 11 with 16 seqlets
Trimmed 0 out of 16
(Round 2) num seqlets: 676
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.23 s
Starting affinity matrix computations
Normalization computed in 0.0 s
Cosine similarity mat computed in 0.03 s
Normalization computed in 0.01 s
Cosine similarity mat computed in 0.03 s
Finished affinity matrix computations in 0.06 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.04 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 12.68 s
Launching nearest neighbors affmat calculation job
Job completed in: 12.72 s
(Round 2) Computed affinity matrix on nearest neighbors in 26.67 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 676 samples in 0.001s...
[t-SNE] Computed neighbors for 676 samples in 0.010s...
[t-SNE] Computed conditional probabilities for sample 676 / 676
[t-SNE] Mean sigma: 0.274327
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.16033053398132324 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers. [Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 1.9s finished
Louvain completed 200 runs in 2.6127665042877197 seconds
Wrote graph to binary file in 0.35215091705322266 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.715414
After 2 runs, maximum modularity is Q = 0.735105
After 4 runs, maximum modularity is Q = 0.760662
After 5 runs, maximum modularity is Q = 0.777664
After 27 runs, maximum modularity is Q = 0.782319
Louvain completed 77 runs in 36.258947134017944 seconds
Preproc + Louvain took 39.47501730918884 s
Got 15 clusters after round 2
Counts:
{6: 55, 0: 99, 7: 40, 9: 28, 5: 57, 1: 89, 8: 37, 4: 59, 2: 75, 3: 70, 11: 18, 12: 15, 10: 18, 14: 7, 13: 9}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 99 seqlets
Trimmed 0 out of 99
Aggregating for cluster 1 with 89 seqlets
Trimmed 0 out of 89
Aggregating for cluster 2 with 75 seqlets
Trimmed 2 out of 75
Aggregating for cluster 3 with 70 seqlets
Trimmed 0 out of 70
Aggregating for cluster 4 with 59 seqlets
Trimmed 0 out of 59
Aggregating for cluster 5 with 57 seqlets
Trimmed 4 out of 57
Aggregating for cluster 6 with 55 seqlets
Trimmed 3 out of 55
Aggregating for cluster 7 with 40 seqlets
Trimmed 0 out of 40
Aggregating for cluster 8 with 37 seqlets
Trimmed 3 out of 37
Aggregating for cluster 9 with 28 seqlets
Trimmed 2 out of 28
Aggregating for cluster 10 with 18 seqlets
Trimmed 0 out of 18
Aggregating for cluster 11 with 18 seqlets
Trimmed 0 out of 18
Aggregating for cluster 12 with 15 seqlets
Trimmed 0 out of 15
Aggregating for cluster 13 with 9 seqlets
Trimmed 0 out of 9
Aggregating for cluster 14 with 7 seqlets
Trimmed 0 out of 7
Got 15 clusters
Splitting into subclusters...
Inspecting for spurious merging
Wrote graph to binary file in 0.04081392288208008 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00584281
After 2 runs, maximum modularity is Q = 0.00695118
After 3 runs, maximum modularity is Q = 0.00700654
After 4 runs, maximum modularity is Q = 0.0085447
After 7 runs, maximum modularity is Q = 0.00854471
Louvain completed 27 runs in 13.869440078735352 seconds
Similarity is 0.8918627; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.047467947006225586 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.011521
Louvain completed 21 runs in 9.816699028015137 seconds
Similarity is 0.8625355; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.04062676429748535 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00662909
After 2 runs, maximum modularity is Q = 0.0066291
After 3 runs, maximum modularity is Q = 0.00908602
After 5 runs, maximum modularity is Q = 0.00908603
Louvain completed 25 runs in 12.632744312286377 seconds
Similarity is 0.8983365; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.040344953536987305 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.0130347
Louvain completed 21 runs in 9.884993076324463 seconds
Similarity is 0.86192644; is_dissimilar is False
Merging on 15 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 3 with prob 0.0001350187051374623 and sim 2.8389903404486185
Collapsing 0 & 1 with prob 3.1722276003872546e-06 and sim 2.798196607188967
Collapsing 0 & 7 with prob 3.199252006275033e-05 and sim 2.7578252693002767
Collapsing 4 & 5 with prob 7.37583483645674e-06 and sim 2.7535758965579107
Collapsing 1 & 4 with prob 0.0001209509888729167 and sim 2.7230722930706284
Aborting collapse as 0 & 4 have prob 6.882846953526734e-08 and sim 2.40193084944238
Aborting collapse as 3 & 4 have prob 1.2050707134190845e-07 and sim 2.3773893166687623
Aborting collapse as 4 & 7 have prob 1.577769847489481e-08 and sim 2.4488126342883283
Aborting collapse as 5 & 7 have prob 1.0386279886025189e-06 and sim 2.4825186473358465
Collapsing 3 & 9 with prob 1.1493309696969602e-05 and sim 2.7214918463201316
Aborting collapse as 7 & 9 have prob 5.28507112866545e-08 and sim 2.4039955399850865
Collapsing 1 & 3 with prob 2.0726342280186e-06 and sim 2.711989528613728
Collapsing 0 & 2 with prob 2.6805974310993316e-05 and sim 2.703138065813256
Aborting collapse as 1 & 2 have prob 4.5177271920080726e-06 and sim 2.416275436643107
Aborting collapse as 2 & 7 have prob 4.2029007396451087e-07 and sim 2.3706237838243642
Collapsing 2 & 11 with prob 3.839182142112109e-05 and sim 2.7009149778006147
Collapsing 1 & 8 with prob 0.00033048671547352787 and sim 2.5429273616508934
Aborting collapse as 0 & 8 have prob 1.4791031564585294e-07 and sim 2.4779305714135806
Aborting collapse as 7 & 8 have prob 2.6630732527037577e-08 and sim 2.4711375138703664
Trimmed 0 out of 169
Trimmed 0 out of 258
Trimmed 1 out of 298
Trimmed 0 out of 112
Trimmed 2 out of 91
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 5 with prob 1.1281398583083037e-05 and sim 2.6969085965609154
Collapsing 0 & 2 with prob 0.00029845565819308363 and sim 2.64837683580742
Aborting collapse as 2 & 5 have prob 3.3327702116138775e-07 and sim 2.2419695838821205
Collapsing 0 & 1 with prob 0.00017599447808576014 and sim 2.638791009316276
Collapsing 0 & 4 with prob 0.00018077754635326105 and sim 2.5906547672141804
Aborting collapse as 1 & 4 have prob 1.5520771574908976e-05 and sim 2.318113450301917
Aborting collapse as 4 & 5 have prob 3.906847058251403e-08 and sim 2.015285422771402
Trimmed 26 out of 323
Trimmed 0 out of 409
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 2 with prob 2.0631164573077682e-05 and sim 2.61869996956114
Collapsing 0 & 3 with prob 0.00023087501615484037 and sim 2.579298672552494
Aborting collapse as 2 & 3 have prob 1.0631303525732162e-07 and sim 1.880832826121125
Trimmed 16 out of 461
On merging iteration 4
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 2 with prob 0.00019938666126600077 and sim 2.550498635620061
Trimmed 0 out of 479
On merging iteration 5
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 6 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.03 s
Cross contin jaccard time taken: 0.03 s
Skipped 4 seqlets
Skipped 2 seqlets
Skipped 4 seqlets
Got 2 patterns after reassignment
Total time taken is 227.68s
On metacluster 0
Metacluster size 4500
Relevant tasks: ('profile/Oct4', 'profile/Sox2', 'counts/Oct4', 'counts/Sox2')
Relevant signs: (1, 1, 1, 1)
(Round 1) num seqlets: 4500
(Round 1) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 1.21 s
Starting affinity matrix computations
Normalization computed in 0.03 s
Cosine similarity mat computed in 0.16 s
Normalization computed in 0.02 s
Cosine similarity mat computed in 0.14 s
Finished affinity matrix computations in 0.3 s
(Round 1) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.61 s
(Round 1) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 104.84 s
Launching nearest neighbors affmat calculation job
Job completed in: 104.57 s
(Round 1) Computed affinity matrix on nearest neighbors in 221.2 s
Filtered down to 3396 of 4500
(Round 1) Retained 3396 rows out of 4500 after filtering
(Round 1) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 3396 samples in 0.009s...
[t-SNE] Computed neighbors for 3396 samples in 0.158s...
[t-SNE] Computed conditional probabilities for sample 1000 / 3396
[t-SNE] Computed conditional probabilities for sample 2000 / 3396
[t-SNE] Computed conditional probabilities for sample 3000 / 3396
[t-SNE] Computed conditional probabilities for sample 3396 / 3396
[t-SNE] Mean sigma: 0.281997
(Round 1) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.6289606094360352 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers. [Parallel(n_jobs=4)]: Done 76 tasks | elapsed: 1.9s [Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 4.8s finished
Louvain completed 200 runs in 11.997238397598267 seconds
Wrote graph to binary file in 7.139870882034302 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.793629
After 2 runs, maximum modularity is Q = 0.799688
After 6 runs, maximum modularity is Q = 0.801266
After 7 runs, maximum modularity is Q = 0.802099
After 14 runs, maximum modularity is Q = 0.802911
After 15 runs, maximum modularity is Q = 0.808023
After 40 runs, maximum modularity is Q = 0.808052
After 80 runs, maximum modularity is Q = 0.808664
Louvain completed 130 runs in 74.55178737640381 seconds
Preproc + Louvain took 95.30100059509277 s
Got 21 clusters after round 1
Counts:
{11: 99, 1: 364, 2: 300, 7: 200, 13: 69, 0: 468, 16: 56, 3: 288, 6: 209, 12: 91, 5: 283, 8: 160, 4: 288, 15: 64, 17: 52, 9: 130, 19: 36, 14: 67, 10: 104, 20: 31, 18: 37}
(Round 1) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 468 seqlets
Trimmed 39 out of 468
Skipped 3 seqlets
Aggregating for cluster 1 with 364 seqlets
Trimmed 36 out of 364
Skipped 10 seqlets
Aggregating for cluster 2 with 300 seqlets
Trimmed 34 out of 300
Skipped 3 seqlets
Aggregating for cluster 3 with 288 seqlets
Trimmed 49 out of 288
Aggregating for cluster 4 with 288 seqlets
Trimmed 42 out of 288
Skipped 4 seqlets
Aggregating for cluster 5 with 283 seqlets
Trimmed 25 out of 283
Aggregating for cluster 6 with 209 seqlets
Trimmed 34 out of 209
Skipped 1 seqlets
Aggregating for cluster 7 with 200 seqlets
Trimmed 10 out of 200
Skipped 2 seqlets
Aggregating for cluster 8 with 160 seqlets
Trimmed 15 out of 160
Aggregating for cluster 9 with 130 seqlets
Trimmed 21 out of 130
Aggregating for cluster 10 with 104 seqlets
Trimmed 10 out of 104
Aggregating for cluster 11 with 99 seqlets
Trimmed 8 out of 99
Skipped 2 seqlets
Aggregating for cluster 12 with 91 seqlets
Trimmed 18 out of 91
Aggregating for cluster 13 with 69 seqlets
Trimmed 6 out of 69
Aggregating for cluster 14 with 67 seqlets
Trimmed 3 out of 67
Aggregating for cluster 15 with 64 seqlets
Trimmed 11 out of 64
Aggregating for cluster 16 with 56 seqlets
Trimmed 6 out of 56
Aggregating for cluster 17 with 52 seqlets
Trimmed 10 out of 52
Aggregating for cluster 18 with 37 seqlets
Trimmed 6 out of 37
Aggregating for cluster 19 with 36 seqlets
Trimmed 0 out of 36
Aggregating for cluster 20 with 31 seqlets
Trimmed 5 out of 31
(Round 2) num seqlets: 2983
(Round 2) Computing coarse affmat
Beginning embedding computation
Computing embeddings
Finished embedding computation in 0.81 s
Starting affinity matrix computations
Normalization computed in 0.01 s
Cosine similarity mat computed in 0.1 s
Normalization computed in 0.01 s
Cosine similarity mat computed in 0.07 s
Finished affinity matrix computations in 0.17 s
(Round 2) Compute nearest neighbors from coarse affmat
Computed nearest neighbors in 0.28 s
(Round 2) Computing affinity matrix on nearest neighbors
Launching nearest neighbors affmat calculation job
Job completed in: 68.55 s
Launching nearest neighbors affmat calculation job
Job completed in: 68.95 s
(Round 2) Computed affinity matrix on nearest neighbors in 145.29 s
Not applying filtering for rounds above first round
(Round 2) Computing density adapted affmat
[t-SNE] Computing 31 nearest neighbors...
[t-SNE] Indexed 2983 samples in 0.008s...
[t-SNE] Computed neighbors for 2983 samples in 0.127s...
[t-SNE] Computed conditional probabilities for sample 1000 / 2983
[t-SNE] Computed conditional probabilities for sample 2000 / 2983
[t-SNE] Computed conditional probabilities for sample 2983 / 2983
[t-SNE] Mean sigma: 0.284216
(Round 2) Computing clustering
Beginning preprocessing + Louvain
Wrote graph to binary file in 0.645883321762085 seconds
Running Louvain modularity optimization
[Parallel(n_jobs=4)]: Using backend LokyBackend with 4 concurrent workers. [Parallel(n_jobs=4)]: Done 76 tasks | elapsed: 1.7s [Parallel(n_jobs=4)]: Done 200 out of 200 | elapsed: 4.2s finished
Louvain completed 200 runs in 9.788201570510864 seconds
Wrote graph to binary file in 6.3620545864105225 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.803471
After 5 runs, maximum modularity is Q = 0.803532
After 11 runs, maximum modularity is Q = 0.806345
Louvain completed 61 runs in 34.87230968475342 seconds
Preproc + Louvain took 52.55779004096985 s
Got 21 clusters after round 2
Counts:
{9: 159, 11: 131, 7: 208, 0: 279, 2: 244, 1: 253, 6: 212, 13: 72, 19: 37, 18: 45, 3: 244, 10: 141, 5: 215, 14: 64, 8: 198, 17: 49, 4: 215, 15: 60, 12: 75, 16: 53, 20: 29}
(Round 2) Aggregating seqlets in each cluster
Aggregating for cluster 0 with 279 seqlets
Trimmed 8 out of 279
Aggregating for cluster 1 with 253 seqlets
Trimmed 11 out of 253
Aggregating for cluster 2 with 244 seqlets
Trimmed 0 out of 244
Aggregating for cluster 3 with 244 seqlets
Trimmed 7 out of 244
Aggregating for cluster 4 with 215 seqlets
Trimmed 0 out of 215
Aggregating for cluster 5 with 215 seqlets
Trimmed 3 out of 215
Aggregating for cluster 6 with 212 seqlets
Trimmed 0 out of 212
Aggregating for cluster 7 with 208 seqlets
Trimmed 5 out of 208
Aggregating for cluster 8 with 198 seqlets
Trimmed 12 out of 198
Aggregating for cluster 9 with 159 seqlets
Trimmed 8 out of 159
Aggregating for cluster 10 with 141 seqlets
Trimmed 1 out of 141
Aggregating for cluster 11 with 131 seqlets
Trimmed 0 out of 131
Aggregating for cluster 12 with 75 seqlets
Trimmed 0 out of 75
Aggregating for cluster 13 with 72 seqlets
Trimmed 0 out of 72
Aggregating for cluster 14 with 64 seqlets
Trimmed 0 out of 64
Aggregating for cluster 15 with 60 seqlets
Trimmed 0 out of 60
Aggregating for cluster 16 with 53 seqlets
Trimmed 0 out of 53
Aggregating for cluster 17 with 49 seqlets
Trimmed 0 out of 49
Aggregating for cluster 18 with 45 seqlets
Trimmed 3 out of 45
Aggregating for cluster 19 with 37 seqlets
Trimmed 0 out of 37
Aggregating for cluster 20 with 29 seqlets
Trimmed 0 out of 29
Got 21 clusters
Splitting into subclusters...
Inspecting for spurious merging
Wrote graph to binary file in 0.3096892833709717 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00601546
Louvain completed 21 runs in 10.638978004455566 seconds
Similarity is 0.9622363; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.307572603225708 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00691348
After 8 runs, maximum modularity is Q = 0.00692441
Louvain completed 28 runs in 14.11666750907898 seconds
Similarity is 0.93866444; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.31024765968322754 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.0107266
Louvain completed 21 runs in 10.445596933364868 seconds
Similarity is 0.9124932; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.2891404628753662 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00845768
After 2 runs, maximum modularity is Q = 0.00851212
Louvain completed 22 runs in 11.386723279953003 seconds
Similarity is 0.94480586; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.23846006393432617 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.0126772
After 3 runs, maximum modularity is Q = 0.0127015
Louvain completed 23 runs in 11.764552116394043 seconds
Similarity is 0.92696154; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.22523784637451172 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00978451
After 18 runs, maximum modularity is Q = 0.00978452
Louvain completed 38 runs in 18.58995270729065 seconds
Similarity is 0.93044174; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.8097324371337891 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00614661
After 4 runs, maximum modularity is Q = 0.00626186
After 5 runs, maximum modularity is Q = 0.00639477
After 7 runs, maximum modularity is Q = 0.00640362
Louvain completed 27 runs in 14.524748086929321 seconds
Similarity is 0.92346674; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.2109205722808838 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00689088
After 2 runs, maximum modularity is Q = 0.00701402
After 3 runs, maximum modularity is Q = 0.00877453
After 12 runs, maximum modularity is Q = 0.00884327
Louvain completed 32 runs in 16.4968581199646 seconds
Similarity is 0.9170815; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.1782536506652832 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.0108344
Louvain completed 21 runs in 10.354874610900879 seconds
Similarity is 0.89773977; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.11406254768371582 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.0131098
After 5 runs, maximum modularity is Q = 0.0131243
Louvain completed 25 runs in 12.82708477973938 seconds
Similarity is 0.9192374; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.11257100105285645 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00685333
After 2 runs, maximum modularity is Q = 0.00738971
After 4 runs, maximum modularity is Q = 0.00752277
After 5 runs, maximum modularity is Q = 0.00757792
After 8 runs, maximum modularity is Q = 0.00761221
Louvain completed 28 runs in 15.073808431625366 seconds
Similarity is 0.9497445; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.0940086841583252 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.0147385
After 2 runs, maximum modularity is Q = 0.0149033
After 3 runs, maximum modularity is Q = 0.0149234
After 8 runs, maximum modularity is Q = 0.0149917
Louvain completed 28 runs in 14.84327244758606 seconds
Similarity is 0.89542645; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.04657435417175293 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00491086
After 3 runs, maximum modularity is Q = 0.00539964
After 7 runs, maximum modularity is Q = 0.00555037
After 8 runs, maximum modularity is Q = 0.00610647
After 9 runs, maximum modularity is Q = 0.00610648
Louvain completed 29 runs in 15.500229597091675 seconds
Similarity is 0.97221184; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.04261612892150879 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00628428
After 3 runs, maximum modularity is Q = 0.00839695
After 6 runs, maximum modularity is Q = 0.00839696
After 8 runs, maximum modularity is Q = 0.0085155
Louvain completed 28 runs in 14.736608266830444 seconds
Similarity is 0.9565799; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.03448605537414551 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.00687788
After 2 runs, maximum modularity is Q = 0.0168717
After 3 runs, maximum modularity is Q = 0.0192907
Louvain completed 23 runs in 12.065630912780762 seconds
Similarity is 0.8275105; is_dissimilar is False
Inspecting for spurious merging
Wrote graph to binary file in 0.031296730041503906 seconds
Running Louvain modularity optimization
After 1 runs, maximum modularity is Q = 0.0146718
Louvain completed 21 runs in 10.294403553009033 seconds
Similarity is 0.94904613; is_dissimilar is False
Merging on 21 clusters
On merging iteration 1
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 19 with prob 0.0005879478522466735 and sim 3.861296724208311
Collapsing 0 & 8 with prob 1.0569685332761153e-06 and sim 3.8274295063199597
Collapsing 7 & 9 with prob 0.001063957587364231 and sim 3.8012731394115353
Collapsing 1 & 7 with prob 0.0007525898508728364 and sim 3.795438490316263
Collapsing 4 & 10 with prob 3.246905103687373e-05 and sim 3.7946076614765754
Collapsing 0 & 3 with prob 0.004979648506796212 and sim 3.7851192480341
Collapsing 5 & 8 with prob 1.0826007499169293e-05 and sim 3.7678144629220847
Collapsing 15 & 18 with prob 0.00029298317975373666 and sim 3.7605899666461053
Collapsing 3 & 13 with prob 2.9359911744110848e-05 and sim 3.750151718083562
Collapsing 13 & 19 with prob 3.6819664704307764e-05 and sim 3.743961122201501
Collapsing 4 & 13 with prob 9.396298063533188e-06 and sim 3.7315667259384306
Aborting collapse as 5 & 10 have prob 5.523776313929691e-07 and sim 3.309979927692697
Collapsing 5 & 15 with prob 1.2233287980130314e-05 and sim 3.7243443493786508
Aborting collapse as 3 & 15 have prob 8.470940377420897e-09 and sim 3.3189060317453745
Aborting collapse as 8 & 18 have prob 1.3112111604093673e-08 and sim 3.573901033589658
Collapsing 5 & 6 with prob 8.591165057583225e-06 and sim 3.719040418648882
Aborting collapse as 6 & 8 have prob 2.2406088740029658e-08 and sim 3.449818873401911
Collapsing 4 & 8 with prob 2.8885787558503905e-05 and sim 3.706797296655804
Aborting collapse as 5 & 10 have prob 5.523776313929691e-07 and sim 3.309979927692697
Collapsing 9 & 11 with prob 1.2649901166169143e-06 and sim 3.700624457978308
Collapsing 5 & 13 with prob 5.019209353733033e-06 and sim 3.700528612845854
Collapsing 0 & 13 with prob 5.35896821907266e-05 and sim 3.698331616647629
Collapsing 3 & 10 with prob 4.0078453393441604e-05 and sim 3.6959513735886222
Aborting collapse as 5 & 10 have prob 5.523776313929691e-07 and sim 3.309979927692697
Collapsing 1 & 9 with prob 0.00016576255122677016 and sim 3.6953747683512477
Collapsing 3 & 4 with prob 5.371147190258852e-06 and sim 3.690559677451914
Aborting collapse as 5 & 10 have prob 5.523776313929691e-07 and sim 3.309979927692697
Collapsing 7 & 11 with prob 2.444724291058468e-06 and sim 3.6873845215603827
Collapsing 3 & 19 with prob 4.272609503976246e-05 and sim 3.6855084789527384
Collapsing 15 & 19 with prob 2.365166946832436e-06 and sim 3.68063167846418
Aborting collapse as 3 & 15 have prob 8.470940377420897e-09 and sim 3.3189060317453745
Aborting collapse as 8 & 18 have prob 1.3112111604093673e-08 and sim 3.573901033589658
Collapsing 1 & 2 with prob 3.3644360206440887e-06 and sim 3.6805373553198137
Collapsing 18 & 19 with prob 3.417820887224263e-05 and sim 3.6795057445561543
Aborting collapse as 3 & 15 have prob 8.470940377420897e-09 and sim 3.3189060317453745
Aborting collapse as 8 & 18 have prob 1.3112111604093673e-08 and sim 3.573901033589658
Collapsing 2 & 7 with prob 2.658971917261618e-06 and sim 3.675172508866801
Collapsing 0 & 18 with prob 4.390667497017457e-05 and sim 3.645758204759427
Aborting collapse as 3 & 15 have prob 8.470940377420897e-09 and sim 3.3189060317453745
Aborting collapse as 8 & 18 have prob 1.3112111604093673e-08 and sim 3.573901033589658
Collapsing 1 & 6 with prob 0.00012591486098382577 and sim 3.6447408524624856
Aborting collapse as 6 & 11 have prob 1.2966998453655382e-08 and sim 3.143425993618511
Collapsing 0 & 5 with prob 3.2884749551371645e-06 and sim 3.612926685543626
Collapsing 13 & 18 with prob 8.06371434301517e-06 and sim 3.608197908451668
Aborting collapse as 3 & 15 have prob 8.470940377420897e-09 and sim 3.3189060317453745
Aborting collapse as 8 & 18 have prob 1.3112111604093673e-08 and sim 3.573901033589658
Collapsing 12 & 16 with prob 5.16999411375753e-05 and sim 3.6078367940177336
Collapsing 6 & 9 with prob 1.80470867487972e-05 and sim 3.574690736107436
Aborting collapse as 6 & 11 have prob 1.2966998453655382e-08 and sim 3.143425993618511
Collapsing 4 & 5 with prob 1.1095449620091085e-05 and sim 3.5622612074981985
Aborting collapse as 5 & 10 have prob 5.523776313929691e-07 and sim 3.309979927692697
Collapsing 0 & 10 with prob 0.00013195428556524307 and sim 3.554505403133724
Aborting collapse as 5 & 10 have prob 5.523776313929691e-07 and sim 3.309979927692697
Collapsing 1 & 12 with prob 1.4201658683021133e-05 and sim 3.549071620075593
Aborting collapse as 1 & 16 have prob 2.5086041403282154e-08 and sim 3.2911230939494724
Aborting collapse as 2 & 12 have prob 5.391712614081484e-08 and sim 3.3776462017539264
Aborting collapse as 7 & 16 have prob 1.848693512493025e-07 and sim 3.178876434045441
Aborting collapse as 9 & 12 have prob 5.162685006183276e-06 and sim 3.2783095974512033
Aborting collapse as 11 & 12 have prob 1.7075619119257867e-06 and sim 3.2046099346512102
Collapsing 2 & 5 with prob 5.2398819777390944e-05 and sim 3.516370099976724
Aborting collapse as 0 & 1 have prob 8.431493653879321e-08 and sim 3.0151998823050556
Aborting collapse as 1 & 3 have prob 2.1425797503711178e-08 and sim 2.9081663126620825
Aborting collapse as 2 & 3 have prob 3.695149534943709e-07 and sim 3.3133980681282797
Aborting collapse as 3 & 7 have prob 3.4202851031182784e-08 and sim 2.986938561109741
Aborting collapse as 5 & 11 have prob 9.390086915123316e-08 and sim 3.1439380793347302
Aborting collapse as 7 & 8 have prob 2.2824384350944793e-09 and sim 3.223237338530239
Aborting collapse as 8 & 9 have prob 3.458045446002835e-09 and sim 3.3746838552114204
Aborting collapse as 9 & 19 have prob 4.196000803439399e-08 and sim 3.1043911678854914
Aborting collapse as 11 & 13 have prob 1.5774576253844503e-08 and sim 3.2676214717134275
Collapsing 2 & 4 with prob 8.980376136753875e-05 and sim 3.5066041418318092
Aborting collapse as 1 & 4 have prob 2.9141814707648935e-07 and sim 3.3159772853385814
Aborting collapse as 2 & 10 have prob 8.037628247905626e-07 and sim 3.278446263700166
Aborting collapse as 7 & 10 have prob 1.7961170981719695e-06 and sim 3.065052942847152
Aborting collapse as 9 & 10 have prob 9.718880656309533e-07 and sim 3.311820411504579
Aborting collapse as 10 & 11 have prob 1.5362460105509246e-07 and sim 3.2371866464878982
Collapsing 2 & 8 with prob 1.0336892172682441e-05 and sim 3.4994329755961098
Aborting collapse as 0 & 1 have prob 8.431493653879321e-08 and sim 3.0151998823050556
Aborting collapse as 1 & 3 have prob 2.1425797503711178e-08 and sim 2.9081663126620825
Aborting collapse as 2 & 3 have prob 3.695149534943709e-07 and sim 3.3133980681282797
Aborting collapse as 3 & 7 have prob 3.4202851031182784e-08 and sim 2.986938561109741
Aborting collapse as 5 & 11 have prob 9.390086915123316e-08 and sim 3.1439380793347302
Aborting collapse as 7 & 8 have prob 2.2824384350944793e-09 and sim 3.223237338530239
Aborting collapse as 8 & 9 have prob 3.458045446002835e-09 and sim 3.3746838552114204
Aborting collapse as 9 & 19 have prob 4.196000803439399e-08 and sim 3.1043911678854914
Aborting collapse as 11 & 13 have prob 1.5774576253844503e-08 and sim 3.2676214717134275
Trimmed 0 out of 308
Trimmed 0 out of 494
Trimmed 0 out of 354
Trimmed 0 out of 596
Trimmed 0 out of 355
Trimmed 0 out of 731
Trimmed 0 out of 943
Trimmed 0 out of 102
Trimmed 0 out of 1015
Trimmed 0 out of 727
Trimmed 0 out of 971
Trimmed 0 out of 128
On merging iteration 2
Computing pattern to seqlet distances
Computing pattern to pattern distances
Collapsing 0 & 2 with prob 0.0003424161327729849 and sim 3.724729366941389
Collapsing 0 & 5 with prob 9.771562821011184e-05 and sim 3.6870095244677614
Collapsing 0 & 3 with prob 1.905166818366431e-05 and sim 3.6004395730934613
Collapsing 1 & 3 with prob 3.799171551677147e-05 and sim 3.578181165450182
Collapsing 1 & 4 with prob 0.0001173820835891779 and sim 3.538197121270303
Aborting collapse as 0 & 4 have prob 1.066661088975494e-06 and sim 2.8513324022985964
Aborting collapse as 2 & 4 have prob 8.311221072020644e-08 and sim 2.981761020893066
Aborting collapse as 3 & 4 have prob 9.013124299730737e-08 and sim 2.8622062817108027
Aborting collapse as 4 & 5 have prob 2.3605523540493774e-07 and sim 2.845270480830733
Collapsing 1 & 2 with prob 1.6388149463827297e-05 and sim 3.4928342579651654
Collapsing 0 & 1 with prob 0.0002849256154722848 and sim 3.3945611903347714
Trimmed 0 out of 1370
Trimmed 0 out of 1472
Trimmed 0 out of 1684
Trimmed 6 out of 2655
On merging iteration 3
Computing pattern to seqlet distances
Computing pattern to pattern distances
Got 5 patterns after merging
Performing seqlet reassignment
Cross contin jaccard time taken: 0.06 s
Cross contin jaccard time taken: 0.06 s
Discarded 4 seqlets
Skipped 8 seqlets
Skipped 7 seqlets
Got 3 patterns after reassignment
Total time taken is 832.47s
from importlib import reload
import h5py
import modisco.util
reload(modisco.util)
!rm modisco_results_on_valid.hdf5
grp = h5py.File("modisco_results_on_valid.hdf5")
tfmodisco_results.save_hdf5(grp)
grp.close()
rm: cannot remove 'modisco_results_on_valid.hdf5': No such file or directory