{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003884261,0.0006533817,0.002027705,0.001670947,0.002505797,0.004683914,0.002605163,0.00484854,0.0154779],"category_scores_gemma":[0.03045321,0.0006267787,0.001584745,0.002036527,0.004538977,0.02022988,0.002939455,0.004975226,0.004072432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001563393,"about_ca_system_score_gemma":0.001760374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001423911,"about_ca_topic_score_gemma":0.001071415,"domain_scores_codex":[0.996106,0.001358076,0.0002002659,0.0008758495,0.0008973215,0.0005623515],"domain_scores_gemma":[0.9846308,0.008275791,0.0003940124,0.004580023,0.001600879,0.0005185139],"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.0005599413,0.0001848147,0.001627152,0.0004377609,0.00009708423,0.000288732,0.0003787685,0.01670888,0.003062041,0.8287592,0.04366541,0.1042301],"study_design_scores_gemma":[0.00006576045,0.00004275651,0.0001297718,0.00005501717,0.00002943532,0.0002496291,0.0001502315,0.032093,0.002093766,0.9555799,0.00948569,0.00002510289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1828158,0.007971285,0.6464126,0.05224514,0.004475812,0.0003426769,0.001158026,0.006204479,0.09837423],"genre_scores_gemma":[0.6962422,0.002356497,0.2553937,0.006216392,0.001709471,0.0002438372,0.001379641,0.002464626,0.03399372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0154779,"threshold_uncertainty_score":0.05177873,"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."}}