[{"publication_identifier":{"issn":["0399-0559","2804-7303"]},"publication_status":"published","page":"1045-1058","intvolume":"        57","citation":{"short":"H.O.M. Silva, D.P. Rubert, E. Araujo, E. Steffen, D. Doerr, F.V. Martinez, RAIRO - Operations Research 57 (2023) 1045–1058.","mla":"Silva, Helmuth O. M., et al. “Algorithms for the Genome Median under a Restricted Measure of Rearrangement.” <i>RAIRO - Operations Research</i>, vol. 57, no. 3, EDP Sciences, 2023, pp. 1045–58, doi:<a href=\"https://doi.org/10.1051/ro/2023052\">10.1051/ro/2023052</a>.","bibtex":"@article{Silva_Rubert_Araujo_Steffen_Doerr_Martinez_2023, title={Algorithms for the genome median under a restricted measure of rearrangement}, volume={57}, DOI={<a href=\"https://doi.org/10.1051/ro/2023052\">10.1051/ro/2023052</a>}, number={3}, journal={RAIRO - Operations Research}, publisher={EDP Sciences}, author={Silva, Helmuth O.M. and Rubert, Diego P. and Araujo, Eloi and Steffen, Eckhard and Doerr, Daniel and Martinez, Fábio V.}, year={2023}, pages={1045–1058} }","apa":"Silva, H. O. M., Rubert, D. P., Araujo, E., Steffen, E., Doerr, D., &#38; Martinez, F. V. (2023). Algorithms for the genome median under a restricted measure of rearrangement. <i>RAIRO - Operations Research</i>, <i>57</i>(3), 1045–1058. <a href=\"https://doi.org/10.1051/ro/2023052\">https://doi.org/10.1051/ro/2023052</a>","ieee":"H. O. M. Silva, D. P. Rubert, E. Araujo, E. Steffen, D. Doerr, and F. V. Martinez, “Algorithms for the genome median under a restricted measure of rearrangement,” <i>RAIRO - Operations Research</i>, vol. 57, no. 3, pp. 1045–1058, 2023, doi: <a href=\"https://doi.org/10.1051/ro/2023052\">10.1051/ro/2023052</a>.","chicago":"Silva, Helmuth O.M., Diego P. Rubert, Eloi Araujo, Eckhard Steffen, Daniel Doerr, and Fábio V. Martinez. “Algorithms for the Genome Median under a Restricted Measure of Rearrangement.” <i>RAIRO - Operations Research</i> 57, no. 3 (2023): 1045–58. <a href=\"https://doi.org/10.1051/ro/2023052\">https://doi.org/10.1051/ro/2023052</a>.","ama":"Silva HOM, Rubert DP, Araujo E, Steffen E, Doerr D, Martinez FV. Algorithms for the genome median under a restricted measure of rearrangement. <i>RAIRO - Operations Research</i>. 2023;57(3):1045-1058. doi:<a href=\"https://doi.org/10.1051/ro/2023052\">10.1051/ro/2023052</a>"},"volume":57,"author":[{"first_name":"Helmuth O.M.","last_name":"Silva","full_name":"Silva, Helmuth O.M."},{"first_name":"Diego P.","last_name":"Rubert","full_name":"Rubert, Diego P."},{"last_name":"Araujo","full_name":"Araujo, Eloi","first_name":"Eloi"},{"orcid":"0000-0002-9808-7401","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548","first_name":"Eckhard"},{"full_name":"Doerr, Daniel","last_name":"Doerr","first_name":"Daniel"},{"first_name":"Fábio V.","last_name":"Martinez","full_name":"Martinez, Fábio V."}],"date_updated":"2023-05-16T08:49:30Z","doi":"10.1051/ro/2023052","type":"journal_article","status":"public","department":[{"_id":"542"}],"user_id":"15540","_id":"44857","issue":"3","year":"2023","date_created":"2023-05-16T08:48:22Z","publisher":"EDP Sciences","title":"Algorithms for the genome median under a restricted measure of rearrangement","publication":"RAIRO - Operations Research","abstract":[{"lang":"eng","text":"Ancestral reconstruction is a classic task in comparative genomics. Here, we study the genome median problem, a related computational problem which, given a set of three or more genomes, asks to find a new genome that minimizes the sum of pairwise distances between it and the given genomes. The distance stands for the amount of evolution observed at the genome level, for which we determine the minimum number of rearrangement operations necessary to transform one genome into the other. For almost all rearrangement operations the median problem is NP-hard, with the exception of the breakpoint median that can be constructed efficiently for multichromosomal circular and mixed genomes. In this work, we study the median problem under a restricted rearrangement measure called c4-distance, which is closely related to the breakpoint and the DCJ distance. We identify tight bounds and decomposers of the c4-median and develop algorithms for its construction, one exact ILP-based and three combinatorial heuristics. Subsequently, we perform experiments on simulated data sets. Our results suggest that the c4-distance is useful for the study the genome median problem, from theoretical and practical perspectives."}],"language":[{"iso":"eng"}],"keyword":["Management Science and Operations Research","Computer Science Applications","Theoretical Computer Science"]},{"title":"A common weights model for investigating efficiency-based leadership in the russian banking industry","doi":"10.1051/ro/2020143","date_updated":"2024-05-04T15:13:07Z","publisher":"EDP Sciences","volume":55,"author":[{"last_name":"Kazemi","full_name":"Kazemi, Sajad","first_name":"Sajad"},{"full_name":"Tavana, Madjid","id":"31858","last_name":"Tavana","first_name":"Madjid"},{"first_name":"Mehdi","last_name":"Toloo","full_name":"Toloo, Mehdi"},{"last_name":"Zenkevich","full_name":"Zenkevich, Nikolay A.","first_name":"Nikolay A."}],"date_created":"2024-05-04T14:45:40Z","year":"2021","intvolume":"        55","page":"213-229","citation":{"chicago":"Kazemi, Sajad, Madjid Tavana, Mehdi Toloo, and Nikolay A. Zenkevich. “A Common Weights Model for Investigating Efficiency-Based Leadership in the Russian Banking Industry.” <i>RAIRO - Operations Research</i> 55, no. 1 (2021): 213–29. <a href=\"https://doi.org/10.1051/ro/2020143\">https://doi.org/10.1051/ro/2020143</a>.","ieee":"S. Kazemi, M. Tavana, M. Toloo, and N. A. Zenkevich, “A common weights model for investigating efficiency-based leadership in the russian banking industry,” <i>RAIRO - Operations Research</i>, vol. 55, no. 1, pp. 213–229, 2021, doi: <a href=\"https://doi.org/10.1051/ro/2020143\">10.1051/ro/2020143</a>.","ama":"Kazemi S, Tavana M, Toloo M, Zenkevich NA. A common weights model for investigating efficiency-based leadership in the russian banking industry. <i>RAIRO - Operations Research</i>. 2021;55(1):213-229. doi:<a href=\"https://doi.org/10.1051/ro/2020143\">10.1051/ro/2020143</a>","apa":"Kazemi, S., Tavana, M., Toloo, M., &#38; Zenkevich, N. A. (2021). A common weights model for investigating efficiency-based leadership in the russian banking industry. <i>RAIRO - Operations Research</i>, <i>55</i>(1), 213–229. <a href=\"https://doi.org/10.1051/ro/2020143\">https://doi.org/10.1051/ro/2020143</a>","bibtex":"@article{Kazemi_Tavana_Toloo_Zenkevich_2021, title={A common weights model for investigating efficiency-based leadership in the russian banking industry}, volume={55}, DOI={<a href=\"https://doi.org/10.1051/ro/2020143\">10.1051/ro/2020143</a>}, number={1}, journal={RAIRO - Operations Research}, publisher={EDP Sciences}, author={Kazemi, Sajad and Tavana, Madjid and Toloo, Mehdi and Zenkevich, Nikolay A.}, year={2021}, pages={213–229} }","short":"S. Kazemi, M. Tavana, M. Toloo, N.A. Zenkevich, RAIRO - Operations Research 55 (2021) 213–229.","mla":"Kazemi, Sajad, et al. “A Common Weights Model for Investigating Efficiency-Based Leadership in the Russian Banking Industry.” <i>RAIRO - Operations Research</i>, vol. 55, no. 1, EDP Sciences, 2021, pp. 213–29, doi:<a href=\"https://doi.org/10.1051/ro/2020143\">10.1051/ro/2020143</a>."},"publication_identifier":{"issn":["0399-0559","1290-3868"]},"publication_status":"published","issue":"1","language":[{"iso":"eng"}],"_id":"53879","department":[{"_id":"277"}],"user_id":"51811","status":"public","publication":"RAIRO - Operations Research","type":"journal_article"},{"_id":"54010","user_id":"51811","department":[{"_id":"277"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"RAIRO - Operations Research","status":"public","date_updated":"2024-05-06T16:58:31Z","publisher":"EDP Sciences","date_created":"2024-05-06T16:56:36Z","author":[{"first_name":"Rashed Khanjani","full_name":"Shiraz, Rashed Khanjani","last_name":"Shiraz"},{"first_name":"Madjid","last_name":"Tavana","id":"31858","full_name":"Tavana, Madjid"},{"first_name":"Debora","full_name":"Di Caprio, Debora","last_name":"Di Caprio"}],"volume":52,"title":"Chance-constrained data envelopment analysis modeling with random-rough data","doi":"10.1051/ro/2016076","publication_status":"published","publication_identifier":{"issn":["0399-0559","1290-3868"]},"issue":"1","year":"2018","citation":{"chicago":"Shiraz, Rashed Khanjani, Madjid Tavana, and Debora Di Caprio. “Chance-Constrained Data Envelopment Analysis Modeling with Random-Rough Data.” <i>RAIRO - Operations Research</i> 52, no. 1 (2018): 259–84. <a href=\"https://doi.org/10.1051/ro/2016076\">https://doi.org/10.1051/ro/2016076</a>.","ieee":"R. K. Shiraz, M. Tavana, and D. Di Caprio, “Chance-constrained data envelopment analysis modeling with random-rough data,” <i>RAIRO - Operations Research</i>, vol. 52, no. 1, pp. 259–284, 2018, doi: <a href=\"https://doi.org/10.1051/ro/2016076\">10.1051/ro/2016076</a>.","ama":"Shiraz RK, Tavana M, Di Caprio D. Chance-constrained data envelopment analysis modeling with random-rough data. <i>RAIRO - Operations Research</i>. 2018;52(1):259-284. doi:<a href=\"https://doi.org/10.1051/ro/2016076\">10.1051/ro/2016076</a>","mla":"Shiraz, Rashed Khanjani, et al. “Chance-Constrained Data Envelopment Analysis Modeling with Random-Rough Data.” <i>RAIRO - Operations Research</i>, vol. 52, no. 1, EDP Sciences, 2018, pp. 259–84, doi:<a href=\"https://doi.org/10.1051/ro/2016076\">10.1051/ro/2016076</a>.","short":"R.K. Shiraz, M. Tavana, D. Di Caprio, RAIRO - Operations Research 52 (2018) 259–284.","bibtex":"@article{Shiraz_Tavana_Di Caprio_2018, title={Chance-constrained data envelopment analysis modeling with random-rough data}, volume={52}, DOI={<a href=\"https://doi.org/10.1051/ro/2016076\">10.1051/ro/2016076</a>}, number={1}, journal={RAIRO - Operations Research}, publisher={EDP Sciences}, author={Shiraz, Rashed Khanjani and Tavana, Madjid and Di Caprio, Debora}, year={2018}, pages={259–284} }","apa":"Shiraz, R. K., Tavana, M., &#38; Di Caprio, D. (2018). Chance-constrained data envelopment analysis modeling with random-rough data. <i>RAIRO - Operations Research</i>, <i>52</i>(1), 259–284. <a href=\"https://doi.org/10.1051/ro/2016076\">https://doi.org/10.1051/ro/2016076</a>"},"page":"259-284","intvolume":"        52"}]