{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T23:12:45Z","timestamp":1687561965019},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,15]],"date-time":"2012-06-15T00:00:00Z","timestamp":1339718400000},"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":[[2012,12]]},"DOI":"10.1186\/1748-7188-7-18","type":"journal-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:29:45Z","timestamp":1340803785000},"source":"Crossref","is-referenced-by-count":1,"title":["Sampling solution traces for the problem of sorting permutations by signed reversals"],"prefix":"10.1186","volume":"7","author":[{"given":"Christian","family":"Baudet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zanoni","family":"Dias","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":[[2012,6,15]]},"reference":[{"key":"161_CR1","first-page":"581","volume-title":"FOCS IEEE Computer Society","author":"S Hannenhalli","year":"1995","unstructured":"Hannenhalli S, Pevzner PA: Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem). FOCS IEEE Computer Society. 1995, 581-592."},{"key":"161_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner PA: 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":"161_CR3","first-page":"106","volume-title":"Proceedings of the 12th Annual Symposium of the Combinatorial Pattern Matching (CPM\u20192001), Volume 2089 of Lecture Notes in Computer Science","author":"A Bergeron","year":"2001","unstructured":"Bergeron A: A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. Proceedings of the 12th Annual Symposium of the Combinatorial Pattern Matching (CPM\u20192001), Volume 2089 of Lecture Notes in Computer Science. 2001, 106-117. Jerusalem, Israel,"},{"key":"161_CR4","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 MF: Advances on sorting by reversals. Discrete Applied Mathematics. 2007, 155: 881-888. 10.1016\/j.dam.2005.02.033","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"161_CR5","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 Distance Between Signed Permutations with an Experimental Study. Journal of Computational Biology. 2001, 8 (5): 483-491. 10.1089\/106652701753216503","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"161_CR6","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1089\/cmb.2009.0184","volume":"17","author":"KM Swenson","year":"2010","unstructured":"Swenson KM, Rajan V, Lin Y, Moret BME: Sorting Signed Permutations by Inversions in O(n log n) Time. Journal of Computational Biology. 2010, 17 (3): 489-501. 10.1089\/cmb.2009.0184","journal-title":"Journal of Computational Biology"},{"issue":"16","key":"161_CR7","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos S, Attie O, Friedberg R: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. 2005, 21 (16): 3340-3346. 10.1093\/bioinformatics\/bti535","journal-title":"Bioinformatics"},{"key":"161_CR8","doi-asserted-by":"publisher","first-page":"5300","DOI":"10.1016\/j.tcs.2009.09.008","volume":"410","author":"A Bergeron","year":"2009","unstructured":"Bergeron A, Mixtacki J, Stoye J: A new linear time algorithm to compute the genomic distance via the double cut and join distance. Theoretical Computer Science. 2009, 410: 5300-5316. 10.1016\/j.tcs.2009.09.008","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"161_CR9","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"MDV Braga","year":"2010","unstructured":"Braga MDV, Stoye J: The Solution Space of Sorting by DCJ. Journal of Computational Biology. 2010, 17 (9): 1145-1165. 10.1089\/cmb.2010.0109","journal-title":"Journal of Computational Biology"},{"issue":"24","key":"161_CR10","doi-asserted-by":"publisher","first-page":"3012","DOI":"10.1093\/bioinformatics\/btq574","volume":"26","author":"I Mikl\u00f3s","year":"2010","unstructured":"Mikl\u00f3s I, Tannier E: Bayesian sampling of genomic rearrangement scenarios via double cut and join. Bioinformatics. 2010, 26 (24): 3012-3019. 10.1093\/bioinformatics\/btq574","journal-title":"Bioinformatics"},{"issue":"3-4","key":"161_CR11","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1089\/10665270360688200","volume":"10","author":"AC Siepel","year":"2003","unstructured":"Siepel AC: An Algorithm to Enumerate Sorting Reversals. Journal of Computational Biology. 2003, 10 (3-4): 575-597. 10.1089\/10665270360688200","journal-title":"Journal of Computational Biology"},{"key":"161_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/1748-7188-6-11","volume":"6","author":"KM Swenson","year":"2011","unstructured":"Swenson KM, Badr G, Sankoff D: Listing all sorting reversals in quadratic time. Algorithms for Molecular Biology. 2011, 6: 11- 10.1186\/1748-7188-6-11","journal-title":"Algorithms for Molecular Biology"},{"issue":"6","key":"161_CR13","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1089\/10665270260518281","volume":"9","author":"TL York","year":"2002","unstructured":"York TL, Durrett R, Nielsen R: Bayesian Estimation of the Number of Inversions in the History of Two Chromosomes. Journal of Computational Biology. 2002, 9 (6): 805-818. 10.1089\/10665270260518281","journal-title":"Journal of Computational Biology"},{"key":"161_CR14","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1534\/genetics.166.1.621","volume":"166","author":"R Durrett","year":"2004","unstructured":"Durrett R, Nielsen R, York TL: Bayesian Estimation of Genomic Distance. Genetics. 2004, 166: 621-629. 10.1534\/genetics.166.1.621","journal-title":"Genetics"},{"issue":"Suppl. 2","key":"161_CR15","doi-asserted-by":"crossref","first-page":"ii130","DOI":"10.1093\/bioinformatics\/btg1070","volume":"19","author":"I Mikl\u00f3s","year":"2003","unstructured":"Mikl\u00f3s I: MCMC genome rearrangement. Bioinformatics. 2003, 19 (Suppl. 2): ii130-ii137.","journal-title":"Bioinformatics"},{"issue":"3","key":"161_CR16","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1093\/molbev\/msi032","volume":"22","author":"B Larget","year":"2005","unstructured":"Larget B, Simon DL, Kadane JB, Sweet D: A Bayesian Analysis of Metazoa Mitochondrial Genome Arrangements. Molecular Biology and Evolution. 2005, 22 (3): 486-495.","journal-title":"Molecular Biology and Evolution"},{"key":"161_CR17","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ympev.2005.03.026","volume":"36","author":"B Larget","year":"2005","unstructured":"Larget B, Kadane JB, Simon DL: A Bayesian approach to the estimation of ancestral genome arrangements. Molecular Phylogenetics and Evolution. 2005, 36: 214-223. 10.1016\/j.ympev.2005.03.026","journal-title":"Molecular Phylogenetics and Evolution"},{"key":"161_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1093\/gbe\/evp015","volume":"1","author":"I Mikl\u00f3s","year":"2009","unstructured":"Mikl\u00f3s I, Darling AE: Efficient Sampling of Parsimonious Inversion Histories with Application to Genome Rearrangement in Yersinia. Genome Biology and Evolution. 2009, 1: 153-164.","journal-title":"Genome Biology and Evolution"},{"key":"161_CR19","first-page":"99","volume-title":"Proceedings of the JOBIM 2002","author":"A Bergeron","year":"2002","unstructured":"Bergeron A, Chauve C, Hartman T, Saint-Onge K: On the Properties of Sequences of Reversals that Sort a Signed Permutation. Proceedings of the JOBIM 2002. 2002, 99-108. Saint Malo,"},{"key":"161_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0079468","volume-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. No. 85 in Lecture Notes in Mathematics","author":"P Cartier","year":"1969","unstructured":"Cartier P, Foata D: Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. No. 85 in Lecture Notes in Mathematics. 1969, Berlin: Springer-Verlag,"},{"issue":"3","key":"161_CR21","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TCBB.2008.16","volume":"5","author":"MDV Braga","year":"2008","unstructured":"Braga MDV, Sagot MF, Scornavacca C, Tannier E: Exploring the solution space of sorting by reversals with experiments and an application to evolution. Transactions on Computational Biology and Bioinformatics. 2008, 5 (3): 348-356.","journal-title":"Transactions on Computational Biology and Bioinformatics"},{"key":"161_CR22","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/1748-7188-4-16","volume":"4","author":"MDV Braga","year":"2009","unstructured":"Braga MDV, Gautier C, Sagot MF: An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology. 2009, 4: 16- 10.1186\/1748-7188-4-16","journal-title":"Algorithms for Molecular Biology"},{"key":"161_CR23","volume-title":"Exploring the Solution Space of Sorting by Reversals When Analyzing Genome Rearrangements","author":"MDV Braga","year":"2008","unstructured":"Braga MDV: Exploring the Solution Space of Sorting by Reversals When Analyzing Genome Rearrangements. 2008, France: Universit\u00e9 Lyon 1,"},{"key":"161_CR24","doi-asserted-by":"crossref","unstructured":"Baudet C, Dias Z: An Improved Algorithm to Enumerate All Traces that Sort a Signed Permutation by Reversals. Proceedings of the 25th Symposium On Applied Computing (ACM SAC 2010). Sierre, Switzerland 2010: [5 pages, Bioinformatics Track],","DOI":"10.1145\/1774088.1774416"},{"key":"161_CR25","first-page":"39","volume-title":"Proceedings of the 8th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG 2010), Volume 6398 of Lecture Notes in Bioinformatics","author":"G Badr","year":"2010","unstructured":"Badr G, Swenson K, Sankoff D: Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives. Proceedings of the 8th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG 2010), Volume 6398 of Lecture Notes in Bioinformatics. Edited by: Tannier E. 2010, 39-49. Ottawa, Canada: Springer-Verlag Berlin Heidelberg,"},{"key":"161_CR26","doi-asserted-by":"publisher","first-page":"i190","DOI":"10.1093\/bioinformatics\/btg1025","volume":"19","author":"JF Lefebvre","year":"2003","unstructured":"Lefebvre JF, El-Mabrouk N, Tillier E, Sankoff D: Detection and validation of single gene inversions. Bioinformatics. 2003, 19: i190-i196. 10.1093\/bioinformatics\/btg1025","journal-title":"Bioinformatics"},{"key":"161_CR27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1093\/genetics\/153.1.251","volume":"153","author":"M C\u00e1ceres","year":"1999","unstructured":"C\u00e1ceres M, Barbadilla A, Ruiz A: Recombination Rate Predicts Inversion Size in Diptera. Genetics. 1999, 153: 251-259.","journal-title":"Genetics"},{"issue":"7","key":"161_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pgen.1000128","volume":"4","author":"AE Darling","year":"2008","unstructured":"Darling AE, Mikl\u00f3s I, Ragan MA: Dynamics of Genome Rearrangement in Bacterial Populations. PLOS Genetics. 2008, 4 (7): 1-16.","journal-title":"PLOS Genetics"},{"key":"161_CR29","first-page":"97","volume-title":"Proceedings of the 2nd Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG 2004), Volume 3388 of Lecture Notes in Bioinformatics","author":"D Sankoff","year":"2005","unstructured":"Sankoff D, Lefebvre JF, Tillier E, Maler A, El-Mabrouk N: The Distribution of Inversion Lengths in Bacteria. Proceedings of the 2nd Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG 2004), Volume 3388 of Lecture Notes in Bioinformatics. Edited by: Lagergren J. 2005, 97-108. Bertinoro, Italy: Springer-Verlag Berlin Heidelberg,"},{"issue":"14","key":"161_CR30","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. [Applications Notes], 10.1093\/bioinformatics\/btp285","journal-title":"Bioinformatics"},{"key":"161_CR31","first-page":"241","volume-title":"Proceedings of the International Workshop on Comparative Genomics (RECOMB-CG\u201908) Volume 5267 of Lecture Notes in Computer Science","author":"KM Swenson","year":"2008","unstructured":"Swenson KM, Lin Y, Rajan V, Moret BM: Hurdles Hardly Have to Be Heeded. Proceedings of the International Workshop on Comparative Genomics (RECOMB-CG\u201908) Volume 5267 of Lecture Notes in Computer Science. 2008, 241-251. Paris,"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-18.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-7-18\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-18.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T22:40:03Z","timestamp":1687560003000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-7-18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,15]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["161"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-7-18","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,15]]},"article-number":"18"}}