{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:52:40Z","timestamp":1726037560376},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811399411"},{"type":"electronic","value":"9789811399428"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-9942-8_23","type":"book-chapter","created":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T07:03:25Z","timestamp":1563433405000},"page":"240-249","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Upper Bound for Sorting $$R_n$$ with LE"],"prefix":"10.1007","author":[{"given":"Sai Satwik","family":"Kuppili","sequence":"first","affiliation":[]},{"given":"Bhadrachalam","family":"Chitturi","sequence":"additional","affiliation":[]},{"given":"T.","family":"Srinath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,19]]},"reference":[{"unstructured":"The On-Line Encyclopedia of Integer Sequences. oeis.org","key":"23_CR1"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"MR Jerrum","year":"1985","unstructured":"Jerrum, M.R.: The complexity of finding minimum-length generator sequences. Theor. Comput. Sci. 36, 265\u2013289 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555\u2013566 (1989)","journal-title":"IEEE Trans. Comput."},{"issue":"36","key":"23_CR4","doi-asserted-by":"publisher","first-page":"3372","DOI":"10.1016\/j.tcs.2008.04.045","volume":"410","author":"B Chitturi","year":"2009","unstructured":"Chitturi, B., Fahle, W., Meng, Z., Morales, L., Shields, C.O., Sudborough, H.: An (18\/11)n upper bound for sorting by prefix reversals. Theor. Comput. Sci. 410(36), 3372\u20133390 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"23_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0166-218X(96)00069-8","volume":"71","author":"T Chen","year":"1996","unstructured":"Chen, T., Skiena, S.S.: Sorting with fixed-length reversals. Discrete Appl. Math. 71(1\u20133), 269\u2013295 (1996)","journal-title":"Discrete Appl. Math."},{"key":"23_CR6","series-title":"Advances in Experimental Medicine and Biology","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/978-1-4419-5913-3_81","volume-title":"Advances in Computational Biology","author":"X Feng","year":"2010","unstructured":"Feng, X., Chitturi, B., Sudborough, H.: Sorting circular permutations by bounded transpositions. In: Arabnia, H. (ed.) Advances in Computational Biology. AEMB, vol. 680, pp. 725\u2013736. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-5913-3_81"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-69733-6_30","volume-title":"Computing and Combinatorics","author":"B Chitturi","year":"2008","unstructured":"Chitturi, B., Sudborough, H., Voit, W., Feng, X.: Adjacent swaps on strings. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 299\u2013308. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69733-6_30"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0167-8191(93)90054-O","volume":"19","author":"S Lakshmivarahan","year":"1993","unstructured":"Lakshmivarahan, S., Jho, J.-S., Dhall, S.K.: Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. Parallel Comput. 19, 361\u2013407 (1993)","journal-title":"Parallel Comput."},{"doi-asserted-by":"crossref","unstructured":"Chitturi, B.: Perturbed layered graphs. In: ICACCP (2019)","key":"23_CR9","DOI":"10.1109\/ICACCP.2019.8882919"},{"issue":"7","key":"23_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.3390\/a11070093","volume":"11","author":"B Chitturi","year":"2018","unstructured":"Chitturi, B., Balachander, S., Satheesh, S., Puthiyoppil, K.: Layered graphs: applications and algorithms. Algorithms 11(7), 93 (2018)","journal-title":"Algorithms"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1017\/S0004972717000028","volume":"95","author":"H Mokhtar","year":"2017","unstructured":"Mokhtar, H.: A few families of Cayley graphs and their efficiency as communication networks. Bull. Aust. Math. Soc. 95(3), 518\u2013520 (2017)","journal-title":"Bull. Aust. Math. Soc."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10801-018-0822-6","volume":"49","author":"T Zhang","year":"2018","unstructured":"Zhang, T., Gennian, G.: Improved lower bounds on the degree-diameter problem. J. Algebr. Comb. 49, 135\u2013146 (2018)","journal-title":"J. Algebr. Comb."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2018.09.015","volume":"766","author":"B Chitturi","year":"2018","unstructured":"Chitturi, B., Das, P.: Sorting permutations with transpositions in $$O(n^3)$$ amortized time. Theor. Comput. Sci. 766, 30\u201337 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.dam.2018.04.025","volume":"250","author":"G Erskine","year":"2018","unstructured":"Erskine, G., James, T.: Large Cayley graphs of small diameter. Discrete Appl. Math. 250, 202\u2013214 (2018)","journal-title":"Discrete Appl. Math."},{"key":"23_CR15","first-page":"205","volume":"15","author":"DA Gostevsky","year":"2018","unstructured":"Gostevsky, D.A., Konstantinova, E.V.: Greedy cycles in the star graphs. Discrete Math. Math. Cybern. 15, 205\u2013213 (2018)","journal-title":"Discrete Math. Math. Cybern."},{"key":"23_CR16","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of Genome Rearrangements","author":"G Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Vialette, S., Tannier, E.: Combinatorics of Genome Rearrangements. MIT Press, Cambridge (2009)"},{"issue":"03","key":"23_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1142\/S1793830911001206","volume":"3","author":"B Chitturi","year":"2011","unstructured":"Chitturi, B.: A note on complexity of genetic mutations. Discrete Math. Algorithms Appl. 3(03), 269\u2013286 (2011)","journal-title":"Discrete Math. Algorithms Appl."}],"container-title":["Communications in Computer and Information Science","Advances in Computing and Data Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-9942-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,4]],"date-time":"2019-12-04T03:48:59Z","timestamp":1575431339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-9942-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811399411","9789811399428"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-9942-8_23","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICACDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advances in Computing and Data Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghazibad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icacds0a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icacds.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"621","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"112","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"-","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}