{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:25:55Z","timestamp":1725578755942},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642199134"},{"type":"electronic","value":"9783642199141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19914-1_24","type":"book-chapter","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T11:13:24Z","timestamp":1299669204000},"page":"175-182","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Motif Search Algorithm Based on a Minimal Forbidden Patterns Approach"],"prefix":"10.1007","author":[{"given":"Tarek","family":"El Falah","sequence":"first","affiliation":[]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[]},{"given":"Mourad","family":"Elloumi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"The Burrows-Wheeler Transform","author":"D. Adjeroh","year":"2008","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform. Springer, Heidelberg (2008)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., Leung, H.C.M.: Voting algorithm for discovering long motifs. In: Proceedings of Asia-Pacific Bioinformatics Conference, pp. 261\u2013272 (2005)","DOI":"10.1142\/9781860947322_0026"},{"key":"24_CR3","first-page":"387","volume-title":"Algorithms Computational Molecular Biology: Techniques, Approaches and Applications, Wiley Book Series on Bioinformatics: Computational Techniques and Ingeneering","author":"T. Falah El","year":"2011","unstructured":"El Falah, T., Elloumi, M., Lecroq, T.: Motif finding algorithms in biological sequences. In: Algorithms Computational Molecular Biology: Techniques, Approaches and Applications, Wiley Book Series on Bioinformatics: Computational Techniques and Ingeneering, pp. 387\u2013398. Wiley-Blackwell, John Wuley and Sons Ltd., New Jersey, USA (2011)"},{"key":"24_CR4","unstructured":"El Falah, T., Lecroq, T., Elloumi, M.: SMS-Forbid: an efficient algorithm for simple motif problem. In: Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, Honolulu, Hawai, pp. 121\u2013126 (2010)"},{"key":"24_CR5","unstructured":"Floratos, A., Rigoutsos, I.: On the time complexity of the teiresias algorithm. Technical report, Research Report RC 21161 (94582). IBM T.J. Watson Research Center (1998)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Leung, H.C.M., Chin, F.Y.L.: An efficient algorithm for the extended (l,d)-motif problem, with unknown number of binding sites. In: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE 2005), pp. 11\u201318 (2005)","DOI":"10.1109\/BIBE.2005.12"},{"issue":"1","key":"24_CR7","first-page":"1","volume":"1","author":"A. Price","year":"2003","unstructured":"Price, A., Ramabhadran, S., Pevzner, P.A.: Finding subtle motifs by branching from sample strings. Bioinformatics\u00a01(1), 1\u20137 (2003)","journal-title":"Bioinformatics"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10877-005-0677-y","volume":"19","author":"S. Rajasekaran","year":"2005","unstructured":"Rajasekaran, S., Balla, S., Huang, C.-H., Thapar, V., Gryk, M., Maciejewski, M., Schiller, M.: High-performance exact algorithms for motif search. Journal of Clinical Monitoring and Computing\u00a019, 319\u2013328 (2005)","journal-title":"Journal of Clinical Monitoring and Computing"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"LATIN 1998: Theoretical Informatics","author":"M.F. Sagot","year":"1998","unstructured":"Sagot, M.F.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 111\u2013127. Springer, Heidelberg (1998)"},{"issue":"2","key":"24_CR10","first-page":"63","volume":"15","author":"M.P. Styczynski","year":"2004","unstructured":"Styczynski, M.P., Jensen, K.L., Rigoutsos, I., Stephanopoulos, G.N.: An extension and novel solution to the (l,d)-motif challenge problem. Genome Informatics\u00a015(2), 63\u201371 (2004)","journal-title":"Genome Informatics"}],"container-title":["Advances in Intelligent and Soft Computing","5th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2011)"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19914-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T18:16:25Z","timestamp":1548440185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19914-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642199134","9783642199141"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19914-1_24","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2011]]}}}