{"id":"W2145838433","doi":"10.1007/11496656_2","title":"On the Longest Common Rigid Subsequence Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest common subsequence problem; Substring; Subsequence; Time complexity; Longest increasing subsequence; Combinatorics; Computer science; Similarity (geometry); Algorithm; Mathematics; Artificial intelligence; Data structure","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001136836,0.0006499626,0.0005031497,0.0004557385,0.0005872334,0.0009607337,0.007325766,0.0003100723,0.00006552604],"category_scores_gemma":[0.00005925614,0.0004248878,0.0001356836,0.0005942241,0.0009171526,0.0008200011,0.002323249,0.001409265,0.0002245636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003244781,"about_ca_system_score_gemma":0.0004251788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004839776,"about_ca_topic_score_gemma":0.00012344,"domain_scores_codex":[0.9953818,0.00006709416,0.0005480824,0.001745674,0.001466242,0.0007910585],"domain_scores_gemma":[0.9953548,0.00107894,0.0003543986,0.002836836,0.0001799276,0.0001951098],"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.000005740723,0.00004458975,0.00001523085,0.00001496501,0.000006934521,0.0001033565,0.0002808868,0.01813998,0.00004616248,0.2608595,0.0003422268,0.7201403],"study_design_scores_gemma":[0.0002270604,0.0003095558,0.0001287216,0.0008745256,0.000006995175,0.0001328589,1.040069e-7,0.4872121,0.0009972041,0.4951969,0.01397125,0.0009427294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009154583,0.0004240237,0.9825841,0.004125556,0.001080567,0.0005621882,0.00001336953,0.0002011412,0.01091755],"genre_scores_gemma":[0.200054,0.0002711017,0.7807804,0.01460597,0.002107529,0.00006466865,0.00003096107,0.0001216463,0.001963664],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7191976,"threshold_uncertainty_score":0.9998203,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01861443766463373,"score_gpt":0.2435803459182233,"score_spread":0.2249659082535896,"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."}}