WordSeeker: Concurrent bioinformatics software for discovering genome-wide patterns and word-based genomic signatures

BMC Bioinformatics

Volumn 11, Issue SUPPL. 12, 2010, Pages

  Lichtenberg, Jens ^a   Kurz, Kyle ^a   Liang, Xiaoyu ^a   Al ouran, Rami ^a   Neiman, Lev ^a   Nau, Lee J ^a   Welch, Joshua D ^a   Jacox, Edwin ^b   Bitterman, Thomas ^c   Ecker, Klaus ^a   Elnitski, Laura ^d   Drews, Frank ^a   Lee, Stephen S ^e   Welch, Lonnie R ^a  

^a OHIO UNIVERSITY   (United States)

^b AIX MARSEILLE UNIVERSITÉ   (France)

^c OHIO SUPERCOMPUTER CENTER   (United States)

^d NATIONAL HUMAN GENOME RESEARCH INSTITUTE   (United States)

^e UNIVERSITY OF IDAHO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARABIDOPSIS THALIANA; BIOINFORMATICS SOFTWARE; COMPUTATIONAL PLATFORMS; CONCURRENT COMPUTING; FUNCTIONAL ELEMENTS; GENOMIC DATA SETS; INFORMATION SERVERS; PERFORMANCE TESTS;

BIOINFORMATICS; CLUSTER COMPUTING; MARKOV PROCESSES; SCALABILITY; SUPERCOMPUTERS;

GENES;

ARABIDOPSIS; ARABIDOPSIS THALIANA;

DNA;

ALGORITHM; ARABIDOPSIS; ARTICLE; CHEMISTRY; COMPUTER PROGRAM; DNA SEQUENCE; EVALUATION; GENETICS; GENOMICS; METHODOLOGY; PLANT GENOME; PROBABILITY; REGULATORY SEQUENCE;

ALGORITHMS; ARABIDOPSIS; DNA; GENOME, PLANT; GENOMICS; MARKOV CHAINS; REGULATORY SEQUENCES, NUCLEIC ACID; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 78650811250     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-11-S12-S6     Document Type: Article

References (35)

