Shuffling biological sequences with motif constraints

Journal of Discrete Algorithms

Volumn 6, Issue 2, 2008, Pages 192-204

  Rivière, Romain ^a   Barth, Dominique ^b   Cohen, Johanne ^c   Denise, Alain ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITY OF VERSAILLES   (France)

^c LORIA   (France)

Author keywords

Motifs constraints; NP completeness; Random sequence generation

Indexed keywords

CONSTRAINT THEORY; DECISION MAKING; INTEGER PROGRAMMING; LEARNING ALGORITHMS; SET THEORY; THEOREM PROVING;

MOTIFS CONSTRAINTS; RANDOM SEQUENCE GENERATION;

PROBLEM SOLVING;

EID: 42249099020     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2007.06.001     Document Type: Article

References (21)

1. van Aardenne-Ehrenfest T., and de Bruijn N.G. Circuits and trees in oriented linear graphs. Simon Stevin (Bull. Belgian Math. Soc.) 28 (1951) 203-217
2. Aldous D. A random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discrete Math. 3 (1990) 450-465
3. Altschul S., and Erickson B. Significance of nucleotide sequence alignments: A method for random sequence permutation that preserves dinucleotide and codon usage. Mol. Biol. Evol. 2 (1985) 526-538
4. Altschul S., Madden T., Schäffer A., Zhang J., Zhang Z., Miller W., and Lipman D. Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Res. 25 (1997) 3389-3402
5. Balas E., and Yu C. On graphs with polynomially solvable maximum-weight clique problem. Networks 19 (1989) 247-253
6. Beaudoing E., Freier S., Wyatt J., Claverie J., and Gautheret D. Patterns of variant polyadenylation signal usage in human genes. Genome Res. 10 (2000) 1001-1010
7. Broder A. Generating random spanning trees. Proc. of 30th Annual Symposium on Foundations of Computer Science (1989), IEEE 442-447
8. Denise A., Régnier M., and Vandenbogaert M. Assessing statistical significance on overrepresented oligonucleotides. In: Gascuel O., and Moret B. (Eds). Proceedings of WABI'01. Lecture Notes in Computer Science vol. 2149 (2001), Springer 85-97
9. Fitch W. Random sequences. J. Mol. Biol. 163 (1983) 171-176
10. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company
11. Grotschel M., Lovasz L., and Schrijver A. Polynomial algorithms for perfect graphs. Ann. Discrete Math. 21 (1984) 322-356
12. Kandel D., Matias Y., Unger R., and Winkler P. Shuffling biological sequences. Discrete Appl. Math. 71 (1996) 171-185
13. Lipman D., Wilbur W., Smith T., and Waterman M. On the statistical significance of nucleic acid similarities. Nucleic Acids Res. 12 (1984) 215-226
14. Nicodème P., Salvy B., and Flajolet P. Motif statistics. Theoret. Computer Sci. 287 2 (2002) 593-618
15. Propp J., and Wilson D. How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. J. Algorithms 27 (1998) 170-217
16. Régnier M. A unified approach to word occurrence probabilities. Discrete Appl. Math. 104 (2000) 259-280
17. Reinert G., Schbath S., and Waterman M. Probabilistic and statistical properties of words: An overview. J. Comput. Biol. 7 (2000) 1-46
18. van Helden J. Metrics for comparing regulatory sequences on the basis of pattern counts. Bioinformatics 20 (2004) 399-406
19. van Helden J., André B., and Collado-Vides J. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J. Mol. Biol. 281 (1998) 827-842
20. Vanet A., Marsan L., and Sagot M.-F. Promoter sequences and algorithmical methods for identifying them. Res. Microbiol. 150 (1999) 779-799
21. D. Wilson, Generating random spanning trees more quickly than the cover time, in: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996, pp. 296-303