Scalable parallel word search in multicore/multiprocessor systems

Journal of Supercomputing

Volumn 51, Issue 1, 2010, Pages 58-75

  Drews, Frank ^a   Lichtenberg, Jens ^a   Welch, Lonnie ^a  

^a Ohio University   (United States)

Author keywords

Biological word discovery; Cache awareness; Lock free data partitioning; Multicore multiprocessor systems; Parallel algorithms

Indexed keywords

ACCESS PATTERNS; CACHE LOCALITY; CACHE-AWARENESS; CORE SYSTEMS; DATA ACCESS; DATA PARTITIONING; DUAL PROCESSORS; LOCK-FREE; MULTIPLE THREADS; NONLOCAL; OUTPUT DATA; PARALLEL IMPLEMENTATIONS; PARALLEL SOLUTIONS; PARALLEL STRATEGIES; PARALLELIZATIONS; PERFORMANCE EVALUATION; PROCESSING LOAD; SEQUENTIAL IMPLEMENTATION; SPEED-UPS; TEST SYSTEMS;

DNA; GENES; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

DNA SEQUENCES;

EID: 76549127379     PISSN: 09208542     EISSN: 15730484     Source Type: Journal    
DOI: 10.1007/s11227-009-0308-3     Document Type: Conference Paper

References (44)

