Extracting string motif bases for quorum higher than two

Theoretical Computer Science

Volumn 460, Issue , 2012, Pages 94-103

  Rombo, Simona E ^a,b  

^a ICAR CNR   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ALPHABETS; COMBINATORIAL PROPERTIES; LARGE PARTS;

COMPUTER SCIENCE;

ALGORITHMS;

EID: 84867333432     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.06.021     Document Type: Article

References (19)

1. A. Apostolico, M. Comin, and L. Parida Mining, compressing and classifying with extensible motifs Algorithms Mol. Biol. 1 4 2006
2. A. Apostolico, and L. Parida Incremental paradigms of motif discovery J. Comp. Biol. 11 1 2004 15 25
3. A. Apostolico, L. Parida, and S.E. Rombo Motif patterns in 2D Theor. Comput. Sci. 390 1 2008 40 55
4. n2 log n) time Theor. Comput. Sci. 408 2-3 2008 106 115
5. A. Apostolico, and C. Tagliacollo Optimal extraction of irredundant motif bases Int. J. Found. Comput. Sci. 21 6 2010 1035 1047
6. A. Brazma, I. Jonassen, I. Eidhammer, and D. Gilbert Approaches to the automatic discovery of patterns in biosequences J. Comp. Biol. 5 2 1998 277 304
7. M.J. Fisher, M.S. Paterson, String matching and other products, in: Proc. of Complexity of Comp. (SIAM-AMS), 1974, pp. 113-125.
8. R. Grossi, A. Pietracaprina, N. Pisanti, G. Pucci, E. Upfal, F. Vandin, MADMX: a novel strategy for maximal dense motif extraction, in: Algorithms in Bioinformatics, 9th International Workshop, WABI 2009, 2009, pp. 362-374.
9. R. Grossi, A. Pietracaprina, N. Pisanti, G. Pucci, E. Upfal, and F. Vandin MADMX: a strategy for maximal dense motif extraction J. Comp. Biol. 18 4 2011 535 545
10. R. Grossi, N. Pisanti, M. Crochemore, and M.-F. Sagot Bases of motifs for generating repeated patterns with wild cards IEEE/ACM Trans. Comp. Biol. Bioinform. 2 1 2005 40 50
11. D. Gusfield Algorithms on strings, trees, and sequences: computer science and computational biology 1997 Camb. Univ. Press NY, USA
12. L. Parida, Algorithmic techniques in computational genomics, Ph.D. Thesis, Department of Computer Science, New York University, 1998.
13. L. Parida Pattern Discovery in Bioinformatics: Theory & Algorithms first ed. 2007 Chapman & Hall/CRC
14. L. Parida, I. Rigoutsos, A. Floratos, D. Platt, Y. Gao, Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and polynomial time algorithms, in: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, 2000, pp. 297-308.
15. P. Patel, E.J. Keogh, J. Lin, S. Lonardi, Mining motifs in massive time series databases, in: Proccedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002, 2002, pp. 370-377.
16. J. Pelfrêne, S. Abdeddaïm, J. Alexandre, Extracting approximate patterns, in: Proc. of CPM, 2003, pp. 328-347.
17. J. Pelfrêne, S. Abdeddaïm, and J. Alexandre Extracting approximate patterns J. Discrete Algorithms 3 2-4 2005 293 320
18. N. Pisanti, M. Crochemore, R. Grossi, M.-F. Sagot, A basisi of tiling motifs for generating repeated patterns and its complexity for higher quorum, in: Proc. of Math. Found. Comp. Sc., MFCS, 2003, pp. 622-632.
19. N. Pisanti, M. Crochemore, R. Grossi, and M.-F. Sagot A comparative study of bases for motif inference C. Iliopoulos, T. Lecroq, String Algorithmics 2004 KCL Publications 195 226