Irredundant tandem motifs

Theoretical Computer Science

Volumn 525, Issue , 2014, Pages 89-102

  Parida, Laxmi ^a   Pizzi, Cinzia ^b   Rombo, Simona E ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

^c UNIVERSITY OF PALERMO   (Italy)

Author keywords

Irredundant; Motifs; Patterns; Redundant motifs; String algorithm; Suffix tree; Tandem

Indexed keywords

IRREDUNDANT; MOTIFS; PATTERNS; REDUNDANT MOTIFS; STRING ALGORITHMS; SUFFIX-TREES; TANDEM;

COMPUTATIONAL METHODS; COMPUTER SCIENCE;

REDUNDANCY;

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

References (40)

1. A. Apostolico, and L. Parida Incremental paradigms of motif discovery J. Comput. Biol. 11 2004 15 25
2. R. Grossi, A. Pietracaprina, N. Pisanti, G. Pucci, E. Upfal, and F. Vandin MADMX: A novel strategy for maximal dense motif extraction Algorithms in Bioinformatics, 9th International Workshop (WABI 2009) 2009 362 374
3. R. Grossi, A. Pietracaprina, N. Pisanti, G. Pucci, E. Upfal, and F. Vandin MADMX: A strategy for maximal dense motif extraction J. Comput. Biol. 18 2011 535 545
4. R. Grossi, N. Pisanti, M. Crochemore, and M.-F. Sagot Bases of motifs for generating repeated patterns with wild cards IEEE/ACM Trans. Comput. Biol. Bioinform. 2 2005 159 177
5. A. Apostolico, L. Parida, and S.E. Rombo Motif patterns in 2D Theor. Comput. Sci. 390 1 2008 40 55
6. S.E. Rombo Optimal extraction of motif patterns in 2D Inf. Process. Lett. 109 17 2009 1015 1020
7. A. Amelio, A. Apostolico, and S.E. Rombo Image compression by 2D motif basis Proc. of Data Compression Conference (DCC 2011) 2011 153 162
8. A. Furfaro, M.C. Groccia, and S.E. Rombo Image classification based on 2D feature motifs Proceedings of Flexible Query Answering Systems (FQAS 2013) 2013
9. L. Parida Discovering topological motifs using a compact notation J. Comput. Biol. 14 2007 300 323
10. L. Parida Pattern Discovery in Bioinformatics: Theory and Algorithms Math. Comput. Biol. 2007 Chapman and Hall/CRC
11. A. Apostolico, M. Barbares, and C. Pizzi Speedup for a periodic subgraph miner Inf. Process. Lett. 111 2011 521 523
12. A. Apostolico, P.L. Erdos, E. Gyoric, Z. Liptak, and C. Pizzi Efficient algorithms for the periodic subgraphs mining problem J. Discrete Algorithms 17 2012 24 30
13. L. Mularoni, R. Guigó, and M.M. Albà Mutation patterns of amino acid tandem repeats in the human proteome Genome Biol. 7 2006 R33
14. P.T. Monteiro, N.D. Mendes, and M.C. Teixeira et al. Yeastract- discoverer: New tools to improve the analysis of transcriptional regulatory associations in Saccharomyces cerevisiae Nucleic Acids Res. 36 2008 132 136
15. A. Apostolico, C. Pizzi, and G. Satta Optimal discovery of subword associations in strings Proc. of the 7th International Conference on Discovery Science (DS 2004) 2004 270 277
16. L. Palopoli, S.E. Rombo, and G. Terracina Flexible pattern discovery with (extended) disjunctive logic programming Proc. of Foundations of Intelligent Systems (ISMIS 2005) 2005 504 513
17. A.M. Carvalho, A.T. Freitas, A.L. Oliveira, and M.-F. Sagot An efficient algorithm for the identification of structured motifs in DNA promoter sequences IEEE/ACM Trans. Comput. Biol. Bioinform. 3 2006 126 140
18. F. Fassetti, G. Greco, and G. Terracina Mining loosely structured motifs from biological data IEEE Trans. Knowl. Data Eng. 20 2008 1472 1489
19. L. Marsan, and M.-F. Sagot Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification J. Comput. Biol. 7 2000 345 362
20. L. Marsan, and M.-F. Sagot Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification Proc. of the Fourth Annual International Conference on Computational Molecular Biology (RECOMB 2000) 2000 210 219
21. S. Inenaga, H. Bannai, H. Hyyro, A. Shinohara, M. Takeda, K. Nakai, and S. Miyano Finding optimal pairs of cooperative and competing patterns with bounded distance Proc. 7th International Conference on Discovery Science (DS 2004) 2004 Springer-Verlag 32 46
22. A. Apostolico, and G. Satta Discovering subword associations in strings in time linear in the output size J. Discrete Algorithms 7 2009 227 238
23. A. Apostolico, C. Pizzi, and E. Ukkonen Efficient algorithms for the discovery of gapped factors Algorithms Mol. Biol. 6 5 2011
24. L. Parida, C. Pizzi, and S.E. Rombo Characterization and extraction of irredundant tandem motifs String Processing and Information Retrieval (SPIRE 2012) 2012 385 397
25. L. Parida, I. Rigoutsos, A. Floratos, D.E. Platt, and Y. Gao Pattern discovery on character sets and real-valued data: Linear bound on irredundant motifs and an efficient polynomial time algorithm Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000) 2000 297 308
26. 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
27. M. Federico, and N. Pisanti Suffix tree characterization of maximal motifs in biological sequences Theor. Comput. Sci. 410 2009 4391 4401
28. S.E. Rombo Extracting string motif bases for quorum higher than two Theor. Comput. Sci. 460 2012 94 103
29. A. Apostolico The myriad virtues of subword trees A. Apostolico, Z. Galil, Combinatorial Algorithms on Words NATO Adv. Stud. Inst. Ser. vol. 12 1985 Springer-Verlag 85 96
30. D. Gusfield Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology 1997 Cambridge University Press New York, NY, USA
31. R. Giegerich, and S. Kurtz From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction Algorithmica 19 1997 331 353
32. J.C. Na, A. Apostolico, C.S. Iliopoulos, and K. Park Truncated suffix trees and their application to data compression Theor. Comput. Sci. 304 2003 87 101
33. J. Allali, and M.-F. Sagot The at most k-deep factor tree Technical Report 2004
34. A. Chattaraj, and L. Parida An inexact-suffix-tree-based algorithm for detecting extensible patterns Theor. Comput. Sci. 335 2005 3 14
35. A. Apostolico, M. Comin, and L. Parida VARUN: Discovering extensible motifs under saturation constraints IEEE/ACM Trans. Comput. Biol. Bioinform. 7 2010 752 762
36. F. Fassetti, O. Leone, L. Palopoli, S.E. Rombo, and A. Saiardi Ip6k gene discovery in plant mtdna Proc. of Computational Intelligence Methods for Bioinformatics and Biostatistics (CIBB 2010) 2010 59 71
37. F. Fassetti, O. Leone, L. Palopoli, S.E. Rombo, and A. Saiardi Ip6k gene identification in plant genomes by tag searching BMC Proc. 5 2011 S1
38. F. Zambelli, G. Pesole, and G. Pavesi Motif discovery and transcription factor binding sites before and after the next-generation sequencing era Brief. Bioinform. 14 2 2013 225 237
39. B.Y.c. Chiu, E.J. Keogh, and S. Lonardi Probabilistic discovery of time series motifs Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003) 2003 493 498
40. S.E. Rombo, and G. Terracina Discovering representative models in large time series databases Proc. of Flexible Query Answering Systems (FQAS 2004) 2004 84 97