{"id":"https://openalex.org/W2292972471","doi":"https://doi.org/10.1007/978-3-319-18123-3_22","title":"Tree Contraction for Compressed Suffix Arrays on Modern Processors","display_name":"Tree Contraction for Compressed Suffix Arrays on Modern Processors","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2292972471","doi":"https://doi.org/10.1007/978-3-319-18123-3_22","mag":"2292972471"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-18123-3_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18123-3_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5069198037","display_name":"Takeshi Yamamuro","orcid":null},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Takeshi Yamamuro","raw_affiliation_strings":["NTT Corp., Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"NTT Corp., Tokyo, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030272842","display_name":"Makoto Onizuka","orcid":"https://orcid.org/0000-0001-5559-8300"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Makoto Onizuka","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014920566","display_name":"Toshimori Honjo","orcid":"https://orcid.org/0000-0002-2176-9842"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshimori Honjo","raw_affiliation_strings":["NTT Corp., Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"NTT Corp., Tokyo, Japan","institution_ids":["https://openalex.org/I2251713219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069198037"],"corresponding_institution_ids":["https://openalex.org/I2251713219"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1115116,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"363","last_page":"378"},"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/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/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9962999820709229,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/suffix","display_name":"Suffix","score":0.6334463357925415},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.5543724298477173},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4978668689727783},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4930736720561981},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.46601298451423645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.376506507396698},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2303195297718048},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.10816869139671326},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.07076159119606018}],"concepts":[{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6334463357925415},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.5543724298477173},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4978668689727783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4930736720561981},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.46601298451423645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.376506507396698},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2303195297718048},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.10816869139671326},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.07076159119606018}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-18123-3_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18123-3_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1528475610","https://openalex.org/W1532491137","https://openalex.org/W1949346071","https://openalex.org/W1965853364","https://openalex.org/W1969173824","https://openalex.org/W1971849009","https://openalex.org/W1991780427","https://openalex.org/W2054816578","https://openalex.org/W2073216502","https://openalex.org/W2088386938","https://openalex.org/W2091829363","https://openalex.org/W2097125969","https://openalex.org/W2105220449","https://openalex.org/W2158322625","https://openalex.org/W2395081044","https://openalex.org/W2603663752","https://openalex.org/W2949260550","https://openalex.org/W4232100484","https://openalex.org/W4247806688"],"related_works":["https://openalex.org/W96331545","https://openalex.org/W1548907175","https://openalex.org/W1882920571","https://openalex.org/W2583658747","https://openalex.org/W1517600056","https://openalex.org/W2159942118","https://openalex.org/W2003608043","https://openalex.org/W2036633468","https://openalex.org/W193772702","https://openalex.org/W2160738675"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}