{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008493951,0.0003017001,0.0004281091,0.00005001724,0.0002695851,0.00008159013,0.0001711308,0.0003046788,7.720964e-7],"category_scores_gemma":[0.0001041654,0.000297115,0.0001142225,0.0000668532,0.0001719064,0.000008412741,0.0002909846,0.0001157685,3.36211e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002187474,"about_ca_system_score_gemma":0.00008158067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007360665,"about_ca_topic_score_gemma":0.00002465379,"domain_scores_codex":[0.9982415,0.0001089534,0.0005017807,0.0004894389,0.00007067424,0.0005876513],"domain_scores_gemma":[0.9990728,0.00005779,0.0002511374,0.000241118,0.0001835274,0.0001935753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004490179,0.00009247292,0.0004446174,0.0002099755,0.0005582059,0.000004002023,0.0006219086,0.001890115,0.8841938,0.004275923,0.0005056071,0.1067543],"study_design_scores_gemma":[0.007256053,0.004432183,0.00006303207,0.0001727297,0.0002753251,0.0001789556,0.001070073,0.7858568,0.1137843,0.0649216,0.0203597,0.001629255],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3145058,0.002096776,0.6821224,0.00008414852,0.0002140132,0.0008705652,0.00007747721,0.00001723046,0.00001159106],"genre_scores_gemma":[0.5528506,0.00001333304,0.4459531,0.0003007598,0.000364491,0.0001484737,0.0003092605,0.00004526139,0.00001470535],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7839667,"threshold_uncertainty_score":0.9999481,"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."}}