{"id":"https://openalex.org/W87719666","doi":null,"title":"A space efficient representation for sparse de Bruijn subgraphs","display_name":"A space efficient representation for sparse de Bruijn subgraphs","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W87719666","mag":"87719666"},"language":"nl","primary_location":{"id":"pmh:oai:pub.librecat.org:1970459","doi":null,"is_oa":true,"landing_page_url":"https://pub.uni-bielefeld.de/record/1970459","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Quitzau JAA, Stoye J. &lt;em&gt;A space efficient representation for sparse de Bruijn subgraphs&lt;/em&gt;. Forschungsberichte der Technischen Fakult\u00e4t, Abteilung Informationstechnik / Universit\u00e4t Bielefeld. Bielefeld: Technische Fakult\u00e4t der Universit\u00e4t Bielefeld; 2008.","raw_type":"info:eu-repo/semantics/report"},"parent_works":[],"lineage":["https://openalex.org/W87719666"],"child_works_count":0,"type":"report","is_traditional":false,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pub.uni-bielefeld.de/record/1970459","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081013759","display_name":"Jos\u00e9 Augusto Amgarten Quitzau","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jos\u00e9 Augusto Amgarten Quitzau","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019771245","display_name":"Jens Stoye","orcid":"https://orcid.org/0000-0002-4656-7155","observed_orcids":["https://orcid.org/0000-0002-4656-7155"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jens Stoye","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.003000000026077032,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12946","display_name":"Fractal and DNA sequence analysis","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/de-bruijn-graph","display_name":"de Bruijn graph","score":0.9860000014305115},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.6039999723434448},{"id":"https://openalex.org/keywords/graph-representation","display_name":"graph representation","score":0.6029999852180481},{"id":"https://openalex.org/keywords/spatial-efficiency","display_name":"space efficiency","score":0.8220000267028809},{"id":"https://openalex.org/keywords/graph-construction-algorithm","display_name":"graph construction algorithm","score":0.7139999866485596},{"id":"https://openalex.org/keywords/genome-assembly","display_name":"genome assembly","score":0.40400001406669617}],"concepts":[{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.9459114670753479},{"id":"https://openalex.org/C20218877","wikidata":"https://www.wikidata.org/wiki/Q3066095","display_name":"De Bruijn graph","level":3,"score":0.8671100735664368},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6720683574676514},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5262340903282166},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.387204647064209},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3256072402000427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32245078682899475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2499777376651764}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:pub.librecat.org:1970459","doi":null,"is_oa":true,"landing_page_url":"https://pub.uni-bielefeld.de/record/1970459","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Quitzau JAA, Stoye J. &lt;em&gt;A space efficient representation for sparse de Bruijn subgraphs&lt;/em&gt;. Forschungsberichte der Technischen Fakult\u00e4t, Abteilung Informationstechnik / Universit\u00e4t Bielefeld. Bielefeld: Technische Fakult\u00e4t der Universit\u00e4t Bielefeld; 2008.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:pub.uni-bielefeld.de:1970459","doi":null,"is_oa":true,"landing_page_url":"https://pub.uni-bielefeld.de/record/1970459","pdf_url":null,"source":{"id":"https://openalex.org/S4306401624","display_name":"Publikationen an der Universit\u00e4t Bielefeld (Universit\u00e4t Bielefeld)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Quitzau JAA, Stoye J. &lt;em&gt;A space efficient representation for sparse de Bruijn subgraphs&lt;/em&gt;. Forschungsberichte der Technischen Fakult\u00e4t, Abteilung Informationstechnik / Universit\u00e4t Bielefeld. Bielefeld: Technische Fakult\u00e4t der Universit\u00e4t Bielefeld; 2008.","raw_type":"info:eu-repo/semantics/report"},{"id":"mag:87719666","doi":null,"is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/download/1970459/2319762/report.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:pub.librecat.org:1970459","doi":null,"is_oa":true,"landing_page_url":"https://pub.uni-bielefeld.de/record/1970459","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Quitzau JAA, Stoye J. &lt;em&gt;A space efficient representation for sparse de Bruijn subgraphs&lt;/em&gt;. Forschungsberichte der Technischen Fakult\u00e4t, Abteilung Informationstechnik / Universit\u00e4t Bielefeld. Bielefeld: Technische Fakult\u00e4t der Universit\u00e4t Bielefeld; 2008.","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W87719666.pdf","grobid_xml":"https://content.openalex.org/works/W87719666.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1597782212","https://openalex.org/W1605646407","https://openalex.org/W2022910024","https://openalex.org/W2026035629","https://openalex.org/W2099809434","https://openalex.org/W2129362674","https://openalex.org/W2136651963","https://openalex.org/W2142749416","https://openalex.org/W2151017710","https://openalex.org/W2155845142","https://openalex.org/W2156104322","https://openalex.org/W2160969485","https://openalex.org/W2167673155","https://openalex.org/W2311710385","https://openalex.org/W2798588639","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W6247929","https://openalex.org/W2991761894","https://openalex.org/W3182485537","https://openalex.org/W3177877512","https://openalex.org/W2809002316","https://openalex.org/W2918532537","https://openalex.org/W2122316710","https://openalex.org/W2272733715"],"abstract_inverted_index":{"De":[0],"Bruijn":[1,18,32,79],"graphs":[2,33,110],"are":[3,44,135],"structures":[4],"that":[5,35,131],"appear":[6],"naturally":[7],"in":[8,41,74,122],"the":[9,14,58,77,106,132,139],"study":[10],"of":[11,16,38,60,76,108],"strings.":[12],"Therefore":[13,118],"rise":[15],"de":[17,31,78],"graph":[19,80,126],"based":[20,81,101],"sequence":[21],"analysis":[22],"approaches":[23],"is":[24,34,57,69,111],"not":[25,90],"a":[26,70,112],"surprise.":[27],"The":[28],"problem":[29,56],"with":[30],"for":[36,48],"most":[37],"their":[39],"applications":[40],"Bioinformatics":[42],"they":[43],"too":[45],"large":[46],"even":[47],"small":[49],"genomes.":[50],"A":[51],"way":[52],"to":[53,63,92,137],"overcome":[54],"this":[55,67,123,148],"compression":[59,68],"branch-free":[61],"paths":[62],"single":[64],"nodes.":[65],"Although":[66],"common":[71],"first":[72],"step":[73],"many":[75],"approaches,":[82],"its":[83],"direct":[84],"construction":[85,107,127],"from":[86],"raw":[87],"data":[88],"does":[89],"seem":[91],"be":[93],"documented":[94],"before.":[95],"Our":[96],"experience":[97],"shows":[98],"that,":[99],"though":[100],"on":[102],"simple":[103],"operations,":[104],"implementing":[105],"such":[109],"tricky":[113],"and":[114,129],"time":[115],"consuming":[116],"task.":[117,149],"we":[119,144],"shortly":[120],"describe":[121],"report":[124],"our":[125],"algorithm":[128],"hope":[130],"given":[133],"details":[134],"enough":[136],"help":[138],"reader":[140],"skipping":[141],"some":[142],"pitfalls":[143],"found":[145],"by":[146],"doing":[147]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W87719666","counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
