{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002179623,0.0001869075,0.0002105005,0.0002965841,0.0003913267,0.0006580037,0.003012676,0.00005346065,0.00001173596],"category_scores_gemma":[0.0001243486,0.0001497505,0.0000414337,0.001675325,0.001228992,0.0018845,0.001545565,0.0002551679,0.00005689594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001511799,"about_ca_system_score_gemma":0.0002276536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001090708,"about_ca_topic_score_gemma":0.000007979629,"domain_scores_codex":[0.9973484,0.0001126212,0.0003063611,0.0008231644,0.0007291951,0.0006803194],"domain_scores_gemma":[0.9986191,0.0001920331,0.00005428046,0.0007825803,0.00009006623,0.0002619584],"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.00000508974,0.00005146077,0.0002956559,0.000003397903,7.513318e-7,0.00008837901,0.0003609066,0.001779412,0.001139731,0.9738805,0.000002057076,0.02239264],"study_design_scores_gemma":[0.0007407537,0.0002270518,0.01350622,0.0002794607,0.000002424542,0.0003246097,0.00001916222,0.631959,0.01271775,0.3396528,0.00006193501,0.0005088016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2563726,0.00005461818,0.741366,0.0006668781,0.0003976665,0.0001048816,6.978919e-7,0.0001322614,0.0009044835],"genre_scores_gemma":[0.7304872,0.000007482661,0.269155,0.0002512895,0.00009000266,0.000003406707,5.638332e-7,0.000004409621,7.145033e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6342278,"threshold_uncertainty_score":0.6345145,"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."}}