{"id":"https://openalex.org/W2239938932","doi":"https://doi.org/10.1007/978-3-642-38905-4_4","title":"Locating All Maximal Approximate Runs in a String","display_name":"Locating All Maximal Approximate Runs in a String","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2239938932","doi":"https://doi.org/10.1007/978-3-642-38905-4_4","mag":"2239938932"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-38905-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-38905-4_4","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/A5028302347","display_name":"Mika Amit","orcid":"https://orcid.org/0000-0001-5178-7817"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]},{"id":"https://openalex.org/I4210120800","display_name":"Carmel (Israel)","ror":"https://ror.org/02wvcn790","country_code":"IL","type":"company","lineage":["https://openalex.org/I4210120800"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Mika Amit","raw_affiliation_strings":["Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel","institution_ids":["https://openalex.org/I91203450","https://openalex.org/I4210120800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081848578","display_name":"Maxime Crochemore","orcid":"https://orcid.org/0000-0003-1087-1419"},"institutions":[{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]},{"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":["FR","GB"],"is_corresponding":false,"raw_author_name":"Maxime Crochemore","raw_affiliation_strings":["Institut Gaspard-Monge, Universit\u00e9 Paris-Est, 77454, Marne-la-Vall\u00e9e Cedex 2, France","King\u2019s College London, Strand, London, WC2R 2LS, UK","King's College London, Strand, London, WC2R 2LS, UK"],"affiliations":[{"raw_affiliation_string":"Institut Gaspard-Monge, Universit\u00e9 Paris-Est, 77454, Marne-la-Vall\u00e9e Cedex 2, France","institution_ids":["https://openalex.org/I4210152518"]},{"raw_affiliation_string":"King\u2019s College London, Strand, London, WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King's College London, Strand, London, WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111624806","display_name":"Gad M. Landau","orcid":null},"institutions":[{"id":"https://openalex.org/I4210120800","display_name":"Carmel (Israel)","ror":"https://ror.org/02wvcn790","country_code":"IL","type":"company","lineage":["https://openalex.org/I4210120800"]},{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gad M. Landau","raw_affiliation_strings":["Department of Computer Science and Engineering, NYU-Poly, Brooklyn, NY, USA","Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, NYU-Poly, Brooklyn, NY, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel","institution_ids":["https://openalex.org/I91203450","https://openalex.org/I4210120800"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028302347"],"corresponding_institution_ids":["https://openalex.org/I4210120800","https://openalex.org/I91203450"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3395,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.64609194,"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":"13","last_page":"27"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9930999875068665,"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/T11567","display_name":"semigroups and automata theory","score":0.9904999732971191,"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/substring","display_name":"Substring","score":0.9809160828590393},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.7855896949768066},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7134421467781067},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.622365415096283},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.442894846200943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4202612638473511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39302393794059753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.353923499584198},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3238919973373413},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.25474318861961365}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.9809160828590393},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.7855896949768066},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7134421467781067},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.622365415096283},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.442894846200943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4202612638473511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39302393794059753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.353923499584198},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3238919973373413},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25474318861961365},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-38905-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-38905-4_4","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:kclpure.kcl.ac.uk:publications/756ee9e1-3c44-4b39-9ae5-0c8b1fc037ff","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84884296942&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Amit, M, Crochemore, M & Landau, G M 2013, Locating all maximal approximate runs in a string. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7922 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7922 LNCS, pp. 13-27, 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, Bad Herrenalb, Germany, 17/06/2013. https://doi.org/10.1007/978-3-642-38905-4_4","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":21,"referenced_works":["https://openalex.org/W206761683","https://openalex.org/W820461064","https://openalex.org/W1504417041","https://openalex.org/W1528544059","https://openalex.org/W1555071653","https://openalex.org/W1882010690","https://openalex.org/W1965743524","https://openalex.org/W1967382114","https://openalex.org/W1973272213","https://openalex.org/W1973456884","https://openalex.org/W2000630039","https://openalex.org/W2007378578","https://openalex.org/W2024145045","https://openalex.org/W2052899946","https://openalex.org/W2067787802","https://openalex.org/W2082092341","https://openalex.org/W2088672239","https://openalex.org/W2157390113","https://openalex.org/W2518632889","https://openalex.org/W4239612016","https://openalex.org/W4254652536"],"related_works":["https://openalex.org/W2051304374","https://openalex.org/W2902482624","https://openalex.org/W4286787697","https://openalex.org/W1505605100","https://openalex.org/W3043769852","https://openalex.org/W52396946","https://openalex.org/W2298204719","https://openalex.org/W2376315482","https://openalex.org/W3210979406","https://openalex.org/W4230921427"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}