메뉴 건너뛰기




Volumn 9, Issue SUPPL. 6, 2008, Pages

BioGraphE: High-performance bionetwork analysis using the Biological Graph Environment

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL FRAMEWORK; COMPUTATIONAL SCIENTISTS; COMPUTATIONAL SOFTWARE; COMPUTATIONAL STRATEGY; HIGH PERFORMANCE SYSTEMS; HIGH-PERFORMANCE COMPUTING; MULTITHREADED ARCHITECTURE; PARALLEL IMPLEMENTATIONS;

EID: 47249087917     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-9-S6-S6     Document Type: Article
Times cited : (15)

References (16)
  • 1
    • 0036564426 scopus 로고    scopus 로고
    • Parallel data intensive computing in scientific and commercial applications
    • Cannataro M Talia D Srimani PK Parallel data intensive computing in scientific and commercial applications Parallel Computing 2002, 28(4):673-704.
    • (2002) Parallel Computing , vol.28 , Issue.4 , pp. 673-704
    • Cannataro, M.1    Talia, D.2    Srimani, P.K.3
  • 3
    • 33746091677 scopus 로고    scopus 로고
    • ScalaBLAST: A scaleable implementation of BLAST for high-performance data-intensive bioinformatics analysis
    • Oehmen CS Nieplocha J ScalaBLAST: A scaleable implementation of BLAST for high-performance data-intensive bioinformatics analysis IEEE Transactions on Parallel and Distributed Systems 2006, 17:740-749.
    • (2006) IEEE Transactions on Parallel and Distributed Systems , vol.17 , pp. 740-749
    • Oehmen, C.S.1    Nieplocha, J.2
  • 5
    • 84886755465 scopus 로고    scopus 로고
    • Similarity Box: Visual analytics for large sequence sets
    • Sofia HJ Nakamura GC Similarity Box: Visual analytics for large sequence sets Bioinformatics.
    • Bioinformatics
    • Sofia, H.J.1    Nakamura, G.C.2
  • 6
    • 37649031218 scopus 로고    scopus 로고
    • Random K-satisfiability problem: From an analytic solution to an efficient algorithm
    • 12513575
    • Mézard M Zecchina R Random K-satisfiability problem: From an analytic solution to an efficient algorithm Phys Rev E Stat Nonlin Soft Matter Phys 2002, 66(5 Pt 2):056126. 12513575
    • (2002) Phys Rev E Stat Nonlin Soft Matter Phys , vol.66 , Issue.5 PART 2 , pp. 056126
    • Mézard, M.1    Zecchina, R.2
  • 9
    • 0001445381 scopus 로고    scopus 로고
    • Local search strategies for satisfiability testing
    • Providence, RI: American Mathematical Society Johnson DS, Trick MA [DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 26.]
    • Selman B Kautz H Cohen B Local search strategies for satisfiability testing Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge Providence, RI: American Mathematical Society Johnson DS, Trick MA 1996, 521-532. [DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 26.]
    • (1996) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge , pp. 521-532
    • Selman, B.1    Kautz, H.2    Cohen, B.3
  • 10
    • 45449100485 scopus 로고    scopus 로고
    • Parallel resolution of the Satisfiability Problem: A survey
    • New York: Wiley-Interscience El-Ghazali T [Zomaya AY (Series Editor): Wiley Series on Parallel and Distributed Computing, 10 Nov 2006.]
    • Singer D Parallel resolution of the Satisfiability Problem: A survey Parallel Combinatorial Optimization New York: Wiley-Interscience El-Ghazali T 2006. [Zomaya AY (Series Editor): Wiley Series on Parallel and Distributed Computing, 10 Nov 2006.]
    • (2006) Parallel Combinatorial Optimization
    • Singer, D.1
  • 15
    • 33745125067 scopus 로고    scopus 로고
    • On the architectural requirements for efficient execution of graph algorithms
    • 14-17 June 2005; Oslo, Norway IEEE Computer Society Feng W, Duato J
    • Bader DA Feo J On the architectural requirements for efficient execution of graph algorithms Proceedings of the 2005 International Conference on Parallel Processing: 14-17 June 2005; Oslo, Norway IEEE Computer Society Feng W, Duato J 2005, 547-556.
    • (2005) Proceedings of the 2005 International Conference on Parallel Processing , pp. 547-556
    • Bader, D.A.1    Feo, J.2
  • 16
    • 34547399946 scopus 로고    scopus 로고
    • Designing multithreaded algorithms for breadth-first search and st-connectivity of the Cray MTA-2
    • 14-18 August 2006; Columbus, Ohio IEEE Computer Society Feng W
    • Bader DA Madduri K Designing multithreaded algorithms for breadth-first search and st-connectivity of the Cray MTA-2 Proceedings of the 2006 International Conference on Parallel Processing: 14-18 August 2006; Columbus, Ohio IEEE Computer Society Feng W 2006, 523-530.
    • (2006) Proceedings of the 2006 International Conference on Parallel Processing , pp. 523-530
    • Bader, D.A.1    Madduri, K.2


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