Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Pei Qiang Liu"'
Autor:
Jing Jin, Bei Guo, Wei Zhang, Jian‐jun Chen, Yu‐qing Deng, Rong Xiang, Lu Tan, Pei‐qiang Liu, Li Zheng, Zhe Chen, Ze‐zhang Tao, Yu Xu
Publikováno v:
The Laryngoscope.
Publikováno v:
Critical reviews in eukaryotic gene expression. 30(3)
This article serves to evaluate the association of polymorphisms of mismatch repair genes (hMLH1 and hMSH2) with breast cancer (BC) susceptibility through a meta-analysis. Our methods involved extensive research in Chinese and English databases that
Autor:
Pei Qiang Liu
Publikováno v:
Advanced Materials Research. 710:687-691
Biclustering has been extensively studied in many fields such as data mining, e-commerce, computational biology, information security, etc. Problems of finding bicliques in bipartite, which are variants of biclustering, have received much attention i
Publikováno v:
Applied Mechanics and Materials. :227-230
To reduce the redundancy, a new integrated wavelet-based surfacelet transform(WBST) is proposed. The integrated WBST is constructed by combining the integrated 3D non-redundant wavelet with nonsubsampled directional filter banks. For 3D non-redundant
Publikováno v:
Applied Mechanics and Materials. :189-194
The paper aims to study the problem of biclustering for gene expression data, which arises in the program of characterizing DNA clone libraries, especially in the oligonucleotide fingerprinting of ribosomal RNA genes method. Gene expression data are
Autor:
Pei-Qiang Liu
Publikováno v:
Journal of Software. 19:500-510
Publikováno v:
2009 3rd International Conference on Bioinformatics and Biomedical Engineering.
Sorting by short block-moves is one of the several approaches recently used for genome rearrangement, and most of the minimum sorting questions by these approaches have been proved to be NP-complete or NP-hard or even PSPACE-complete. Nevertheless, t
Autor:
Pei-Qiang Liu
Publikováno v:
2006 International Conference on Machine Learning and Cybernetics.
Clustering of binary fingerprints is used in the classification of gene expression data. It is known that the clustering of binary fingerprints with 3 bits of missing value is NP-Hard. The Greedy Clique Partition (GCP for short) algorithm is a heuris
Publikováno v:
Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).
In DNA clone classification, a key step is the cluster analysis of fingerprint data. A good algorithm - GCP (greedy clique partition) is presented, recently. In this paper, a high efficient implementation of GCP is presented, and a little defect of G
Publikováno v:
Proceedings of 2004 International Conference on Machine Learning & Cybernetics (IEEE Cat. No.04EX826); 2004, p2761-2761, 1p