{"id":"W6891678007","doi":"10.4230/lipics.cpm.2023.2","title":"Approximation Algorithms for the Longest Run Subsequence Problem","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Subsequence; Longest increasing subsequence; Longest common subsequence problem; String (physics); Symbol (formal); Sequence (biology); Bounded function","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.002561023,0.002238272,0.002495346,0.001949526,0.001039376,0.002491438,0.00357426,0.002019578,0.004417579],"category_scores_gemma":[0.01616757,0.0007796068,0.001821311,0.003897469,0.00128828,0.005577809,0.002234324,0.003631724,0.00156022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002106957,"about_ca_system_score_gemma":0.002641205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003040572,"about_ca_topic_score_gemma":0.002893449,"domain_scores_codex":[0.9964455,0.0008280355,0.0002989685,0.0009567731,0.0008987036,0.0005719777],"domain_scores_gemma":[0.991823,0.005577621,0.0006247544,0.001206329,0.000536359,0.0002319244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001090633,0.0005875996,0.002847334,0.0009999857,0.0003169741,0.0003328789,0.0005100078,0.6388187,0.005301556,0.07215711,0.01783416,0.259203],"study_design_scores_gemma":[0.0001107968,0.0001118424,0.0002388251,0.00004460754,0.00004298678,0.0001694957,0.00006872059,0.9041402,0.00154347,0.09103243,0.002477785,0.00001883517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03891581,0.002742175,0.9479781,0.001093676,0.0002173968,0.0001620479,0.0006499711,0.002918377,0.0053224],"genre_scores_gemma":[0.3356275,0.002181089,0.6511598,0.0005607096,0.0005103766,0.0005518174,0.003619651,0.0008557035,0.004933334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004417579,"threshold_uncertainty_score":0.01528704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03699491195130999,"score_gpt":0.2847968448206783,"score_spread":0.2478019328693683,"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."}}