{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166012,0.0008852476,0.001629489,0.002383798,0.002685579,0.004405585,0.002367833,0.002228641,0.01657699],"category_scores_gemma":[0.004183694,0.001241924,0.001220979,0.002750596,0.004148508,0.007146516,0.002534305,0.005221101,0.003032991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001096484,"about_ca_system_score_gemma":0.000589488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008344615,"about_ca_topic_score_gemma":0.0007986561,"domain_scores_codex":[0.9986639,0.0003943536,0.00006985866,0.0002880138,0.000429283,0.0001546085],"domain_scores_gemma":[0.9968575,0.002061776,0.0002016698,0.0003289446,0.0003193965,0.0002305972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001719472,0.000009775526,0.00008369041,0.00003612393,0.000004922776,0.00002168268,0.00008111027,0.0009786939,0.000285888,0.9894283,0.002895733,0.006156843],"study_design_scores_gemma":[0.000004093029,0.000004091627,0.00006092395,0.000005080888,0.00000240966,0.0000608973,0.0000282335,0.003741592,0.0001202986,0.993266,0.002700135,0.000006222806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1449755,0.005052837,0.6397597,0.005921342,0.0008776103,0.0001399142,0.001164323,0.0007954366,0.2013134],"genre_scores_gemma":[0.7121685,0.004238546,0.2042481,0.002480528,0.001616828,0.0007844442,0.001849219,0.0007275153,0.07188626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01657699,"threshold_uncertainty_score":0.05545551,"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."}}