1. The ENCODE Project Consortium The ENCODE (ENCyclopedia Of DNA Elements) Project. Science 2004, 306:636-640. 10.1126/science.1105136, 15499007, The ENCODE Project Consortium.
2. Blahnik KR, Dou L, O'Geen H, McPhillips T, Xu X, Cao AR, Iyengar S, Nicolet CM, Ludascher B, Korf I, Farnham PJ. Sole-Search: an integrated analysis program for peak detection and functional annotation using ChIP-seq data. Nucl Acids Res 2010, 38(3):e13. 10.1093/nar/gkp1012, 2817454, 19906703.
3. Feng J, Naiman DQ, Cooper B. Coding DNA repeated throughout intergenic regions of the Arabidopsis thaliana genome: evolutionary footprints of RNA silencing. Molecular BioSystems 2009, 5:1679-1687. 10.1039/b903031j, 19452047.
4. Rigoutsos I, Huynh T, Miranda K, Tsirigos A, McHardy A, Platt D. Short blocks from the noncoding parts of the human genome have instances within nearly all known genes and relate to biological processes. Proc Natl Acad Sci U S A 2006, 103:6605-6610. 10.1073/pnas.0601688103, 1447521, 16636294.
5. Heath L, Pati A. Genomic Signatures from DNA Word Graphs. Bioinformatics Research and Applications 2007, 317-328. Springer Berlin/Heidelberg, Mandoiu I, Zelikovsky A, Lecture Notes in Computer Science, vol 4463.
6. Blanchette M, Sinha S. Separating real motifs from their artifacts. Bioinformatics 2001, 17:S30-38.
7. Fauteux F, Blanchette M, Stromvik MV. Seeder: discriminative seeding DNA motif discovery. Bioinformatics 2008, 24:2303-2307. 10.1093/bioinformatics/btn444, 2562012, 18718942.
8. Hoebeke M, Schbath S. R'MES: Finding Exceptional Motifs, version 3. User Guide 2006, L'institut nationl de la recherché agronomique;.
9. Prum B, Rodolphe F, Turckheim E. Finding Words with Unexpected Frequencies in Deoxyribonucleic Acid Sequences. Journal of the Royal Statistical Society Series B (Methodological) 1995, 57:205-220.
10. Sagot M-F. Spelling Approximate Repeated or Common Motifs Using a Suffix Tree. LATIN'98: Theoretical Informatics 1998, 374-390. Springer: Berlin/Heidelberg, Lucchesi C, Moura A, Lecture Notes in Computer Science vol 1380.
11. Schbath S, Prum B, de Turckheim E. Exceptional motifs in different Markov chain models for a statistical analysis of DNA sequences. J Comput Biol 1995, 2:417-437. 10.1089/cmb.1995.2.417, 8521272.
12. Sharma D, Rajasekaran S. A Simple Algorithm for (l, d) Motif Search. Proceedings of the 6th Annual IEEE conference on Computational Intelligence in Bioinformatics and Computational Biology 2009, 148-154. IEEE Press: Piscataway, 30 March-02 April 2009; Nashville.
13. Sinha S, Tompa M. A statistical method for finding transcription factor binding sites. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology: 19-23 August 2000; La Jolla 2000, 344-354. The AAAI Press, Menlo Park, Russ Altman, Timothy L. Bailey, Philip Bourne, Michael Gribskov, Thomas Lengauer, Ilya N. Shindyalov, Lynn F.Ten Eyck, and Helge Weissig.
14. Sinha S, Tompa M. YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucl Acids Res 2003, 31:3586-3588. 10.1093/nar/gkg618, 169024, 12824371.
15. Wang G, Yu T, Zhang W. WordSpy: identifying transcription factor binding motifs by building a dictionary and learning a grammar. Nucl Acids Res 2005, 33:W412-416. 10.1093/nar/gki492, 1160252, 15980501.
16. Wang G, Zhang W. A steganalysis-based approach to comprehensive identification and characterization of functional regulatory elements. Genome Biol 2006, 7:R49. 10.1186/gb-2006-7-6-r49, 1779545, 16787547.
17. Pavesi G, Mereghetti P, Mauri G, Pesole G. Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucl Acids Res 2004, 32:W199-203. 10.1093/nar/gkh465, 441603, 15215380.
18. Kurtz S, Choudhuri JV, Ohlebusch E, Schleiermacher C, Stoye J, Giegerich R. REPuter: the manifold applications of repeat analysis on a genomic scale. Nucl Acids Res 2001, 29:4633-4642. 10.1093/nar/29.22.4633, 92531, 11713313.
19. Apostolico A, Bock ME, Lonardi S, Xu X. Efficient detection of unusual words. J Comput Biol 2000, 7:71-94. 10.1089/10665270050081397, 10890389.
20. Pevzner PA, Sze SH. Combinatorial approaches to finding subtle signals in DNA sequences. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology: 19-23 August 2000; La Jolla 2000, 269-278. The AAAI Press, Menlo Park, Russ Altman, Timothy L. Bailey, Philip Bourne, Michael Gribskov, Thomas Lengauer, Ilya N.Shindyalov, Lynn F.TenEyck, and Helge Weissig.
21. Eskin E, Pevzner PA. Finding composite regulatory patterns in DNA sequences. Bioinformatics 2002, 18:S354-363.
22. Rigoutsos I, Floratos A. Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm. Bioinformatics 1998, 14:55-67. 10.1093/bioinformatics/14.1.55, 9520502.
23. Karp RM. Reducibility Among Combinatorial Problems. Complexity of Computer Computations 1972, 85-103. New York: Plenum, Miller RE, Thatcher JW.
24. Floratos A, Rigoutsos I. On the Time Complexity of the TEIRESIAS Algorithm. Research Report 1998, IBM T.J. Watson Research Center.
25. Lichtenberg J, Jacox E, Welch J, Kurz K, Liang X, Yang M, Drews F, Ecker K, Lee S, Elnitski L, Welch L. Word-based characterization of promoters involved in human DNA repair pathways. BMC Genomics 2009, 10(Suppl 1):S18. 10.1186/1471-2164-10-S1-S18, 2709261, 19594877.
26. Lichtenberg J, Yilmaz A, Welch J, Kurz K, Liang X, Drews F, Ecker K, Lee S, Geisler M, Grotewold E, Welch L. The word landscape of the non-coding segments of the Arabidopsis thaliana genome. BMC Genomics 2009, 10:463. 10.1186/1471-2164-10-463, 2770528, 19814816.
27. Liang X, Shen K, Lichtenberg J, Wyatt SE, Welch LR. An integrated bioinformatics approach to the discovery of cis-regulatory elements involved in plant gravitropic signal transduction. International Journal of Computational Bioscience 2010, 1(1):33-54.
28. Lichtenberg J, Yilmaz A, Kurz K, Liang X, Nelson C, Bitterman T, Stockinger E, Grotewold E, Welch LR. Encyclopedias of DNA elements for Plant Genomes. Advances in Genomic Sequence Analysis and Pattern Discovery 2011, Hackensack: World Scientific Publishing Company; (in press), Elnitski L, Piontkivska H, Welch L.
29. Davaluri RV, Sun H, Palaniswamy SK, Matthews N, Molina C, Kurtz M, Grotewold E. AGRIS Arabidopsis Gene Regulatory Information Server, an information resource of Arabidopsis cis-regulatory elements and transcription factors. BMC Bioinformatics 2003, 4(1):25. 10.1186/1471-2105-4-25, 166152, 12820902.
30. Kurz K, Lichtenberg J, Nau L, Drews F, Welch LR. An Open Source Framework for Bioinformatics Word Enumeration and Scoring. 10th Annual Bioinformatics Open Source Conference BOSC: 27-28 June 2009; Stockholm 2009, 37.
31. Kurz K. A Parallel, High-Throughput Framework for Discovery of DNA Motifs. 2010, Ohio University Electrical Engineering and Computer Science.
32. Tian Y, Tata S, Hankins RA, Patel JM. Practical methods for constructing suffix trees. The VLDB Journal 2005, 14(3):281-299.
33. Drews F, Lichtenberg J, Welch L. Scalable parallel word search in multicore/multiprocessor systems. J Supercomput 2010, 51:58-75.
34. Tompa M, Li N, Bailey TL, Church GM, De Moor B, Eskin E, Favorov AV, Frith MC, Fu Y, Kent WJ, et al. Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology 2005, 23:137-144. 10.1038/nbt1053, 15637633.
35. Grotewold E, Springer N. The Plant Genome: Decoding the Transcriptional Hardwiring. Annual Plant Reviews 2009, 35:196-227.