Finding Patterns in Biological Sequences, 2000. ,
Survey of biodata analysis from a data mining Perspective, Data Mining in Bioinformaties, pp.9-39, 2005. ,
Discovering generalized episodes using minimal occurrences, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD '96, pp.146-151, 1996. ,
Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.259-289, 1997. ,
DOI : 10.1023/A:1009748302351
Mining sequential patterns, Proceedings of the Eleventh International Conference on Data Engineering, pp.3-14, 1995. ,
DOI : 10.1109/ICDE.1995.380415
Mining sequential patterns: Generalizations and performance improvements, Advances in Database Technology, Proc. of the 15th Int'l Conf. on Extending Database Technology, pp.3-17, 1996. ,
DOI : 10.1007/BFb0014140
URL : http://arbor.ee.ntu.edu.tw/~chyun/dmpaper/srikms96.pdf
Prefixspan: Mining sequential patterns efficiently by prefix-projected growth, Proc. of the 17th Int'l Conf. on Data Engineering, pp.215-224, 2001. ,
Frequent pattern mining: current status and future directions, Data Mining and Knowledge Discovery, vol.1, issue.1, pp.55-86, 2007. ,
DOI : 10.1007/s10618-006-0059-1
Optimal off-line detection of repetitions in a string, Theoretical Computer Science, vol.22, issue.3, pp.297-315, 1983. ,
DOI : 10.1016/0304-3975(83)90109-3
Finding maximal repetitions in a word in linear time, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.596-604, 1999. ,
DOI : 10.1109/SFFCS.1999.814634
URL : https://hal.archives-ouvertes.fr/inria-00098853
STAR: an algorithm to Search for Tandem Approximate Repeats, Bioinformatics, vol.20, issue.16, pp.202812-2820, 2004. ,
DOI : 10.1093/bioinformatics/bth335
URL : https://hal.archives-ouvertes.fr/lirmm-00108544
Finding repeats with fixed gap, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp.162-168, 2000. ,
DOI : 10.1109/SPIRE.2000.878192
URL : https://hal.archives-ouvertes.fr/inria-00072753
Finding approximate repetitions under Hamming distance, Theoretical Computer Science, vol.303, issue.1, pp.135-156, 2003. ,
DOI : 10.1016/S0304-3975(02)00448-6
URL : https://hal.archives-ouvertes.fr/inria-00100491
Exhaustive whole-genome tandem repeats search, Bioinformatics, vol.20, issue.16, pp.2702-2710, 2004. ,
DOI : 10.1093/bioinformatics/bth311
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.7257
REPuter: The mani fold applications of repeat analysis on a genomic scale, J]. Nucleic Acids Reseach, issue.22, pp.294633-4642, 2001. ,
An Algorithm for Approximate Tandem Repeats, Journal of Computational Biology, vol.8, issue.1, pp.1-18, 2001. ,
DOI : 10.1089/106652701300099038
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3741
Identifying DNA and protein patterns with statistically significant alignments of multiple sequences, Bioinformatics, vol.15, issue.7, pp.563-577, 1999. ,
DOI : 10.1093/bioinformatics/15.7.563
Combinatorial approaches to finding subtle signals in DNA sequences, Proc. of the 8th Int'l Conf. Intelligent System for Molecular Biology, pp.269-278, 2000. ,
Tandem repeats finder: a program to analyze DNA sequences, Nucleic Acids Research, vol.27, issue.2, pp.573-580, 1999. ,
DOI : 10.1093/nar/27.2.573
URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC148217/pdf
Finding LPRs in DNA sequence based on a new index SUA, Proc. of the IEEE 5th Symp. on Bioinformatics and Bioenginerering, pp.281-284, 2005. ,
SUA-Based algorithm for finding SATRs in DNA sequence, Journal of Northeastern University (Natural Science), vol.28, issue.2, pp.209-212, 2007. ,
BioPM: An Efficient Algorithm for Protein Motif Mining, Proc. of ICBBE'07. [S. l, pp.394-397, 2007. ,
A new pattern mining algorithm for protein sequences, Computer Engineering, vol.435, issue.8, pp.208-210, 2009. ,
The Pfam Protein Families Database, Nucleic Acids Research, vol.30, issue.1, pp.276-288, 2002. ,
DOI : 10.1093/nar/30.1.276
URL : https://hal.archives-ouvertes.fr/hal-01294685