{"id":"W2077484872","doi":"10.1016/j.tcs.2004.03.057","title":"Longest increasing subsequences in sliding windows","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"University of Waterloo","keywords":"Subsequence; Sliding window protocol; Longest increasing subsequence; Sequence (biology); Generalization; Longest common subsequence problem; Algorithm; Combinatorics; Mathematics; Window (computing); Computer science; Mathematical analysis","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.0009364019,0.000467196,0.0007423002,0.002206628,0.0006566418,0.001116526,0.0008297624,0.0006147883,0.003019581],"category_scores_gemma":[0.00737418,0.0004854192,0.0004939646,0.00330454,0.0007403917,0.002386305,0.0009485391,0.0008914992,0.0006634741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004413941,"about_ca_system_score_gemma":0.00052075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008252803,"about_ca_topic_score_gemma":0.0008177566,"domain_scores_codex":[0.99913,0.0001480554,0.0001298703,0.0002033503,0.0003057818,0.00008310469],"domain_scores_gemma":[0.9967737,0.001869647,0.0004043932,0.0004292922,0.0003791262,0.0001438742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001328869,0.0002059684,0.007072339,0.0005476286,0.0001276269,0.001558988,0.0009219311,0.08819307,0.04839785,0.35887,0.004483457,0.4882922],"study_design_scores_gemma":[0.0000695733,0.0003089985,0.003751792,0.0001246187,0.0001124388,0.001174354,0.0002616958,0.593795,0.01988249,0.3655175,0.01495625,0.00004528844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1939746,0.002509431,0.7978244,0.0002242531,0.0002201996,0.00008542548,0.0003582597,0.0007411529,0.00406232],"genre_scores_gemma":[0.6871976,0.001839322,0.3006126,0.0001225592,0.0002793147,0.0001906006,0.001257602,0.0002769759,0.008223586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003019581,"threshold_uncertainty_score":0.0101015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0122544783628273,"score_gpt":0.2526647131745715,"score_spread":0.2404102348117441,"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."}}