{"id":"W1578303271","doi":"10.1007/978-3-540-69733-6_26","title":"Quasi-bicliques: Complexity and Binding Pairs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Vertex (graph theory); Time complexity; Heuristic; Combinatorics; Greedy algorithm; Benchmark (surveying); Algorithm; Theoretical computer science; Graph; Mathematics; Artificial intelligence","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.000285197,0.0002765463,0.00025463,0.0001349648,0.0001766954,0.00008651715,0.0004300625,0.0003276716,0.000008572135],"category_scores_gemma":[0.00001956074,0.000253191,0.00006583337,0.00006872795,0.0009287929,0.000007704375,0.0004915958,0.0003158124,0.000007051917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003843524,"about_ca_system_score_gemma":0.000155389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001058417,"about_ca_topic_score_gemma":0.00007466489,"domain_scores_codex":[0.9986466,0.00001089038,0.0002754519,0.000543987,0.0001988561,0.0003241882],"domain_scores_gemma":[0.9992317,0.00003333722,0.0001381531,0.000429324,0.00006332206,0.000104155],"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.00005008763,0.00006746518,0.0004295091,0.0001413419,0.00005352667,0.00005023202,0.001034025,0.003361478,0.002815358,0.002640216,0.001166773,0.98819],"study_design_scores_gemma":[0.003734626,0.005838227,0.001172689,0.002160691,0.00009999533,0.002148692,0.000006879392,0.5064844,0.02403547,0.2079177,0.2385204,0.00788017],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004536986,0.001317746,0.987713,0.0002033425,0.0005036142,0.0002456418,0.00001671429,0.00002045924,0.005442528],"genre_scores_gemma":[0.8367336,0.002796586,0.1554756,0.002542109,0.001414485,0.000007017031,0.0001419135,0.00006986268,0.0008188429],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9803098,"threshold_uncertainty_score":0.999992,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02010467174000157,"score_gpt":0.239247378394841,"score_spread":0.2191427066548395,"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."}}