{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002159536,0.0001864909,0.0002850751,0.0001594549,0.000316039,0.0003359932,0.001221785,0.00005761472,0.00001803009],"category_scores_gemma":[0.0001119624,0.0001407388,0.00004173912,0.0006218287,0.001696473,0.001179545,0.001358089,0.0001463056,0.00002206318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004414668,"about_ca_system_score_gemma":0.00007606014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006447243,"about_ca_topic_score_gemma":0.000001926171,"domain_scores_codex":[0.9978343,0.0001004082,0.0002818612,0.0006033267,0.0004403818,0.0007396901],"domain_scores_gemma":[0.9984227,0.0004566819,0.00007486154,0.0005974925,0.00009314488,0.0003551607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003477988,0.0001062711,0.001020538,0.00001040273,0.00000220383,0.000006469925,0.0006602316,0.00001324807,0.001716853,0.9628594,0.0001990845,0.03337054],"study_design_scores_gemma":[0.0006784546,0.0001514214,0.003827511,0.0000544968,0.000004446381,0.00005504823,0.000008261227,0.9371369,0.002781411,0.05468297,0.0003498531,0.000269243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1487347,0.00008591694,0.8496006,0.0004249848,0.0003739943,0.0002730227,0.000009152912,0.0001012185,0.0003964101],"genre_scores_gemma":[0.7699088,0.0000057944,0.2296979,0.0002785512,0.00008485714,0.0000102133,0.000001534557,0.000005054196,0.000007320192],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9371237,"threshold_uncertainty_score":0.6250727,"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."}}