{"id":"W3125798661","doi":"10.20944/preprints202009.0557.v1","title":"Computing Maximal Lyndon Substrings of a String","year":2020,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Suffix array; Suffix tree; Generalized suffix tree; String (physics); Algorithm; Time complexity; Suffix; Compressed suffix array; Mathematics; Combinatorics; String searching algorithm; Sorting; Computer science; Discrete mathematics; Data structure; Pattern matching; Artificial intelligence","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.0009588781,0.0008489107,0.001634597,0.00206314,0.001268184,0.002717518,0.001214022,0.001328295,0.007966629],"category_scores_gemma":[0.008512985,0.0005396843,0.001541928,0.00206866,0.001454956,0.00539631,0.002138197,0.001268848,0.003642097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095706,"about_ca_system_score_gemma":0.001582114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001652719,"about_ca_topic_score_gemma":0.002932337,"domain_scores_codex":[0.99843,0.0001675804,0.0002287982,0.000544824,0.0003945655,0.0002343127],"domain_scores_gemma":[0.9972271,0.001244185,0.0002474614,0.0005939681,0.0005520096,0.0001352131],"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.002412991,0.0002732161,0.009546382,0.001292606,0.0002046071,0.001554024,0.002328384,0.05724059,0.09840176,0.2348163,0.009932103,0.581997],"study_design_scores_gemma":[0.0001345755,0.0006337585,0.002491748,0.0003235249,0.0001237515,0.0009888802,0.001018166,0.3259956,0.09030355,0.5433238,0.03446484,0.0001978155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1162954,0.0006313334,0.8688014,0.0002669848,0.0001647469,0.0001313917,0.0009329045,0.005073702,0.007702167],"genre_scores_gemma":[0.3441857,0.0002948188,0.6436185,0.0002466637,0.0001039797,0.0001792218,0.002981904,0.0008246046,0.007564558],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007966629,"threshold_uncertainty_score":0.02665108,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1394014060639709,"score_gpt":0.3351850256452111,"score_spread":0.1957836195812402,"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."}}