An output-sensitive flexible pattern discovery algorithm

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

Volumn 2089, Issue , 2001, Pages 131-142

  Parida, Laxmi ^a   Rigoutsos, Isidore ^a   Platt, Dan ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; DATA MINING; GENE EXPRESSION; PATTERN MATCHING;

COMPLEXITY BOUNDS; DISCOVERY ALGORITHM; FLEXIBLE PATTERNS; GENE EXPRESSION DATA; OUTPUT-SENSITIVE; PROTEIN SEQUENCES; REPEATING PATTERNS; TIME POLYNOMIALS;

COMPUTATIONAL COMPLEXITY;

EID: 84956976251     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48194-x_11     Document Type: Conference Paper

References (18)

1. P.O. Brown and D. Botstein. Exploring the new world of the genome with DNA microarrays. Nature Genetics, 21:33-37, 1999.
2. A. Ben-Dor and Z. Yakhini. Clustering gene expression patterns. Proceedings of the Annual Conference on Computational Molecular Biology (RECOMB'99), pages 33-42, 1999.
3. T.L. Bailey and M. Gribskov. Methods and statistics for combining motif match scores. Journal of Computational Biology, 5:211-221, 1998.
4. Alvis Brazma, Inge Jonassen, Ingvar Eidhammer, and David Gilbert. Approaches to the automatic discovery of patterns in biosequences. Journal of Computational Biology, 5(2):279-305, 1998.
5. Andrea Califano. SPLASH: structural pattern localization algorithm by sequential histogramming. Bioinformatics (under publication), 2000.
6. J. DeRisi and L. Penland et al. Use of a cDNA microarray to analyse gen expression patterns in human cancer. Nat. Genetics, 14(4):457-460, 1996.
7. M.O. Dayhofi, R.M. Schwartz, and B.C. Orcutt. A model of evolutionary change in proteins. Atlas of Protein Sequence and Structure, pages 345-352, 1978.
8. S. Henikofi and J.G. Henikofi. Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci., 89:10915-10919, 1992.
9. I.J.F. Jonassen, J.F. Collins, and D.G. Higgins. Finding flexible patterns in unaligned protein sequences. Protein Science, pages 1587-1595, 1995.
10. D.J. Lockhart and H. Dong et al. Expression monitoring by hybridization to high density oligonucleotide arrays. Nat. Biotechnol., 14(13):1675-1680, 1996.
11. A.F. Neuwald and P. Green. Detecting patterns in protein sequences. Journal of Molecular Biology, pages 698-712, 1994.
12. Laxmi Parida. Some results on flexible-pattern matching. In Proc. of the Eleventh Symp. On Comp. Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 33-45. Springer-Verlag, 2000.
13. 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 eficient polynomial time algorithm. In Proceedings of the eleventh ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 297 - 308. ACM Press, 2000.
14. I. Rigoutsos and A. Floratos. Motif discovery in biological sequences without alignment or enumeration. In Proceedings of the Annual Conference on Computational Molecular Biology (RECOMB'98), pages 221-227. ACM Press, 1998.
15. M.A. Roytberg. A search for common patterns in many sequences. CABIOS, pages 57-64, 1992.
16. R.M. Schwartz and M.O. Dayhofi. Matrices for detecting distance relationships. Atlas of Protein Sequence and Structure, pages 353-358, 1978.
17. M. Suyama, T. Nishioka, and O. Junfifichi. Searching for common sequence patterns among distantly related proteins. Protein Engineering, pages 366-385, 1995.
18. M.F. Sagot and A. Viari. A double combinatorial approach to discovering patterns in biological sequences. Proceedings of the 7th symposium on combinatorial pattern matching, pages 186-208, 1996.