{"id":"W2963943201","doi":"10.1016/j.tcs.2018.06.039","title":"Constructing de Bruijn sequences by concatenating smaller universal cycles","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Disjoint sets; De Bruijn graph; Set (abstract data type); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Computer science","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.0006724406,0.0006854437,0.0007600594,0.00139607,0.0008821826,0.001068737,0.0008111831,0.0008313789,0.006490667],"category_scores_gemma":[0.003969496,0.0006643653,0.0007230076,0.001247804,0.000984618,0.002309291,0.002112732,0.001297513,0.001786201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000449285,"about_ca_system_score_gemma":0.0007617638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003683738,"about_ca_topic_score_gemma":0.0007995516,"domain_scores_codex":[0.9992058,0.0002396613,0.00007178794,0.000199061,0.0001588435,0.0001248551],"domain_scores_gemma":[0.9979588,0.0009872675,0.0001255835,0.0006119519,0.0001906684,0.0001257239],"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.0005881865,0.0003390723,0.001638168,0.0005596122,0.00009176021,0.0005627661,0.001067462,0.03997594,0.08554067,0.52435,0.004573265,0.340713],"study_design_scores_gemma":[0.00012113,0.0004752062,0.0008266809,0.0002415473,0.0001272739,0.0007432434,0.0004324067,0.1550192,0.1091684,0.6744726,0.05824148,0.0001306623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2868273,0.0006326654,0.6785478,0.0005382081,0.0004139325,0.0002815669,0.0003263701,0.002259827,0.03017235],"genre_scores_gemma":[0.581486,0.0004870693,0.402062,0.0003408105,0.0001268252,0.0002682919,0.0005989464,0.0008268417,0.01380319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006490667,"threshold_uncertainty_score":0.0217135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01024452300472329,"score_gpt":0.2417172559699828,"score_spread":0.2314727329652595,"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."}}