{"id":"W2167200109","doi":"10.1109/dcc.2010.67","title":"Optimum String Match Choices in LZSS","year":2010,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Acadia University","funders":"","keywords":"String (physics); Computer science; Set (abstract data type); Compression (physics); Data compression; String searching algorithm; Algorithm; Greedy algorithm; Compression ratio; Mathematics; Artificial intelligence; Engineering; Pattern matching","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.001757804,0.0007607272,0.001191742,0.002343092,0.001267089,0.001991304,0.001584631,0.001542287,0.009171733],"category_scores_gemma":[0.00965644,0.0004588127,0.0006016613,0.002913815,0.001519714,0.003825578,0.002425697,0.001021271,0.003996029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001076655,"about_ca_system_score_gemma":0.001313088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006720021,"about_ca_topic_score_gemma":0.001195485,"domain_scores_codex":[0.9968058,0.0008443518,0.0003076245,0.0003526584,0.001391854,0.000297787],"domain_scores_gemma":[0.9976411,0.001123434,0.0001907281,0.0005672032,0.0003956074,0.00008203091],"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.001960766,0.0001782743,0.001922967,0.0004771287,0.00006875383,0.0003172745,0.0006678302,0.09405237,0.03329664,0.196338,0.01413169,0.6565883],"study_design_scores_gemma":[0.0003042845,0.00054431,0.0007896913,0.0002218724,0.00007740466,0.0008028339,0.0005300607,0.4900669,0.1129151,0.3447582,0.04884671,0.0001427623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07825129,0.001585716,0.9002277,0.0004925096,0.0001156658,0.0002937019,0.0006014119,0.003662172,0.01476986],"genre_scores_gemma":[0.2945114,0.0007490076,0.6929526,0.0002617845,0.0001155166,0.0004252778,0.001178003,0.0007761658,0.009030335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009171733,"threshold_uncertainty_score":0.0306825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009385781601101092,"score_gpt":0.2495336743216183,"score_spread":0.2401478927205172,"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."}}