{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003823007,0.0002050096,0.000196589,0.00006462034,0.0003584295,0.00003086923,0.0001573001,0.0002589524,0.000009272425],"category_scores_gemma":[0.00001683836,0.0001739074,0.0001124335,0.00009043869,0.00009015837,0.0000253172,0.00002021299,0.0001537848,0.000009184667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001452598,"about_ca_system_score_gemma":0.00003477042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003348959,"about_ca_topic_score_gemma":0.000003235828,"domain_scores_codex":[0.9989523,0.00004257302,0.0003947458,0.0001516952,0.00007611328,0.0003825293],"domain_scores_gemma":[0.9992419,0.0002061107,0.00014126,0.0002171639,0.00006315069,0.0001303508],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007799838,0.0004585405,0.002210121,0.0004099123,0.0008372512,3.168833e-7,0.001032915,0.5175818,0.003501215,0.01185329,0.009071571,0.4522631],"study_design_scores_gemma":[0.00356676,0.001514299,0.002245449,0.0001441011,0.0002251788,0.0001692806,0.000602563,0.8952026,0.007020503,0.02590436,0.06203958,0.001365327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01260106,0.0002953119,0.9852438,0.0001585821,0.000971168,0.0003055921,0.0001677968,0.00002224269,0.0002344669],"genre_scores_gemma":[0.5281171,0.0001017531,0.4697011,0.000970818,0.0005485056,0.0000376867,0.0004229567,0.00001610987,0.00008397321],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5155427,"threshold_uncertainty_score":0.7091739,"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."}}