{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:38:43Z","timestamp":1648586323628},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1186\/1748-7188-4-16","type":"journal-article","created":{"date-parts":[[2009,12,30]],"date-time":"2009-12-30T14:15:29Z","timestamp":1262182529000},"source":"Crossref","is-referenced-by-count":4,"title":["An asymmetric approach to preserve common intervals while sorting by reversals"],"prefix":"10.1186","volume":"4","author":[{"given":"Mar\u00edlia DV","family":"Braga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Gautier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,30]]},"reference":[{"key":"73_CR1","unstructured":"Pevzner P: \"Computational Molecular Biology - An Algorithmic Approach\". The MIT Press"},{"key":"73_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1371\/journal.pgen.0030014","volume":"3","author":"G Blanc","year":"2007","unstructured":"Blanc G, Ogata H, Robert C, Audic S, Suhre K, Vestris G, Claverie J-M, Raoult D: \"Reductive genome evolution from the mother of Rickettsia\". PLoS Genetics. 2007, 3: 103-114. 10.1371\/journal.pgen.0030014.","journal-title":"PLoS Genetics"},{"key":"73_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner P: \"Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)\". Journal of the ACM. 1999, 46: 1-27. 10.1145\/300515.300516.","journal-title":"Journal of the ACM"},{"key":"73_CR4","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/SFCS.1995.492588","volume-title":"Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science","author":"S Hannenhalli","year":"1995","unstructured":"Hannenhalli S, Pevzner PA: \"Transforming men into mice (polynomial algorithm for genomic distance problem)\". Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science. 1995, 581-592."},{"issue":"6-7","key":"73_CR5","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E Tannier","year":"2007","unstructured":"Tannier E, Bergeron A, Sagot M-F: \"Advances on Sorting by Reversals\". Discrete Applied Mathematics. 2007, 155 (6-7): 881-888. 10.1016\/j.dam.2005.02.033. (A preliminary version appeared in CPM 2004, Lecture Notes in Computer Science, vol. 3595, 42-51). 10.1016\/j.dam.2005.02.033","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"73_CR6","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"DA Bader","year":"2001","unstructured":"Bader DA, Moret BME, Yan M: \"A linear-time algorithm for computing inversion distances between signed permutations with an experimental study\". J Comput Biol. 2001, 8 (5): 483-491. 10.1089\/106652701753216503","journal-title":"J Comput Biol"},{"key":"73_CR7","volume-title":"Mathematics of evolution and phylogeny","author":"A Bergeron","year":"2005","unstructured":"Bergeron A, Mixtacki J, Stoye J: \"The inversion distance problem\". Mathematics of evolution and phylogeny. Edited by: Gascuel O. 2005, Oxford University Press"},{"key":"73_CR8","volume-title":"Proceedings of The 2006 International Conference on Bioinformatics and Computational Biology","author":"Y Han","year":"2006","unstructured":"Han Y: \"Improving the Efficiency of Sorting by Reversals\". Proceedings of The 2006 International Conference on Bioinformatics and Computational Biology. 2006, CSREA Press, Las Vegas, Nevada, USA"},{"key":"73_CR9","first-page":"583","volume-title":"Proc 6th Pacific Symp on Biocomputing (PSB 2001)","author":"BME Moret","year":"2001","unstructured":"Moret BME, Wyman S, Bader DA, Warnow T, Yan M: \"A new implementation and detailed study of breakpoint analysis\". Proc 6th Pacific Symp on Biocomputing (PSB 2001). 2001, 583-594. Hawaii, World Scientific Pub"},{"issue":"3","key":"73_CR10","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1093\/bioinformatics\/18.3.492","volume":"18","author":"G Tesler","year":"2002","unstructured":"Tesler G: \"GRIMM: genome rearrangements web server\". Bioinformatics. 2002, 18 (3): 492-493. 10.1093\/bioinformatics\/18.3.492","journal-title":"Bioinformatics"},{"issue":"2","key":"73_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TCBB.2007.1042","volume":"4","author":"Y Diekmann","year":"2005","unstructured":"Diekmann Y, Sagot MF, Tannier E: \"Evolution under reversals: parsimony and conservation of common intervals\". IEEE\/ACM Transactions on Computational Biology and Bioinformatics. 2005, 4 (2): 301-309. 10.1109\/TCBB.2007.1042. (A preliminary version appeared in COCOON Lecture Notes in Computer Science, vol. 3595, 42-51).","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"73_CR12","first-page":"1","volume":"3388","author":"S Berard","year":"2005","unstructured":"Berard S, Bergeron A, Chauve C: \"Conserved structures in evolution scenarios.\". RCG Lecture Notes in Bioinformatics. 2005, 3388: 1-15.","journal-title":"RCG Lecture Notes in Bioinformatics"},{"issue":"1","key":"73_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCBB.2007.1011","volume":"4","author":"S Berard","year":"2007","unstructured":"Berard S, Bergeron A, Chauve C, Paul C: \"Perfect sorting by reversals is not always difficult\". IEEE\/ACM Transactions on Computational Biology and Bioinformatics. 2007, 4 (1): 4-16. 10.1109\/TCBB.2007.1011.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"Suppl. 2","key":"73_CR14","doi-asserted-by":"publisher","first-page":"S54","DOI":"10.1093\/bioinformatics\/18.suppl_2.S54","volume":"18","author":"A Bergeron","year":"2002","unstructured":"Bergeron A, Heber S, Stoye J: \"Common intervals and sorting by reversals: a marriage of necessity\". Bioinformatics. 2002, 18 (Suppl. 2): S54-63.","journal-title":"Bioinformatics"},{"key":"73_CR15","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1089\/10665270360688200","volume":"10","author":"A Siepel","year":"2003","unstructured":"Siepel A: \"An algorithm to enumerate sorting reversals for signed permutations\". J Comput Biol. 2003, 10: 575-597. 10.1089\/10665270360688200","journal-title":"J Comput Biol"},{"key":"73_CR16","first-page":"99","volume-title":"JOBIM","author":"A Bergeron","year":"2002","unstructured":"Bergeron A, Chauve C, Hartmann T, St-Onge K: \"On the properties of sequences of reversals that sort a signed permutation\". JOBIM. 2002, 99-108."},{"issue":"3","key":"73_CR17","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TCBB.2008.16","volume":"5","author":"MDV Braga","year":"2008","unstructured":"Braga MDV, Sagot M-F, Scornavacca C, Tannier E: \"Exploring The Solution Space of Sorting by Reversals With Experiments and an Application to Evolution\". Transactions on Comp Biology and Bioinformatics. 2008, 5 (3): 348-356. 10.1109\/TCBB.2008.16. (A preliminary version appeared in ISBRA 2007, Lecture Notes in Bioinformatics vol. 4463, 293-304).","journal-title":"Transactions on Comp Biology and Bioinformatics"},{"issue":"2","key":"73_CR18","doi-asserted-by":"publisher","first-page":"e129","DOI":"10.1093\/bioinformatics\/btl300","volume":"23","author":"M Bernt","year":"2007","unstructured":"Bernt M, Merkle D, Middendorf M: \"Using median sets for inferring phylogenetic trees\". Bioinformatics. 2007, 23 (2): e129-135. 10.1093\/bioinformatics\/btl300","journal-title":"Bioinformatics"},{"key":"73_CR19","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1186\/1471-2105-9-516","volume":"9","author":"M Bader","year":"2008","unstructured":"Bader M, Abouelhoda MI, Ohlebusch E: \"A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions\". BMC Bioinformatics. 2008, 9: 516. 10.1186\/1471-2105-9-516","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"73_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/ijoc.15.1.93.15155","volume":"15","author":"A Caprara","year":"2003","unstructured":"Caprara A: \"The Reversal Median Problem\". INFORMS Journal on Computing. 2003, 15 (1): 93-113. 10.1287\/ijoc.15.1.93.15155.","journal-title":"INFORMS Journal on Computing"},{"key":"73_CR21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-48194-X_19","volume":"2089","author":"S Heber","year":"2001","unstructured":"Heber S, Stoye J: \"Finding all common intervals of k permutations\". Combinatorial Pattern Matching, 12th Annual Symposium, Lecture Notes in Computer Science. 2001, 2089: 207-218.","journal-title":"Combinatorial Pattern Matching, 12th Annual Symposium, Lecture Notes in Computer Science"},{"issue":"14","key":"73_CR22","doi-asserted-by":"publisher","first-page":"1833","DOI":"10.1093\/bioinformatics\/btp285","volume":"25","author":"MDV Braga","year":"2009","unstructured":"Braga MDV: \"baobabLUNA: the solution space of sorting by reversals\". Bioinformatics. 2009, 25 (14): 1833-1835. 10.1093\/bioinformatics\/btp285","journal-title":"Bioinformatics"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-4-16.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-4-16\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-4-16.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T18:36:50Z","timestamp":1548095810000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-4-16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["73"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-4-16","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]},"article-number":"16"}}