MADMX: A strategy for maximal dense motif extraction

Journal of Computational Biology

Volumn 18, Issue 4, 2011, Pages 535-545

  Grossi, Roberto ^a   Pietracaprina, Andrea ^b   Pisanti, Nadia ^a   Pucci, Geppino ^b   Upfal, Eli ^c   Vandin, Fabio ^c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

^c Brown Univerity   (United States)

Author keywords

algorithms; motifs extraction

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; METHODOLOGY; SEQUENCE ANALYSIS;

ALGORITHMS; COMPUTATIONAL BIOLOGY; SEQUENCE ANALYSIS;

EID: 79957533186     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2010.0177     Document Type: Article

References (17)

1. Agrawal, R., and Srikant, R. 1994. Fast algorithms for mining association rules. Proc. 20th VLDB 487-499.
2. Apostolico, A., Comin, M., and Parida, L. 2009. VARUN: discovering extensible motifs under saturation constraints. IEEE Trans. Comput. Biol. Bioinform. http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.123.
3. Apostolico, A., and Parida, L. 2004. Incremental paradigms of motif discovery. J. Comput. Biol. 11, 15-25. (Pubitemid 38429361)
4. Apostolico, A., and Tagliacollo, C. 2007. Optimal offline extraction of irredundant motif bases. Lect. Notes Comput. Sci. 4598, 360-371.
5. 2 log n) time. Theor. Comput. Sci. 408, 106-115.
6. Arimura, H., and Uno, T. 2008. Mining maximal flexible patterns in a sequence. Lect. Notes Comput. Sci. 4914, 307-317.
7. Jurka, J., Kapitonov, V.V., Pavlicek, A., et al. 2005. Repbase update: a database of eukaryotic repetitive elements. Cytogenet. Genome Res. 110, 462-467. (Pubitemid 41159923)
8. Morris, M., Nicolas, F., and Ukkonen, E. 2008. On the complexity of finding gapped motifs. CoRR abs/0802.0314.
9. Parida, L. 2000. Some results on flexible-pattern discovery. Lect. Notes Comput. Sci. 1848, 33-45.
10. Parida, L. 2008.Pattern Discovery in Bioinformatics. Chapman & Hall/CRC, Boca Raton, FL.
11. Pisanti, N. 2002. Segment-based distances and similarities in genomic sequences [Ph.D. dissertation]. University of Pisa, Italy.
12. Pisanti, N., Crochemore, M., Grossi, R., et al. 2005. Bases of motifs for generating repeated patterns with wild cards. IEEE Trans. Comput. Biol. Bioinform. 2, 40-50.
13. Rigoutsos, I., and Floratos, A. 1998. Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm. Bioinformatics 14, 55-67. (Pubitemid 28397726)
14. Saha, S., Bridges, S., Magbanua, Z.V., et al. 2008. Empirical comparison of ab initio repeat finding programs. Nucleic Acids Res. 36, 2284-2294. (Pubitemid 351567001)
15. Smit, A.F.A., Hubley, R., and Green, P. 1996. RepeatMasker Open-3.0. Available at: www.repeatmasker.org. Accessed January 15, 2011.
16. Smith, T.F., and Waterman, M.S. 1981. Identification of common molecular subsequences. J. Mol. Biol. 147, 195-197.
17. Ukkonen, E. 2007. Structural analysis of gapped motifs of a string. Lect. Notes Comput. Sci. 4708, 681-690.