{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T06:26:44Z","timestamp":1786688804015,"version":"build-2736575974"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T00:00:00Z","timestamp":1785110400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T00:00:00Z","timestamp":1785110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Math. Biol."],"published-print":{"date-parts":[[2026,8]]},"abstract":"Abstract<\/jats:title>\n \n Permutation groups provide a natural framework for modeling genomes and their rearrangement events, which is crucial for understanding evolutionary relationships. Double cosets can be used to model objects arising from multiple symmetries, such as circular genomes with repeated genes. Suppose\n \n \n $${\\varvec{\\lambda } = \\varvec{( \\lambda _1,}\\varvec{\\lambda _2,} \\varvec{\\dots , \\lambda _k)}}$$<\/jats:tex-math>\n \n \n \n \u03bb<\/mml:mi>\n <\/mml:mrow>\n =<\/mml:mo>\n \n (<\/mml:mo>\n \n \u03bb<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n ,<\/mml:mo>\n <\/mml:mrow>\n \n \n \u03bb<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n ,<\/mml:mo>\n <\/mml:mrow>\n \n \u22ef<\/mml:mo>\n ,<\/mml:mo>\n \n \u03bb<\/mml:mi>\n k<\/mml:mi>\n <\/mml:msub>\n \n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is a partition of\n \n \n $${{\\varvec{n}}}$$<\/jats:tex-math>\n \n \n n<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n which indicates the number of repeated regions or genes of different types (\n \n \n $$\\varvec{\\lambda _i}$$<\/jats:tex-math>\n \n \n \n \u03bb<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n of type\n \n \n $${{\\varvec{i}}}$$<\/jats:tex-math>\n \n \n i<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n with\n \n \n $${{\\varvec{n}}}$$<\/jats:tex-math>\n \n \n n<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n total regions). A circular genome with\n \n \n $${{\\varvec{n}}}$$<\/jats:tex-math>\n \n \n n<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n oriented regions determined by\n \n \n $$\\varvec{\\lambda }$$<\/jats:tex-math>\n \n \n \u03bb<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n can be identified with the double coset space\n \n \n $${\\varvec{S}}_{\\varvec{\\lambda }} \\backslash {\\varvec{B}}_{\\varvec{n}} \/ {\\varvec{D}}_{\\varvec{n}}$$<\/jats:tex-math>\n \n \n \n \n S<\/mml:mi>\n <\/mml:mrow>\n \n \u03bb<\/mml:mi>\n <\/mml:mrow>\n <\/mml:msub>\n \n \\<\/mml:mo>\n <\/mml:mrow>\n \n \n B<\/mml:mi>\n <\/mml:mrow>\n \n n<\/mml:mi>\n <\/mml:mrow>\n <\/mml:msub>\n \/<\/mml:mo>\n \n \n D<\/mml:mi>\n <\/mml:mrow>\n \n n<\/mml:mi>\n <\/mml:mrow>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , where\n \n \n $$\\varvec{B_n}$$<\/jats:tex-math>\n \n \n \n B<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is the hyperoctahedral group,\n \n \n $$\\varvec{D_n}$$<\/jats:tex-math>\n \n \n \n D<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n the dihedral group extended to\n \n \n $$\\varvec{B_n}$$<\/jats:tex-math>\n \n \n \n B<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , and\n \n \n $$\\varvec{S_\\lambda }$$<\/jats:tex-math>\n \n \n \n S<\/mml:mi>\n \u03bb<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n the Young subgroup extended to\n \n \n $$\\varvec{B_n}$$<\/jats:tex-math>\n \n \n \n B<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . This paper develops this correspondence and derives formulas for the sizes of double cosets and the number of double cosets in special cases. The size of double cosets gives the induced probability distribution on genomes from uniformly sampling\n \n \n $$\\varvec{B_n}$$<\/jats:tex-math>\n \n \n \n B<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . The representation is utilized to define Markov chains which capture the processes of inversions, transpositions, and translocations.\n <\/jats:p>","DOI":"10.1007\/s00285-026-02450-x","type":"journal-article","created":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T04:55:35Z","timestamp":1785128135000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Genome rearrangements as double coset Markov chains"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7084-8395","authenticated-orcid":false,"given":"Mackenzie A.","family":"Simper","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,27]]},"reference":[{"issue":"Suppl 1","key":"2450_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1186\/1471-2105-11-S1-S27","volume":"11","author":"M Bader","year":"2010","unstructured":"Bader M (2010) Genome rearrangements with duplications. BMC Bioinf 11(Suppl 1):27","journal-title":"BMC Bioinf"},{"key":"2450_CR2","doi-asserted-by":"publisher","first-page":"3227","DOI":"10.1007\/s11538-018-0514-3","volume":"80","author":"S Bhatia","year":"2018","unstructured":"Bhatia S, Feij\u00e3o P, Francis AR (2018) Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics. Bull Math Biol 80:3227\u20133246","journal-title":"Bull Math Biol"},{"key":"2450_CR3","doi-asserted-by":"crossref","unstructured":"Bergeron A, Mixtacki J, Stoye J (2006) A unifying view of genome rearrangements. In: Algorithms in bioinformatics: 6th international workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006. Proceedings 6, pp. 163\u2013173. Springer","DOI":"10.1007\/11851561_16"},{"issue":"5","key":"2450_CR4","doi-asserted-by":"publisher","first-page":"3303","DOI":"10.1214\/19-AOP1340","volume":"47","author":"M Bernstein","year":"2019","unstructured":"Bernstein M, Nestoridi E (2019) Cutoff for random to random card shuffle. Ann Probab 47(5):3303\u20133320","journal-title":"Ann Probab"},{"key":"2450_CR5","first-page":"239","volume":"12","author":"V Bafna","year":"1995","unstructured":"Bafna V, Pevzner PA (1995) Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome. Mol Biol Evol 12:239\u2013239","journal-title":"Mol Biol Evol"},{"issue":"2","key":"2450_CR6","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna V, Pevzner PA (1996) Genome rearrangements and sorting by reversals. SIAM J Comput 25(2):272\u2013289","journal-title":"SIAM J Comput"},{"issue":"08","key":"2450_CR7","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1090\/proc\/16853","volume":"152","author":"J Britnell","year":"2024","unstructured":"Britnell J, Wildon M (2024) A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle. Proceed Am Math Soc 152(08):3265\u20133274","journal-title":"Proceed Am Math Soc"},{"issue":"4","key":"2450_CR8","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1111\/j.1558-5646.1997.tb03962.x","volume":"51","author":"M C\u00e1ceres","year":"1997","unstructured":"C\u00e1ceres M, Barbadilla A, Ruiz A (1997) Inversion length and breakpoint distribution in the drosophila buzzatii species complex: is inversion length a selected trait? Evolution 51(4):1149\u20131155","journal-title":"Evolution"},{"issue":"3","key":"2450_CR9","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1214\/105051606000000295","volume":"16","author":"N Cancrini","year":"2006","unstructured":"Cancrini N, Caputo P, Martinelli F (2006) Relaxation time of L-reversal chains and other chromosome shuffles. Ann Appl Probab 16(3):1506\u20131527","journal-title":"Ann Appl Probab"},{"issue":"2","key":"2450_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00285-023-01965-x","volume":"87","author":"C Clark","year":"2023","unstructured":"Clark C, Jonu\u0161as J, Mitchell JD, Francis A (2023) An algebraic model for inversion and deletion in bacterial genome rearrangement. J Math Biol 87(2):34","journal-title":"J Math Biol"},{"key":"2450_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jalgebra.2025.09.036","volume":"689","author":"P Diaconis","year":"2026","unstructured":"Diaconis P, Giannelli E, Guralnick RM, Law S, Navarro G, Sambale B, Spink H (2026) On the number and sizes of double cosets of Sylow subgroups of the symmetric group. J Algebra 689:62\u201386","journal-title":"J Algebra"},{"key":"2450_CR12","unstructured":"Diaconis P (1988) Group Representations in probability and statistics. Institute of mathematical statistics lecture notes\u2014monograph series, vol. 11, p. 198. Institute of Mathematical Statistics, Hayward, CA"},{"key":"2450_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1017\/fms.2022.106","volume":"11","author":"P Diaconis","year":"2023","unstructured":"Diaconis P, Ram A, Simper M (2023) Double coset Markov chains. Forum Math Sigma 11:2","journal-title":"Forum Math Sigma"},{"issue":"3","key":"2450_CR14","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1023\/A:1025676617383","volume":"16","author":"R Durrett","year":"2003","unstructured":"Durrett R (2003) Shuffling chromosomes. J Theor Probab 16(3):725\u2013750","journal-title":"J Theor Probab"},{"key":"2450_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78168-6","volume-title":"Probability Models for DNA Sequence Evolution","author":"R Durrett","year":"2008","unstructured":"Durrett R (2008) Probability Models for DNA Sequence Evolution, vol 2. Springer, New York, NY"},{"key":"2450_CR16","doi-asserted-by":"publisher","first-page":"102955","DOI":"10.1016\/j.aam.2025.102955","volume":"172","author":"P Diaconis","year":"2026","unstructured":"Diaconis P, Zhong C (2026) Counting the number of group orbits by marrying the burnside process with importance sampling. Adv Appl Math 172:102955","journal-title":"Adv Appl Math"},{"issue":"1","key":"2450_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00285-013-0702-6","volume":"69","author":"A Egri-Nagy","year":"2014","unstructured":"Egri-Nagy A, Gebhardt V, Tanaka MM, Francis AR (2014) Group-theoretic models of the inversion process in bacterial genomes. J Math Biol 69(1):243\u2013265","journal-title":"J Math Biol"},{"issue":"6","key":"2450_CR18","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1007\/s00285-013-0747-6","volume":"69","author":"AR Francis","year":"2014","unstructured":"Francis AR (2014) An algebraic view of bacterial genome evolution. J Math Biol 69(6):1693\u20131718","journal-title":"J Math Biol"},{"key":"2450_CR19","doi-asserted-by":"publisher","first-page":"985","DOI":"10.30757\/ALEA.v18-36","volume":"18","author":"S Ghosh","year":"2021","unstructured":"Ghosh S (2021) Total variation cutoff for the flip-transpose top with random shuffle. Latin Am J Probability Math Stat 18:985","journal-title":"Latin Am J Probability Math Stat"},{"issue":"1","key":"2450_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner PA (1999) Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J ACM (JACM) 46(1):1\u201327","journal-title":"J ACM (JACM)"},{"key":"2450_CR21","unstructured":"James G, Kerber A (1981) The representation theory of the symmetric group. Encyclopedia of mathematics and its applications, vol 16. Addison-Wesley Publishing Co, Reading, Mass,"},{"issue":"3","key":"2450_CR22","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1002\/j.1460-2075.1993.tb05746.x","volume":"12","author":"A Klippel","year":"1993","unstructured":"Klippel A, Kanaar R, Kahmann R, Cozzarelli N (1993) Analysis of strand exchange and DNA binding of enhancer-independent Gin recombinase mutants. EMBO J 12(3):1047\u20131057","journal-title":"EMBO J"},{"key":"2450_CR23","volume-title":"Symmetric Functions and Hall Polynomials","author":"IG Macdonald","year":"1998","unstructured":"Macdonald IG (1998) Symmetric Functions and Hall Polynomials. Oxford University Press, Oxford, UK"},{"issue":"2","key":"2450_CR24","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1214\/08-AOP409","volume":"37","author":"B Morris","year":"2009","unstructured":"Morris B (2009) Improved mixing time bounds for the Thorp shuffle and L-reversal chain. Ann Probab 37(2):453\u2013477","journal-title":"Ann Probab"},{"key":"2450_CR25","unstructured":"Matheau-Raven O (2020) Random walks on the symmetric group: cutoff for one-sided transposition shuffles. University of York,(PhD thesis)"},{"key":"2450_CR26","doi-asserted-by":"crossref","unstructured":"Moshe A, Wygoda E, Ecker N, Loewenthal G, Avram O, Israeli O, Hazkani-Covo E, Pe\u2019er I, Pupko T (2022) An approximate Bayesian computation approach for modeling genome rearrangements. Mol Biol Evol 39(11):231","DOI":"10.1093\/molbev\/msac231"},{"key":"2450_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02143500","volume":"28","author":"JD Palmer","year":"1988","unstructured":"Palmer JD, Herbon LA (1988) Plant mitochondrial DNA evolved rapidly in structure, but slowly in sequence. J Mol Evol 28:87\u201397","journal-title":"J Mol Evol"},{"issue":"6","key":"2450_CR28","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1016\/S0959-437X(00)00253-7","volume":"11","author":"D Sankoff","year":"2001","unstructured":"Sankoff D (2001) Gene and genome duplication. Curr Opin Genet & Develop 11(6):681\u2013684","journal-title":"Curr Opin Genet & Develop"},{"key":"2450_CR29","doi-asserted-by":"publisher","first-page":"102982","DOI":"10.1016\/j.aam.2025.102982","volume":"173","author":"L Schwob","year":"2025","unstructured":"Schwob L (2025) On the enumeration of double cosets and self-inverse double cosets. Adv Appl Math 173:102982","journal-title":"Adv Appl Math"},{"issue":"7","key":"2450_CR30","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1073\/pnas.22.7.448","volume":"22","author":"AH Sturtevant","year":"1936","unstructured":"Sturtevant AH, Dobzhansky T (1936) Inversions in the third chromosome of wild races of Drosophila pseudoobscura, and their use in the study of the history of the species. Proc Natl Acad Sci 22(7):448\u2013450","journal-title":"Proc Natl Acad Sci"},{"key":"2450_CR31","unstructured":"Simper MA (2022) Double coset Markov chains. Stanford University,(PhD thesis)"},{"key":"2450_CR32","doi-asserted-by":"crossref","unstructured":"Simper M (2023) Random transpositions on contingency tables. J Theor Probab 1\u201335","DOI":"10.1007\/s10959-023-01286-1"},{"issue":"4","key":"2450_CR33","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10959-005-7532-4","volume":"18","author":"CH Schoolfield Jr","year":"2005","unstructured":"Schoolfield CH Jr (2005) Generating a random signed permutation with random reversals. J Theor Probab 18(4):911\u2013931","journal-title":"J Theor Probab"},{"issue":"33","key":"2450_CR34","doi-asserted-by":"publisher","first-page":"335601","DOI":"10.1088\/1751-8121\/aa7d60","volume":"50","author":"JG Sumner","year":"2017","unstructured":"Sumner JG, Jarvis PD, Francis AR (2017) A representation-theoretic approach to the calculation of evolutionary distance in bacteria. J Phys A: Math Theor 50(33):335601","journal-title":"J Phys A: Math Theor"},{"issue":"4","key":"2450_CR35","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou N, Nei M (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol 4(4):406\u2013425","journal-title":"Mol Biol Evol"},{"issue":"11","key":"2450_CR36","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11538-023-01209-5","volume":"85","author":"J Stevenson","year":"2023","unstructured":"Stevenson J, Terauds V, Sumner J (2023) Rearrangement events on circular genomes. Bull Math Biol 85(11):107","journal-title":"Bull Math Biol"},{"issue":"6","key":"2450_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00285-022-01744-0","volume":"84","author":"V Terauds","year":"2022","unstructured":"Terauds V, Sumner J (2022) A new algebraic approach to genome rearrangement models. J Math Biol 84(6):1\u201332","journal-title":"J Math Biol"},{"key":"2450_CR38","volume-title":"Markov Chains and Mixing Times","author":"EL Wilmer","year":"2009","unstructured":"Wilmer EL, Levin DA, Peres Y (2009) Markov Chains and Mixing Times. American Mathematical Soc, Providence"},{"issue":"16","key":"2450_CR39","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 (2005) Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16):3340\u20133346","journal-title":"Bioinformatics"}],"container-title":["Journal of Mathematical Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00285-026-02450-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00285-026-02450-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00285-026-02450-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T05:26:45Z","timestamp":1786685205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00285-026-02450-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,27]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["2450"],"URL":"https:\/\/doi.org\/10.1007\/s00285-026-02450-x","relation":{},"ISSN":["0303-6812","1432-1416"],"issn-type":[{"value":"0303-6812","type":"print"},{"value":"1432-1416","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,27]]},"assertion":[{"value":"3 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author has no conflict of interest to report.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"25"}}