{"id":"W2111953579","doi":"10.1016/j.tcs.2009.09.014","title":"Why greed works for shortest common superstring problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Tsinghua University; National Science Foundation","keywords":"Greedy algorithm; Mathematics; Algorithm; Combinatorics; Superstring theory; Asymptotically optimal algorithm; Approximation algorithm; Sequence (biology); Biology; Supersymmetry; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163803,0.0002234608,0.0002587776,0.000167231,0.0006669151,0.001026082,0.003422612,0.00007101248,0.00001153279],"category_scores_gemma":[0.00003601639,0.0001766773,0.00008618936,0.0009946314,0.0009008368,0.001586701,0.0008793991,0.0002184402,0.00001340336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005573866,"about_ca_system_score_gemma":0.00007726881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005221429,"about_ca_topic_score_gemma":7.906557e-7,"domain_scores_codex":[0.997345,0.00005130247,0.0003167036,0.0008673719,0.0006254802,0.0007941258],"domain_scores_gemma":[0.9981462,0.0002565686,0.00006273997,0.001016724,0.0001800356,0.0003377096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008986049,0.00006610977,0.00001914076,0.000002801548,0.000001473177,0.000005605069,0.0001326977,0.0002122065,0.0004578625,0.7650108,0.0005327228,0.2335496],"study_design_scores_gemma":[0.0003016742,0.0004466021,0.0005226458,0.00008907908,0.000003886041,0.00003007178,0.000003862674,0.7828078,0.001590758,0.2130735,0.0008669226,0.000263272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004456859,0.00004992885,0.9898965,0.003348213,0.0003951812,0.0003658727,0.000002955703,0.0003054345,0.001179071],"genre_scores_gemma":[0.5928577,0.000003291375,0.4049694,0.002012145,0.0001398742,0.000007246984,0.000002694626,0.000004887236,0.000002796581],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7825955,"threshold_uncertainty_score":0.9894536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01250291370907331,"score_gpt":0.2567674646483736,"score_spread":0.2442645509393003,"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."}}