메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1350-1354

CPS-tree: A compact partitioned suffix tree for disk-based indexing on large genome sequences

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DATA STRUCTURES; INDEXING (OF INFORMATION); KNOWLEDGE REPRESENTATION; ONLINE SEARCHING; PATTERN RECOGNITION;

EID: 34548728518     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.369009     Document Type: Conference Paper
Times cited : (11)

References (9)
  • 1
    • 85031086563 scopus 로고    scopus 로고
    • Efficient suffix trees on secondary storage
    • D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In ACM-SIAM SODA, pages 383-391, 1996.
    • (1996) ACM-SIAM SODA , pp. 383-391
    • Clark, D.R.1    Munro, J.I.2
  • 3
    • 84962449088 scopus 로고    scopus 로고
    • Fast string searching in secondary storage: Theoretical developments and experimental results
    • P. Ferragina and R. Grossi. Fast string searching in secondary storage: Theoretical developments and experimental results. In ACM-SIAM SODA, pages 373-382, 1996.
    • (1996) ACM-SIAM SODA , pp. 373-382
    • Ferragina, P.1    Grossi, R.2
  • 4
    • 0000950910 scopus 로고    scopus 로고
    • The string B-tree: A new data, structure for string search in external memory and its applications
    • P. Ferragina and R. Grossi. The string B-tree: A new data, structure for string search in external memory and its applications. Journal of the ACM, 46(2):236-280, 1999.
    • (1999) Journal of the ACM , vol.46 , Issue.2 , pp. 236-280
    • Ferragina, P.1    Grossi, R.2
  • 6
    • 0033227559 scopus 로고    scopus 로고
    • Reducing the space requirement of suffix trees
    • S. Kurtz. Reducing the space requirement of suffix trees. Software-Practice and Experience, 13:1149-1171, 1999.
    • (1999) Software-Practice and Experience , vol.13 , pp. 1149-1171
    • Kurtz, S.1
  • 8
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on-line string searches
    • U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal of Computing, 22(5):935-948, 1993.
    • (1993) SIAM Journal of Computing , vol.22 , Issue.5 , pp. 935-948
    • Manber, U.1    Myers, G.2
  • 9
    • 25844486159 scopus 로고    scopus 로고
    • Practical suffix tree construction
    • S. Tata, R. A. Hankins, and J. M. Patel. Practical suffix tree construction. In Proceedings of VLDB, pages 36-47, 2004. http://www.eecs.umich.edu/tdd/index.html.
    • (2004) Proceedings of VLDB , pp. 36-47
    • Tata, S.1    Hankins, R.A.2    Patel, J.M.3


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