Using bloom filters for large scale gene sequence analysis in haskell

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5418 LNCS, Issue , 2009, Pages 183-194

  Malde, Ketil ^a   O'Sullivan, Bryan ^b  

^a INSTITUTE OF MARINE RESEARCH   (Norway)

^b Serpentine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS APPLICATIONS; BIOLOGICAL DATA; BLOOM FILTERS; GENE SEQUENCE ANALYSIS; GENE SEQUENCES; HASKELL; HUMAN GENOMES; IMPROVED ALGORITHM; INDEXING STRUCTURES; LARGE DATASETS; RAPID DEVELOPMENT; SEQUENCE DATA;

BLOOMS (METAL); DATA STRUCTURES; GENES; INDEXING (OF INFORMATION); LINGUISTICS; QUALITY ASSURANCE; TEXTILES; TOTAL QUALITY MANAGEMENT;

BIOINFORMATICS;

EID: 70350656155     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92995-6_13     Document Type: Conference Paper

References (24)

1. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing Suffix Trees with Enhanced Suffix Arrays. Journal of Discrete Algorithms 2(1), 53-86 (2004)
2. Abouelhoda, M.I., Ohlebusch, E., Kurtz, S.: Optimal Exact String Matching Based on Suffix Arrays. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 31-43. Springer, Heidelberg (2002)
3. Altschul, S., Gish, W., Miller, W., Myers, E., Lipman, D.: A basic local alignment search tool. Journal of Molecular Biology 215(3), 403-410 (1990)4. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422-426 (1970)
4. Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. Internet Mathematics 1(4), 636-646 (2003)
5. Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: ACM SIGPLAN Notices, pp. 268-279. ACM Press, New York (2000)
6. Cloonan, N., Forrest, A.R.R., Kolle, G., Gardiner, B.B.A., Faulkner, G.J., Brown, M.K., Taylor, D.F., Steptoe, A.L., Wani, S., Bethel, G., Robertson, A.J., Perkins, A.C., Bruce, S.J., Lee, C.C., Ranade, S.S., Peckham, H.E., Manning, J.M., McKernan, K.J., Grimmond, S.M.: Stem cell transcriptome profiling via massive-scale mRNA sequencing. Nature Methods 5(7), 613-619 (2008)
7. Coutts, D., Stewart, D., Leshchinskiy, R.: Rewriting haskell strings. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 50-64. Springer, Heidelberg (2006)
8. Dillinger, P.C., Manolios, P.: Bloom filters in probabilistic verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 367-381. Springer, Heidelberg (2004)
9. Galperin, M.Y.: The molecular biology database collection: 2008 update. Nucleic Acids Research 36, D2-D4 (2008)
10. Gotoh, O.: An improved algorithm for matching biological sequences. Journal of Molecular Biology 162, 705-708 (1982)
11. Kalyanaraman, A., Aluru, S., Brendel, V., Kothari, S.: Space and time efficient parallel algorithms and software for EST clustering. IEEE Transactions on Parallel and Distributed Systems 14(12), 1209-1221 (2003)
12. Kent, W.J.: BLAT-the BLAST-like alignment tool. Genome Research 12(4), 656-664 (2002)
13. Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: Building a better bloom filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 456-467. Springer, Heidelberg (2006)
14. Launchbury, J., Jones, S.L.P.: Lazy functional state threads. In: Programming Languages Design and Implementation, pp. 24-35. ACM Press, New York (1994)
15. Malde, K., Coward, E., Jonassen, I.: Fast sequence clustering using a suffix array algorithm. Bioinformatics 19(10), 1221-1226 (2003)
16. Malde, K., Schneeberger, K., Coward, E., Jonassen, I.: RBR: Library-less repeat detection for ESTs. Bioinformatics 22(18), 2232-2236 (2006)
17. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22(5), 935-948 (1993)
18. Margulies, M., Egholm, M., Altman, W.E., Attiya, S., Bader, J.S., Berka, L.A.B.J., Braverman, M.S., Chen, Y.-J., Chen, Z., Dewell, S.B., Du, L., Fierro, J.M., Gomes, X.V., Godwin, B.C., He,W., Helgesen, S., Ho,C.H., Irzyk,G.P., Jando, S.C., Alenquer, M.L.I., Jarvie, T.P., Jirage, K.B., Kim, J.-B., Knight, J.R., Lanza, J.R., Leamon, J.H., Lefkowitz, S.M., Lei, M., Li, J., Lohman, K.L., Lu, H., Makhijani, V.B., McDade, K.E., McKenna, M.P., Myers2, E.W., Nickerson, E., Nobile, J.R., Plant, R., Puc, B.P., Ronan, M.T., Roth, G.T., Sarkis, G.J., Simons, J.F., Simpson, J.W., Srinivasan, M., Tartaro, K.R., Tomasz3, A., Vogt, K.A., Volkmer, G.A., Wang, S.H., Wang, Y., Weiner4, M.P., Yu, P., Begley, R.F., Rothberg, J.M.: Genome sequencing in microfabricated high-density picolitre reactors. Nature 437(7057), 376-380 (2005)
19. Needleman, S., Wunsch, C.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48(3), 443-453 (1970)
20. O'Sullivan, B., Stewart, D., Goerzen, J.: Real World Haskell. In: Profiling and optimization, ch. 25. O'Reilly Media, Sebastopol (2008)
21. Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology 147, 195-197 (1981)
22. Steemers, F.J., Gunderson, K.L.: Illumina profile: technology and assays. Pharmacogenomics 6(7), 777-782 (2005)
23. Valle, G.: Discover 1: a new program to search for unusually represented DNA motifs. Nucleic Acids Research 21(22), 5152-5156 (1993)
24. Weiner, P.: Linear pattern matching algorithms. In: Proceedings of 14th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1-11 (1973)