메뉴 건너뛰기




Volumn 483, Issue , 2013, Pages 22-35

Compressed indexes for text with wildcards

Author keywords

Compressed indexes; Dictionary matching; Text search; Wildcard matching

Indexed keywords

AUXILIARY DATA STRUCTURES; COMPRESSED INDEXES; COMPRESSED SUFFIX ARRAY; DICTIONARY MATCHING; SINGLE NUCLEOTIDE POLYMORPHISMS; SPACE COMPLEXITY; TEXT SEARCH; WILDCARD MATCHING;

EID: 84876418157     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.08.011     Document Type: Conference Paper
Times cited : (3)

References (28)
  • 1
    • 79960096690 scopus 로고    scopus 로고
    • Succincter text indexing with wildcards
    • R. Giancarlo, G. Manzini, Lecture Notes in Computer Science Springer Berlin/Heidelberg
    • C. Thachuk Succincter text indexing with wildcards R. Giancarlo, G. Manzini, Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 6661 2011 Springer Berlin/Heidelberg 27 40
    • (2011) Combinatorial Pattern Matching , vol.6661 , pp. 27-40
    • Thachuk, C.1
  • 6
    • 0033690274 scopus 로고    scopus 로고
    • Compressed suffix arrays and suffix trees with applications to text indexing and string matching
    • R. Grossi, J. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, in: ACM Symposium on Theory of Computing, 2000, pp. 397-406.
    • (2000) ACM Symposium on Theory of Computing , pp. 397-406
    • Grossi, R.1    Vitter, J.2
  • 8
    • 35348983887 scopus 로고    scopus 로고
    • A second generation human haplotype map of over 3.1 million SNPs
    • K. Frazer, D. Ballinger, D. Cox, D. Hinds, L. Stuve, and R. Gibbs A second generation human haplotype map of over 3.1 million SNPs Nature 449 7164 2007 851 861
    • (2007) Nature , vol.449 , Issue.7164 , pp. 851-861
    • Frazer, K.1    Ballinger, D.2    Cox, D.3    Hinds, D.4    Stuve, L.5    Gibbs, R.6
  • 17
  • 20
    • 84968909171 scopus 로고    scopus 로고
    • Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
    • R. Raman, V. Raman, S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 233-242.
    • (2002) ACM-SIAM Symposium on Discrete Algorithms , pp. 233-242
    • Raman, R.1    Raman, V.2    Rao, S.3
  • 21
    • 0036306861 scopus 로고    scopus 로고
    • Succinct representation of balanced parentheses and static trees
    • J. Munro, and V. Raman Succinct representation of balanced parentheses and static trees SIAM J. Computing 31 3 2002 762 776
    • (2002) SIAM J. Computing , vol.31 , Issue.3 , pp. 762-776
    • Munro, J.1    Raman, V.2
  • 22
    • 78449271699 scopus 로고    scopus 로고
    • Computing matching statistics and maximal exact matches on compressed full-text indexes
    • E. Ohlebusch, S. Gog, A. Kügel, Computing matching statistics and maximal exact matches on compressed full-text indexes, in: Symposium on String Processing and Information Retrieval, 2010, pp. 347-358.
    • (2010) Symposium on String Processing and Information Retrieval , pp. 347-358
    • Ohlebusch, E.1
  • 23
    • 69949184936 scopus 로고    scopus 로고
    • Succinct orthogonal range search structures on a grid with applications to text indexing
    • P. Bose, M. He, A. Maheshwari, and P. Morin Succinct orthogonal range search structures on a grid with applications to text indexing Algorithms Data Struct. 2009 98 109
    • (2009) Algorithms Data Struct. , pp. 98-109
    • Bose, P.1    He, M.2    Maheshwari, A.3    Morin, P.4
  • 26
    • 70349961525 scopus 로고    scopus 로고
    • Faster entropy-bounded compressed suffix trees
    • J. Fischer, V. Mäkinen, and G. Navarro Faster entropy-bounded compressed suffix trees Theoret. Comput. Sci. 410 51 2009 5354 5364
    • (2009) Theoret. Comput. Sci. , vol.410 , Issue.51 , pp. 5354-5364
    • Fischer, J.1    Mäkinen, V.2    Navarro, G.3


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