{"id":"https://openalex.org/W3178002565","doi":"https://doi.org/10.1017/9781108835831.005","title":"Efficient Data Structures","display_name":"Efficient Data Structures","publication_year":2021,"publication_date":"2021-05-31","ids":{"openalex":"https://openalex.org/W3178002565","doi":"https://doi.org/10.1017/9781108835831.005","mag":"3178002565"},"language":"en","primary_location":{"id":"doi:10.1017/9781108835831.005","doi":"https://doi.org/10.1017/9781108835831.005","is_oa":false,"landing_page_url":"https://doi.org/10.1017/9781108835831.005","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"125 Problems in Text Algorithms","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W4256281879","display_name":"125 Problems in Text Algorithms: with Solutions","relationship":"volume"}],"lineage":["https://openalex.org/W3178002565","https://openalex.org/W4256281879"],"child_works_count":0,"type":"book-chapter","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081848578","display_name":"Maxime Crochemore","orcid":"https://orcid.org/0000-0003-1087-1419","observed_orcids":["https://orcid.org/0000-0003-1087-1419"]},"institutions":[{"id":"https://openalex.org/I4405278519","display_name":"P\u00f4le de recherche et d'enseignement sup\u00e9rieur Universit\u00e9 Paris-Est","ror":"https://ror.org/005hkz789","country_code":"FR","type":"education","lineage":["https://openalex.org/I2800365227","https://openalex.org/I4405278519"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Maxime Crochemore","raw_affiliation_strings":["Universit\u00e9 Paris-Est"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Est","institution_ids":["https://openalex.org/I4405278519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052475314","display_name":"Thierry Lecroq B","orcid":"https://orcid.org/0000-0002-1900-3397","observed_orcids":["https://orcid.org/0000-0002-1900-3397"]},"institutions":[{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thierry Lecroq","raw_affiliation_strings":["University of Rouen Normandy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rouen Normandy","institution_ids":["https://openalex.org/I62396329"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079957387","display_name":"Wojciech Rytter","orcid":"https://orcid.org/0000-0002-9162-6724","observed_orcids":["https://orcid.org/0000-0002-9162-6724"]},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Wojciech Rytter","raw_affiliation_strings":["Warsaw University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Warsaw University","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T11567","display_name":"semigroups and automata theory","score":0.0,"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"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/text-indexing","display_name":"text indexing","score":0.9539999961853027},{"id":"https://openalex.org/keywords/suffix-trees","display_name":"suffix trees","score":0.9670000076293945},{"id":"https://openalex.org/keywords/suffix-automata","display_name":"suffix automata","score":0.8450000286102295},{"id":"https://openalex.org/keywords/suffix-arrays","display_name":"suffix arrays","score":1.0},{"id":"https://openalex.org/keywords/de-bruijn-graph","display_name":"de Bruijn graph","score":0.8579999804496765}],"concepts":[{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.7205420732498169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6904547214508057},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6305785179138184},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6182198524475098},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.6016445159912109},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.5361988544464111},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.5178699493408203},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5120273232460022},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42838355898857117},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.3832886815071106},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2690473794937134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23775514960289001},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16183778643608093},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07884860038757324},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.07660821080207825},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/9781108835831.005","doi":"https://doi.org/10.1017/9781108835831.005","is_oa":false,"landing_page_url":"https://doi.org/10.1017/9781108835831.005","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"125 Problems in Text Algorithms","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2279536699","https://openalex.org/W7082162085","https://openalex.org/W69757616","https://openalex.org/W4387083975","https://openalex.org/W2200019713","https://openalex.org/W1503962612","https://openalex.org/W4252935496","https://openalex.org/W4212784367","https://openalex.org/W1556086214","https://openalex.org/W2527540123"],"abstract_inverted_index":{"The":[0,30],"chapter":[1,77],"is":[2],"about":[3],"data":[4,32],"structures":[5,33,82],"for":[6,96],"text":[7,36,58],"indexing.":[8],"They":[9],"are":[10,38,67,78,92],"used":[11],"as":[12,45,47,94],"fundamental":[13],"tools":[14,95],"in":[15,59,75],"a":[16,57,60,69],"large":[17],"amount":[18],"of":[19,49,56,68],"algorithms,":[20],"represented":[21],"by":[22],"special":[23,64,98],"arrays":[24,44],"and":[25,41,102],"trees":[26,40],"associated":[27],"with":[28,83],"texts.":[29],"main":[31],"related":[34,79],"to":[35,80],"algorithmics":[37],"Suffix":[39,43],"automata,":[42],"well":[46],"dictionaries":[48],"basic":[50],"factors.":[51],"All":[52],"represent":[53],"all":[54],"factors":[55],"compact":[61],"way.":[62],"For":[63],"words":[65],"they":[66],"very":[70],"specific":[71],"form.":[72],"Many":[73],"problems":[74],"this":[76],"such":[81],"emphasis":[84],"on":[85],"their":[86],"applications.":[87],"Also":[88],"de":[89],"Bruijn":[90],"graphs":[91],"shown":[93],"creating":[97],"non-trivial":[99],"words:":[100],"dense":[101],"perfect":[103],"words.":[104]},"counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2021-07-19T00:00:00"}