{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:40:23Z","timestamp":1775281223283,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T00:00:00Z","timestamp":1246924800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s11227-009-0308-3","type":"journal-article","created":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T14:35:17Z","timestamp":1246890917000},"page":"58-75","source":"Crossref","is-referenced-by-count":9,"title":["Scalable parallel word search in\u00a0multicore\/multiprocessor systems"],"prefix":"10.1007","volume":"51","author":[{"given":"Frank","family":"Drews","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Lichtenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lonnie","family":"Welch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,7,7]]},"reference":[{"key":"308_CR1","first-page":"28","volume-title":"Fitting a mixture model by expectation maximization to discover motifs in biopolymers","author":"TL Bailey","year":"1994","unstructured":"Bailey TL, Elkan C (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers. AAAI Press, Menlo Park, pp 28\u201336"},{"issue":"10","key":"308_CR2","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1038\/nbt1098-939","volume":"16","author":"FR Roth","year":"1998","unstructured":"Roth FR, Hughes JD, Church PE, Church GM (1998) Finding DNA regulatory motifs within unaligned non-coding sequences clustered by whole-genome mRNA quantita. Nature Biotechnol 16(10):939\u2013945","journal-title":"Nature Biotechnol"},{"key":"308_CR3","doi-asserted-by":"crossref","first-page":"W199","DOI":"10.1093\/nar\/gkh465","volume":"32","author":"G Pavesi","year":"2004","unstructured":"Pavesi G, Mereghetti P, Mauri G, Pesole G (2004) Weeder web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Res 32:W199\u2013W203","journal-title":"Nucleic Acids Res"},{"issue":"17","key":"308_CR4","doi-asserted-by":"crossref","first-page":"6605","DOI":"10.1073\/pnas.0601688103","volume":"103","author":"I Rigoutsos","year":"2006","unstructured":"Rigoutsos I, Huynh T, Miranda K, Tsirigos A, McHardy A, Platt D (2006) Short blocks from the noncoding parts of the human genome have instances within nearly all known genes and relate to biological processes. Proc Nat Acad Sci 103(17):6605\u20136610","journal-title":"Proc Nat Acad Sci"},{"issue":"13","key":"308_CR5","doi-asserted-by":"crossref","first-page":"3586","DOI":"10.1093\/nar\/gkg618","volume":"32","author":"S Sinha","year":"2003","unstructured":"Sinha S, Tompa M (2003) Ymf: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res 32(13):3586\u20133588","journal-title":"Nucleic Acids Res"},{"key":"308_CR6","doi-asserted-by":"crossref","unstructured":"Wang G, Yu T, Zhang W (2005) Wordspy: identifying transcription factor binding motifs by building a dictionary and learning a grammar. Nucleic Acids Res 33(Web Server issue). http:\/\/view.ncbi.nlm.nih.gov\/pubmed\/15980501","DOI":"10.1093\/nar\/gki492"},{"key":"308_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: Computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield D (1997) Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, Cambridge"},{"issue":"10","key":"308_CR8","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer RS, Moore JS (1977) A fast string searching algorithm. Commun ACM 20(10):762\u2013772","journal-title":"Commun ACM"},{"issue":"2","key":"308_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth DE, Morris JH, Pratt VR (1977) Fast pattern matching in strings. SIAM J Comput 6(2):323\u2013350","journal-title":"SIAM J Comput"},{"key":"308_CR10","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/0215007","volume":"15","author":"A Apostolico","year":"1986","unstructured":"Apostolico A, Giancarlo R (1986) The Boyer-Moore-Galil string searching strategies revisited. SIAM J Comput 15:98\u2013105","journal-title":"SIAM J Comput"},{"issue":"6","key":"308_CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho AV, Corasick MJ (1975) Efficient string matching: an aid to bibliographic search. Commun ACM 18(6):333\u2013340","journal-title":"Commun ACM"},{"key":"308_CR12","doi-asserted-by":"crossref","unstructured":"Weiner P (1973) Linear pattern matching algorithms. In: Proc of the 14th annual IEEE symposium on switching and automata theory, pp 1\u201311. URL http:\/\/citeseer.ist.psu.edu\/context\/43441\/0","DOI":"10.1109\/SWAT.1973.13"},{"issue":"2","key":"308_CR13","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight EM (1976) A space-economical suffix tree construction algorithm. J ACM 23(2):262\u2013272","journal-title":"J ACM"},{"issue":"3","key":"308_CR14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen E (1995) On-line construction of suffix trees. Algorithmica 14(3):249\u2013260","journal-title":"Algorithmica"},{"key":"308_CR15","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/PL00009177","volume":"19","author":"R Giegerich","year":"1997","unstructured":"Giegerich R, Kurtz S (1997) From Ukkonen to McCreight and Weiner: A\u00a0unifying view of linear-time suffix tree construction. Algorithmica 19:331\u2013353","journal-title":"Algorithmica"},{"issue":"5","key":"308_CR16","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber U, Myers G (1993) Suffix arrays: a\u00a0new method for on-line string searches. SIAM J Comput 22(5):935\u2013948","journal-title":"SIAM J Comput"},{"key":"308_CR17","unstructured":"Burrows M, Wheeler DJ (1994) A block-sorting lossless data compression algorithm. Tech Rep 124. URL http:\/\/citeseer.ist.psu.edu\/76182.html"},{"key":"308_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-78909-5","volume-title":"The Burrows-Wheeler transform: Data compression, suffix arrays, and pattern matching","author":"D Adjeroh","year":"2008","unstructured":"Adjeroh D, Bell T, Mukherjee A (2008) The Burrows-Wheeler transform: Data compression, suffix arrays, and pattern matching. Springer, Berlin"},{"issue":"4","key":"308_CR19","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"DR Morrison","year":"1968","unstructured":"Morrison DR (1968) Patricia\u2014Practical algorithm to retrieve information coded in alphanumeric. J\u00a0ACM 15(4):514\u2013534. doi: 10.1145\/321479.321481","journal-title":"J\u00a0ACM"},{"key":"308_CR20","series-title":"CRPIT","first-page":"97","volume-title":"Proceedings of the thirtieth Australasian computer science conference (ACSC 2007)","author":"N Askitis","year":"2007","unstructured":"Askitis N, Sinha R (2007) Hat-trie: A cache-conscious trie-based data structure for strings. In: Dobbie, G (ed) Proceedings of the thirtieth Australasian computer science conference (ACSC 2007). CRPIT, vol\u00a062. Australian Computing Society, Ballarat, pp\u00a097\u2013105"},{"key":"308_CR21","volume-title":"Art of computer programming, vol\u00a03: Sorting and searching","author":"DE Knuth","year":"1998","unstructured":"Knuth DE (1998) Art of computer programming, vol\u00a03: Sorting and searching, 2nd edn. Addison-Wesley, Reading","edition":"2"},{"key":"308_CR22","volume-title":"Prentice Hall advanced reference series","author":"TC Bell","year":"1990","unstructured":"Bell TC, Cleary JG, Witten IH (1990) Text compression. In: Prentice Hall advanced reference series. Prentice Hall, New York"},{"key":"308_CR23","volume-title":"Algorithms C","author":"R Sedgewick","year":"2002","unstructured":"Sedgewick R (2002) Algorithms C. Addison-Wesley\/Longman, Boston"},{"issue":"3","key":"308_CR24","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/356631.356633","volume":"6","author":"DG Severance","year":"1974","unstructured":"Severance DG (1974) Identifier search mechanisms: A\u00a0survey and generalized model. ACM Comput Surv 6(3):175\u2013194","journal-title":"ACM Comput Surv"},{"issue":"2","key":"308_CR25","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1145\/329.295","volume":"9","author":"M Al-Suwaiyel","year":"1984","unstructured":"Al-Suwaiyel M, Horowitz E (1984) Algorithms for trie compaction. ACM Trans Database Syst 9(2):243\u2013263","journal-title":"ACM Trans Database Syst"},{"issue":"7","key":"308_CR26","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/360248.360258","volume":"19","author":"K Maly","year":"1976","unstructured":"Maly K (1976) Compressed tries. Commun ACM 19(7):409\u2013415. doi: 10.1145\/360248.360258","journal-title":"Commun ACM"},{"key":"308_CR27","doi-asserted-by":"crossref","first-page":"1.5","DOI":"10.1145\/1005813.1041517","volume":"9","author":"R Sinha","year":"2004","unstructured":"Sinha R, Zobel J (2004) Cache-conscious sorting of large sets of strings with dynamic tries. J Exp Algorithmics 9:1.5","journal-title":"J Exp Algorithmics"},{"key":"308_CR28","first-page":"1.2","volume":"11","author":"R Sinha","year":"2006","unstructured":"Sinha R, Ring D, Zobel J (2006) Cache-efficient string sorting using copying. J Exp Algorithmics 11:1.2","journal-title":"J Exp Algorithmics"},{"key":"308_CR29","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/301618.301635","volume-title":"PLDI\u201999: Proceedings of the ACM SIGPLAN 1999 conference on programming language design and implementation","author":"TM Chilimbi","year":"1999","unstructured":"Chilimbi TM, Davidson B, Larus JR (1999) Cache-conscious structure definition. In: PLDI\u201999: Proceedings of the ACM SIGPLAN 1999 conference on programming language design and implementation. ACM, New York, pp 13\u201324"},{"issue":"12","key":"308_CR30","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/2.889095","volume":"33","author":"TM Chilimbi","year":"2000","unstructured":"Chilimbi TM, Hill MD, Larus JR (2000) Making pointer-based data structures cache conscious. Computer 33(12):67\u201374","journal-title":"Computer"},{"key":"308_CR31","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/377792.377906","volume-title":"ICS\u201901: Proceedings of the 15th international conference on Supercomputing","author":"AHA Badawy","year":"2001","unstructured":"Badawy AHA, Aggarwal A, Yeung D, Tseng CW (2001) Evaluating the impact of memory system performance on software prefetching and locality optimizations. In: ICS\u201901: Proceedings of the 15th international conference on Supercomputing. ACM, New York, pp 486\u2013500"},{"key":"308_CR32","unstructured":"Hallberg J, Palm T, Brorsson M (2003) Cacheconscious allocation of pointer-based data structures revisited with hw\/sw prefetching. In: 2nd Annual workshop on duplicating, deconstructing, and debunking"},{"key":"308_CR33","unstructured":"R J, Ross KA (1999) Cache conscious indexing for decision-support in main memory, pp 78\u201389"},{"key":"308_CR34","doi-asserted-by":"crossref","unstructured":"Rao J, Ross KA (2000) Making b+-trees cache conscious in main memory. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, pp 475\u2013486","DOI":"10.1145\/342009.335449"},{"issue":"4","key":"308_CR35","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/1044823.1044827","volume":"1","author":"CL Yang","year":"2004","unstructured":"Yang CL, Lebeck AR, Tseng HW, Lee CH (2004) Tolerating memory latency through push prefetching for pointer-intensive applications. ACM Trans Archit Code Optim 1(4):445\u2013475","journal-title":"ACM Trans Archit Code Optim"},{"issue":"12","key":"308_CR36","doi-asserted-by":"crossref","first-page":"R103","DOI":"10.1186\/gb-2005-6-12-r103","volume":"6","author":"Y Bilu","year":"2005","unstructured":"Bilu Y, Barkai N (2005) The design of transcription-factor binding sites is affected by combinatorial regulation. Genome Biol 6(12):R103. doi: 10.1186\/gb-2005-6-12-r103 . URL http:\/\/genomebiology.com\/2005\/6\/12\/R103","journal-title":"Genome Biol"},{"issue":"8","key":"308_CR37","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1093\/bioinformatics\/btm055","volume":"23","author":"A Tomovic","year":"2007","unstructured":"Tomovic A, Oakeley EJ (2007) Position dependencies in transcription factor binding sites. Bioinformatics 23(8):933\u2013941. doi: 10.1093\/bioinformatics\/btm055 . URL http:\/\/bioinformatics.oxfordjournals.org\/cgi\/content\/abstract\/23\/8\/933","journal-title":"Bioinformatics"},{"issue":"1","key":"308_CR38","doi-asserted-by":"crossref","first-page":"D91","DOI":"10.1093\/nar\/gkh012","volume":"32","author":"A Sandelin","year":"2004","unstructured":"Sandelin A, Alkema W, Engstrom P, Wasserman WW, Lenhard B (2004) Jaspar: an open-access database for eukaryotic transcription factor binding profiles. Nucl Acids Res 32(1):D91\u201394. doi: 10.1093\/nar\/gkh012","journal-title":"Nucl Acids Res"},{"key":"308_CR39","volume-title":"DNA, Words and models","author":"S Robin","year":"2005","unstructured":"Robin S, Rodolphe F, Schbath S (2005) DNA, Words and models. Cambridge University Press, New York"},{"key":"308_CR40","doi-asserted-by":"crossref","unstructured":"Swarbreck D, Wilks C, Lamesch P, Berardini TZ, Garcia-Hernandez M, Foerster H, Li D, Meyer T, Muller R, Ploetz L, Radenbaugh A, Singh S, Swing V, Tissier C, Zhang P, Huala E (2007) The arabidopsis information resource (TAIR): gene structure and function annotation. Nucleic Acids Res pp 965+. doi: 10.1093\/nar\/gkm965","DOI":"10.1093\/nar\/gkm965"},{"issue":"6","key":"308_CR41","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1101\/gr.3364705","volume":"15","author":"I Borodina","year":"2005","unstructured":"Borodina I, Krabben P, Nielsen J (2005) Genome-scale analysis of streptomyces coelicolor a3(2) metabolism. Genome Res 15(6):820\u2013829. doi: 10.1101\/gr.3364705","journal-title":"Genome Res"},{"key":"308_CR42","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85\u2013103"},{"key":"308_CR43","doi-asserted-by":"crossref","unstructured":"Graham R Bounds for certain multiprocessing anomalies. Bell Syst Tech J (1966)","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"308_CR44","volume-title":"Programming with POSIX threads","author":"DR Butenhof","year":"1997","unstructured":"Butenhof DR (1997) Programming with POSIX threads. Addison-Wesley\/Longman, Boston"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-009-0308-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-009-0308-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-009-0308-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T05:14:18Z","timestamp":1633670058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-009-0308-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,7]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["308"],"URL":"https:\/\/doi.org\/10.1007\/s11227-009-0308-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,7]]}}}