{"id":"https://openalex.org/W1766660969","doi":"https://doi.org/10.1007/978-3-319-19315-1_5","title":"Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance","display_name":"Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1766660969","doi":"https://doi.org/10.1007/978-3-319-19315-1_5","mag":"1766660969"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-19315-1_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-19315-1_5","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/A5102952570","display_name":"Carl Barton","orcid":"https://orcid.org/0000-0003-1589-0432"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Carl Barton","raw_affiliation_strings":["King\u2019s College London, London, UK","King \u2018s College London"],"affiliations":[{"raw_affiliation_string":"King\u2019s College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King \u2018s College London","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]},{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["AU","GB"],"is_corresponding":false,"raw_author_name":"Costas S. Iliopoulos","raw_affiliation_strings":["King\u2019s College London, London, UK","University of Western Australia, Crawley, Australia","King\u2019s College London","University of Western Australia"],"affiliations":[{"raw_affiliation_string":"King\u2019s College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"University of Western Australia, Crawley, Australia","institution_ids":["https://openalex.org/I177877127"]},{"raw_affiliation_string":"King\u2019s College London","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"University of Western Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051275317","display_name":"Solon P. Pissis","orcid":"https://orcid.org/0000-0002-1445-1932"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Solon P. Pissis","raw_affiliation_strings":["King\u2019s College London, London, UK","King \u2018s College London"],"affiliations":[{"raw_affiliation_string":"King\u2019s College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King \u2018s College London","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108368102","display_name":"William F. Smyth","orcid":null},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"William F. Smyth","raw_affiliation_strings":["McMaster University, Hamilton, Canada","McMaster university#TAB#"],"affiliations":[{"raw_affiliation_string":"McMaster University, Hamilton, Canada","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"McMaster university#TAB#","institution_ids":["https://openalex.org/I98251732"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102952570"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3638,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8072018,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"49","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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":0.9998999834060669,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9962999820709229,"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/hamming-distance","display_name":"Hamming distance","score":0.8271270394325256},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.7587538957595825},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.6199241280555725},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.571087658405304},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5698024034500122},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5591717958450317},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5462994575500488},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.5387787222862244},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5331830978393555},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5151085257530212},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5113189220428467},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.49860644340515137},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.46483421325683594},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.45287004113197327},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.42457905411720276},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.4185140132904053},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.41377416253089905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39687371253967285},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.05825731158256531},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.05587318539619446}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.8271270394325256},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.7587538957595825},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.6199241280555725},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.571087658405304},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5698024034500122},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5591717958450317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5462994575500488},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5387787222862244},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5331830978393555},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5151085257530212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5113189220428467},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.49860644340515137},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.46483421325683594},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.45287004113197327},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.42457905411720276},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.4185140132904053},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.41377416253089905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39687371253967285},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.05825731158256531},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.05587318539619446},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-19315-1_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-19315-1_5","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"},{"id":"pmh:oai:pure.atira.dk:publications/a57c7558-c5f0-4a28-9ebb-85421966fb07","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/a57c7558-c5f0-4a28-9ebb-85421966fb07","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Barton , C , Iliopoulos , C , Pissis , S P &amp; Smyth , W F 2015 , Fast and simple computations using prefix tables under hamming and edit distance . in Combinatorial Algorithms . vol. 8986 , Springer , USA , pp. 49-61 , 25th International Workshop on Combinatorial Algorithms 2014 , Duluth , United States , 15/10/14 . https://doi.org/10.1007/978-3-319-19315-1_5","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/0f922d47-84a7-45d3-8986-32bb8a2e39b7","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/0f922d47-84a7-45d3-8986-32bb8a2e39b7","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Barton , C , Iliopoulos , C S , Pissis , S P &amp; Smythe , W 2015 , Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance . in K Jan , M Miller &amp; D Froncek (eds) , Combinatorial Algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers . Lecture Notes in Computer Science , vol. 8986 , pp. 49-61 , 25th International Workshop, IWOCA 2014 , Duluth, MN , United States , 15/10/2014 . https://doi.org/10.1007/978-3-319-19315-1_5","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1752984","https://openalex.org/W1504417041","https://openalex.org/W1535018767","https://openalex.org/W1549124425","https://openalex.org/W1582906780","https://openalex.org/W1583827615","https://openalex.org/W1647671624","https://openalex.org/W1860104593","https://openalex.org/W1964638897","https://openalex.org/W1973456884","https://openalex.org/W1974708980","https://openalex.org/W1989204408","https://openalex.org/W1991673591","https://openalex.org/W2002246332","https://openalex.org/W2007791040","https://openalex.org/W2034474362","https://openalex.org/W2045821558","https://openalex.org/W2082092341","https://openalex.org/W2096967468","https://openalex.org/W2128711701","https://openalex.org/W2139749722","https://openalex.org/W2143991273","https://openalex.org/W2480722803","https://openalex.org/W2611200784","https://openalex.org/W3137072739","https://openalex.org/W4254652536"],"related_works":["https://openalex.org/W3092074933","https://openalex.org/W1717915937","https://openalex.org/W2114699799","https://openalex.org/W2005977804","https://openalex.org/W2981523383","https://openalex.org/W2611052684","https://openalex.org/W2576782855","https://openalex.org/W2359436045","https://openalex.org/W1556278722","https://openalex.org/W1494289317"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
