{"id":"https://openalex.org/W4283264411","doi":"https://doi.org/10.3390/a15070220","title":"Optimal Algorithms for Sorting Permutations with Brooms","display_name":"Optimal Algorithms for Sorting Permutations with Brooms","publication_year":2022,"publication_date":"2022-06-21","ids":{"openalex":"https://openalex.org/W4283264411","doi":"https://doi.org/10.3390/a15070220"},"language":"en","primary_location":{"id":"doi:10.3390/a15070220","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15070220","pdf_url":"https://www.mdpi.com/1999-4893/15/7/220/pdf?version=1655976649","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/7/220/pdf?version=1655976649","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110919288","display_name":"Indulekha Sadanandan","orcid":null},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Indulekha Sadanandan","raw_affiliation_strings":["Department of Computer Science and Applications, Amrita Vishwa Vidyapeetham, Amritapuri 641112, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Applications, Amrita Vishwa Vidyapeetham, Amritapuri 641112, India","institution_ids":["https://openalex.org/I81556334"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091758089","display_name":"Bhadrachalam Chitturi","orcid":"https://orcid.org/0000-0002-8768-9183"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhadrachalam Chitturi","raw_affiliation_strings":["Department of Computer Science, UT Dallas, Richardson, TX 75080, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UT Dallas, Richardson, TX 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110919288"],"corresponding_institution_ids":["https://openalex.org/I81556334"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.2989,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81415835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"7","first_page":"220","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T12029","display_name":"DNA and Biological Computing","score":0.9868999719619751,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.7741039395332336},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5874511003494263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.517509937286377},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4637032151222229},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.43274569511413574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4251802861690521},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3881642818450928},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35396188497543335},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3095141053199768},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.29062017798423767},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10499641299247742}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7741039395332336},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5874511003494263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.517509937286377},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4637032151222229},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.43274569511413574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4251802861690521},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3881642818450928},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35396188497543335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3095141053199768},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.29062017798423767},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10499641299247742}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15070220","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15070220","pdf_url":"https://www.mdpi.com/1999-4893/15/7/220/pdf?version=1655976649","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:444432336d374f0ba6f8dcb8376a42fd","is_oa":true,"landing_page_url":"https://doaj.org/article/444432336d374f0ba6f8dcb8376a42fd","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 7, p 220 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/7/220/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15070220","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 7; Pages: 220","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15070220","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15070220","pdf_url":"https://www.mdpi.com/1999-4893/15/7/220/pdf?version=1655976649","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4283264411.pdf","grobid_xml":"https://content.openalex.org/works/W4283264411.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1589359552","https://openalex.org/W1900018267","https://openalex.org/W1970524113","https://openalex.org/W1986976002","https://openalex.org/W2006394420","https://openalex.org/W2008048468","https://openalex.org/W2009096717","https://openalex.org/W2013947940","https://openalex.org/W2016495473","https://openalex.org/W2028889910","https://openalex.org/W2074078620","https://openalex.org/W2103894616","https://openalex.org/W2104852618","https://openalex.org/W2564453173","https://openalex.org/W2767005068","https://openalex.org/W2771694221","https://openalex.org/W2893559467","https://openalex.org/W2947779963","https://openalex.org/W2962964818","https://openalex.org/W2981994390","https://openalex.org/W2982347821","https://openalex.org/W3033131621","https://openalex.org/W6639504489","https://openalex.org/W6682602173","https://openalex.org/W6722766420","https://openalex.org/W6763234150"],"related_works":["https://openalex.org/W2031959132","https://openalex.org/W1719252778","https://openalex.org/W2031098440","https://openalex.org/W4307385446","https://openalex.org/W2466894780","https://openalex.org/W3092119098","https://openalex.org/W2003008160","https://openalex.org/W2381713449","https://openalex.org/W2731724293","https://openalex.org/W2904724461"],"abstract_inverted_index":{"Sorting":[0],"permutations":[1,123,222,235,262],"with":[2,165,223,236,263],"various":[3],"operations":[4],"has":[5],"applications":[6],"in":[7,38,115,203],"genetics":[8],"and":[9,63,144,211,228,251,273],"computer":[10],"interconnection":[11],"networks":[12],"where":[13,186],"an":[14,36,103,180,216],"operation":[15,37],"is":[16,26,42,51,94,153,179,194],"specified":[17],"by":[18,106,157],"its":[19,145],"generator":[20],"set.":[21],"A":[22,45,150,176],"transposition":[23,132,139,225],"tree":[24,29,155,226,250,267],"T=(V,E)":[25],"a":[27,43,49,53,56,78,128,136,142,147,154,163,173,183,191,204,209,229,237,243,256,264],"spanning":[28],"over":[30],"n":[31],"vertices":[32,61,84,171],"v1,v2,\u2026vn.":[33],"T":[34],"denotes":[35],"which":[39],"each":[40],"edge":[41],"generator.":[44],"value":[46],"assigned":[47],"to":[48,86,95,121,196,214,220,233,269],"vertex":[50,161,189,199],"called":[52,141],"token":[54],"or":[55,113],"marker.":[57],"The":[58,73,92],"markers":[59,90],"on":[60],"u":[62],"v":[64],"can":[65],"be":[66],"swapped":[67],"only":[68,126],"if":[69],"the":[70,81,87,97,108,159,168,187,197,201,224],"pair":[71],"(u,v)\u2208E.":[72],"initial":[74,98],"configuration":[75,99],"consists":[76],"of":[77,83,89,100,111,131,138,162,167,172,182,190,200,246],"bijection":[79],"from":[80],"set":[82,88],"v1,v2,\u2026,vn":[85],"(1,2,\u22ef,n\u22121,n).":[91],"goal":[93],"sort":[96,122,221,234],"T,":[101],"i.e.,":[102],"input":[104],"permutation,":[105],"applying":[107],"minimum":[109],"number":[110],"swaps":[112],"moves":[114],"T.":[116],"Computationally":[117],"tractable":[118],"optimal":[119,217,231],"algorithms":[120],"are":[124,275],"known":[125],"for":[127,260],"few":[129],"classes":[130],"trees.":[133],"We":[134,207,240],"study":[135],"class":[137,245],"trees":[140,247],"broom":[143,152,178,185,227],"variation":[146],"double":[148,177,238],"broom.":[149,206,239],"single":[151,184,205],"obtained":[156],"joining":[158],"centre":[160,188],"star":[164,193],"one":[166],"two":[169],"leaf":[170],"path":[174,202],"graph.":[175],"extension":[181],"second":[192],"connected":[195],"terminal":[198],"propose":[208],"simple":[210],"efficient":[212],"algorithm":[213,232],"obtain":[215],"swap":[218],"sequence":[219],"novel":[230],"also":[241],"introduce":[242],"new":[244],"named":[248],"millipede":[249,266],"prove":[252],"that":[253],"D*":[254,272],"yields":[255],"tighter":[257],"upper":[258],"bound":[259],"sorting":[261],"balanced":[265],"compared":[268],"D\u2032.":[270],"Algorithms":[271],"D\u2032":[274],"designed":[276],"previously.":[277]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2022-06-23T00:00:00"}