{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:19:54Z","timestamp":1742941194179,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642375019"},{"type":"electronic","value":"9783642375026"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37502-6_98","type":"book-chapter","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T08:25:55Z","timestamp":1367915155000},"page":"825-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DNA Sequence Motif Discovery Based on Kd-Trees and Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shouhang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuedong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,8]]},"reference":[{"key":"98_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.2011.0249","volume":"19","author":"NE Ihuegbu","year":"2012","unstructured":"Ihuegbu NE, Stormo GD, Buhler J (2012) Fast, sensitive of conserved genome wide motifs. J Comput Biol 19:139\u2013147","journal-title":"J Comput Biol"},{"key":"98_CR2","first-page":"1596","volume":"3","author":"M Stine","year":"2003","unstructured":"Stine M, Dasgupta D, Mukatira S (2003) Motif discovery in upstream sequences of coordinately expressed genes. Evol Comput 3:1596\u20131603","journal-title":"Evol Comput"},{"key":"98_CR3","doi-asserted-by":"crossref","unstructured":"Liu FFM, Tsai JJP, Chen RM, Shih SH (2004) FMGA: finding motifs by genetic algorithm. In: Proceedings of 4th IEEE symposium on bioinformatics and bioengineering, Taichung, pp 301\u2013309","DOI":"10.1109\/BIBE.2004.1317378"},{"key":"98_CR4","first-page":"447","volume-title":"MDGA: motif discovery using a genetic algorithm","author":"DS Che","year":"2005","unstructured":"Che DS, Song YL, Rasheed K (2005) MDGA: motif discovery using a genetic algorithm. Genetic and Evolutionary Computation, New York, pp 447\u2013452"},{"key":"98_CR5","doi-asserted-by":"crossref","unstructured":"Congdon CB, Fizer CW, Smith NW (2005) Preliminary results for GAMI: a genetic algorithm approach to motif inference. In: Proceedings of symposium on computational intelligence in bioinformatics and computational biology, CA, pp 1\u20138","DOI":"10.1109\/CIBCB.2005.1594904"},{"key":"98_CR6","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.1016\/j.mcm.2010.06.003","volume":"52","author":"HW Huo","year":"2010","unstructured":"Huo HW, Zhao ZH, Stojkovic V, Liu LF (2010) Optimizing genetic algorithm for motif discovery. Math Comput Model 52:2011\u20132020","journal-title":"Math Comput Model"},{"key":"98_CR7","doi-asserted-by":"crossref","unstructured":"Blekas K, Fotiadis DI, Likas A (2003) Greedy mixture learning for multiple motif discovery in biological sequences. Bioinformatics 19:607\u2013617","DOI":"10.1093\/bioinformatics\/btg037"},{"key":"98_CR8","first-page":"269","volume":"8","author":"PA Pevzner","year":"2000","unstructured":"Pevzner PA, Sze SH (2000) Combinatorial approaches to finding subtle signals in DNA sequences. Intell Syst Mol Biol 8:269\u2013278","journal-title":"Intell Syst Mol Biol"},{"key":"98_CR9","doi-asserted-by":"publisher","first-page":"2641","DOI":"10.1093\/bioinformatics\/btr459","volume":"27","author":"HQ Sun","year":"2012","unstructured":"Sun HQ, Low MYH, Hsu WJ, Tan CW, Rajapakse JC (2012) Tree-structured algorithm for long weak motif discovery. Bioinformatics 27:2641\u20132647","journal-title":"Bioinformatics"},{"key":"98_CR10","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1109\/TCBB.2010.92","volume":"8","author":"CW Huang","year":"2011","unstructured":"Huang CW, Lee WS, Hsieh SY (2011) An improved heuristic algorithm for finding motif signals in DNA sequences. IEEE\/ACM Trans Comput Biol Bioinf 8:959\u2013975","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37502-6_98","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T12:45:28Z","timestamp":1676810728000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37502-6_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642375019","9783642375026"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37502-6_98","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"8 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}