{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:27Z","timestamp":1725524607548},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540929949"},{"type":"electronic","value":"9783540929956"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92995-6_13","type":"book-chapter","created":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T09:02:58Z","timestamp":1231491778000},"page":"183-194","source":"Crossref","is-referenced-by-count":4,"title":["Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell"],"prefix":"10.1007","author":[{"given":"Ketil","family":"Malde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bryan","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing Suffix Trees with Enhanced Suffix Arrays. Journal of Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45735-6_4","volume-title":"String Processing and Information Retrieval","author":"M.I. Abouelhoda","year":"2002","unstructured":"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.\u00a02476, pp. 31\u201343. Springer, Heidelberg (2002)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. Altschul","year":"1990","unstructured":"Altschul, S., Gish, W., Miller, W., Myers, E., Lipman, D.: A basic local alignment search tool. Journal of Molecular Biology\u00a0215(3), 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"issue":"7","key":"13_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"issue":"4","key":"13_CR5","first-page":"636","volume":"1","author":"A. Broder","year":"2003","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. Internet Mathematics\u00a01(4), 636\u2013646 (2003)","journal-title":"Internet Mathematics"},{"key":"13_CR6","first-page":"268","volume-title":"ACM SIGPLAN Notices","author":"K. Claessen","year":"2000","unstructured":"Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: ACM SIGPLAN Notices, pp. 268\u2013279. ACM Press, New York (2000)"},{"issue":"7","key":"13_CR7","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1038\/nmeth.1223","volume":"5","author":"N. Cloonan","year":"2008","unstructured":"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\u00a05(7), 613\u2013619 (2008)","journal-title":"Nature Methods"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-69611-7_3","volume-title":"Practical Aspects of Declarative Languages","author":"D. Coutts","year":"2006","unstructured":"Coutts, D., Stewart, D., Leshchinskiy, R.: Rewriting haskell strings. In: Hanus, M. (ed.) PADL 2007. LNCS, vol.\u00a04354, pp. 50\u201364. Springer, Heidelberg (2006)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-30494-4_26","volume-title":"Formal Methods in Computer-Aided Design","author":"P.C. Dillinger","year":"2004","unstructured":"Dillinger, P.C., Manolios, P.: Bloom filters in probabilistic verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol.\u00a03312, pp. 367\u2013381. Springer, Heidelberg (2004)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1093\/nar\/gkm1037","volume":"36","author":"M.Y. Galperin","year":"2008","unstructured":"Galperin, M.Y.: The molecular biology database collection: 2008 update. Nucleic Acids Research\u00a036, D2\u2013D4 (2008)","journal-title":"Nucleic Acids Research"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"Gotoh, O.: An improved algorithm for matching biological sequences. Journal of Molecular Biology\u00a0162, 705\u2013708 (1982)","journal-title":"Journal of Molecular Biology"},{"issue":"12","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1109\/TPDS.2003.1255634","volume":"14","author":"A. Kalyanaraman","year":"2003","unstructured":"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\u00a014(12), 1209\u20131221 (2003)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1101\/gr.229202. Article published online before March 2002","volume":"12","author":"W.J. Kent","year":"2002","unstructured":"Kent, W.J.: BLAT\u2014the BLAST-like alignment tool. Genome Research\u00a012(4), 656\u2013664 (2002)","journal-title":"Genome Research"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms \u2013 ESA 2006","author":"A. Kirsch","year":"2006","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: Building a better bloom filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 456\u2013467. Springer, Heidelberg (2006)"},{"key":"13_CR15","first-page":"24","volume-title":"Programming Languages Design and Implementation","author":"J. Launchbury","year":"1994","unstructured":"Launchbury, J., Jones, S.L.P.: Lazy functional state threads. In: Programming Languages Design and Implementation, pp. 24\u201335. ACM Press, New York (1994)"},{"issue":"10","key":"13_CR16","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1093\/bioinformatics\/btg138","volume":"19","author":"K. Malde","year":"2003","unstructured":"Malde, K., Coward, E., Jonassen, I.: Fast sequence clustering using a suffix array algorithm. Bioinformatics\u00a019(10), 1221\u20131226 (2003)","journal-title":"Bioinformatics"},{"issue":"18","key":"13_CR17","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1093\/bioinformatics\/btl368","volume":"22","author":"K. Malde","year":"2006","unstructured":"Malde, K., Schneeberger, K., Coward, E., Jonassen, I.: RBR: Library-less repeat detection for ESTs. Bioinformatics\u00a022(18), 2232\u20132236 (2006)","journal-title":"Bioinformatics"},{"issue":"5","key":"13_CR18","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"7057","key":"13_CR19","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1038\/nature03959","volume":"437","author":"M. Margulies","year":"2005","unstructured":"Marcel Margulies, Michael Egholm, William\u00a0E. Altman, Said Attiya, Joel\u00a0S. Bader, Lisa A. Bemben\u00a0Jan Berka, Michael\u00a0S. Braverman, Yi-Ju Chen, Zhoutao Chen, Scott\u00a0B. Dewell, Lei Du, Joseph\u00a0M. Fierro, Xavier\u00a0V. Gomes, Brian\u00a0C. Godwin, Wen He, Scott Helgesen, Chun\u00a0He Ho, Gerard\u00a0P. Irzyk, Szilveszter\u00a0C. Jando, Maria L.\u00a0I. Alenquer, Thomas\u00a0P. Jarvie, Kshama\u00a0B. Jirage, Jong-Bum Kim, James\u00a0R. Knight, Janna\u00a0R. Lanza, John\u00a0H. Leamon, Steven\u00a0M. Lefkowitz, Ming Lei, Jing Li, Kenton\u00a0L. Lohman, Hong Lu, Vinod\u00a0B. Makhijani, Keith\u00a0E. McDade, Michael\u00a0P. McKenna, Eugene\u00a0W. Myers2, Elizabeth Nickerson, John\u00a0R. Nobile, Ramona Plant, Bernard\u00a0P. Puc, Michael\u00a0T. Ronan, George\u00a0T. Roth, Gary\u00a0J. Sarkis, Jan\u00a0Fredrik Simons, John\u00a0W. Simpson, Maithreyan Srinivasan, Karrie\u00a0R. Tartaro, Alexander Tomasz3, Kari\u00a0A. Vogt, Greg\u00a0A. Volkmer, Shally\u00a0H. Wang, Yong Wang, Michael\u00a0P. Weiner4, Pengguang Yu, Richard\u00a0F. Begley, and Jonathan\u00a0M. Rothberg. Genome sequencing in microfabricated high-density picolitre reactors. Nature, 437(7057):376\u201380, 2005.","journal-title":"Nature"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S. Needleman","year":"1970","unstructured":"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\u00a048(3), 443\u2013453 (1970)","journal-title":"Journal of Molecular Biology"},{"key":"13_CR21","volume-title":"Profiling and optimization","author":"B. O\u2019Sullivan","year":"2008","unstructured":"O\u2019Sullivan, B., Stewart, D., Goerzen, J.: Real World Haskell. In: Profiling and optimization, ch.\u00a025. O\u2019Reilly Media, Sebastopol (2008)"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147, 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"issue":"7","key":"13_CR23","doi-asserted-by":"publisher","first-page":"777","DOI":"10.2217\/14622416.6.7.777","volume":"6","author":"F.J. Steemers","year":"2005","unstructured":"Steemers, F.J., Gunderson, K.L.: Illumina profile: technology and assays. Pharmacogenomics\u00a06(7), 777\u2013782 (2005)","journal-title":"Pharmacogenomics"},{"issue":"22","key":"13_CR24","doi-asserted-by":"publisher","first-page":"5152","DOI":"10.1093\/nar\/21.22.5152","volume":"21","author":"G. Valle","year":"1993","unstructured":"Valle, G.: Discover 1: a new program to search for unusually represented DNA motifs. Nucleic Acids Research\u00a021(22), 5152\u20135156 (1993)","journal-title":"Nucleic Acids Research"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of 14th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92995-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T15:37:27Z","timestamp":1551713847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92995-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540929949","9783540929956"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92995-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}