Guimei Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Guimei Liu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Limsoon Wong
Department of Computer Science, School of Computing, National University of Singapore, 117417, Singapore
10 shared publications - Jinyan Li
Shenzhen University of Advanced Technology
5 shared publications - Hon Nian Chua
Institute for Infocomm Research Agency for Science Technology & Research (A*STAR) 138632 Singapore Singapore
3 shared publications - Chern Han Yong
Graduate School for Integrative Sciences and Engineering, National University of Singapore, 28 Medical Drive, 117456 Singapore
2 shared publications - Kelvin Sim
Institute for Infocomm Research, A*STAR, Singapore
2 shared publications Andre Suchitra
School of Computing, National University of Singapore
1 shared publication
Latest Publications
- Open Access
- 1 May 2013
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 6 (7) , 505-516
A performance study of three disk-based structures for indexing and querying frequent itemsets
- 1 May 2013
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 6 (7) , 505-516
Open AccessA performance study of three disk-based structures for indexing and querying frequent itemsets
- Open Access
- 1 January 2012
- Published by Springer Nature in BMC Systems Biology
- Vol. 6 (Suppl 2) , S13
Supervised maximum-likelihood weighting of composite protein networks for complex prediction
Protein complexes participate in many important cellular functions, so finding the set of existent complexes is essential for understanding the organization and regulation of processes in the cell. With the availability of large amounts of high-throughput protein-protein interaction (PPI) data, many algorithms have been proposed to discover protein complexes from PPI networks. However, such approaches are hindered by the high rate of noise in high-throughput PPI data, including spurious and missing interactions. Furthermore, many transient interactions are detected between proteins that are not from the same complex, while not all proteins from the same complex may actually interact. As a result, predicted complexes often do not match true complexes well, and many true complexes go undetected.
- 1 January 2012
- Published by Springer Nature in BMC Systems Biology
- Vol. 6 (Suppl 2) , S13
Open AccessSupervised maximum-likelihood weighting of composite protein networks for complex prediction
Protein complexes participate in many important cellular functions, so finding the set of existent complexes is essential for understanding the organization and regulation of processes in the cell. With the availability of large amounts of high-throughput protein-protein interaction (PPI) data, many algorithms have been proposed to discover protein complexes from PPI networks. However, such approaches are hindered by the high rate of noise in high-throughput PPI data, including spurious and missing interactions. Furthermore, many transient interactions are detected between proteins that are not from the same complex, while not all proteins from the same complex may actually interact. As a result, predicted complexes often do not match true complexes well, and many true complexes go undetected.
- 29 March 2011
- Published by Springer Nature
- p. 243-270
Protein Function Prediction Using Protein–Protein Interaction Networks
- 29 March 2011
- Published by Springer Nature
- p. 243-270
Protein Function Prediction Using Protein–Protein Interaction Networks
- 18 January 2011
- Published by IGI Global Scientific Publishing
- p. 294-310
Mining Conditional Contrast Patterns
- 18 January 2011
- Published by IGI Global Scientific Publishing
- p. 294-310
Mining Conditional Contrast Patterns
- Open Access
- 1 January 2011
- Published by Springer Nature in Proteome Science
- Vol. 9 (Suppl 1) , S15
Decomposing PPI networks for complex discovery
Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput protein-protein interactions (PPI), many algorithms have been proposed to discover protein complexes from PPI networks. However, existing algorithms generally do not take into consideration the fact that not all the interactions in a PPI network take place at the same time. As a result, predicted complexes often contain many spuriously included proteins, precluding them from matching true complexes.
- 1 January 2011
- Published by Springer Nature in Proteome Science
- Vol. 9 (Suppl 1) , S15
Open AccessDecomposing PPI networks for complex discovery
Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput protein-protein interactions (PPI), many algorithms have been proposed to discover protein complexes from PPI networks. However, existing algorithms generally do not take into consideration the fact that not all the interactions in a PPI network take place at the same time. As a result, predicted complexes often contain many spuriously included proteins, precluding them from matching true complexes.
- 1 January 2011
- Published by Elsevier in Information Sciences
- Vol. 181 (1) , 201-216
A case study on financial ratios via cross-graph quasi-bicliques
- 1 January 2011
- Published by Elsevier in Information Sciences
- Vol. 181 (1) , 201-216
A case study on financial ratios via cross-graph quasi-bicliques
- Open Access
- 29 January 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (1) , 66
FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium
Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic variations and human diseases. Many SNPs show correlated genotypes, or linkage disequilibrium (LD), thus it is not necessary to genotype all SNPs for association study. Many algorithms have been developed to find a small subset of SNPs called tag SNPs that are sufficient to infer all the other SNPs. Algorithms based on the r 2 LD statistic have gained popularity because r 2 is directly related to statistical power to detect disease associations. Most of existing r 2 based algorithms use pairwise LD. Recent studies show that multi-marker LD can help further reduce the number of tag SNPs. However, existing tag SNP selection algorithms based on multi-marker LD are both time-consuming and memory-consuming. They cannot work on chromosomes containing more than 100 k SNPs using length-3 tagging rules.
- 29 January 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (1) , 66
Open AccessFastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium
Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic variations and human diseases. Many SNPs show correlated genotypes, or linkage disequilibrium (LD), thus it is not necessary to genotype all SNPs for association study. Many algorithms have been developed to find a small subset of SNPs called tag SNPs that are sufficient to infer all the other SNPs. Algorithms based on the r 2 LD statistic have gained popularity because r 2 is directly related to statistical power to detect disease associations. Most of existing r 2 based algorithms use pairwise LD. Recent studies show that multi-marker LD can help further reduce the number of tag SNPs. However, existing tag SNP selection algorithms based on multi-marker LD are both time-consuming and memory-consuming. They cannot work on chromosomes containing more than 100 k SNPs using length-3 tagging rules.
- 20 January 2010
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 25 (1) , 124-130
Protein Interactome Analysis for Countering Pathogen Drug Resistance
- 20 January 2010
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 25 (1) , 124-130
Protein Interactome Analysis for Countering Pathogen Drug Resistance
- 18 November 2009
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 2 (5-6) , 427-444
Efficient mining of distance‐based subspace clusters
- 18 November 2009
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 2 (5-6) , 427-444
Efficient mining of distance‐based subspace clusters
- Open Access
- 12 May 2009
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 25 (15) , 1891-1897
Complex discovery from weighted PPI networks
Motivation: Protein complexes are important for understanding principles of cellular organization and function. High-throughput experimental techniques have produced a large amount of protein interactions, which makes it possible to predict protein complexes from protein–protein interaction (PPI) networks. However, protein interaction data produced by high-throughput experiments are often associated with high false positive and false negative rates, which makes it difficult to predict complexes accurately. Results: We use an iterative scoring method to assign weight to protein pairs, and the weight of a protein pair indicates the reliability of the interaction between the two proteins. We develop an algorithm called CMC (clustering-based on maximal cliques) to discover complexes from the weighted PPI network. CMC first generates all the maximal cliques from the PPI networks, and then removes or merges highly overlapped clusters based on their interconnectivity. We studied the performance of CMC and the impact of our iterative scoring method on CMC. Our results show that: (i) the iterative scoring method can improve the performance of CMC considerably; (ii) the iterative scoring method can effectively reduce the impact of random noise on the performance of CMC; (iii) the iterative scoring method can also improve the performance of other protein complex prediction methods and reduce the impact of random noise on their performance; and (iv) CMC is an effective approach to protein complex prediction from protein interaction network. Contact:liugm@comp.nus.edu.sg Supplementary information: Supplementary data are available at Bioinformatics online.
- 12 May 2009
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 25 (15) , 1891-1897
Open AccessComplex discovery from weighted PPI networks
Motivation: Protein complexes are important for understanding principles of cellular organization and function. High-throughput experimental techniques have produced a large amount of protein interactions, which makes it possible to predict protein complexes from protein–protein interaction (PPI) networks. However, protein interaction data produced by high-throughput experiments are often associated with high false positive and false negative rates, which makes it difficult to predict complexes accurately. Results: We use an iterative scoring method to assign weight to protein pairs, and the weight of a protein pair indicates the reliability of the interaction between the two proteins. We develop an algorithm called CMC (clustering-based on maximal cliques) to discover complexes from the weighted PPI network. CMC first generates all the maximal cliques from the PPI networks, and then removes or merges highly overlapped clusters based on their interconnectivity. We studied the performance of CMC and the impact of our iterative scoring method on CMC. Our results show that: (i) the iterative scoring method can improve the performance of CMC considerably; (ii) the iterative scoring method can effectively reduce the impact of random noise on the performance of CMC; (iii) the iterative scoring method can also improve the performance of other protein complex prediction methods and reduce the impact of random noise on their performance; and (iv) CMC is an effective approach to protein complex prediction from protein interaction network. Contact:liugm@comp.nus.edu.sg Supplementary information: Supplementary data are available at Bioinformatics online.