{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001251619,0.0002869086,0.0002771228,0.0007607369,0.001783854,0.0005305895,0.004959772,0.0001191781,0.00003435029],"category_scores_gemma":[0.0001209726,0.0001783821,0.0001558504,0.002261623,0.0003840762,0.0013558,0.002546529,0.0005211733,0.0004557115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004818856,"about_ca_system_score_gemma":0.0003773839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004568267,"about_ca_topic_score_gemma":0.00002450706,"domain_scores_codex":[0.9949281,0.0009490328,0.0002886926,0.001132331,0.001583202,0.001118624],"domain_scores_gemma":[0.9954017,0.0008439202,0.00009995211,0.002283587,0.0007330621,0.0006378271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003420952,0.0007095092,0.001459763,0.00006485635,0.0002817586,0.00414797,0.002382371,0.000131485,0.231037,0.1971269,0.1690529,0.3932634],"study_design_scores_gemma":[0.001124209,0.0005186418,0.003529541,0.0002240275,0.00001147064,0.0001558669,0.0002511352,0.005324697,0.03238422,0.001131393,0.9547818,0.0005629588],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01580637,0.0001453756,0.9297532,0.008179523,0.001251973,0.0008295125,0.0000188417,0.0004516982,0.04356351],"genre_scores_gemma":[0.7748109,0.0003057497,0.08250302,0.000885536,0.002202185,0.00003751044,0.00001219613,0.0001048064,0.1391381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8472502,"threshold_uncertainty_score":0.9995157,"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."}}