A first approach to finding common motifs with gaps

International Journal of Foundations of Computer Science

Volumn 16, Issue 6, 2005, Pages 1145-1154

  Iliopoulos, Costas S ^a,b   Mchugh, James ^c   Peterlongo, Pierre ^d   Pisanti, Nadia ^e   Rytter, Wojciech ^c   Sagot, Marie France ^f  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b CURTIN UNIVERSITY   (Australia)

^c New Jersey Institute of Technology   (United States)

^d Université de Marne la Vallée   (France)

^e UNIVERSITY OF PISA   (Italy)

^f UNIVERSITÉ LYON 1   (France)

Author keywords

DNA; Gapped Motifs; Inference; Suffix tree

Indexed keywords

EID: 33746189871     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105003716     Document Type: Article

References (6)

1. M. Crochemore, W. Rytter, Text algorithms, Oxford Press, 1994.
2. T. Crawford, C.S. Iliopoulos, R. Raman, String matching techniques for musical similarity and melodic recognition, Computing in Musicology, Vol. 11, pp. 73-100, 1998.
3. M. Farach, Optimal suffix tree construction with large alphabets, in Foundations of Computer Science (FOCS '97), 137-143, 1997.
4. C. Charras, T. Lecroq, Handbook of Exact String Matching Algorithms, King's College London publications 2004.
5. P. Bieganski, J. Riedl, J. V. Carlis, Generalized Suffix Trees for Biological Sequence Data: Applications and Implementation, in Proc. Hawaii International Conference on System Sciences, 1994.
6. J. Allali, M.-F. Sagot, The at-most k-deep factor tree, Internal Report IGM 2004-03 (Institut Gaspard Monge), 2004.