DASS-GUI: A user interface for identification and analysis of significant patterns in non-sequential data

Bioinformatics

Volumn 26, Issue 7, 2010, Pages 987-989

  Hollunder, Jens ^a,b   Friedel, Maik ^c   Kuiper, Martin ^a,b   Wilhelm, Thomas ^d  

^a DEPARTMENT OF PLANT SYSTEMS BIOLOGY   (Belgium)

^b GHENT UNIVERSITY   (Belgium)

^c FRITZ LIPMANN INSTITUTE   (Germany)

^d NORWICH RESEARCH PARK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; AUTOMATED PATTERN RECOGNITION; COMPUTER GRAPHICS; COMPUTER INTERFACE; COMPUTER PROGRAM; METHODOLOGY;

COMPUTER GRAPHICS; PATTERN RECOGNITION, AUTOMATED; SOFTWARE; USER-COMPUTER INTERFACE;

EID: 77951961369     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq071     Document Type: Article

References (19)

1. Agrawal, R. and Srikant, R. (1994) Fast algorithms for mining association rules. In Proceedings of 20th International Conference on Very Large Data Bases, pp. 487-499.
2. Altschul, S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410
3. Barkow, S. et al. (2006) BicAT: a biclustering analysis toolbox. Bioinformatics, 22, 1282-1283.
4. Beyer, A. et al. (2006) Integrated assessment and prediction of transcription factor binding. PLoS Comput. Biol., 2, 615-626.
5. Cameron, M. et al. (2004) Improved gapped alignment in BLAST. IEEE/ACM Trans. Comput. Biol. Bioinform., 1, 116-129.
6. Cheng, Y.a nd Church, G.M. (2000) Biclustering of expression data. In Proceedings of 8th International Conf erence on Intelligent Systems for Molecular Biology (ISMB'00), pp. 93-103.
7. Eisen, M.B. et al. (1998) Cluster analysis and display of genome-wide expression patterns. Proc. Natl Acad. Sci. USA, 95, 14863-14868.
8. Friedel, M. et al. (2009) DiProGB: the dinucleotide properties genome browser. Bioinformatics, 25, 2603-2604.
9. Goncalves, J.P. et al. (2009) BiGGEsTS: integrated environment for biclustering analysis of time series expression data. BMC Res. Notes, 2, 124.
10. Grahne, G. and Zhu, J. (2003) Efficiently using prefix-trees in mining frequent itemsets. In Goethals, B. and Zaki, M.J. (eds). Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, FIMI'03, pp. 125-134.
11. Hollunder, J. et al. (2005) Identification and characterization of protein subcomplexes in yeast. Proteomics, 5, 2082-2089.
12. Hollunder, J. et al. (2007a) DASS: efficient discovery and p-value calculation of substructures in unordered data. Bioinformatics, 23, 77-83.
13. Hollunder, J. et al. (2007b) Protein subcomplexes - molecular machines with highly specialized functions. IEEE Trans. Nanobioscience, 6, 86-93.
14. Kaiser, S. and Leisch, F. (2008) A toolbox for bicluster analysis in R. In Brito, P. (ed.). Compstat 2008 - Proceedings in Computational Statistics. Physica Verlag, Heidelberg. Available at http://epub.ub.uni-muenchen.de/3293/ (last accessed date November 10, 2009).
15. Liu, J. and Wang, W. (2003) OP-Cluster: clustering by tendency in high dimensional space. Proceedings of 3rd IEEE Int ernational Conference on Data Mining, pp. 187-194.
16. Madeira, S.C. and Oliveira, A.L. (2004) Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans. Comput. Biol. Bioinform., 1, 24-45.
17. Tanay, A. et al. (2002) Discovering statistically significant biclusters in gene expression data. Bioinformatics, 18, S136-S144.
18. Uno, T. et al. (2003) LCM: an efficient algorithm for enumerating frequent closed itemsets. In Goethals, B., Zaki, M.J. (eds). Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations FIMI'03.
19. Zaki, M.J. and Xiao, W. (2002) CHARM: an efficient algorithm for closed itemset mining. In Proceedings of the 2nd SIAM International Conference on Data Mining (SDM 2002), pp. 457-473