메뉴 건너뛰기




Volumn , Issue , 2012, Pages 665-674

Investigating memory optimization of hash-index for next generation sequencing on multi-core architecture

Author keywords

memory optimization; next generation sequencing

Indexed keywords

COMPUTING SYSTEM; DATA LOCALITY; DATA-INTENSIVE COMPUTATION; INDEX BASED ALGORITHM; INDEX COMPRESSION; MEMORY OPTIMIZATION; MULTICORE ARCHITECTURES; MULTIPLE THREADS; NEXT-GENERATION SEQUENCING; OPTIMIZATION APPROACH; ORIGINAL ALGORITHMS; QUERY PERFORMANCE; SEQUENTIAL ACCESS; SHARED CACHE; SHORT SEQUENCES;

EID: 84867410972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2012.83     Document Type: Conference Paper
Times cited : (8)

References (26)
  • 1
    • 77950348516 scopus 로고    scopus 로고
    • Genome variation discovery with high-throughput sequencing data
    • Dalca AV, Brudno M, "Genome variation discovery with high-throughput sequencing data," Brief Bioinform 2010;11:3-14.
    • (2010) Brief Bioinform , vol.11 , pp. 3-14
    • Dalca, A.V.1    Brudno, M.2
  • 2
    • 70449711243 scopus 로고    scopus 로고
    • Computation for ChIP-seq and RNAseq studies
    • Pepke S, "Wold B, Mortazavi A. Computation for ChIP-seq and RNAseq studies," NatMethods 2009;6:S22-32.
    • (2009) NatMethods , vol.6
    • Pepke, S.1    Wold, B.2    Mortazavi, A.3
  • 3
    • 43149115851 scopus 로고    scopus 로고
    • Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
    • D. Zerbino and E. Birney. "Velvet: Algorithms for de novo short read assembly using de Bruijn graphs," In Genome Research 18(5), pages 821-829, 2008.
    • (2008) Genome Research , vol.18 , Issue.5 , pp. 821-829
    • Zerbino, D.1    Birney, E.2
  • 4
    • 70349886587 scopus 로고    scopus 로고
    • PerM: Efficient mapping of short sequencing reads with periodic full sensitive spaced seeds
    • Chen Y, Souaiaia T, Chen T. "PerM: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds," Bioinformatics 2009;25:2514-21.
    • (2009) Bioinformatics , vol.25 , pp. 2514-2521
    • Chen, Y.1    Souaiaia, T.2    Chen, T.3
  • 5
    • 72849144434 scopus 로고    scopus 로고
    • Sequencing technologies-the next generation
    • Metzker ML. "Sequencing technologies-the next generation," Nat RevGenet 2010;11:31-46.
    • (2010) Nat RevGenet , vol.11 , pp. 31-46
    • Metzker, M.L.1
  • 6
    • 0036226603 scopus 로고    scopus 로고
    • BLAT: The BLAST-Like Alignment Tool
    • Kent, J.W., "BLAT: The BLAST-Like Alignment Tool," Genome Res. 12(4), 656-664, 2002.
    • (2002) Genome Res. , vol.12 , Issue.4 , pp. 656-664
    • Kent, J.W.1
  • 10
    • 77957272611 scopus 로고    scopus 로고
    • A survey of sequence alignment algorithms for next-generation sequencing
    • Li H, Homer N, "A survey of sequence alignment algorithms for next-generation sequencing," Brief Bioinform 2010, 11:473-83.
    • (2010) Brief Bioinform , vol.11 , pp. 473-483
    • Li, H.1    Homer, N.2
  • 11
    • 55549097836 scopus 로고    scopus 로고
    • Mapping short DNA sequencing reads and calling variants using mapping quality scores
    • H. Li, J. Ruan, and R. Durbin, "Mapping short DNA sequencing reads and calling variants using mapping quality scores," Genome Research, vol. 18, no. 11, pp. 1851-1858, 2008.
    • (2008) Genome Research , vol.18 , Issue.11 , pp. 1851-1858
    • Li, H.1    Ruan, J.2    Durbin, R.3
  • 13
    • 62349130698 scopus 로고    scopus 로고
    • Ultrafast and memory-efficient alignment of short DNA sequences to the human genome
    • article R25
    • B. Langmead, C. Trapnell, M. Pop, and S. L. Salzberg, "Ultrafast and memory-efficient alignment of short DNA sequences to the human genome," Genome Biology, vol. 10, no.3, article R25, 2009.
    • (2009) Genome Biology , vol.10 , Issue.3
    • Langmead, B.1    Trapnell, C.2    Pop, M.3    Salzberg, S.L.4
  • 14
    • 67650711615 scopus 로고    scopus 로고
    • SOAP2: An improved ultrafast tool for short read alignment
    • R. Li, C. Yu, Y. Li et al., "SOAP2: an improved ultrafast tool for short read alignment," Bioinformatics, vol. 25, no. 15, pp.1966-1967, 2009.
    • (2009) Bioinformatics , vol.25 , Issue.15 , pp. 1966-1967
    • Li, R.1    Yu, C.2    Li, Y.3
  • 15
    • 41249096306 scopus 로고    scopus 로고
    • Using Quality Scores and Longer Reads Improves Accuracy of Solexa Read Mapping
    • A. Smith, Z. Xuan, and M. Zhang, "Using Quality Scores and Longer Reads Improves Accuracy of Solexa Read Mapping," BMC Bioinformatics, vol. 9, no. 1, p. 128, 2008.
    • (2008) BMC Bioinformatics , vol.9 , Issue.1 , pp. 128
    • Smith, A.1    Xuan, Z.2    Zhang, M.3
  • 18
    • 38749118638 scopus 로고    scopus 로고
    • Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
    • Alexandr Andoni, Piotr Indyk, "Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions," Foundations of Computer Science, Annual IEEE Symposium on, pp. 459-468, 2006.
    • (2006) Foundations of Computer Science, Annual IEEE Symposium on , pp. 459-468
    • Andoni, A.1    Indyk, P.2
  • 20
    • 77954705147 scopus 로고    scopus 로고
    • Sort vs. Hash revisited: Fast join implementation on modern multi-core CPUs
    • August
    • Changkyu Kim, Tim Kaldewey, Victor W. Lee, Eric Sedlar, and et al, "Sort vs. Hash revisited: fast join implementation on modern multi-core CPUs," Proc. VLDB Endow., 1378-1389, August, 2009.
    • (2009) Proc. VLDB Endow. , pp. 1378-1389
    • Kim, C.1    Kaldewey, T.2    Lee, V.W.3    Sedlar, E.4
  • 23
    • 65649120715 scopus 로고    scopus 로고
    • CloudBurst: Highly Sensitive Read Mapping with MapReduce
    • June
    • M. C. Schatz, "CloudBurst: Highly Sensitive Read Mapping with MapReduce," Bioinformatics, vol. 25, no. 11, pp. 1363-1369, June 2009.
    • (2009) Bioinformatics , vol.25 , Issue.11 , pp. 1363-1369
    • Schatz, M.C.1
  • 25
    • 84867410184 scopus 로고    scopus 로고
    • http://www.ncbi.nlm.nih.gov/
  • 26
    • 84867410182 scopus 로고    scopus 로고
    • http://www.novogene.cn/


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