Optimal extraction of irredundant motif bases

International Journal of Foundations of Computer Science

Volumn 21, Issue 6, 2010, Pages 1035-1047

  Apostolico, Alberto ^a,b   Tagliacollo, Claudia ^a  

^a UNIVERSITY OF PADOVA   (Italy)

^b Georgia Institute of Technology   (United States)

Author keywords

basis; Design and analysis of algorithms; irredundant motif; motif discovery; pattern matching

Indexed keywords

EID: 78649415754     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054110007714     Document Type: Conference Paper

References (13)

1. Jason T. L. Wang, Bruce A. Shapiro, and Dennis Elliot Shasha. Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications. Oxford University Press, 1999.
2. Laxmi Parida. Algorithmic Techniques in Computational Genomics. PhD thesis, Department of Computer Science, New York University, 1998.
3. Laxmi Parida, Isidore Rigoutsos, Aris Floratos, Dan Platt, and Yuan Gao. Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm. In Symposium on Discrete Algorithms, pages 297-308, 2000.
4. Alberto Apostolico and Laxmi Parida. Incremental paradigms of motif discovery. Journal of Computational Biology, 11(1):15-25, 2004.
5. Michael J. Fischer and Michael S. Paterson. String matching and other products. In R. Karp, editor, Proceedings of the SIAM-AMS Complexity of Computation, pages 113-125, American Mathematical Society, Providence, R. I., 1974.
6. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot. Bases of motifs for generating repeated patterns with wild cards. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 2(1):40-50, 2005.
7. Johann Pelfrêne, Saïd Abdeddaïm, and Joël Alexandre. Extracting approximate patterns. Journal of Discrete Algorithms, 3 (2-4): 293-320, 2005.
8. 2logn). Theoretical Computer Science 408 (2-3): 106-115, 2008.
9. Alberto Apostolico. Pattern discovery and the algorithmics of surprise. Artificial Intelligence and Heuristic Methods for Bioinformatics, pages 111-127, 2003.
10. Alfred V. Aho. Algorithms for finding patterns in strings. Handbook of theoretical computer science (vol. A): algorithms and complexity, pages 255-300, 1990.
11. Alberto Apostolico and Zvi Galil. Pattern Matching Algorithms. Oxford University Press, New York, 1997.
12. Gonzalo Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001. (Pubitemid 33768480)
13. Richard Cole and Ramesh Hariharan. Verifying candidate matches in sparse and wildcard matching. In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 592-601, 2002.