MADMX: A novel strategy for maximal dense motif extraction

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

Volumn 5724 LNBI, Issue , 2009, Pages 362-374

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

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

^c Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SEQUENCES; BOTTOM-UP FASHION; COMBINING OPERATIONS; DON'T CARE CHARACTER; EXPERIMENTAL EVIDENCE; NEW TOOLS; NOVEL STRATEGIES; TOTAL LENGTH;

BIOINFORMATICS;

EID: 70350350198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04241-6_30     Document Type: Conference Paper

References (16)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of 20th VLDB, pp. 487-499 (1994)
2. Apostolico, A., Comin, M., Parida, L.: VARUN: discovering extensible motifs under saturation constraints. IEEE Trans. on Computational Biology and Bioinformatics (to appear, 2009)
3. Apostolico, A., Parida, L.: Incremental paradigms of motif discovery. Journal of Computational Biology 11(1), 15-25 (2004)
4. Apostolico, A., Tagliacollo, C.: Optimal offline extraction of irredundant motif bases. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 360-371. Springer, Heidelberg (2007)
5. 2 log n) time. Theoretical Computer Science 408(2-3), 106-115 (2008)
6. Arimura, H., Uno, T.: Mining maximal flexible patterns in a sequence. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol. 4914, pp. 307-317. Springer, Heidelberg (2008)
7. Jurka, J., Kapitonov, V.V., Pavlicek, A., Klonowski, P., Kohani, O., Walichiewicz, J.: Repbase Update, a database of eukaryotic repetitive elements. Cytogenet. Genome Res. 110, 462-467 (2005)
8. Morris, M., Nicolas, F., Ukkonen, E.: On the complexity of finding gapped motifs. CoRR, abs/0802.0314 (2008)
9. Parida, L.: Some results on flexible-pattern discovery. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 33-45. Springer, Heidelberg (2000)
10. Parida, L.: Pattern discovery in bioinformatics. Mathematical and Computational Biology Series. Chapman & Hall/CRC, Boca Raton (2008)
11. Pisanti, N.: Segment-based distances and similarities in genomic sequences. PhD thesis, University of Pisa, Italy (2002)
12. Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.F.: Bases of motifs for generating repeated patterns with wild cards. IEEE Trans. on Computational Biology and Bioinformatics 2(1), 40-50 (2005)
13. Rigoutsos, I., Floratos, A.: Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm. Bioinformatics 14(1), 55-67 (1998)
14. Saha, S., Bridges, S., Magbanua, Z.V., Peterson, D.G.: Empirical comparison of ab initio repeat finding programs. Nucleic Acids Res. 36(7), 2284-2294 (2008)
15. Smit, A.F.A., Hubley, R., Green, P.: RepeatMasker Open-3.0. 1996-2004, http://www.repeatmasker.org
16. Ukkonen, E.: Structural analysis of gapped motifs of a string. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 681-690. Springer, Heidelberg (2007)