{"id":"https://openalex.org/W2137542250","doi":"https://doi.org/10.1109/dcc.2004.1281511","title":"Adapting the Knuth-Morris-Pratt algorithm for pattern matching in human encoded texts","display_name":"Adapting the Knuth-Morris-Pratt algorithm for pattern matching in human encoded texts","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2137542250","doi":"https://doi.org/10.1109/dcc.2004.1281511","mag":"2137542250"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2004.1281511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-article"},"type":"article","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/A5079328780","display_name":"Ajay Daptardar","orcid":null},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Daptardar","raw_affiliation_strings":["Computer Science Department, Brandeis University, Waltham, MA, USA","Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brandeis University, Waltham, MA, USA","institution_ids":["https://openalex.org/I6902469"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA","institution_ids":["https://openalex.org/I6902469"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042328423","display_name":"Dana Shapira","orcid":"https://orcid.org/0000-0002-2320-9064"},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Shapira","raw_affiliation_strings":["Computer Science Department, Brandeis University, Waltham, MA, USA","Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brandeis University, Waltham, MA, USA","institution_ids":["https://openalex.org/I6902469"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA","institution_ids":["https://openalex.org/I6902469"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079328780"],"corresponding_institution_ids":["https://openalex.org/I6902469"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.1284964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"535","last_page":"535"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9945999979972839,"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.9847999811172485,"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/huffman-coding","display_name":"Huffman coding","score":0.8619834184646606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6715984344482422},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.619437575340271},{"id":"https://openalex.org/keywords/bitwise-operation","display_name":"Bitwise operation","score":0.5980563759803772},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5804579257965088},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4254576563835144},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3842982053756714},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3213489353656769},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31833407282829285},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.3091893196105957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23240557312965393}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8619834184646606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6715984344482422},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.619437575340271},{"id":"https://openalex.org/C134765980","wikidata":"https://www.wikidata.org/wiki/Q879126","display_name":"Bitwise operation","level":2,"score":0.5980563759803772},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5804579257965088},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4254576563835144},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3842982053756714},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3213489353656769},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31833407282829285},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3091893196105957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23240557312965393},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc.2004.1281511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.6899999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W155389570","https://openalex.org/W1585125654","https://openalex.org/W1773069773","https://openalex.org/W1832628917","https://openalex.org/W1935337053","https://openalex.org/W1985108724","https://openalex.org/W2013849299","https://openalex.org/W2028386115","https://openalex.org/W2045821558","https://openalex.org/W2060108852","https://openalex.org/W2062657631","https://openalex.org/W2077701615","https://openalex.org/W2080702353","https://openalex.org/W2108189215","https://openalex.org/W2133248397","https://openalex.org/W2160748429","https://openalex.org/W4285719527","https://openalex.org/W6606206345"],"related_works":["https://openalex.org/W2368824897","https://openalex.org/W1508050556","https://openalex.org/W1910862367","https://openalex.org/W2011446102","https://openalex.org/W2379365082","https://openalex.org/W2370747590","https://openalex.org/W2030109976","https://openalex.org/W2369260257","https://openalex.org/W1979511889","https://openalex.org/W2389120450"],"abstract_inverted_index":{"This":[0,27],"paper":[1,28],"presents":[2],"a":[3,31,45,70],"compressed":[4],"pattern":[5],"matching":[6],"in":[7,18,41],"Huffman":[8,59,85],"encoded":[9,86],"texts.":[10,87],"A":[11],"modified":[12],"Knuth-Morris-Pratt":[13],"(KMP)":[14],"algorithm":[15,34,54],"is":[16,50,55],"used":[17,80],"order":[19],"to":[20,66],"overcome":[21],"the":[22,42,48],"problem":[23],"of":[24,44,84],"false":[25],"matches.":[26],"also":[29],"proposes":[30],"bitwise":[32],"KMP":[33,53],"that":[35],"can":[36],"move":[37],"one":[38],"extra":[39],"bit":[40,72],"case":[43],"mismatch,":[46],"since":[47],"alphabet":[49],"binary.":[51],"The":[52],"combined":[56],"with":[57],"two":[58],"decoding":[60,83],"algorithms":[61],"called":[62],"sk-kmp":[63],"and":[64],"win-kmp":[65],"handle":[67],"more":[68],"than":[69],"single":[71],"per":[73],"machine":[74],"operation.":[75],"However,":[76],"skeleton":[77],"trees":[78],"are":[79],"for":[81],"efficient":[82]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}