Extracting approximate patterns

Journal of Discrete Algorithms

Volumn 3, Issue 2-4, 2005, Pages 293-320

  Pelfrêne, Johann ^a,b   Abdeddaïm, Saïd ^b   Alexandre, Joël ^b  

^a ExonHit Therapeutics   (France)

^b UNIVERSITÉ DE ROUEN   (France)

Author keywords

Design and analysis of algorithms; Don't care character; Pattern discovery; Primitive pattern; String matching

Indexed keywords

CODES (SYMBOLS); COMPUTER MUSIC; COMPUTER SCIENCE; INFORMATION RETRIEVAL; PARALLEL ALGORITHMS;

DESIGN AND ANALYSIS OF ALGORITHMS; DON'T CARE CHARACTER; PATTERN DISCOVERY; STRING MATCHING;

PATTERN MATCHING;

EID: 18544366395     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.08.010     Document Type: Conference Paper

References (21)

1. I. Jonassen, J. Collins, and D. Higgins Finding flexible patterns in unaligned protein sequences Protein Science 1995 1587 1595
2. L. Marsan, and M.-F. Sagot Extracting structured motifs using a suffix tree - algorithms and application to consensus identification S. Minoru R. Shamir Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB) 2000 ACM Press Tokyo, Japan 210 219
3. M. Crochemore, and M.-F. Sagot Motifs in sequences: localization and extraction A. Konopka Handbook of Computational Chemistry 2001 Marcel Dekker
4. M. Waterman, and R. Jones Methods in Enzymology 1990 Academic Press London p. 221
5. G. Schuler, S. Altschul, and D. Lipman Proteins: Structure, Function, and Genetics 9 1991 180 190
6. C. Lawrence, S. Altschul, M. Boguski, J. Liu, A. Neuwald, and J. Wootton Science 262 1993 208
7. B. Morgenstern, A. Dress, and T. Werner Multiple DNA and protein sequence alignment based on segment-to-segment comparison Proceedings of the National Academy of Sciences USA 1996 12098 12103
8. A. Apostolico, and L. Parida Compression and the wheel of fortune Proceedings of Data Compression Conference (DCC), Snowbird, Utah 2003 143 152
9. J. Wang, B. Shapiro, and D. Shasha Pattern Discovery in Biomolecular Data 1999 Oxford University Press
10. L. Parida, I. Rigoutsos, A. Floratos, D. 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 11th Symposium on Discrete Algorithms 2000 297 308
11. J. Pelfrêne, Indexation de motifs approchés, rapport de DÉA Algorithmique, Université Paris 7, September 2000
12. J. Pelfrêne, S. Abdeddaïm, and J. Alexandre Un algorithme d'indexation de motifs approchés (poster and short talk) Journées Ouvertes Biologie Informatique Mathématiques, Saint-Malo 2002 263 264
13. N. Pisanti, M. Crochemore, R. Grossi, M.-F. Sagot, Bases of motifs for generating repeated patterns with don't cares, Tech. Rep. TR-03-02, Università di Pisa, February 2003
14. N. Pisanti, M. Crochemore, R. Grossi, and M.-F. Sagot A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum B. Rovan P. Vojtáš Proceedings of Mathematical Foundations of Computer Science (MFCS), Bratislava, Slovakia Lecture Notes in Comput. Sci. vol. 2747 2003 Springer 622 632
15. I. Rigoutsos, and A. Floratos Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm BioInformatics 14 1 1998 55 67
16. A. Apostolico Pattern discovery and the algorithmics of surprise P. Frasconi R. Shamir Proceedings of the NATO ASI on Artificial Intelligence and Heuristic Methods for Bioinformatics 2002
17. J. Pelfrêne, S. Abdeddaïm, and J. Alexandre Extracting approximate patterns R. Baeza-Yates E. Chávez M. Crochemore Proceedings of the 14th annual symposium on Combinatorial Pattern Matching (CPM 2003) 2003 Springer 328 347
18. M.J. Fischer, and M.S. Paterson String matching and other products SIAM-AMS Proceedings 1974 113 125
19. A. Schönhage, and V. Strassen Schnelle multiplikation grosser zahlen Computer (Arch. Elektron. Rechnen) 7 1971 281 292
20. S.B. Needleman, and C.D. Wunsch A general method applicable to the search for similarities in the amino acid sequence of two proteins J. Mol. Biol. 48 1970 443 453
21. T.F. Smith, and M.S. Waterman Identification of common molecular sequences J. Mol. Biol. 147 1981 195 197