{"id":"W2964152270","doi":"","title":"Algorithms to Compute the Lyndon Array.","year":2016,"lang":"en","type":"article","venue":"Murdoch Research Repository (Murdoch University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Suffix array; Compressed suffix array; Computation; Computer science; Suffix; Algorithm; Time complexity; Conjecture; Quadratic equation; Inverse; Data structure; Theoretical computer science; Mathematics; Discrete mathematics; Suffix tree","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.001763702,0.00122538,0.001094512,0.002522884,0.001450667,0.003037889,0.002442578,0.001368692,0.01592175],"category_scores_gemma":[0.01070576,0.0005647948,0.001125315,0.002982442,0.001303644,0.005149497,0.004096819,0.00191934,0.008234615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344512,"about_ca_system_score_gemma":0.002683192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001620477,"about_ca_topic_score_gemma":0.003587984,"domain_scores_codex":[0.9979495,0.0003209338,0.0002694232,0.0004012013,0.0007993053,0.00025959],"domain_scores_gemma":[0.9958402,0.001230147,0.0003032442,0.001452187,0.001023644,0.0001505917],"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.000505137,0.0001456747,0.001935303,0.0004846148,0.00007659264,0.0001819805,0.0004862077,0.01503753,0.01902322,0.1486168,0.01954235,0.7939646],"study_design_scores_gemma":[0.0002572949,0.0004498059,0.001408376,0.0002813663,0.0001214175,0.001551264,0.0007623527,0.4064542,0.08459791,0.3549545,0.1489523,0.0002092258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003607027,0.0003118202,0.9876986,0.0001280096,0.0001019938,0.0001445848,0.0001396072,0.003253523,0.004614791],"genre_scores_gemma":[0.04620064,0.0003122342,0.9449395,0.0001631621,0.00007112859,0.0004144534,0.0009172105,0.0005471375,0.006434537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01592175,"threshold_uncertainty_score":0.05326355,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04782579081001204,"score_gpt":0.2893956958418437,"score_spread":0.2415699050318316,"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."}}