TY - STD TI - Nicolae M, Rajasekaran S. qPMS9: An Efficient Algorithm for Quorum Planted Motif Search. Nat Sci Rep. 2015;5. doi:10.1038/srep07813. UR - http://dx.doi.org/10.1038/srep07813 ID - ref1 ER - TY - STD TI - Floratou A, Tata S, Patel JM. Efficient and Accurate Discovery of Patterns in Sequence Data Sets. IEEE Trans Knowl Data Eng. 2011; 23(8):1154–68. http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.69. UR - http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.69 ID - ref2 ER - TY - JOUR AU - Nicolae, M. AU - Rajasekaran, S. PY - 2014 DA - 2014// TI - Efficient Sequential and Parallel Algorithms for Planted Motif Search JO - BMC Bioinformatics VL - 15 UR - https://doi.org/10.1186/1471-2105-15-34 DO - 10.1186/1471-2105-15-34 ID - Nicolae2014 ER - TY - JOUR AU - Tanaka, S. PY - 2014 DA - 2014// TI - Improved Exact Enumerative Algorithms for the Planted (l,d)-motif Search Problem JO - IEEE/ACM Trans Comput Biol Bioinformatics (TCBB) VL - 11 UR - https://doi.org/10.1109/TCBB.2014.2306842 DO - 10.1109/TCBB.2014.2306842 ID - Tanaka2014 ER - TY - JOUR AU - Yu, Q. AU - Huo, H. AU - Zhang, Y. AU - Guo, H. PY - 2012 DA - 2012// TI - PairMotif: A new pattern-driven algorithm for planted (l,d) DNA motif search JO - PloS One VL - 7 UR - https://doi.org/10.1371/journal.pone.0048442 DO - 10.1371/journal.pone.0048442 ID - Yu2012 ER - TY - CHAP AU - Karlin, S. AU - Ost, F. AU - Blaisdell, B. E. ED - Waterman, M. S. PY - 1989 DA - 1989// TI - Patterns in DNA and Amino Acid Sequences and Their Statistical Significance BT - Mathematical Methods for DNA Sequences PB - CRC Press Inc CY - Boca Raton, FL, USA ID - Karlin1989 ER - TY - CHAP AU - Rocke, E. AU - Tompa, M. PY - 1998 DA - 1998// TI - An Algorithm for Finding Novel Gapped Motifs in DNA Sequences BT - Proceedings of the Second Annual International Conference on Computational Molecular Biology PB - ACM CY - New York, NY, USA ID - Rocke1998 ER - TY - CHAP AU - Sagot, M. F. PY - 1998 DA - 1998// TI - Spelling Approximate Repeated or Common Motifs using a Suffix Tree BT - LATIN’98: Theoretical Informatics PB - Springer CY - Brazil ID - Sagot1998 ER - TY - JOUR AU - Lanctot, J. K. AU - Li, M. AU - Ma, B. AU - Wang, S. AU - Zhang, L. PY - 2003 DA - 2003// TI - Distinguishing string selection problems JO - Inform Comput VL - 185 UR - https://doi.org/10.1016/S0890-5401(03)00057-9 DO - 10.1016/S0890-5401(03)00057-9 ID - Lanctot2003 ER - TY - CHAP AU - Adebiyi, E. F. AU - Kaufmann, M. ED - Guigó, R. ED - Gusfield, D. PY - 2002 DA - 2002// TI - Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation BT - Algorithms in Bioinformatics: Second International Workshop, WABI 2002 Rome, Italy, September 17–21, 2002 Proceedings PB - Springer Berlin Heidelberg CY - Berlin, Heidelberg ID - Adebiyi2002 ER - TY - JOUR AU - Wang, X. AU - Miao, Y. PY - 2014 DA - 2014// TI - GAEM: A Hybrid Algorithm Incorporating GA with EM for Planted Edited Motif Finding Problem JO - Curr Bioinformatics VL - 9 UR - https://doi.org/10.2174/1574893609666140901222327 DO - 10.2174/1574893609666140901222327 ID - Wang2014 ER - TY - JOUR AU - Rajasekaran, S. AU - Balla, S. AU - Huang, C. H. AU - Thapar, V. AU - Gryk, M. AU - Maciejewski, M. AU - Schiller, M. PY - 2005 DA - 2005// TI - High-performance Exact Algorithms for Motif Search JO - J Clin Monitoring Comput VL - 19 UR - https://doi.org/10.1007/s10877-005-0677-y DO - 10.1007/s10877-005-0677-y ID - Rajasekaran2005 ER - TY - JOUR AU - Pathak, S. AU - Rajasekaran, S. AU - Nicolae, M. PY - 2013 DA - 2013// TI - EMS1: An Elegant Algorithm for Edit Distance Based Motif Search JO - Int J Foundations Comput Sci VL - 24 UR - https://doi.org/10.1142/S0129054113500159 DO - 10.1142/S0129054113500159 ID - Pathak2013 ER - TY - BOOK AU - Knuth, D. E. PY - 2005 DA - 2005// TI - The Art of Computer Programming, Volume 4, Generating All Tuples and Permutations, Fascicle 2 PB - Addison Wesley CY - New Jersey, USA ID - Knuth2005 ER -