{"id":"https://openalex.org/W1582266566","doi":"https://doi.org/10.1007/978-3-540-76394-9_6","title":"Texte durchsuchen \u2013 aber schnell! Der Boyer-Moore-Horspool Algorithmus","display_name":"Texte durchsuchen \u2013 aber schnell! Der Boyer-Moore-Horspool Algorithmus","publication_year":2008,"publication_date":"2008-04-16","ids":{"openalex":"https://openalex.org/W1582266566","doi":"https://doi.org/10.1007/978-3-540-76394-9_6","mag":"1582266566"},"language":"de","primary_location":{"id":"doi:10.1007/978-3-540-76394-9_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-76394-9_6","pdf_url":null,"source":{"id":"https://openalex.org/S4210237810","display_name":"eXamen.press","issn_l":"1614-5216","issn":["1614-5216","2627-633X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"eXamen.press","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/A5024961278","display_name":"Markus E. Nebel","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]},{"id":"https://openalex.org/I891521709","display_name":"Daimler (Germany)","ror":"https://ror.org/00m0j3d84","country_code":"DE","type":"company","lineage":["https://openalex.org/I891521709"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus E. Nebel","raw_affiliation_strings":["Fachbereich Informatik, AG Algorithmen und Komplexit\u00e4t, TU Kaiserslautern, Gottlieb Daimler Stra\u00dfe 48, 67663, Kaiserslautern, Deutschland","Fachbereich Informatik, AG Algorithmen und Komplexit\u00e4t, TU Kaiserslautern, Kaiserslautern, Deutschland"],"affiliations":[{"raw_affiliation_string":"Fachbereich Informatik, AG Algorithmen und Komplexit\u00e4t, TU Kaiserslautern, Gottlieb Daimler Stra\u00dfe 48, 67663, Kaiserslautern, Deutschland","institution_ids":["https://openalex.org/I153267046","https://openalex.org/I891521709"]},{"raw_affiliation_string":"Fachbereich Informatik, AG Algorithmen und Komplexit\u00e4t, TU Kaiserslautern, Kaiserslautern, Deutschland","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024961278"],"corresponding_institution_ids":["https://openalex.org/I153267046","https://openalex.org/I891521709"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10799704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.994700014591217,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.994700014591217,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9944000244140625,"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/T11567","display_name":"semigroups and automata theory","score":0.988099992275238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/humanities","display_name":"Humanities","score":0.7319808602333069},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.3585726022720337},{"id":"https://openalex.org/keywords/art","display_name":"Art","score":0.3250791132450104}],"concepts":[{"id":"https://openalex.org/C15708023","wikidata":"https://www.wikidata.org/wiki/Q80083","display_name":"Humanities","level":1,"score":0.7319808602333069},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.3585726022720337},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.3250791132450104}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-76394-9_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-76394-9_6","pdf_url":null,"source":{"id":"https://openalex.org/S4210237810","display_name":"eXamen.press","issn_l":"1614-5216","issn":["1614-5216","2627-633X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"eXamen.press","raw_type":"book-chapter"},{"id":"pmh:oai:pub.librecat.org:2910030","is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/2910030","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nebel M. Texte durchsuchen - aber schnell! Der Boyer-Moore-Horspool Algorithmus. In:  <em>Taschenbuch der Algorithmen</em>. 2008: 51--60.","raw_type":"info:eu-repo/semantics/bookPart"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2899084033","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W2748952813","https://openalex.org/W1531601525","https://openalex.org/W4391375266"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}