{"id":"https://openalex.org/W2083521576","doi":"https://doi.org/10.1137/080741860","title":"A Lower Bound on the Transposition Diameter","display_name":"A Lower Bound on the Transposition Diameter","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2083521576","doi":"https://doi.org/10.1137/080741860","mag":"2083521576"},"language":"en","primary_location":{"id":"doi:10.1137/080741860","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080741860","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","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/A5036596371","display_name":"Linyuan L\u00fc","orcid":"https://orcid.org/0000-0003-0155-2002"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Linyuan Lu","raw_affiliation_strings":["lu@math.sc.edu and yang36@mailbox.sc.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"lu@math.sc.edu and yang36@mailbox.sc.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101484171","display_name":"Yiting Yang","orcid":"https://orcid.org/0000-0002-7331-2772"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yiting Yang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9353,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78298857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"4","first_page":"1242","last_page":"1249"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10434","display_name":"Chromosomal and Genetic Variations","score":0.9743000268936157,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9598000049591064,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8597368001937866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7711038589477539},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7443007230758667},{"id":"https://openalex.org/keywords/transposition","display_name":"Transposition (logic)","score":0.7302534580230713},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6042766571044922},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6035628914833069},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4383885860443115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3491291403770447},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1494627594947815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12605193257331848},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.061243295669555664}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8597368001937866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7711038589477539},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7443007230758667},{"id":"https://openalex.org/C12455157","wikidata":"https://www.wikidata.org/wiki/Q7835331","display_name":"Transposition (logic)","level":2,"score":0.7302534580230713},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6042766571044922},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6035628914833069},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4383885860443115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3491291403770447},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1494627594947815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12605193257331848},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.061243295669555664}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/080741860","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080741860","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.211.2838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.211.2838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.sc.edu/%7Elu/papers/lbtd.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":8,"referenced_works":["https://openalex.org/W1989978323","https://openalex.org/W2004163905","https://openalex.org/W2023749136","https://openalex.org/W2040742107","https://openalex.org/W2070642495","https://openalex.org/W2103333868","https://openalex.org/W2157622572","https://openalex.org/W2170746407"],"related_works":["https://openalex.org/W2073700517","https://openalex.org/W4288062113","https://openalex.org/W3151485003","https://openalex.org/W2356141215","https://openalex.org/W2361312893","https://openalex.org/W3215624820","https://openalex.org/W4292765704","https://openalex.org/W4207057333","https://openalex.org/W2077637320","https://openalex.org/W2739612537"],"abstract_inverted_index":{"Sorting":[0],"permutations":[1,26],"by":[2,49,62],"transpositions":[3],"is":[4,17],"an":[5],"important":[6],"and":[7,51],"difficult":[8],"problem":[9],"in":[10,27],"genome":[11],"rearrangements.":[12],"The":[13],"transposition":[14,20],"diameter":[15],"$TD(n)$":[16],"the":[18,70],"maximum":[19],"distance":[21],"among":[22],"all":[23],"pairs":[24],"of":[25],"$S_n$.":[28],"It":[29],"was":[30,47],"previously":[31],"conjectured":[32],"[H.":[33],"Eriksson":[34],"et":[35],"al.,":[36],"Discrete":[37],"Math.,":[38],"241":[39],"(2001),":[40],"pp.":[41,60],"289\u2013300]":[42],"that":[43],"$TD(n)\\leq\\lceil\\frac{n+1}{2}\\rceil$.":[44],"This":[45],"conjecture":[46],"disproved":[48],"Elias":[50],"Hartman":[52],"[IEEE/ACM":[53],"Trans.":[54],"Comput.":[55],"Biol.":[56],"Bioinform.,":[57],"3":[58],"(2006),":[59],"369\u2013379]":[61],"showing":[63],"$TD(n)\\geq\\lfloor\\frac{n+1}{2}\\rfloor+1$.":[64],"In":[65],"this":[66],"paper":[67],"we":[68],"improved":[69],"lower":[71],"bound":[72],"to":[73],"$TD(n)\\geq\\frac{17}{33}n+\\frac{1}{33}$":[74],"via":[75],"computation.":[76]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}