메뉴 건너뛰기




Volumn , Issue , 2002, Pages 90-99

Provably sensitive indexing strategies for biosequence similarity search

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATABASE SYSTEMS; FUNCTIONS;

EID: 0036374335     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/565196.565208     Document Type: Conference Paper
Times cited : (18)

References (23)
  • 2
    • 0038111513 scopus 로고    scopus 로고
    • Complexity of minimum biclique decomposition of bipartite graphs
    • Amilhastre, J.1
  • 4
    • 0035024494 scopus 로고    scopus 로고
    • Efficient large-scale sequence comparison by locality-sensitive hashing
    • (2001) Bioinformatics , vol.17 , pp. 419-428
    • Buhler, J.1
  • 5
    • 0003533867 scopus 로고    scopus 로고
    • Search algorithms for biosequences using random projection
    • PhD thesis, University of Washington, Seattle, WA
    • (2001)
    • Buhler, J.1


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