An index structure for pattern similarity searching in DNA microarray data

Proceedings - IEEE Computer Society Bioinformatics Conference, CSB 2002

Volumn , Issue , 2002, Pages 256-267

  Wang, Haixun ^a   Perng, Chang Shing ^a   Fan, Wei ^a   Yu, P S ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DNA; DNA SEQUENCES; GENE ENCODING; GENE EXPRESSION; GENES; QUERY LANGUAGES; QUERY PROCESSING; SCALES (WEIGHING INSTRUMENTS); VIRTUAL REALITY;

DNA MICROARRAY DATA; DNA MICROARRAY TECHNOLOGY; GENE EXPRESSION DATA; MICRO-ARRAY DATABASE; PATTERN CORRELATION; SUBSEQUENCE MATCHING ALGORITHMS; TWO-DIMENSIONAL STRUCTURES; WEIGHTED SEQUENCES;

BIOINFORMATICS;

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; CLUSTER ANALYSIS; COMPARATIVE STUDY; DNA MICROARRAY; DNA SEQUENCE; EVALUATION; GENE EXPRESSION PROFILING; METHODOLOGY; SEQUENCE ALIGNMENT;

ALGORITHMS; CLUSTER ANALYSIS; GENE EXPRESSION PROFILING; OLIGONUCLEOTIDE ARRAY SEQUENCE ANALYSIS; PATTERN RECOGNITION, AUTOMATED; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 18244390980     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSB.2002.1039348     Document Type: Conference Paper

References (21)

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. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. The R∗-tree: an efficient and robust access method for points and rectangles. In SIGMOD, pages 322-331, 1990.
4. Alvis Brazma, Alan Robinson, Graham Cameron, and Michael Ashburner. One-stop shop for microarray data. Nature, 403:699-700, 2000.
5. Y. Cheng and G. Church. Biclustering of expression data. In Proc. of 8th International Conference on Intelligent System for Molecular Biology, 2000.
6. 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 U.S.A, 98, pages 2199-2204, 2001.
7. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In SIGMOD, pages 419-429, 1994.
8. Paolo Ferragina and Roberto Grossi. Fast string searching in secondary storage: Theoretical developments and experimental results. In Proceedings of the ACM SODA, pages 373-382, Atlanta, 1996.
9. Paolo Ferragina and Roberto Grossi. The string B-tree: a new data structure for string search in external memory and its applications. Journal of the ACM, 46(2):236-280, 1999.
10. 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.
11. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
12. H. V. Jagadish, N. Koudas, and D. Srivastava. On effective multi-dimensional indexing for strings. In SIGMOD, pages 403-414, 2000.
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, 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.
16. Ramakrishnan Srikant and Rakesh Agrawal. Mining generalized association rules. In Proc. of the 21st Int'l Conference on Very Large Databases, Zurich, Switzerland, September 1995.
17. 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.
18. E. Ukkonen. Constructing suffix-trees on-line in linear time. Algorithms, Software, Architecture: Information Processing, pages 484-92, 1992.
19. H. Wang, C. Perng, W. Fan, S. Park, and P. Yu. Indexing weighted-sequences in large databases. Technical Report Research Report, IBM T. J. Watson Research Center, Hawthorne, NY, February 2002.
20. Haixun Wang, Wei Wang, Jiong Yang, and Philip S. Yu. Clustering by pattern similarity in large data sets. In SIGMOD, 2002.
21. Jiong Yang, Wei Wang, Haixun Wang, and Philip S Yu. δ-clusters: Capturing subspace correlation in a large data set. In ICDE, pages 517-528, 2002.