{"id":"W4413071359","doi":"10.1007/978-3-031-98740-3_17","title":"A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Longest common subsequence problem; Computer science; Longest increasing subsequence; Subsequence; Algorithm; Space (punctuation); Theoretical computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.000755321,0.001438426,0.001454464,0.002869139,0.001286269,0.001649043,0.002080313,0.001154325,0.009587023],"category_scores_gemma":[0.00312014,0.0005880828,0.001273124,0.00437319,0.0006375572,0.002515933,0.002116856,0.001369637,0.004870791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008460279,"about_ca_system_score_gemma":0.002442623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002464749,"about_ca_topic_score_gemma":0.003343287,"domain_scores_codex":[0.9987166,0.0001369217,0.0001429661,0.0003717883,0.0005053136,0.0001265135],"domain_scores_gemma":[0.9985683,0.0004627879,0.00009091529,0.0003405598,0.0004652277,0.00007221158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003745886,0.0001897627,0.0006026221,0.0002782403,0.0000687854,0.0001849232,0.0002116333,0.01352118,0.04215283,0.01830817,0.011147,0.9129602],"study_design_scores_gemma":[0.0004180644,0.0008699398,0.001876805,0.0001232416,0.0001730296,0.002053959,0.0005919134,0.7555748,0.09385884,0.0822195,0.06210354,0.0001364329],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01579904,0.0005729226,0.9756588,0.000124291,0.0002020153,0.0002786649,0.0004404192,0.00428855,0.002635262],"genre_scores_gemma":[0.03683948,0.0001739266,0.9570369,0.00004983618,0.00005133319,0.0002245458,0.001458717,0.0002246564,0.003940585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009587023,"threshold_uncertainty_score":0.03207177,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01818424227148864,"score_gpt":0.2780371640264606,"score_spread":0.259852921754972,"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."}}