Shuffling biological sequences

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 171-185

  Kandel, D ^a   Matias, Y ^b   Unger, R ^c   Winkler, P ^b  

^a HARVARD UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004608699     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)81456-4     Document Type: Article

References (20)

1. D.J. Aldous, The random walk construction for spanning trees and uniform labelled trees, SIAM J. Discrete Math. 3 (1990) 450-465.
2. S.F. Altschul and B.W. Erickson, Significance of nucleotide sequence alignments: a method for random sequence permutation that preserves dinucleatide and codon usage, Mol. Biol. Evol. 2 (1985) 526-538.
3. D. Bayer and P. Diaconis, Trailing the dovetail shuffle to its lair, Ann. Appl. Probab. 2 (1992) 294-313.
4. A. Broder, Generating random spanning trees, in: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (1989) 442-447.
5. P.G. Doyle and J.L. Snell, Random Walks and Electric Networks (Mathematical Assoc. of America, Washington, DC, 1984).
6. S. Even. Graph Algorithms (Computer Science Press, Potomac, MD, 1979).
7. W.M. Fitch, Random sequences, J. Mol. Biol. 163 (1983) 171-176.
8. G. Frobenius, Über matrizen aus positiven elementen, Sitzber. Akad. Wiss. Berlin, Phys. math. Kl. (1908) 471-476.
9. G. Frobenius, Über matrizen aus positiven elementen, Sitzber. Akad. Wiss. Berlin, Phys. math. Kl. (1909) 514-518.
10. G. Frobenius, Über matrizen aus nicht negativen elementen, Sitzber. Akad. Wiss. Berlin, Phys. math. Kl. (1912) 456-477.
11. F. R. Gantmacher, Application of the Theory of Matrices, (Interscience, New York, 1959).
12. S. Karlin and S.F. Altschul, Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes, Proc. Natl. Acad. Sci. USA 87 (1994) 2264-2268.
13. S. Karlin and V. Brendel, Chance and statistical significance in protein and DNA sequence analysis, Science 257 (1992) 39-49.
14. S. Karlin, I. Ladunga and B.E. Blaisdell, Hetrogeneity of genomes: measures and values, Proc. Natl Acad. Sci. USA 91 (1994) 12837-12842.
15. A.C.B.L. Bulletin (American Contract Bridge League), 1995.
16. O. Perron, Grundlagen für eine theorie des jacobischen kettenbruchalgorithmus, Math. Ann. 64 (1907) 1-76.
17. O. Perron, Zur theorie der matrices, Math. Ann. 64 (1907) 248-263.
18. P.A. Pevzner, DNA physical mapping and alternating eulerian cycles in colored graphs, Algorithmica 13 (1995) 77-105.
19. E. Ukkonen, Approximate string matching with q-grams and maximal matches, Theoret. Comput. Sci. 92 (1992) 191-211.
20. R. Unger, G. Avrahami, D. Harel and J. L. Sussman, Simple general shuffling scheme which preserves fragment frequencies up to any required length, in: Proceedings of the Macromolecules, Genes, and Computers conference (1986).