Searching maximal degenerate motifs guided by a compact suffix tree

Advances in Experimental Medicine and Biology

Volumn 680, Issue , 2010, Pages 19-26

  Jiang, Hongshan ^a   Zhao, Ying ^b   Chen, Wenguang ^b   Zheng, Weimin ^b  

^a TSINGHUA UNIVERSITY   (China)

^b NONE

Author keywords

Degenerate motif; Motif discovery; Suffix tree

Indexed keywords

TRANSCRIPTION FACTOR;

BINDING SITE; BIOINFORMATICS; CONFERENCE PAPER; CONSENSUS SEQUENCE; DEGENERATE MOTIF; GENE AND NUCLEIC ACID PARAMETERS; GENETIC ALGORITHM; GENOME SIZE; INTERNET; PRIORITY JOURNAL; PROTEIN ANALYSIS; SEQUENCE ANALYSIS; STATISTICAL ANALYSIS; SUFFIX TREE; VALIDATION PROCESS; ALGORITHM; ARTICLE; BIOLOGY; COMPUTER PROGRAM; GENETICS; METABOLISM; PROTEIN MOTIF; SEQUENCE ALIGNMENT; STATISTICS;

ALGORITHMS; AMINO ACID MOTIFS; BINDING SITES; COMPUTATIONAL BIOLOGY; CONSENSUS SEQUENCE; SEQUENCE ALIGNMENT; SOFTWARE; TRANSCRIPTION FACTORS;

EID: 79952197724     PISSN: 00652598     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-5913-3_3     Document Type: Conference Paper

References (15)

1. Stormo, G.D.: 'DNA binding sites: representation and discovery', Bioinformatics, 2000, 16, (1), pp. 16-23 (Pubitemid 30204197)
2. Bussemaker, H.J., Li, H., and Siggia, E.D.: 'From the cover: building a dictionary for genomes: identification of presumptive regulatory sites by statistical analysis', Proc Natl Acad Sci USA, 2000, 97, (18), pp. 10096-10100
3. Sinha, S., and Tompa, M.: 'Discovery of novel transcription factor binding sites by statistical overrepresentation', Nucleic Acids Res, 2002, 30, (24), pp. 5549-5560 (Pubitemid 36113932)
4. Sagot, M-F.: 'Spelling approximate repeated or common motifs using a suffix tree'. In 'Proceedings of the 1998 3rd Latin American Symposium, Apr 20-24 1998' (1998), p. 374
5. Marsan, L., and Sagot, M-F.: 'Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification'. In 'Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification' (ACM, 2000), pp. 210-219
6. Pavesi, G., Mauri, G., and Pesole, G.: 'An algorithm for finding signals of unknown length in DNA sequences', Bioinformatics, 2001, 17, (suppl 1), pp. S207-S214 (Pubitemid 33793512)
7. Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F., and Wootton, J.C.: 'Detecting subtle sequence signals. A Gibbs sampling strategy for multiple alignment', Science, 1993, 262, (5131), p. 208
8. Bailey, T.L., and Elkan, C.: 'Fitting a mixture model by expectation maximization to discover motifs in biopolymers', Proc Int Conf Intell Syst Mol Biol, 1994, 2, pp. 28-36
9. Hertz, G., and Stormo, G.: 'Identifying DNA and protein patterns with statistically significant alignments of multiple sequences', Bioinformatics, 1999, 15, (7), pp. 563-577 (Pubitemid 29462105)
10. Vishnevsky, O.V., and Kolchanov, N.A.: 'ARGO: a web system for the detection of degenerate motifs and large-scale recognition of eukaryotic promoters', Nucleic Acids Res, 2005, 33, (suppl 2), pp. W417-W422 (Pubitemid 44529955)
11. Peng, C.H., Hsu, J.T., Chung, Y.S., Lin, Y.J., Chow, W.Y., Hsu, D.F., and Tang, C.Y.: 'Identification of degenerate motifs using position restricted selection and hybrid ranking combination', Nucleic Acids Res, 2006, 34, (22), pp. 6379-6391 (Pubitemid 46017938)
12. Sandve, G.K., Abul, O., Walseng, V., et al.: 'Improved benchmarks for computational motif discovery,' BMC Bioinformatics, 8, p. 193, 2007
13. Weiner, P.: 'Linear pattern matching algorithms'. In 'Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973), Volume 001973', pp. 1-11
14. Tompa, M., Li, N., Bailey, T.L., et al.: 'Assessing computational tools for the discovery of transcription factor binding sites', Nat Biotechnol, 2005, 23, (1), pp. 137-144 (Pubitemid 41724640)
15. Ukkonen, E.: 'On-line construction of suffix trees', Algorithmica (New York), 1995, 14, (3), p. 249