{"id":"W2503041365","doi":"10.2140/involve.2016.9.657","title":"Avoiding approximate repetitions with respect to the longest common subsequence distance","year":2016,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest common subsequence problem; Hamming distance; Edit distance; Combinatorics; Mathematics; Lemma (botany); Similarity (geometry); Repetition (rhetorical device); Longest increasing subsequence; Entropy (arrow of time); Subsequence; Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Physics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002313885,0.0008845133,0.001541729,0.002727022,0.001352911,0.002091163,0.001594589,0.001509395,0.00181451],"category_scores_gemma":[0.03060734,0.0005627099,0.0009294846,0.003061782,0.003664624,0.005329386,0.003031776,0.001965224,0.0008903972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008645785,"about_ca_system_score_gemma":0.001192953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007324583,"about_ca_topic_score_gemma":0.0005587757,"domain_scores_codex":[0.9952319,0.001344661,0.0004229039,0.0008431903,0.001830825,0.0003263301],"domain_scores_gemma":[0.9765048,0.01432265,0.002503584,0.004238833,0.001961822,0.0004682611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006141009,0.0001297022,0.005118264,0.0004319495,0.0001402966,0.001397873,0.001654901,0.08496412,0.02585291,0.7479605,0.003041571,0.1286938],"study_design_scores_gemma":[0.00007027137,0.0003976364,0.001379986,0.00009729493,0.00008934467,0.001717215,0.0002978125,0.2920916,0.02094508,0.6750339,0.007748488,0.000131379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1424306,0.001197367,0.8469722,0.000443631,0.00008605421,0.0001199236,0.0001905998,0.0006366057,0.007922909],"genre_scores_gemma":[0.6813592,0.0009121406,0.3116345,0.0002973376,0.0003079971,0.0002912578,0.0004868388,0.0002924399,0.004418202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002727022,"threshold_uncertainty_score":0.01223713,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03174359769984818,"score_gpt":0.2618504691778532,"score_spread":0.230106871478005,"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."}}