{"id":"W2136850043","doi":"10.1186/1471-2105-4-2","title":"An automated method for finding molecular complexes in large protein interaction networks","year":2003,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6293,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lunenfeld-Tanenbaum Research Institute; University of Toronto; Mount Sinai Hospital","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Tree traversal; Cluster analysis; Protein Interaction Networks; Protein–protein interaction; Interaction network; Data mining; False positive paradox; Computational biology; Theoretical computer science; Algorithm; Artificial intelligence; Biology; Genetics","routes":{"ca_aff":true,"ca_fund":true,"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.001050482,0.001919187,0.00101863,0.006494888,0.001551686,0.002266301,0.002293383,0.001503326,0.004975339],"category_scores_gemma":[0.006487999,0.0007598197,0.00128664,0.003499652,0.000834992,0.001900799,0.001691962,0.001262429,0.00247788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001514594,"about_ca_system_score_gemma":0.002233903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004420822,"about_ca_topic_score_gemma":0.005955643,"domain_scores_codex":[0.9983436,0.0002585274,0.00009439225,0.0004360038,0.0007879717,0.00007953751],"domain_scores_gemma":[0.9976225,0.001100762,0.000240015,0.0003175036,0.0006254859,0.00009374673],"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.0001985323,0.000165324,0.004114739,0.0005302659,0.0002294411,0.0004100268,0.0002642712,0.07854603,0.02660965,0.02761425,0.01774975,0.8435677],"study_design_scores_gemma":[0.0000641532,0.00004162094,0.001212066,0.00004109973,0.00005347069,0.0005785357,0.00007674003,0.9360606,0.01166092,0.02980494,0.02036384,0.00004201227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003390209,0.000163895,0.9921604,0.000086911,0.00002928253,0.0001438155,0.0003529775,0.003006275,0.0006662793],"genre_scores_gemma":[0.02403232,0.0001195532,0.9733098,0.00004343364,0.00002114662,0.0002410842,0.0009262831,0.000210204,0.001096257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006494888,"threshold_uncertainty_score":0.01664418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01704138690107336,"score_gpt":0.3135825610453267,"score_spread":0.2965411741442533,"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."}}