{"id":"W2060480410","doi":"10.1109/tcbb.2012.119","title":"Symmetry Compression Method for Discovering Network Motifs","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"National Natural Science Foundation of China; University of Pittsburgh","keywords":"Lossless compression; Computer science; Cluster analysis; Algorithm; Speedup; Sampling (signal processing); Symmetry (geometry); Biological network; Network topology; Theoretical computer science; Data compression; Mathematics; Artificial intelligence; Combinatorics; Parallel computing","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005337933,0.0005128107,0.0005277135,0.001992893,0.0003866724,0.0004487309,0.0007084865,0.0004388223,0.001852223],"category_scores_gemma":[0.003096059,0.0002066919,0.0004936264,0.00142641,0.0004708753,0.001344151,0.0005663543,0.0004840377,0.0003507432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004828428,"about_ca_system_score_gemma":0.0009765425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002078295,"about_ca_topic_score_gemma":0.001890228,"domain_scores_codex":[0.9994548,0.0001015674,0.00003974942,0.0000870575,0.0002695346,0.00004731492],"domain_scores_gemma":[0.9989883,0.0004248802,0.000103031,0.0001842226,0.0002550658,0.00004441446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003996771,0.0001601653,0.004980216,0.0002476767,0.00008179202,0.0003074087,0.0002231212,0.1271622,0.06116043,0.02311521,0.004478616,0.7776834],"study_design_scores_gemma":[0.0000424896,0.00009050627,0.001236092,0.000009808209,0.00002152597,0.0003182077,0.00005293093,0.9562798,0.02800079,0.01211172,0.001820098,0.00001594191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09493471,0.0003201045,0.9015456,0.0001410585,0.0000368119,0.0001166532,0.0002046878,0.001369513,0.001330789],"genre_scores_gemma":[0.3890548,0.000272269,0.6081004,0.00007539231,0.00004394785,0.0001614382,0.000927098,0.0001116609,0.001252953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002078295,"threshold_uncertainty_score":0.00619626,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01569049982648398,"score_gpt":0.2947461209584036,"score_spread":0.2790556211319196,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}