1. Bailey TL, Elkan C (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers. AAAI Press, Menlo Park, pp 28-36
2. FR Roth JD Hughes PE Church GM Church 1998 Finding DNA regulatory motifs within unaligned non-coding sequences clustered by whole-genome mRNA quantita Nature Biotechnol 16 10 939 945 10.1038/nbt1098-939 (Pubitemid 28483622)
3. G Pavesi P Mereghetti G Mauri G Pesole 2004 Weeder web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes Nucleic Acids Res 32 W199 W203 10.1093/nar/gkh465 (Pubitemid 38997329)
4. I Rigoutsos T Huynh K Miranda A Tsirigos A McHardy D Platt 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 6610 10.1073/pnas.0601688103
5. S Sinha M Tompa 2003 Ymf: a program for discovery of novel transcription factor binding sites by statistical overrepresentation Nucleic Acids Res 32 13 3586 3588 10.1093/nar/gkg618 (Pubitemid 37442203)
6. 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
7. Gusfield D (1997) Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, Cambridge
8. RS Boyer JS Moore 1977 A fast string searching algorithm Commun ACM 20 10 762 772 10.1145/359842.359859 (Pubitemid 8554622)
9. DE Knuth JH Morris VR Pratt 1977 Fast pattern matching in strings SIAM J Comput 6 2 323 350 0372.68005 10.1137/0206024 451916
10. A Apostolico R Giancarlo 1986 The Boyer-Moore-Galil string searching strategies revisited SIAM J Comput 15 98 105 0589.68047 10.1137/0215007 822195
11. AV Aho MJ Corasick 1975 Efficient string matching: an aid to bibliographic search Commun ACM 18 6 333 340 0301.68048 10.1145/360825.360855 371172
12. Weiner P (1973) Linear pattern matching algorithms. In: Proc of the 14th annual IEEE symposium on switching and automata theory, pp 1-11. URL http://citeseer.ist.psu.edu/context/43441/0
13. EM McCreight 1976 A space-economical suffix tree construction algorithm J ACM 23 2 262 272 0329.68042 10.1145/321941.321946 413594
14. E Ukkonen 1995 On-line construction of suffix trees Algorithmica 14 3 249 260 0831.68027 10.1007/BF01206331 1343552
15. R Giegerich S Kurtz 1997 From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction Algorithmica 19 331 353 0895.68056 10.1007/PL00009177 1471306
16. U Manber G Myers 1993 Suffix arrays: a new method for on-line string searches SIAM J Comput 22 5 935 948 0784.68027 10.1137/0222058 1237156
17. Burrows M, Wheeler DJ (1994) A block-sorting lossless data compression algorithm. Tech Rep 124. URL http://citeseer.ist.psu.edu/76182.html
18. Adjeroh D, Bell T, Mukherjee A (2008) The Burrows-Wheeler transform: Data compression, suffix arrays, and pattern matching. Springer, Berlin
19. DR Morrison 1968 Patricia-Practical algorithm to retrieve information coded in alphanumeric J ACM 15 4 514 534 10.1145/321479.321481 10.1145/321479.321481 721708
20. 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 62. Australian Computing Society, Ballarat, pp 97-105
21. Knuth DE (1998) Art of computer programming, vol 3: Sorting and searching, 2nd edn. Addison-Wesley, Reading
22. Bell TC, Cleary JG, Witten IH (1990) Text compression. In: Prentice Hall advanced reference series. Prentice Hall, New York
23. Sedgewick R (2002) Algorithms C. Addison-Wesley/Longman, Boston
24. DG Severance 1974 Identifier search mechanisms: A survey and generalized model ACM Comput Surv 6 3 175 194 0297.68032 10.1145/356631.356633
25. M Al-Suwaiyel E Horowitz 1984 Algorithms for trie compaction ACM Trans Database Syst 9 2 243 263 0542.68079 10.1145/329.295 794541
26. K Maly 1976 Compressed tries Commun ACM 19 7 409 415 10.1145/360248. 360258 0329.68037 10.1145/360248.360258 421190
27. R Sinha J Zobel 2004 Cache-conscious sorting of large sets of strings with dynamic tries J Exp Algorithmics 9 1.5 10.1145/1005813.1041517 2116895
28. R Sinha D Ring J Zobel 2006 Cache-efficient string sorting using copying J Exp Algorithmics 11 1.2 10.1145/1187436.1187439 2276803
29. Chilimbi TM, Davidson B, Larus JR (1999) Cache-conscious structure definition. In: PLDI'99: Proceedings of the ACM SIGPLAN 1999 conference on programming language design and implementation. ACM, New York, pp 13-24
30. TM Chilimbi MD Hill JR Larus 2000 Making pointer-based data structures cache conscious Computer 33 12 67 74 10.1109/2.889095 (Pubitemid 32032492)
31. Badawy AHA, Aggarwal A, Yeung D, Tseng CW (2001) Evaluating the impact of memory system performance on software prefetching and locality optimizations. In: ICS'01: Proceedings of the 15th international conference on Supercomputing. ACM, New York, pp 486-500
32. 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
33. R J, Ross KA (1999) Cache conscious indexing for decision-support in main memory, pp 78-89
34. 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-486
35. CL Yang AR Lebeck HW Tseng CH Lee 2004 Tolerating memory latency through push prefetching for pointer-intensive applications ACM Trans Archit Code Optim 1 4 445 475 10.1145/1044823.1044827
36. Y Bilu N Barkai 2005 The design of transcription-factor binding sites is affected by combinatorial regulation Genome Biol 6 12 R103 10.1186/gb-2005-6-12- r103 10.1186/gb-2005-6-12-r103 URL http://genomebiology.com/2005/6/12/R103
37. A Tomovic EJ Oakeley 2007 Position dependencies in transcription factor binding sites Bioinformatics 23 8 933 941 10.1093/bioinformatics/btm055 10.1093/bioinformatics/btm055 URL http://bioinformatics.oxfordjournals.org/cgi/ content/abstract/23/8/933 (Pubitemid 47050579)
38. A Sandelin W Alkema P Engstrom WW Wasserman B Lenhard 2004 Jaspar: an open-access database for eukaryotic transcription factor binding profiles Nucl Acids Res 32 1 D91 94 10.1093/nar/gkh012 10.1093/nar/gkh012
39. Robin S, Rodolphe F, Schbath S (2005) DNA, Words and models. Cambridge University Press, New York
40. 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
41. I Borodina P Krabben J Nielsen 2005 Genome-scale analysis of streptomyces coelicolor a3(2) metabolism Genome Res 15 6 820 829 10.1101/gr.3364705 10.1101/gr.3364705 (Pubitemid 41007057)
42. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85-103
43. Graham R Bounds for certain multiprocessing anomalies. Bell Syst Tech J (1966)
44. Butenhof DR (1997) Programming with POSIX threads. Addison-Wesley/ Longman, Boston