{"id":"W4411089206","doi":"10.1016/j.ic.2025.105313","title":"The longest subsequence-duplicated subsequence and related problems","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Longest increasing subsequence; Subsequence; Longest common subsequence problem; Combinatorics; Computer science; Mathematics","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.004576685,0.001127116,0.002674761,0.004830769,0.002523317,0.003420404,0.004758306,0.00414265,0.005239595],"category_scores_gemma":[0.03251399,0.0008432693,0.001710744,0.01410168,0.004477306,0.01052,0.003000297,0.003056115,0.001292915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001747502,"about_ca_system_score_gemma":0.00200145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001946028,"about_ca_topic_score_gemma":0.0009711102,"domain_scores_codex":[0.99514,0.001094428,0.0005870175,0.001345866,0.001578249,0.0002544692],"domain_scores_gemma":[0.9757349,0.01708305,0.00192876,0.002828326,0.002061831,0.0003630586],"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.0005445187,0.0002581743,0.003857485,0.001523325,0.0002326181,0.001713096,0.0004657306,0.1046253,0.001945644,0.481295,0.0314611,0.372078],"study_design_scores_gemma":[0.00004629423,0.00006601371,0.000609779,0.0001177227,0.00008480006,0.001294385,0.0001892289,0.1841149,0.002275395,0.801076,0.0100757,0.00004988696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04200187,0.028652,0.9067947,0.007366955,0.002338516,0.0001649014,0.001140362,0.0005227367,0.01101797],"genre_scores_gemma":[0.5103266,0.03436673,0.4121608,0.002031855,0.01195613,0.0005089959,0.004281737,0.0006754139,0.02369161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005239595,"threshold_uncertainty_score":0.02420408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007996093520544739,"score_gpt":0.2384342259044898,"score_spread":0.2304381323839451,"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."}}