Structural analysis of gapped motifs of a string

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

Volumn 4708 LNCS, Issue , 2007, Pages 681-690

  Ukkonen, Esko ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; TREES (MATHEMATICS);

MAXIMAL GAPPED MOTIFS;

PATTERN RECOGNITION;

EID: 38049083794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74456-6_60     Document Type: Conference Paper

References (10)

1. Apostolico, A., Parida, L.: Incremental Paradigms of Motif Discovery. J. Computational Biology 11, 15-25 (2004)
2. Arimura, H., Uno, T.: A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 724-737. Springer, Heidelberg (2005)
3. Crochemore, M., Iliopoulos, C.S., Mohamed, M., Sagot, M.-F.: Longest repeats with a block of k don't cares. In: Theoretical Computer Science, vol. 362, pp. 248-254 (2006)
4. Crochemore, M., Rytter, W.: Jewels of Stringology, World Scientific (2002)
5. Fischer, M.J., Paterson, M.S.: String matching and other products. In: Complexity of Computation. SIAM-AMS Proc, pp. 113-125 (1974)
6. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
7. Michael, M., Nicolas, F., Ukkonen, E.: On the complexity of finding gapped motifs. Submitted manuscript (2007)
8. Pelfrêne, J., Abdeddaïm, S., Alexandre, J.: Extracting approximate patterns. J. Discrete Algorithms 3, 293-320 (2005)
9. Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.F.: A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 622-631. Springer, Heidelberg (2003)
10. Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.F.: Bases of motifs for generating repeated patterns with wild cards. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2, 40-50 (2005)