1 |
C. Shannon and W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, 1964
|
2 |
S. Berchtold, D. A. Keim, and H.-P. Kriegel, 'The X-tree: An Index Structure for High-Dimensional Data,' In Proc Int'l. Conf. on Very Large Data Bases, VLDB, pp. 28-39, 1996
|
3 |
N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, 'The R-tree: An Efficient and Robust Access Method for Points and Rectangles,' In Proc. Int'l conf. on Management of Data, ACM SIGMOD, pp. 322-331, 1990
|
4 |
C. Faloutsos and K. Lin, 'FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp. 163-174, 1995
DOI
|
5 |
R. Agrawal, C. Faloutsos, and A. Swami, 'Efficient Similarity Search in Sequence Databases,' In Proc. Int'l. Conference on Foundations of Data Organization and Algorithms, FODO, pp. 69-84, 1993
|
6 |
L. Hammel and J. Patel, 'Searching on the Secondary Structure of Protein Sequences,' In Proc. 28th Int'l Conf. on Very Large Data Bases, pp. 634-645, 2002
|
7 |
K. Chakrabarti and S. Mehrotra, 'The Hybrid Tree : An Index Structure for High Dimensional Feature Spaces,' Proc. the 15th International Conference on Data Engineering, pp.440-447, 1999
DOI
|
8 |
H. Wang, C. Perng, W. Fan, S. Park, and P. Yu, 'Indexing Weighted Sequences in Large Databases,' In Proc. 19th Irit'l Conf. on Data Engineering, pp. 63-74, 2003
DOI
|
9 |
G. A. Stephen, String Searching Algorithms, World Scientific Publishing, 1994
|
10 |
S. Park, D Lee, and W. Chu, 'Fast Retrieval of Similar Subsequences in Long Sequence Databases,' In Proc. 3rd IEEE Knowledge and Data Engineering Exchange Workshop (IEEE KDEX) , pp. 60-67, 1999
DOI
|
11 |
M-S Chen, J. Han, and Philip S. Yu, 'Data Mining : An Overview from a Database Perspective,' IEEE Transactions on Knowledge and Data Engineering, 8(6) : pp.866-883, 1996
DOI
ScienceOn
|