TY - STD TI - Watson JD, Baker TA, Bell SP, Gann A, Levine M, Losick R: Molecular Biology of the Gene. 6/e: Pearson International Edition; 2007. ID - ref1 ER - TY - JOUR AU - Werner, T. PY - 1999 DA - 1999// TI - Models for prediction and recognition of eukaryotic promoters JO - Mammalian Genome VL - 10 UR - https://doi.org/10.1007/s003359900963 DO - 10.1007/s003359900963 ID - Werner1999 ER - TY - JOUR AU - Sinha, S. AU - Tompa, M. PY - 2002 DA - 2002// TI - Discovery of novel transcription factor binding sites by statistical overrepresentation JO - Nucleic Acids Res VL - 30 UR - https://doi.org/10.1093/nar/gkf669 DO - 10.1093/nar/gkf669 ID - Sinha2002 ER - TY - JOUR AU - Lemon, B. AU - Tjian, R. PY - 2000 DA - 2000// TI - Orchestrated response: a symphony of transcription factors for gene control JO - Genes & Dev VL - 14 UR - https://doi.org/10.1101/gad.831000 DO - 10.1101/gad.831000 ID - Lemon2000 ER - TY - JOUR AU - Wray, G. A. PY - 2007 DA - 2007// TI - The evolutionary significance of cis-regulatory mutations JO - Nature Rev Genet VL - 8 UR - https://doi.org/10.1038/nrg2063 DO - 10.1038/nrg2063 ID - Wray2007 ER - TY - CHAP AU - Bailey, T. L. AU - Elkan, C. PY - 1995 DA - 1995// TI - The Value of Prior Knowledge in Discovering Motifs with MEME BT - Proceedings of 3rd International Conference on Intelligent Systems for Molecular Biology (ISMB ’95) ID - Bailey1995 ER - TY - JOUR AU - Sagot, M. F. PY - 1998 DA - 1998// TI - Spelling approximate repeated or common motifs using a suffix tree JO - Lecture Notes Comput Sci VL - 1380 ID - Sagot1998 ER - TY - CHAP AU - Li, M. AU - Ma, B. AU - Wang, L. PY - 1999 DA - 1999// TI - Finding Similar Regions in Many Strings BT - Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC ’99) ID - Li1999 ER - TY - JOUR AU - Lawrence, C. E. AU - Altschul, S. F. AU - Boguski, M. S. AU - Liu, J. S. AU - Neuwald, A. F. AU - Wootton, J. C. PY - 1993 DA - 1993// TI - Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment JO - Science VL - 262 UR - https://doi.org/10.1126/science.8211139 DO - 10.1126/science.8211139 ID - Lawrence1993 ER - TY - JOUR AU - Brazma, A. AU - Jonassen, I. AU - Eidhammer, I. AU - Gilbert, D. PY - 1998 DA - 1998// TI - Approaches to the Automatic Discovery of Patterns in Biosequences JO - J Comput Biol VL - 5 UR - https://doi.org/10.1089/cmb.1998.5.279 DO - 10.1089/cmb.1998.5.279 ID - Brazma1998 ER - TY - JOUR AU - van, H. e. l. d. e. n. AU - André, B. AU - Collado-Vides, J. PY - 1998 DA - 1998// TI - Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies JO - Mol Biol VL - 281 UR - https://doi.org/10.1006/jmbi.1998.1947 DO - 10.1006/jmbi.1998.1947 ID - van1998 ER - TY - CHAP AU - Pevzner, P. A. AU - Sze, S. H. PY - 2000 DA - 2000// TI - Combinatorial Approaches to Finding Subtle Signals in DNA Sequences BT - Proceedings of 8th International Conference on Intelligent Systems for Molecular Biology (ISMB ’00) ID - Pevzner2000 ER - TY - JOUR AU - Guha-Thakurta, D. AU - Stormo, G. D. PY - 2001 DA - 2001// TI - Identifying target sites for cooperatively binding factors JO - Bioinformatics VL - 17 UR - https://doi.org/10.1093/bioinformatics/17.7.608 DO - 10.1093/bioinformatics/17.7.608 ID - Guha-Thakurta2001 ER - TY - JOUR AU - Pavesi, G. AU - Mauri, G. AU - Pesole, G. PY - 2001 DA - 2001// TI - An algorithm for finding signals of unknown length in DNA sequences JO - Bioinformatics VL - 17 UR - https://doi.org/10.1093/bioinformatics/17.suppl_1.S207 DO - 10.1093/bioinformatics/17.suppl_1.S207 ID - Pavesi2001 ER - TY - CHAP AU - Eskin, E. AU - Pevzner, P. PY - 2002 DA - 2002// TI - Finding composite regulatory patterns in DNA sequences BT - Proceedings of the 10th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB ’02) ID - Eskin2002 ER - TY - JOUR AU - Sinha, S. AU - Tompa, M. PY - 2003 DA - 2003// TI - YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation JO - Nucleic Acids Res VL - 31 UR - https://doi.org/10.1093/nar/gkg618 DO - 10.1093/nar/gkg618 ID - Sinha2003 ER - TY - CHAP AU - Leung, H. C. M. AU - Chin, F. Y. L. PY - 2005 DA - 2005// TI - Generalized Planted (l, d)-Motif Problem with Negative Set BT - Proceedings of the Workshop on Algorithms in Bioinformatics (WABI) UR - https://doi.org/10.1007/11557067_22 DO - 10.1007/11557067_22 ID - Leung2005 ER - TY - JOUR AU - Favorov, A. V. AU - Gelfand, M. S. AU - Gerasimova, A. V. AU - Ravcheev, D. A. AU - Mironov, A. A. AU - Makeev, V. J. PY - 2005 DA - 2005// TI - A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length JO - Bioinformatics VL - 21 UR - https://doi.org/10.1093/bioinformatics/bti336 DO - 10.1093/bioinformatics/bti336 ID - Favorov2005 ER - TY - JOUR AU - Mendes, N. AU - Casimiro, A. AU - Santos, P. AU - Sá-Correia, I. AU - Oliveira, A. AU - Freitas, A. PY - 2006 DA - 2006// TI - MUSA: a parameter free algorithm for the identification of biologically significant motifs JO - Bioinformatics VL - 22 UR - https://doi.org/10.1093/bioinformatics/btl537 DO - 10.1093/bioinformatics/btl537 ID - Mendes2006 ER - TY - JOUR AU - D’haeseleer, P. PY - 2006 DA - 2006// TI - How does DNA sequence motif discovery work? JO - Nat Biotech VL - 24 UR - https://doi.org/10.1038/nbt0806-959 DO - 10.1038/nbt0806-959 ID - D’haeseleer2006 ER - TY - JOUR AU - Das, M. K. AU - Dai, H. K. PY - 2007 DA - 2007// TI - A survey of dna motif finding algorithms JO - BMC Bioinformatics VL - 8 UR - https://doi.org/10.1186/1471-2105-8-S7-S21 DO - 10.1186/1471-2105-8-S7-S21 ID - Das2007 ER - TY - JOUR AU - Stormo, G. D. AU - Hartzell, G. W. PY - 1989 DA - 1989// TI - Identifying protein binding sites from unaligned DNA fragments JO - PNAS VL - 86 UR - https://doi.org/10.1073/pnas.86.4.1183 DO - 10.1073/pnas.86.4.1183 ID - Stormo1989 ER - TY - JOUR AU - Wolfertstetter, F. AU - Frech, K. AU - Herrmann, G. AU - Werner, T. PY - 1996 DA - 1996// TI - Identification of functional elements in unaligned nucleic acid sequences by a novel tuple search algorithm JO - Comput Appl Biosci VL - 12 ID - Wolfertstetter1996 ER - TY - CHAP AU - Tompa, M. PY - 1999 DA - 1999// TI - An exact method for finding short motifs in sequences, with application to the ribosome binding site problem BT - Proceedings of 7th International Conference on Intelligent Systems for Molecular Biology (ISMB ’99) ID - Tompa1999 ER - TY - JOUR AU - Linhart, C. AU - Halperin, Y. AU - Shamir, R. PY - 2008 DA - 2008// TI - Transcription factor and microRNA motif discovery: The Amadeus platform and a compendium of metazoan target sets JO - Genome Res VL - 18 UR - https://doi.org/10.1101/gr.076117.108 DO - 10.1101/gr.076117.108 ID - Linhart2008 ER - TY - JOUR AU - Zhang, Y. AU - Zaki, M. J. PY - 2006 DA - 2006// TI - EXMOTIF: efficient structured motif extraction JO - Algorithms Mol Biol VL - 1 UR - https://doi.org/10.1186/1748-7188-1-21 DO - 10.1186/1748-7188-1-21 ID - Zhang2006 ER - TY - CHAP AU - Pisanti, N. AU - Carvalho, A. AU - Marsan, L. AU - Sagot, M. F. PY - 2006 DA - 2006// TI - RISOTTO: Fast extraction of motifs with mismatches BT - Proceedings of the 7th Latin American Theoretical Informatics Symposium ID - Pisanti2006 ER - TY - JOUR AU - Zhou, J. AU - Sander, J. AU - Lin, G. PY - 2007 DA - 2007// TI - Efficient composite pattern finding from monad patterns JO - Int J Bioinf Res Appl VL - 3 UR - https://doi.org/10.1504/IJBRA.2007.011836 DO - 10.1504/IJBRA.2007.011836 ID - Zhou2007 ER - TY - JOUR AU - Tompa, M. AU - Li, N. AU - Bailey, T. L. AU - Church, G. M. PY - 2005 DA - 2005// TI - Assessingcomputational tools for the discovery of transcription factor binding sites JO - Nature Biotechnol VL - 23 UR - https://doi.org/10.1038/nbt1053 DO - 10.1038/nbt1053 ID - Tompa2005 ER - TY - JOUR AU - McCreight, E. M. PY - 1976 DA - 1976// TI - A Space-Economical Suffix Tree Construction Algorithm JO - J ACM VL - 23 UR - https://doi.org/10.1145/321941.321946 DO - 10.1145/321941.321946 ID - McCreight1976 ER - TY - BOOK AU - Gusfield, D. PY - 1997 DA - 1997// TI - Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology PB - Cambridge University Press CY - New York UR - https://doi.org/10.1017/CBO9780511574931 DO - 10.1017/CBO9780511574931 ID - Gusfield1997 ER - TY - JOUR AU - Marsan, L. AU - Sagot, M. F. PY - 2000 DA - 2000// TI - Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification JO - J Comput Biol VL - 7 UR - https://doi.org/10.1089/106652700750050826 DO - 10.1089/106652700750050826 ID - Marsan2000 ER - TY - CHAP AU - Carvalho, A. AU - Freitas, A. AU - Oliveira, A. AU - Sagot, M. F. PY - 2005 DA - 2005// TI - A highly scalable algorithm for the extraction of cis-regulatory regions BT - Proceedings of the Asia-Pacific Bioinformatics Conference UR - https://doi.org/10.1142/9781860947322_0027 DO - 10.1142/9781860947322_0027 ID - Carvalho2005 ER - TY - BOOK AU - Allali, J. AU - Sagot, M. F. PY - 2004 DA - 2004// TI - The at most k-deep factor tree. Tech ID - Allali2004 ER - TY - CHAP AU - Carvalho, A. AU - Freitas, A. AU - Oliveira, A. PY - 2004 DA - 2004// TI - Efficient Extraction of Structured Motifs Using Box-links BT - Proceedings of 11th Conference on String Processing and Information Retrieval UR - https://doi.org/10.1007/978-3-540-30213-1_37 DO - 10.1007/978-3-540-30213-1_37 ID - Carvalho2004 ER - TY - JOUR AU - Leung, C. M. AU - Chin, F. Y. L. PY - 2006 DA - 2006// TI - Algorithms for Challenging Motif Problems JO - J Bioinf Comput Biol VL - 4 UR - https://doi.org/10.1142/S0219720006001692 DO - 10.1142/S0219720006001692 ID - Leung2006 ER - TY - JOUR AU - Buhler, J. AU - Tompa, M. PY - 2002 DA - 2002// TI - Finding motifs using random projections JO - J Comput Biol VL - 9 UR - https://doi.org/10.1089/10665270252935430 DO - 10.1089/10665270252935430 ID - Buhler2002 ER - TY - JOUR AU - Davila, J. AU - Balla, S. AU - Rajasekaran, S. PY - 2007 DA - 2007// TI - Fast and Practical Algorithms for Planted (l,d)-Motif Search JO - IEEE/ACM Trans Comput Biol Bioinf (TCBB) VL - 4 UR - https://doi.org/10.1109/TCBB.2007.70241 DO - 10.1109/TCBB.2007.70241 ID - Davila2007 ER - TY - CHAP AU - Federico, M. AU - Valente, P. AU - Leoncini, M. AU - Montangero, M. AU - Cavicchioli, R. PY - 2009 DA - 2009// TI - An Efficient Algorithm for Planted Structured Motif Extraction BT - CompBio ’09: Proceedings of the 1st ACM Workshop on Breaking Frontiers of Computational Biology UR - https://doi.org/10.1145/1531780.1531782 DO - 10.1145/1531780.1531782 ID - Federico2009 ER - TY - JOUR AU - Zhu, J. AU - Zhang, M. PY - 1999 DA - 1999// TI - SCPD: a promoter database of the yeast Saccharomyces cerevisiae JO - Bioinformatics VL - 15 UR - https://doi.org/10.1093/bioinformatics/15.7.607 DO - 10.1093/bioinformatics/15.7.607 ID - Zhu1999 ER - TY - JOUR AU - Teixeira, M. C. AU - Monteiro, P. AU - Jain, P. AU - Tenreiro, S. AU - Fernandes, A. R. AU - Mira, N. P. AU - Alenquer, M. AU - Freitas, A. T. AU - Oliveira, A. L. AU - Sá-Correia, I. PY - 2006 DA - 2006// TI - The YEASTRACT database: a tool for the analysis of transcription regulatory associations in Saccharomyces cerevisiae JO - Nucleic Acids Res VL - 34 UR - https://doi.org/10.1093/nar/gkj013 DO - 10.1093/nar/gkj013 ID - Teixeira2006 ER - TY - JOUR AU - Thomas-Chollier, M. AU - Sand, O. AU - Turatsinze, J. V. AU - Janky, R. AU - Defrance, M. AU - Vervisch, E. AU - Brohee, S. PY - 2008 DA - 2008// TI - RSAT: regulatory sequence analysis tools JO - Nucleic Acids Res VL - 36 UR - https://doi.org/10.1093/nar/gkn304 DO - 10.1093/nar/gkn304 ID - Thomas-Chollier2008 ER - TY - CHAP AU - Carvalho, A. M. AU - Freitas, A. T. AU - Oliveira, A. L. AU - Sagot, M. F. PY - 2004 DA - 2004// TI - A parallel algorithm for the extraction of structured motifs BT - Proceedings of the 19th ACM Symposium on Applied Computing (SAC’04) ID - Carvalho2004 ER -