{"id":"https://openalex.org/W1811655018","doi":"https://doi.org/10.1007/978-3-642-13509-5_10","title":"Pseudo-realtime Pattern Matching: Closing the Gap","display_name":"Pseudo-realtime Pattern Matching: Closing the Gap","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1811655018","doi":"https://doi.org/10.1007/978-3-642-13509-5_10","mag":"1811655018"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13509-5_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13509-5_10","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/A5011337679","display_name":"Rapha\u00ebl Clifford","orcid":"https://orcid.org/0000-0003-0599-0915"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Rapha\u00ebl Clifford","raw_affiliation_strings":["Department of Computer Science, University of Bristol, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035485534","display_name":"Benjamin Sach","orcid":"https://orcid.org/0000-0001-8360-9345"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Benjamin Sach","raw_affiliation_strings":["Department of Computer Science, University of Bristol, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011337679"],"corresponding_institution_ids":["https://openalex.org/I36234482"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5651,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.68498393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"111"},"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.9904000163078308,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9882000088691711,"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/hamming-distance","display_name":"Hamming distance","score":0.6161620020866394},{"id":"https://openalex.org/keywords/closing","display_name":"Closing (real estate)","score":0.5906514525413513},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5899260640144348},{"id":"https://openalex.org/keywords/character","display_name":"Character (mathematics)","score":0.5801926851272583},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5215097069740295},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.46528711915016174},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.46104615926742554},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4598565697669983},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4587966799736023},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4541492164134979},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4454188048839569},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4226863980293274},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4221242368221283},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.416775107383728},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37963980436325073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31849902868270874},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13348129391670227},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11498197913169861},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1059630811214447},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.08796831965446472}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6161620020866394},{"id":"https://openalex.org/C2778775528","wikidata":"https://www.wikidata.org/wiki/Q5135432","display_name":"Closing (real estate)","level":2,"score":0.5906514525413513},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5899260640144348},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.5801926851272583},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5215097069740295},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.46528711915016174},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.46104615926742554},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4598565697669983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4587966799736023},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4541492164134979},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4454188048839569},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4226863980293274},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4221242368221283},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.416775107383728},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37963980436325073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31849902868270874},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13348129391670227},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11498197913169861},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1059630811214447},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.08796831965446472},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-13509-5_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13509-5_10","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:CiteSeerX.psu:10.1.1.414.9382","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.9382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bris.ac.uk/Publications/Papers/2001295.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/3208372a-8ba6-4d2b-b35e-a9f44c2aa3d4","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/3208372a-8ba6-4d2b-b35e-a9f44c2aa3d4","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Clifford, R & Sach, B 2010, Pseudo-realtime Pattern Matching: Closing the Gap. in Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (CPM). Springer Berlin Heidelberg. < http://www.cs.bris.ac.uk/Publications/pub_master.jsp?id=2001295 >","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/6a91271a-fc38-4548-8393-2cff5d1991b3","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/6a91271a-fc38-4548-8393-2cff5d1991b3","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Clifford, R & Sach, BG 2010, Pseudo-realtime Pattern Matching: Closing the Gap. in CPM: Combinatorial Pattern Matching (2010). pp. 101 - 111.","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1484531407","https://openalex.org/W1967384930","https://openalex.org/W1974708980","https://openalex.org/W1989204408","https://openalex.org/W2034474362","https://openalex.org/W2074707165","https://openalex.org/W2099283146","https://openalex.org/W2099964107","https://openalex.org/W2140007524","https://openalex.org/W2158874082","https://openalex.org/W2164259467"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W1968512104","https://openalex.org/W78560857"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}