메뉴 건너뛰기




Volumn , Issue , 2014, Pages 506-513

Strand: Fast sequence comparison using map reduce and locality sensitive hashing

Author keywords

Locality sensitive hashing; Map reduce; Sequence classification

Indexed keywords

BIOINFORMATICS; MEDICAL INFORMATICS; RNA; TAXONOMIES;

EID: 84920719093     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2649387.2649436     Document Type: Conference Paper
Times cited : (9)

References (22)
  • 2
    • 0031346696 scopus 로고    scopus 로고
    • On the resemblance and containment of documents
    • Proceedings, IEEE
    • A. Z. Broder. On the resemblance and containment of documents. In Compression and Complexity of Sequences 1997. Proceedings, pages 21-29. IEEE, 1997.
    • (1997) Compression and Complexity of Sequences 1997 , pp. 21-29
    • Broder, A.Z.1
  • 5
    • 0035024494 scopus 로고    scopus 로고
    • Effcient large-scale sequence comparison by locality-sensitive hashing
    • J. Buhler. Effcient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics, 17(5):419-428, 2001.
    • (2001) Bioinformatics , vol.17 , Issue.5 , pp. 419-428
    • Buhler, J.1
  • 7
    • 56049109090 scopus 로고    scopus 로고
    • Map-reduce for machine learning on multicore
    • B. Scholkopf, J. C. Platt, and T. Homan, editors, MIT Press
    • C. T. Chu, S. K. Kim, Y. A. Lin, Y. Yu, G. R. Bradski, A. Y. Ng, and K. Olukotun. Map-Reduce for Machine Learning on Multicore. In B. Scholkopf, J. C. Platt, and T. Homan, editors, NIPS, pages 281-288. MIT Press, 2006.
    • (2006) NIPS , pp. 281-288
    • Chu, C.T.1    Kim, S.K.2    Lin, Y.A.3    Yu, Y.4    Bradski, G.R.5    Ng, A.Y.6    Olukotun, K.7
  • 8
    • 70450192888 scopus 로고    scopus 로고
    • Geometric min-hashing: Finding a (thick) needle in a haystack
    • CVPR 2009. IEEE Conference on, IEEE
    • O. Chum, M. Perdoch, and J. Matas. Geometric min-hashing: Finding a (thick) needle in a haystack. In Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, pages 17-24. IEEE, 2009.
    • (2009) Computer Vision and Pattern Recognition, 2009 , pp. 17-24
    • Chum, O.1    Perdoch, M.2    Matas, J.3
  • 9
    • 73649114265 scopus 로고    scopus 로고
    • Mapreduce: A exible data processing tool
    • J. Dean and S. Ghemawat. Mapreduce: A exible data processing tool. Communications of the ACM, 53(1):72-77, 2010.
    • (2010) Communications of the ACM , vol.53 , Issue.1 , pp. 72-77
    • Dean, J.1    Ghemawat, S.2
  • 11
    • 77957244650 scopus 로고    scopus 로고
    • Search and clustering orders of magnitude faster than blast
    • Oxford, England
    • R. C. Edgar. Search and clustering orders of magnitude faster than BLAST. Bioinformatics (Oxford, England), 26(19):2460-1, 2010.
    • (2010) Bioinformatics , vol.26 , Issue.19 , pp. 2460-2461
    • Edgar, R.C.1
  • 12
  • 14
    • 79952592810 scopus 로고    scopus 로고
    • Lock-free approach for effcient parallel counting of occurrences of k-mers
    • G. Marcais and C. Kingsford. A fast, lock-free approach for effcient parallel counting of occurrences of k-mers. Bioinformatics, 27(6):764-770, 2011.
    • (2011) Bioinformatics , vol.27 , Issue.6 , pp. 764-770
    • Marcais, G.1    Fast C.Kingsford., A.2
  • 16
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • S. B. Needleman and C. D. Wunsch. 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.
    • (1970) Journal of Molecular Biology , vol.48 , Issue.3 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 19
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • March
    • T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195-197, March 1981.
    • (1981) Journal of Molecular Biology , vol.147 , Issue.1 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 20
    • 0027113212 scopus 로고
    • Approximate string-matching with q-grams and maximal matches
    • E. Ukkonen. Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science, 92(205):191-211, 1992.
    • (1992) Theoretical Computer Science , vol.92 , Issue.205 , pp. 191-211
    • Ukkonen, E.1
  • 21
    • 0037342499 scopus 로고    scopus 로고
    • Alignment-free sequence comparison | a review
    • S. Vinga and J. Almeida. Alignment-free sequence comparison | A review. Bioinformatics, 19(4):513-523, 2003.
    • (2003) Bioinformatics , vol.19 , Issue.4 , pp. 513-523
    • Vinga, S.1    Almeida, J.2
  • 22
    • 34548293679 scopus 로고    scopus 로고
    • Naive bayesian classifier for rapid assignment of RNA sequences into the new bacterial taxonomy
    • Q. Wang, G. M. Garrity, J. M. Tiedje, and J. R. Cole. Naive bayesian classifier for rapid assignment of RNA sequences into the new bacterial taxonomy. Applied and Environmental Microbiology, 73(16):5261-5267, 2007.
    • (2007) Applied and Environmental Microbiology , vol.73 , Issue.16 , pp. 5261-5267
    • Wang, Q.1    Garrity, G.M.2    Tiedje, J.M.3    Cole, J.R.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.