{"id":"https://openalex.org/W3093330059","doi":"https://doi.org/10.1145/3679015","title":"Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences","display_name":"Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences","publication_year":2024,"publication_date":"2024-07-26","ids":{"openalex":"https://openalex.org/W3093330059","doi":"https://doi.org/10.1145/3679015","mag":"3093330059"},"language":"en","primary_location":{"id":"doi:10.1145/3679015","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3679015","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3679015","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3679015","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009388805","display_name":"Evan Sala","orcid":null},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Evan Sala","raw_affiliation_strings":["University of Guelph, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"University of Guelph, Ontario, Canada","institution_ids":["https://openalex.org/I79817857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060694274","display_name":"Joe Sawada","orcid":"https://orcid.org/0000-0001-7364-2993"},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Joe Sawada","raw_affiliation_strings":["University of Guelph, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"University of Guelph, Ontario, Canada","institution_ids":["https://openalex.org/I79817857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053886187","display_name":"Abbas Alhakim","orcid":"https://orcid.org/0000-0002-2995-3740"},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Abbas Alhakim","raw_affiliation_strings":["American University of Beirut, Beirut, Lebanon"],"affiliations":[{"raw_affiliation_string":"American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009388805"],"corresponding_institution_ids":["https://openalex.org/I79817857"],"apc_list":null,"apc_paid":null,"fwci":0.3626,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60588775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"21","issue":"1","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9753000140190125,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.9881019592285156},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.7606374621391296},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5941123366355896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5580610036849976},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5472497940063477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5055232048034668},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.45637381076812744},{"id":"https://openalex.org/keywords/de-bruijn-graph","display_name":"De Bruijn graph","score":0.43763479590415955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39123377203941345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37137818336486816},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3481088876724243},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33155500888824463}],"concepts":[{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.9881019592285156},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.7606374621391296},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5941123366355896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5580610036849976},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5472497940063477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5055232048034668},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45637381076812744},{"id":"https://openalex.org/C20218877","wikidata":"https://www.wikidata.org/wiki/Q3066095","display_name":"De Bruijn graph","level":3,"score":0.43763479590415955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39123377203941345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37137818336486816},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3481088876724243},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33155500888824463},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3679015","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3679015","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3679015","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3679015","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3679015","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3679015","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3093330059.pdf"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W133997040","https://openalex.org/W1480210121","https://openalex.org/W1745342855","https://openalex.org/W1965627014","https://openalex.org/W1973220679","https://openalex.org/W1976395511","https://openalex.org/W1995300673","https://openalex.org/W2007453203","https://openalex.org/W2024334686","https://openalex.org/W2027662810","https://openalex.org/W2039807365","https://openalex.org/W2041391522","https://openalex.org/W2073103034","https://openalex.org/W2075879870","https://openalex.org/W2081569145","https://openalex.org/W2136651963","https://openalex.org/W2293974372","https://openalex.org/W2294002006","https://openalex.org/W2563737235","https://openalex.org/W2592570088","https://openalex.org/W2795040290","https://openalex.org/W2799851485","https://openalex.org/W2885945836","https://openalex.org/W2886418347","https://openalex.org/W2913925549","https://openalex.org/W2961176507","https://openalex.org/W2963943201","https://openalex.org/W3023517918","https://openalex.org/W3101685628","https://openalex.org/W4231084617","https://openalex.org/W4234417735","https://openalex.org/W4294860891","https://openalex.org/W6697139589","https://openalex.org/W7073683553"],"related_works":["https://openalex.org/W2562683361","https://openalex.org/W3087469195","https://openalex.org/W2354744388","https://openalex.org/W3125399386","https://openalex.org/W2949121831","https://openalex.org/W1908987670","https://openalex.org/W2756186577","https://openalex.org/W2735897904","https://openalex.org/W3215786367","https://openalex.org/W3021341025"],"abstract_inverted_index":{"The":[0],"greedy":[1,20],"Prefer-same":[2,61,81],"de":[3,39,43,62,82,121],"Bruijn":[4,40,44,63,83,122],"sequence":[5,64,84],"construction":[6,58],"was":[7],"first":[8],"presented":[9],"by":[10,90],"Eldert,":[11],"Gray,":[12],"Gurk,":[13],"and":[14,85,103],"Rubinoff":[15],"in":[16],"1958.":[17],"As":[18],"a":[19,67,108],"algorithm,":[21],"it":[22,27,97],"has":[23,65],"one":[24],"major":[25],"downside:":[26],"requires":[28],"an":[29,56,92,114],"exponential":[30],"amount":[31],"of":[32,79],"space":[33],"to":[34,95,117],"store":[35],"the":[36,51,60,76,80,87,119],"length":[37],"\\(2^{n}\\)":[38],"sequence.":[41,123],"Though":[42],"sequences":[45],"have":[46],"been":[47],"heavily":[48],"studied":[49],"over":[50],"last":[52],"60":[53],"years,":[54],"finding":[55],"efficient":[57,93,115],"for":[59],"remained":[66],"tantalizing":[68],"open":[69,88],"problem.":[70],"In":[71],"this":[72],"article,":[73],"we":[74,111],"unveil":[75],"underlying":[77],"structure":[78],"solve":[86],"problem":[89],"presenting":[91],"algorithm":[94,116],"construct":[96,118],"using":[98],"\\(O(n)\\)":[99,105],"time":[100],"per":[101],"bit":[102],"only":[104],"space.":[106],"Following":[107],"similar":[109],"approach,":[110],"also":[112],"present":[113],"Prefer-opposite":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}