{"id":"https://openalex.org/W2889659119","doi":"https://doi.org/10.1007/978-3-030-00479-8_24","title":"Better Heuristic Algorithms for the Repetition Free LCS and Other Variants","display_name":"Better Heuristic Algorithms for the Repetition Free LCS and Other Variants","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2889659119","doi":"https://doi.org/10.1007/978-3-030-00479-8_24","mag":"2889659119"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-00479-8_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-00479-8_24","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/A5005721226","display_name":"Radu Stefan Mincu","orcid":"https://orcid.org/0000-0003-2613-582X"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Radu Stefan Mincu","raw_affiliation_strings":["Department of Computer Science, University of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008143115","display_name":"Alexandru Popa","orcid":"https://orcid.org/0000-0003-3364-1210"},"institutions":[{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research & Development in Informatics","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]},{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Alexandru Popa","raw_affiliation_strings":["Department of Computer Science, University of Bucharest, Bucharest, Romania","National Institute for Research and Development in Informatics, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]},{"raw_affiliation_string":"National Institute for Research and Development in Informatics, Bucharest, Romania","institution_ids":["https://openalex.org/I4210114681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008143115"],"corresponding_institution_ids":["https://openalex.org/I141595442","https://openalex.org/I4210114681"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2719,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57454384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"297","last_page":"310"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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.9919999837875366,"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.752764105796814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6530240774154663},{"id":"https://openalex.org/keywords/multiset","display_name":"Multiset","score":0.6141323447227478},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5124481320381165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5010092258453369},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4791140556335449},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.45994043350219727},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45526647567749023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45431965589523315},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.43097391724586487},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40302133560180664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39101505279541016},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17957761883735657}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.752764105796814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6530240774154663},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.6141323447227478},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5124481320381165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5010092258453369},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4791140556335449},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.45994043350219727},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45526647567749023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45431965589523315},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43097391724586487},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40302133560180664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39101505279541016},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17957761883735657},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-00479-8_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-00479-8_24","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W151843899","https://openalex.org/W1518653692","https://openalex.org/W1520631193","https://openalex.org/W1848152589","https://openalex.org/W1867483677","https://openalex.org/W1967860105","https://openalex.org/W1970026646","https://openalex.org/W1974063126","https://openalex.org/W1999395788","https://openalex.org/W2038282261","https://openalex.org/W2040176884","https://openalex.org/W2053419093","https://openalex.org/W2077783248","https://openalex.org/W2098667053","https://openalex.org/W2109227373","https://openalex.org/W2162744351","https://openalex.org/W2346534675","https://openalex.org/W2605033097","https://openalex.org/W2742408471"],"related_works":["https://openalex.org/W25732909","https://openalex.org/W4323338832","https://openalex.org/W4289596129","https://openalex.org/W3083981518","https://openalex.org/W170643605","https://openalex.org/W4225868058","https://openalex.org/W1999879627","https://openalex.org/W2088055539","https://openalex.org/W1574834681","https://openalex.org/W2389167168"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}