{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001765545,0.0006767347,0.0009414307,0.0009969572,0.0004231583,0.0004813268,0.004783947,0.0003096529,0.000008148858],"category_scores_gemma":[0.0001533827,0.0005993244,0.000215741,0.0009838421,0.001138314,0.0005850514,0.002419218,0.0006664081,0.000005391306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003566231,"about_ca_system_score_gemma":0.001203578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004584613,"about_ca_topic_score_gemma":0.0001031232,"domain_scores_codex":[0.9951373,0.00008394906,0.0008599666,0.001899268,0.001193069,0.0008264734],"domain_scores_gemma":[0.9950929,0.001597392,0.0006410409,0.001907974,0.0005540653,0.0002066015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001026285,0.00006068646,0.00004840515,0.00009589124,0.00001574863,0.00006082865,0.0002880579,0.02574182,0.0004043689,0.02857115,0.00002828789,0.9446745],"study_design_scores_gemma":[0.000426147,0.000212628,0.000057402,0.001504579,0.00001801558,0.00008827072,4.172547e-7,0.9328724,0.004923658,0.05863158,0.000646562,0.0006183357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002069503,0.00111451,0.9941497,0.0004447374,0.001828574,0.0008542091,0.0001134927,0.0001342235,0.001153611],"genre_scores_gemma":[0.03761991,0.00006728627,0.9613218,0.0004190214,0.0003231545,0.00002541859,0.00003159927,0.00002873956,0.0001631212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9440562,"threshold_uncertainty_score":0.9996458,"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."}}