RISOTTO: Fast extraction of motifs with mismatches

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

Volumn 3887 LNCS, Issue , 2006, Pages 757-768

  Pisanti, Nadia ^a   Carvalho, Alexandra M ^b   Marsan, Laurent ^c   Sagot, Marie France ^d  

^a UNIVERSITY OF PISA   (Italy)

^b INESC ID   (Portugal)

^c UNIVERSITY OF VERSAILLES   (France)

^d INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MOTIF EXTRACTION; MOTIF INFERENCE ALGORITHMS;

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; TREES (MATHEMATICS);

ALGORITHMS;

EID: 33745594596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_69     Document Type: Conference Paper

References (7)

1. J. Allali. Structures d'indexation: les arbres des facteurs. Memoire de maitrise, University of Marne-la-vallée, 2000.
2. A. M. Carvalho, A. T. Freitas, A. L. Oliveira, and M.-F. Sagot. A highly scalable algorithm for the extraction of cis-regulatory regions. In Proc. APBC'05, pages 273-282. Imperial College Press, 2005.
3. D. Guha-Thakurta and G. D. Stormo. Identifying target sites for cooperatively binding factors. Bioinformatics, 17:608-621, 2001.
4. M. Lothaire. Applied Combinatorics on words. Cambridge University Press, 2005.
5. L. Marsan and M.-F. Sagot, Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory consensus identification. J. Comp. Bio., 7:345-360, 2001.
6. P. A. Pevzner and S. H. Sze. Combinatorial algorithm for finding subtle signals in dna sequences. In Proc. ISMB'00, pages 269-278, 2000.
7. M.-F. Sagot. Spelling Approximate repeated or common motifs using a suffix tree. In C.L. Lucchesi and A.V. Moura, editors, Proc. Latin'98, volume 1380, pages 111-127, 1998. LNCS.