{"id":"W2586556622","doi":"10.1016/j.jda.2017.01.003","title":"Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences","year":2017,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Lexicographical order; Substring; Combinatorics; Ranking (information retrieval); Rank (graph theory); Sequence (biology); Mathematics; Order (exchange); Algorithm; Simple (philosophy); Computer science; Artificial intelligence; Data structure","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001569397,0.0002990346,0.0005215186,0.0002072885,0.0007021487,0.001599431,0.002025577,0.0001431481,0.0000250336],"category_scores_gemma":[0.0005697858,0.0002235097,0.0001554191,0.0001712164,0.0001863267,0.003465693,0.001044842,0.0005562714,0.0000178019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008932915,"about_ca_system_score_gemma":0.000358887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002156208,"about_ca_topic_score_gemma":0.00001337167,"domain_scores_codex":[0.9972821,0.0001627098,0.0006558573,0.0004679642,0.0008506373,0.0005806785],"domain_scores_gemma":[0.9969097,0.0002235322,0.0008801568,0.001004456,0.0002520574,0.0007301115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002682064,0.0003628517,0.002773093,0.00007656132,0.0003388594,0.002887154,0.003024006,0.0001987118,0.003229006,0.007062002,0.04410786,0.9356717],"study_design_scores_gemma":[0.008365977,0.00475555,0.0553032,0.001683972,0.0003299242,0.01356167,0.001386249,0.7104862,0.01083965,0.02329032,0.1672375,0.002759739],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01183126,0.0008779765,0.9710934,0.01391018,0.001290191,0.0002040689,0.00002391045,0.00004557865,0.0007234545],"genre_scores_gemma":[0.1052202,0.0008227425,0.8920607,0.0004893059,0.001099834,0.000007173846,0.000002427994,0.0000262608,0.0002713299],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9329119,"threshold_uncertainty_score":0.999437,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03259474542133807,"score_gpt":0.3431906005152647,"score_spread":0.3105958550939267,"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."}}