Integrating sample-driven and pattern-driven approaches in motif finding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3240, Issue , 2004, Pages 438-449

  Sze, Sing Hoi ^a   Lu, Songjian ^a   Chen, Jianer ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; BRANCH AND BOUND METHOD; LOCATION;

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTATIONAL EXPERIMENT; DIVIDE-AND-CONQUER APPROACH; EXPRESSED GENES; INTEGRATED APPROACH; K-PARTITE GRAPH; MOTIF FINDING;

DNA SEQUENCES;

EID: 35048825709     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30219-3_37     Document Type: Article

References (17)

1. Bailey, T. L., Elkan, C. P.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proc. of the 2nd Int. Conf. on Intelligent Systems for Mol. Biol. (ISMB'1994) 28-36
2. Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization 4 D.-Z. Du and P. M. Pardalos ed. Kluwer Academic (1999)
3. Buhler, J., Tompa, M.: Finding motifs using random projections. J. Comp. Biol. 9 (2002) 225-242
4. Chen, J., Huang, X., Kanj, I., Xia, G.: Linear FPT reductions and computational lower bounds. Proc. of the 34th ACM Symp. on Theory of Computing (STOC'2004) 212-221
5. Eskin, E.: From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles. Proc. of the 8th Ann. Int. Conf. on Comp. Mol. Biol. (RECOMB'2004) 115-124
6. Eskin, E., Pevzner, P. A.: Finding composite regulatory patterns in DNA sequences. Bioinformatics 18 (2002) S354-363
7. Gramm, J., Niedermeier, R., Rossmanith, P.: Exact solutions for closest string and related problems. Lecture Notes in Computer Science 2223 (ISAAC'2001) 441-453
8. Keich, U., Pevzner, P. A.: Finding motifs in the twilight zone. Proc. of the 6th Ann. Int. Conf. on Comp. Mol. Biol. (RECOMB'2002) 195-204
9. Lanctot, J. K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation 185 (2003) 41-55
10. Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., Wootton, J. C.: Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 262 (1993) 208-214
11. Liang, S.: cWINNOWER algorithm for finding fuzzy DNA motifs. Proc. of the 2nd IEEE Computer Society Bioinformatics Conf. (CSB'2003) 260-265
12. Lukashin, A. V., Engelbrecht, J., Brunak, S.: Multiple alignment using simulated annealing: branch point definition in human mRNA splicing. Nucleic Acids Res. 20 (1992) 2511-2516
13. Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. Comp. Biol. 7 (2000) 345-362
14. Pevzner, P. A., Sze, S.-H.: Combinatorial approaches to finding subtle signals in DNA sequences. Proc. of the 8th Int. Conf. on Intelligent Systems for Mol. Biol. (ISMB'2000) 269-278
15. Price, A., Ramabhadran, S., Pevzner, P. A.: Finding subtle motifs by branching from sample strings. Bioinformatics (2003) SII149-155
16. Stormo, G. D., Hartzell, G. W.: Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl. Acad. Sci. USA 86 (1989) 1183-1187
17. Sze, S.-H., Gelfand, M. S., Pevzner, P. A.: Finding weak motifs in DNA sequences. Pac. Symp. Biocomput. (PSB'2002) 235-246