{"id":"https://openalex.org/W1556959123","doi":"https://doi.org/10.1007/11554714_1","title":"Lower Bounds for Maximum Parsimony with Gene Order Data","display_name":"Lower Bounds for Maximum Parsimony with Gene Order Data","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1556959123","doi":"https://doi.org/10.1007/11554714_1","mag":"1556959123"},"language":"en","primary_location":{"id":"doi:10.1007/11554714_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11554714_1","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/A5082573410","display_name":"Abraham Bachrach","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Abraham Bachrach","raw_affiliation_strings":["Department of Computer Science, UC Berkeley,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Berkeley,","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100350900","display_name":"Kevin Chen","orcid":"https://orcid.org/0000-0003-1139-3981"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin Chen","raw_affiliation_strings":["Department of Computer Science, UC Berkeley,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Berkeley,","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041036764","display_name":"Chris Harrelson","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Harrelson","raw_affiliation_strings":["Department of Computer Science, UC Berkeley,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Berkeley,","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077590229","display_name":"Radu Mihaescu","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Radu Mihaescu","raw_affiliation_strings":["Department of Computer Science, UC Berkeley,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Berkeley,","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082369624","display_name":"Satish Rao","orcid":"https://orcid.org/0000-0002-7353-333X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":["Department of Computer Science, UC Berkeley,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Berkeley,","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039974286","display_name":"Apurva S. Shah","orcid":"https://orcid.org/0000-0002-9597-5665"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Apurva Shah","raw_affiliation_strings":["Department of Computer Science, UC Berkeley,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Berkeley,","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5082573410"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8743,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.90265866,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9947999715805054,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9915000200271606,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7874656915664673},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6363831162452698},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.623771071434021},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5946629643440247},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5230382680892944},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4625617265701294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4596061706542969},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4496501088142395},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.42571133375167847},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42501455545425415},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.423012912273407},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42118537425994873},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41218236088752747},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4107101261615753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40156587958335876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39529329538345337},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3625776767730713}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7874656915664673},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6363831162452698},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.623771071434021},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5946629643440247},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5230382680892944},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4625617265701294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4596061706542969},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4496501088142395},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.42571133375167847},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42501455545425415},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.423012912273407},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42118537425994873},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41218236088752747},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4107101261615753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40156587958335876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39529329538345337},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3625776767730713},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":3,"locations":[{"id":"doi:10.1007/11554714_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11554714_1","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.487.485","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.487.485","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.phylo.org/pdf_docs/2_(14)Mihaescu_recombcg.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.8808","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.8808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.nyu.edu/~kc1111/recombcg_final.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1493976128","https://openalex.org/W1516981301","https://openalex.org/W1572531572","https://openalex.org/W1582154576","https://openalex.org/W1827131769","https://openalex.org/W1973111150","https://openalex.org/W2012628879","https://openalex.org/W2029943378","https://openalex.org/W2045235028","https://openalex.org/W2049796549","https://openalex.org/W2050701304","https://openalex.org/W2103849916","https://openalex.org/W2103991913","https://openalex.org/W2129364267","https://openalex.org/W2133090982","https://openalex.org/W2140985588","https://openalex.org/W2148699297","https://openalex.org/W2163656645","https://openalex.org/W2168559467","https://openalex.org/W2240125645","https://openalex.org/W2792484713"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W4306878646","https://openalex.org/W3005108979","https://openalex.org/W2392203420","https://openalex.org/W4366444253","https://openalex.org/W2940865666"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}