메뉴 건너뛰기




Volumn , Issue , 2013, Pages 549-558

A map-reduce framework for clustering metagenomes

Author keywords

map reduce; metagenome clustering; minwise hashing

Indexed keywords

BENCHMARKING; GENES; GENETIC ENGINEERING;

EID: 84899755646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2013.100     Document Type: Conference Paper
Times cited : (21)

References (32)
  • 4
    • 52949115612 scopus 로고    scopus 로고
    • Microbiology: Metagenomics
    • P. Hugenholtz and G.W. Tyson. Microbiology: metagenomics. Nature, 455(7212):481-483, 2008.
    • (2008) Nature , vol.455 , Issue.7212 , pp. 481-483
    • Hugenholtz, P.1    Tyson, G.W.2
  • 5
    • 79960872039 scopus 로고    scopus 로고
    • Evaluation of short read metagenomic assembly
    • A. Charuvaka and H. Rangwala. Evaluation of short read metagenomic assembly. BMC genomics, 12(Suppl 2):S8, 2011.
    • (2011) BMC Genomics , vol.12 , Issue.SUPPL. 2
    • Charuvaka, A.1    Rangwala, H.2
  • 7
    • 84960127584 scopus 로고    scopus 로고
    • Mc-minh: Metagenome clustering using minwise based hashing
    • Austin, TX SIAM
    • Zeehasham Rasheed and Huzefa Rangwala. Mc-minh: Metagenome clustering using minwise based hashing. In SIAM International Conference in Data Mining, Austin, TX, 05 2013. SIAM.
    • (2013) SIAM International Conference in Data Mining , pp. 05
    • Rasheed, Z.1    Rangwala, H.2
  • 10
    • 47249139915 scopus 로고    scopus 로고
    • Compostbin: A dna composition-based algorithm for binning environmental shotgun reads
    • Springer
    • S. Chatterji, I. Yamazaki, Z. Bai, and J. Eisen. Compostbin: A dna composition-based algorithm for binning environmental shotgun reads. In Research in Computational Molecular Biology, pages 17-28. Springer, 2008.
    • (2008) Research in Computational Molecular Biology , pp. 17-28
    • Chatterji, S.1    Yamazaki, I.2    Bai, Z.3    Eisen, J.4
  • 12
    • 33745634395 scopus 로고    scopus 로고
    • Cd-hit: A fast program for clustering and comparing large sets of protein or nucleotide sequences
    • W. Li and A. Godzik. Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences. Bioinformatics, 22(13):1658-1659, 2006.
    • (2006) Bioinformatics , vol.22 , Issue.13 , pp. 1658-1659
    • Li, W.1    Godzik, A.2
  • 13
    • 77957244650 scopus 로고    scopus 로고
    • Search and clustering orders of magnitude faster than blast
    • R.C. Edgar. Search and clustering orders of magnitude faster than blast. Bioinformatics, 26(19):2460-2461, 2010.
    • (2010) Bioinformatics , vol.26 , Issue.19 , pp. 2460-2461
    • Edgar, R.C.1
  • 14
    • 15444362001 scopus 로고    scopus 로고
    • Introducing dotur, a computer program for defining operational taxonomic units and estimating species richness
    • P.D. Schloss and J. Handelsman. Introducing dotur, a computer program for defining operational taxonomic units and estimating species richness. Applied and environmental microbiology, 71(3):1501-1506, 2005.
    • (2005) Applied and Environmental Microbiology , vol.71 , Issue.3 , pp. 1501-1506
    • Schloss, P.D.1    Handelsman, J.2
  • 18
    • 84872533735 scopus 로고    scopus 로고
    • Efficient clustering of metagenomic sequences using locality sensitive hashing
    • Anaheim, CA SIAM
    • Zeehasham Rasheed, Huzefa Rangwala, and Daniel Barbara. Efficient clustering of metagenomic sequences using locality sensitive hashing. In SIAM International Conference in Data Mining, pages 1023-1034, Anaheim, CA, 04 2012. SIAM.
    • (2012) SIAM International Conference in Data Mining , vol.4 , pp. 1023-1034
    • Rasheed, Z.1    Rangwala, H.2    Barbara, D.3
  • 21
    • 0037790561 scopus 로고    scopus 로고
    • Efficient clustering of large est data sets on parallel computers
    • A. Kalyanaraman, S. Aluru, S. Kothari, and V. Brendel. Efficient clustering of large est data sets on parallel computers. Nucleic Acids Research, 31(11):2963-2974, 2003.
    • (2003) Nucleic Acids Research , vol.31 , Issue.11 , pp. 2963-2974
    • Kalyanaraman, A.1    Aluru, S.2    Kothari, S.3    Brendel, V.4
  • 23
    • 80053243671 scopus 로고    scopus 로고
    • Parallel metagenomic sequence clustering via sketching and maximal quasi-clique enumeration on map-reduce clouds
    • IEEE
    • X. Yang, J. Zola, and S. Aluru. Parallel metagenomic sequence clustering via sketching and maximal quasi-clique enumeration on map-reduce clouds. In Parallel & Distributed Processing Symposium (IPDPS), 2011 IEEE International, pages 1223-1233. IEEE, 2011.
    • (2011) Parallel & Distributed Processing Symposium (IPDPS), 2011 IEEE International , pp. 1223-1233
    • Yang, X.1    Zola, J.2    Aluru, S.3


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