uShuffle: A useful tool for shuffling biological sequences while preserving the k-let counts
Open Access
- 11 April 2008
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 9 (1) , 192
Abstract
Randomly shuffled sequences are routinely used in sequence analysis to evaluate the statistical significance of a biological sequence. In many cases, biologists need sophisticated shuffling tools that preserve not only the counts of distinct letters but also higher-order statistics such as doublet counts, triplet counts, and, in general, k-let counts.Keywords
This publication has 24 references indexed in Scilit:
- Structural RNA has lower folding energy than random RNA of the same dinucleotide frequencyRNA, 2005
- Evidence that microRNA precursors, unlike other non-coding RNAs, have lower folding free energies than random sequencesBioinformatics, 2004
- Modern Graph TheoryJournal of the American Statistical Association, 2000
- Two Algorithms for Unranking ArborescencesJournal of Algorithms, 1996
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled TreesSIAM Journal on Discrete Mathematics, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Unranking and ranking spanning trees of a graphJournal of Algorithms, 1989
- Generating random spanning trees1989
- Significance of nucleotide sequence alignments: a method for random sequence permutation that preserves dinucleotide and codon usage.Molecular Biology and Evolution, 1985