Indexing weighted-sequences in large databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2003, Pages 63-74

  Wang, Haixun ^a   Perng, Chang Shing ^a   Fan, Wei ^a   Park, Sanghyun ^b   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PATTERN MATCHING; TWO DIMENSIONAL;

INDEX STRUCTURE; WEIGHTED SEQUENCES;

AUTOMATIC INDEXING;

EID: 0345359236     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Alison Abbott. Bioinformatics institute plans public database for gene expression data. Nature, 398:646, 1999.
2. R. Agrawal and R. Srikant. Mining sequential patterns. In ICDE, 1995.
3. Alvis Brazma, Alan Robinson, Graham Cameron, and Michael Ashburner. One-stop shop for microarray data. Nature, 403:699-700, 2000.
4. P.O. Brown and D. Botstein. Exploring the new world of the genome with DNA microarrays. Nature Genetics, 21:33-37, 1999.
5. Y. Cheng and G. Church. Biclustering of expression data. In Proc. of 8th International Conference on Intelligent System for Molecular Biology, 2000.
6. P. D'Haeseleer, S. Liang, and R. Somogyi. Gene expression analysis and genetic network modeling. In Pacific Symposium on Biocomputing, 1999.
7. R. Miki et al. Delineating developmental and metabolic pathways in vivo by expression profiling using the riken set of 18,816 full-length enriched mouse cDNA arrays. In Proceedings of National Academy of Sciences, 98, pages 2199-2204, 2001.
8. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In SIGMOD, pages 419-429, 1994.
9. G. Gonnet, R. Baeza-Yates, and T. Snider, New indices for text: Pat trees and pat arrays. In Information Retrieval: Data Structures and Algorithms, pages 335-349. Prentice Hall, 1992.
10. H. V. Jagadish, N. Koudas, and D. Srivastava. On effective multi-dimensional indexing for strings. In SIGMOD, pages 403-414, 2000.
11. E. Keogh, K. Chakrabarti, S. Mehrotra, and M. Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. In SIGMOD, 2001.
12. Q. Li and B. Moon. Indexing and querying XML data for regular path expressions. In VLDB, pages 361-370, September 2001.
13. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal On Computing, pages 935-948, 1993.
14. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, April 1976.
15. Chang-Shing Perng, Haixun Wang, Sheng Ma, and Joseph L Hellerstein. A framework for exploring mining spaces with multiple attributes. In ICDM, 2001.
16. Chang-Shing Perng, Haixun Wang, Sylvia R. Zhang, and D. Stott Parker. Landmarks: a new model for similarity-based pattern querying in time series databases. In ICDE, pages 33-42, 2000.
17. Ramakrishnan Srikant and Rakesh Agrawal. Mining generalized association rules. In VLDB, Zurich, Switzerland, September 1995.
18. S. Tavazoie, J. Hughes, M. Campbell, R. Cho, and G. Church. Yeast micro data set. In http://arep.med.harvard.edu/biclustering/yeast.matrix, 2000.
19. E. Ukkonen. Constructing suffix-trees on-line in linear time. Algorithms, Software, Architecture: Information Processing, 484-92, 1992.
20. Haixun Wang, Wei Wang, Jiong Yang, and Philip S. Yu. Clustering by pattern similarity in large data sets. In SIGMOD, 2002.