{"id":"W1039758599","doi":"10.1186/s13015-015-0053-5","title":"Detecting conserved protein complexes using a dividing-and-matching algorithm and unequally lenient criteria for network comparison","year":2015,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"National Natural Science Foundation of China","keywords":"Computer science; Protein superfamily; Similarity (geometry); Matching (statistics); Computational biology; Drosophila melanogaster; Data mining; Topology (electrical circuits); Artificial intelligence; Biology; Genetics; Mathematics; Gene","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.003112102,0.001400147,0.001618411,0.00802498,0.001311574,0.001865982,0.002140701,0.001565805,0.001943339],"category_scores_gemma":[0.008103237,0.0006735438,0.001444054,0.004020135,0.001187148,0.003281813,0.001839649,0.0008487918,0.0005511474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155432,"about_ca_system_score_gemma":0.0015747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003594863,"about_ca_topic_score_gemma":0.002911183,"domain_scores_codex":[0.9970236,0.0006459944,0.0003314021,0.0008828885,0.0008599971,0.0002560298],"domain_scores_gemma":[0.9967971,0.001114012,0.000581622,0.0005419127,0.0007444368,0.0002208129],"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.001134453,0.0004360228,0.02657134,0.0006901235,0.0006692527,0.0008996264,0.000957914,0.09429983,0.09187774,0.01994274,0.004352648,0.7581683],"study_design_scores_gemma":[0.00008662178,0.0001930208,0.008239981,0.00003418251,0.0001582739,0.0006281127,0.000295148,0.9369275,0.03571688,0.0123796,0.005267006,0.00007374098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1022814,0.0007007029,0.8929309,0.0001115245,0.00004259538,0.0002860282,0.0001629185,0.002004928,0.001478949],"genre_scores_gemma":[0.3124883,0.0003429836,0.6839646,0.00007974855,0.0000227937,0.0002547532,0.001025573,0.0002414106,0.001579876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00802498,"threshold_uncertainty_score":0.01645857,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05642390626907818,"score_gpt":0.3395592973962983,"score_spread":0.2831353911272201,"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."}}