Motif patterns in 2D

Theoretical Computer Science

Volumn 390, Issue 1, 2008, Pages 40-55

  Apostolico, Alberto ^a,b   Parida, Laxmi ^c   Rombo, Simona E ^d  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

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

^d UNIVERSITY OF CALABRIA   (Italy)

Author keywords

2D irredundant motifs; Design and analysis of algorithms; Motif; Pattern discovery; Pattern matching

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; TWO DIMENSIONAL;

ANALYSIS OF ALGORITHMS; IRREDUNDANT MOTIFS; PATTERN DISCOVERY;

PATTERN MATCHING;

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

References (19)

1. A. Amir, G. Benson, Two-dimensional periodicity and its applications, in: Proceedings of the Symposium on Discrete Algorithms, SODA 1992, 1992, pp. 440-452
2. A. Amir, O. Kapah, D. Tsur, Faster two dimensional pattern matching with rotations, in: Proceedings of Combinatorial Pattern Matching, CPM 2004, 2004, pp. 409-419
3. Amir A., Butman A., Crochemore M., Landau G.M., and Schaps M. Two-dimensional pattern matching with rotations. Theoret. Comput. Sci. 314 1-2 (2004) 173-187
4. Amir A., and Farach M. Two-dimensional dictionary matching. Inform. Process. Lett. 44 5 (1992) 233-239
5. Apostolico A., and Brimkov V. Optimal discovery of repetitions in 2D. Discrete Appl. Math. 151 1-3 (2005) 5-20
6. Apostolico A., and Parida L. Incremental paradigms of motif discovery. J. Comput. Biol. 11 1 (2004) 15-25
7. A. Apostolico, L. Parida, Compression and the wheel of fortune, in: Proceedings of IEEE Data Compression Conference, 2004, pp. 115-125
8. Baker T.P. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7 (1978) 533-541
9. Bird R.S. Two dimensional pattern matching. Inform. Process. Lett. 6 (1997) 168-170
10. Blumer A., Blumer J., Ehrenfeucht A., Haussler D., Chen M.T., and Seiferas J. The smallest automaton recognizing the subwords of a text. Theoret. Comput. Sci. 40 (1985) 31-55
11. Brazma A., Jonassen I., Eidhammer I., and Gilbert D. Approaches to the automatic discovery of patterns in biosequences. J. Comput. Biol. 5 2 (1998) 277-304
12. R. Cole, R. Hariharan, Verifying candidate matches in sparse and wildcard matching, in: Proceedings of the Symposium on Theory of Computing, STOC 2002, 2002, pp. 592-601
13. Fisher M.J., and Paterson M.S. String matching and other products. In: Karp R.M. (Ed). Complexity of Computation. SIAM-AMS Proceedings vol. 7 (1974) 113-125
14. Galil Z., Park J.G., and Park K. Three-dimensional periodicity and its application to pattern matching. SIAM J. Discrete Math. 18 2 (2004) 362-381
15. Grossi R., Pisanti N., Crochemore M., and Sagot M.-F. Bases of motifs for generating repeated patterns with wild cards. IEEE/ACM Trans. Comput. Biol. Bioinf. 2 1 (2005) 40-50
16. 2 log n) time on-line construction of two-dimensional suffix trees, in: Proceedings of Computing and Combinatorics, COCOON 2005, 2005, pp. 273-282
17. Rigoutsos I., Floratos A., Parida L., Gao Y., and Platt D. The emergence of pattern discovery techniques in computational biology. J. Metabolic Eng. 2 3 (2000) 159-177
18. Samet H. The quadtree and related hierarchical data structures. ACM Comput. Surv. 16 2 (1984) 187-260
19. Wang J.T.L., Shapiro B.A., and Shasha D.E. Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications (1999), Oxford University Press