{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:10:51Z","timestamp":1783577451984,"version":"3.55.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T00:00:00Z","timestamp":1207872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1186\/1471-2105-9-192","type":"journal-article","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T14:15:08Z","timestamp":1207923308000},"source":"Crossref","is-referenced-by-count":165,"title":["uShuffle: A useful tool for shuffling biological sequences while preserving the k-let counts"],"prefix":"10.1186","volume":"9","author":[{"given":"Minghui","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Anderson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joel","family":"Gillespie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Mayne","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,4,11]]},"reference":[{"issue":"4","key":"2177_CR1","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0403039","volume":"3","author":"DJ Aldous","year":"1990","unstructured":"Aldous DJ: The random walk construction of uniform spanning trees and uniform labelled trees. SIAM Journal of Discrete Mathematics 1990, 3(4):450\u2013465.","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"6","key":"2177_CR2","first-page":"526","volume":"2","author":"SF Altschul","year":"1985","unstructured":"Altschul SF, Erickson BW: Significance of nucleotide sequence alignment: a method for random sequence permutation that preserves dinucleotide and codon usage. Molecular Biology and Evolution 1985, 2(6):526\u2013538.","journal-title":"Molecular Biology and Evolution"},{"key":"2177_CR3","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s B: Modern Graph Theory. Springer; 2002."},{"issue":"17","key":"2177_CR4","doi-asserted-by":"publisher","first-page":"2911","DOI":"10.1093\/bioinformatics\/bth374","volume":"20","author":"E Bonnet","year":"2004","unstructured":"Bonnet E, Wuyts J, Rouz\u00e9 P, van de Peer Y: Evidence that microRNA precursors, unlike other non-coding RNAs, have lower folding free energies than random sequences. Bioinformatics 2004, 20(17):2911\u20132917.","journal-title":"Bioinformatics"},{"key":"2177_CR5","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/SFCS.1989.63516","volume-title":"Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS'89)","author":"A Broder","year":"1989","unstructured":"Broder A: Generating random spanning trees. Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS'89) 1989, 442\u2013447."},{"key":"2177_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1261\/rna.7220505","volume":"11","author":"P Clote","year":"2005","unstructured":"Clote P, Ferr'e F, Kranakis E, Krizanc D: Structural RNA has lower folding energy than random RNA of the same dinucleotide frequency. RNA 2005, 11: 578\u2013591.","journal-title":"RNA"},{"key":"2177_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0196-6774(89)90016-3","volume":"10","author":"CJ Colbourn","year":"1989","unstructured":"Colbourn CJ, Day RPJ, Nel LD: Unranking and ranking spanning trees of a graph. Journal of Algorithms 1989, 10: 271\u2013286.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"2177_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1006\/jagm.1996.0014","volume":"20","author":"CJ Colbourn","year":"1996","unstructured":"Colbourn CJ, Myrvold WJ, Neufeld E: Two algorithms for unranking arborescences. Journal of Algorithms 1996, 20(2):268\u2013281.","journal-title":"Journal of Algorithms"},{"key":"2177_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith D, Winograd S: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 1990, 9: 251\u2013280.","journal-title":"Journal of Symbolic Computation"},{"key":"2177_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C: Introduction to Algorithms. Second edition. MIT Press; 2001.","edition":"Second"},{"issue":"2","key":"2177_CR11","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1093\/bioinformatics\/15.12.1058","volume":"15","author":"E Coward","year":"1999","unstructured":"Coward E: Shufflet: shuffling sequences while conserving the k-let counts. Bioinformatics 1999, 15(2):1058\u20131059.","journal-title":"Bioinformatics"},{"key":"2177_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0022-2836(83)90002-5","volume":"163","author":"WM Fitch","year":"1983","unstructured":"Fitch WM: Random sequences. Journal of Molecular Biology 1983, 163: 171\u2013176.","journal-title":"Journal of Molecular Biology"},{"key":"2177_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1186\/1471-2105-6-241","volume":"6","author":"E Freyhult","year":"2005","unstructured":"Freyhult E, Gardner PP, Moulton V: A comparison of RNA folding measures. BMC Bioinformatics 2005, 6: 241.","journal-title":"BMC Bioinformatics"},{"key":"2177_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/0196-6774(83)90022-6","volume":"4","author":"A Gu\u00e9noche","year":"1983","unstructured":"Gu\u00e9noche A: Random spanning tree. Journal of Algorithms 1983, 4: 214\u2013220.","journal-title":"Journal of Algorithms"},{"issue":"1\u20133","key":"2177_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0166-218X(97)81456-4","volume":"71","author":"D Kandel","year":"1996","unstructured":"Kandel D, Matias Y, Unger R, Winker P: Shuffling biological sequences. Discrete Applied Mathematics 1996, 71(1\u20133):171\u2013185.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2177_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0196-6774(90)90002-V","volume":"11","author":"VG Kulkarni","year":"1990","unstructured":"Kulkarni VG: Generating random combinatorial objects. Journal of Algorithms 1990, 11(2):185\u2013207.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"2177_CR17","first-page":"153","volume":"4","author":"S-Y Le","year":"1988","unstructured":"Le S-Y, Chen J-H, Currey KM, Maizel JV Jr: A program for predicting significant RNA secondary structures. Computer Applications in the Biosciences 1988, 4(1):153\u2013159.","journal-title":"Computer Applications in the Biosciences"},{"issue":"19","key":"2177_CR18","doi-asserted-by":"publisher","first-page":"4545","DOI":"10.1093\/nar\/8.19.4545","volume":"8","author":"R Nussinov","year":"1980","unstructured":"Nussinov R: Sone rules in the ordering of nucleotides in the DNA. Nucleic Acids Research 1980, 8(19):4545\u20134562.","journal-title":"Nucleic Acids Research"},{"issue":"2","key":"2177_CR19","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jagm.1997.0917","volume":"27","author":"JG Propp","year":"1998","unstructured":"Propp JG, Wilson DB: How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. Journal of Algorithms 1998, 27(2):170\u2013217.","journal-title":"Journal of Algorithms"},{"issue":"7","key":"2177_CR20","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1093\/bioinformatics\/16.7.583","volume":"16","author":"E Rivas","year":"2000","unstructured":"Rivas E, Eddy SR: Secondary structure alone is generally not statistically significant for the detection of noncoding RNAs. Bioinformatics 2000, 16(7):583\u2013605.","journal-title":"Bioinformatics"},{"issue":"7","key":"2177_CR21","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1093\/nar\/27.7.1578","volume":"27","author":"W Seffens","year":"1999","unstructured":"Seffens W, Digby D: mRNAs have greater negative folding free energies than shuffled or codon choice randomized sequences. Nucleic Acids Research 1999, 27(7):1578\u20131584.","journal-title":"Nucleic Acids Research"},{"issue":"7","key":"2177_CR22","doi-asserted-by":"publisher","first-page":"2205","DOI":"10.1093\/nar\/11.7.2205","volume":"11","author":"TF Smith","year":"1983","unstructured":"Smith TF, Waterman MS, Sadler JR: Statistical characterization of nucleic acid sequence functional domains. Nucleic Acids Research 1983, 11(7):2205\u20132220.","journal-title":"Nucleic Acids Research"},{"key":"2177_CR23","first-page":"296","volume-title":"Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96)","author":"DB Wilson","year":"1996","unstructured":"Wilson DB: Generating random spanning trees more quickly than the cover time. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96) 1996, 296\u2013303."},{"key":"2177_CR24","first-page":"448","volume-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'96)","author":"DB Wilson","year":"1996","unstructured":"Wilson DB, Propp JG: How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'96) 1996, 448\u2013457."},{"issue":"24","key":"2177_CR25","doi-asserted-by":"publisher","first-page":"4816","DOI":"10.1093\/nar\/27.24.4816","volume":"27","author":"C Workman","year":"1999","unstructured":"Workman C, Krogh A: No evidence that mRNAs have lower folding free energies than random sequences with the same dinucleotide distribution. Nucleic Acids Research 1999, 27(24):4816\u20134822.","journal-title":"Nucleic Acids Research"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-9-192.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-9-192\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-9-192.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T04:36:28Z","timestamp":1548131788000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-9-192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,11]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["2177"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-9-192","relation":{"has-review":[{"id-type":"doi","id":"10.3410\/f.6237956.6307054","asserted-by":"object"}]},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,11]]},"article-number":"192"}}