Succincter text indexing with wildcards

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6661 LNCS, Issue , 2011, Pages 27-40

  Thachuk, Chris ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUXILIARY DATA STRUCTURES; COMPRESSED SUFFIX ARRAY; DICTIONARY MATCHING; HUMAN GENOMES; NEW INDICES; ORDERS OF MAGNITUDE; QUERY ALGORITHMS; SINGLE NUCLEOTIDE POLYMORPHISMS; SPACE COMPLEXITY; SPACE REDUCTIONS; TEXT-INDEXING; WORKING SPACE;

DATA STRUCTURES; ELECTROSTATIC DISCHARGE; GENES; PATTERN MATCHING;

INDEXING (OF INFORMATION);

EID: 79960096690     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21458-5_5     Document Type: Conference Paper

References (22)

1. Belazzougui, D.: Succinct dictionary matching with no slowdown. In: Symposium on Combinatorial Pattern Matching, pp. 88-100 (2010)
2. Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. Algorithms and Data Structures, 98-109 (2009)
3. Briggs, P., Torczon, L.: An efficient representation for sparse sets. ACMLett. Program. Lang. Syst. 2, 59-69 (1993)
4. Cole, R., Gottlieb, L.A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: ACM Symposium on Theory of Computing, pp. 91-100 (2004)
5. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Symposium on Foundations of Computer Science, pp. 390-398 (2002)
6. Fischer, J., Makinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theoretical Computer Science 410(51), 5354-5364 (2009)
7. Frazer, K., Ballinger, D., Cox, D., Hinds, D., Stuve, L., Gibbs, R., et al.: A second generation human haplotype map of over 3.1 million SNPs. Nature 449(7164), 851-861 (2007)
8. Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: ACM Symposium on Theory of Computing, pp. 397-406 (2000)
9. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 841-850 (2003)
10. Hon, W., Ku, T., Shah, R., Thankachan, S., Vitter, J.: Faster Compressed Dictionary Matching. In: Symposium on String Processing and Information Retrieval, pp. 191-200 (2010)
11. Jacobson, G.: Succinct static data structures. Ph.D. thesis, CarnegieMellon University (1989)
12. Knuth, D.,Morris Jr., J., Pratt, V.: Fast pattern matching in strings. SIAM J. on Computing 6, 323 (1977)
13. Lam, T.W., Sung, W.K., Tam, S.L., Yiu, S.M.: Space efficient indexes for string matching with don't cares. In: Conference on Algorithms and Computation, pp. 846-857 (2007)
14. Lam, T., Li, R., Tam, A., Wong, S., Wu, E., Yiu, S.: High throughput short read alignment via bi-directional BWT. In: IEEE Conference on Bioinformatics and Biomedicine, pp. 31-36 (2009)
15. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 319-327 (1990)
16. Munro, J., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. on Computing 31(3), 762-776 (2002)
17. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1), 2 (2007)
18. Ohlebusch, E., Gog, S.: A compressed enhanced suffix array supporting fast string matching. In: Symposium on String Processing and Information Retrieval, pp. 51-62 (2009)
19. Ohlebusch, E., Gog, S., Kügel, A.: Computing matching statistics and maximal exact matches on compressed full-text indexes. In: Symposium on String Processing and Information Retrieval, pp. 347-358 (2010)
20. Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 233-242 (2002)
21. Tam, A., Wu, E., Lam, T.W., Yiu, S.M.: Succinct text indexing with wildcards. In: Symposium on String Processing and Information Retrieval, pp. 39-50 (2009)
22. Weiner, P.: Linear pattern matching algorithms. In: Symposium on Switching and Automata Theory, pp. 1-11 (1973)