{"id":"W2040262311","doi":"10.1016/j.tcs.2012.01.013","title":"A Gray code for fixed-density necklaces and Lyndon words in constant amortized time","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; University of Guelph","funders":"","keywords":"De Bruijn sequence; Gray code; Amortized analysis; Mathematics; Combinatorics; Constant (computer programming); Binary number; Code (set theory); Polyomino; Discrete mathematics; Algorithm; Data structure; Arithmetic; Computer science; Set (abstract data type); Geometry","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.001579284,0.001263966,0.001827102,0.002350037,0.00179936,0.003787992,0.00252917,0.002578718,0.01050397],"category_scores_gemma":[0.01397504,0.0008028395,0.001161048,0.003899713,0.003211501,0.006659115,0.005008792,0.003055786,0.002171353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004038216,"about_ca_system_score_gemma":0.003609769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003987259,"about_ca_topic_score_gemma":0.004253664,"domain_scores_codex":[0.9980763,0.0003413269,0.0001491817,0.0003943045,0.0006632746,0.0003755595],"domain_scores_gemma":[0.9926801,0.003862723,0.0004189968,0.001813191,0.0007204829,0.0005045713],"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.001386148,0.0002808652,0.001153366,0.0003820139,0.00009508632,0.0002965057,0.000640147,0.07618368,0.01140807,0.7192171,0.02642685,0.1625303],"study_design_scores_gemma":[0.0001697503,0.000145091,0.0002536501,0.0001100094,0.00006481023,0.0001833307,0.0001101016,0.2001497,0.005146902,0.7868094,0.006781194,0.00007596749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2696196,0.002236097,0.6869753,0.003413781,0.0006167836,0.0004717481,0.001694356,0.004867482,0.0301049],"genre_scores_gemma":[0.6410084,0.001019731,0.3280175,0.001305442,0.0003470479,0.0009665004,0.001530592,0.001238405,0.02456634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01050397,"threshold_uncertainty_score":0.03513932,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00957280733346831,"score_gpt":0.2551489312165006,"score_spread":0.2455761238830323,"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."}}