-
1
-
-
79960096690
-
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
-
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
-
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
-
9
-
-
4544388794
-
Dictionary matching and indexing with errors and don't cares
-
R. Cole, L.-A. Gottlieb, M. Lewenstein, Dictionary matching and indexing with errors and don't cares, in: ACM Symposium on Theory of Computing, 2004, pp. 91-100.
-
(2004)
ACM Symposium on Theory of Computing
, pp. 91-100
-
-
Cole, R.1
Gottlieb, L.-A.2
Lewenstein, M.3
-
10
-
-
38149062674
-
Space efficient indexes for string matching with don't cares
-
T.-W. Lam, W.-K. Sung, S.-L. Tam, S.-M. Yiu, Space efficient indexes for string matching with don't cares, in: Conference on Algorithms and Computation, 2007, pp. 846-857.
-
(2007)
Conference on Algorithms and Computation
, pp. 846-857
-
-
Lam, T.-W.1
Sung, W.-K.2
Tam, S.-L.3
Yiu, S.-M.4
-
11
-
-
70350678834
-
Succinct text indexing with wildcards
-
A. Tam, E. Wu, T.-W. Lam, S.-M. Yiu, Succinct text indexing with wildcards, in: Symposium on String Processing and Information Retrieval, 2009, pp. 39-50.
-
(2009)
Symposium on String Processing and Information Retrieval
, pp. 39-50
-
-
Tam, A.1
Wu, E.2
Lam, T.-W.3
Yiu, S.-M.4
-
13
-
-
78449304418
-
Faster compressed dictionary matching
-
W. Hon, T. Ku, R. Shah, S. Thankachan, J. Vitter, Faster compressed dictionary matching, in: Symposium on String Processing and Information Retrieval, 2010, pp. 191-200.
-
(2010)
Symposium on String Processing and Information Retrieval
, pp. 191-200
-
-
Hon, W.1
Ku, T.2
Shah, R.3
Thankachan, S.4
Vitter, J.5
-
14
-
-
74549131724
-
High throughput short read alignment via bi-directional BWT
-
T. Lam, R. Li, A. Tam, S. Wong, E. Wu, S. Yiu, High throughput short read alignment via bi-directional BWT, in: IEEE Conference on Bioinformatics and Biomedicine, 2009, pp. 31-36.
-
(2009)
IEEE Conference on Bioinformatics and Biomedicine
, pp. 31-36
-
-
Lam, T.1
Li, R.2
Tam, A.3
Wong, S.4
Wu, E.5
Yiu, S.6
-
15
-
-
79956312806
-
Bidirectional search in a string with wavelet trees
-
T. Schnattinger, E. Ohlebusch, S. Gog, Bidirectional search in a string with wavelet trees, in: Symposium on Combinatorial Pattern Matching, 2010, pp. 40-50.
-
(2010)
Symposium on Combinatorial Pattern Matching
, pp. 40-50
-
-
Schnattinger, T.1
Ohlebusch, E.2
Gog, S.3
-
16
-
-
80053936837
-
Compressed text indexing with wildcards
-
W.-K. Hon, T.-H. Ku, R. Shah, S.V. Thankachan, J.S. Vitter, Compressed text indexing with wildcards, in: Proceedings of the 18th International Conference on String Processing and Information Retrieval, SPIRE'11, 2011, pp. 267-277.
-
(2011)
Proceedings of the 18th International Conference on String Processing and Information Retrieval, SPIRE'11
, pp. 267-277
-
-
Hon, W.-K.1
Ku, T.-H.2
Shah, R.3
Thankachan, S.V.4
Vitter, J.S.5
-
18
-
-
0037739870
-
High-order entropy-compressed text indexes
-
R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in: ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 841-850.
-
(2003)
ACM-SIAM Symposium on Discrete Algorithms
, pp. 841-850
-
-
Grossi, R.1
Gupta, A.2
Vitter, J.S.3
-
20
-
-
84968909171
-
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
-
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
-
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
-
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
-
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
|