Haiquan Li

Dr. Haiquan Li

orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 December 2012 in PLOS ONE
Verified
Journal Article
Open access
PDF file
Yves LussierYves Lussier
Yves Lussier
NKNikolai N. Khodarev
Nikolai N. Khodarev
KRKelly Regan
Kelly Regan
KCKimberly Corbin
Kimberly Corbin
HLHaiquan Li
Haiquan Li
RWRalph Weichselbaum
Ralph Weichselbaum
Strategies to stage and treat cancer rely on a presumption of either localized or widespread metastatic disease. An intermediate state of metastasis termed oligometastasis(es) characterized by limited progression has been proposed. Oligometastases are amenable to treatment by surgical resection or radiotherapy. We analyzed microRNA expression patterns from lung metastasis samples of patients with ≤5 initial metastases resected with curative intent. Patients were stratified into subgroups based on their rate of metastatic progression. We prioritized microRNAs between patients with the highest and lowest rates of recurrence. We designated these as high rate of progression (HRP) and low rate of progression (LRP); the latter group included patients with no recurrences. The prioritized microRNAs distinguished HRP from LRP and were associated with rate of metastatic progression and survival in an independent validation dataset. Oligo- and poly- metastasis are distinct entities at the clinical and molecular level.

22 October 2007 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JLJinyan Li
Jinyan Li
GLGuimei Liu
Guimei Liu
HLHaiquan Li
Haiquan Li
LWLimsoon Wong
Limsoon Wong
Maximal biclique (also known as complete bipartite) subgraphs can model many applications in Web mining, business, and bioinformatics. Enumerating maximal biclique subgraphs from a graph is a computationally challenging problem, as the size of the output can become exponentially large with respect to the vertex number when the graph grows. In this paper, we efficiently enumerate them through the use of closed patterns of the adjacency matrix of the graph. For an undirected graph G without self-loops, we prove that 1) the number of closed patterns in the adjacency matrix of G is even, 2) the number of the closed patterns is precisely double the number of maximal biclique subgraphs of G, and 3) for every maximal biclique subgraph, there always exists a unique pair of closed patterns that matches the two vertex sets of the subgraph. Therefore, the problem of enumerating maximal bicliques can be solved by using efficient algorithms for mining closed patterns, which are algorithms extensively studied in the data mining field. However, this direct use of existing algorithms causes a duplicated enumeration. To achieve high efficiency, we propose an O(mn) time delay algorithm for a nonduplicated enumeration, in particular, for enumerating those maximal bicliques with a large size, where m and n. are the number of edges and vertices of the graph, respectively. We evaluate the high efficiency of our algorithm by comparing it to state- of-the-art algorithms on three categories of graphs: randomly generated graphs, benchmarks, and a real-life protein interaction network. In this paper, we also prove that if self-loops are allowed in a graph, then the number of closed patterns in the adjacency matrix is not necessarily even, but the maximal bicliques are exactly the same as those of the graph after removing all the self-loops.

18 December 2009 in Plant Physiology
Verified
Journal Article
Open access
VBVagner A. Benedito
Vagner A. Benedito
HLHaiquan Li
Haiquan Li
XDXinbin Dai
Xinbin Dai
MWMaren Wandrey
Maren Wandrey
JHJi He
Ji He
MUMichael K Udvardi
Michael K Udvardi
Transporters move hydrophilic substrates across hydrophobic biological membranes and play key roles in plant nutrition, metabolism, and signaling and, consequently, in plant growth, development, and responses to the environment. To initiate and support systematic characterization of transporters in the model legume Medicago truncatula, we identified 3,830 transporters and classified 2,673 of these into 113 families and 146 subfamilies. Analysis of gene expression data for 2,611 of these transporters identified 129 that are expressed in an organ-specific manner, including 50 that are nodule specific and 36 specific to mycorrhizal roots. Further analysis uncovered 196 transporters that are induced at least 5-fold during nodule development and 44 in roots during arbuscular mycorrhizal symbiosis. Among the nodule- and mycorrhiza-induced transporter genes are many candidates for known transport activities in these beneficial symbioses. The data presented here are a unique resource for the selection and functional characterization of legume transporters.

1 June 2014 in American Journal of Respiratory and Critical Care Medicine
Verified
Journal Article
Closed access
LHLong Shuang Huang
Long Shuang Huang
BMBiji Mathew
Biji Mathew
HLHaiquan Li
Haiquan Li
YZYutong Zhao
Yutong Zhao
SMShwu-Fan Ma
Shwu-Fan Ma
VNViswanathan Natarajan
Viswanathan Natarajan
Rationale: Lysocardiolipin acyltransferase (LYCAT), a cardiolipin-remodeling enzyme regulating the 18:2 linoleic acid pattern of mammalian mitochondrial cardiolipin, is necessary for maintaining normal mitochondrial function and vascular development. We hypothesized that modulation of LYCAT expression in lung epithelium regulates development of pulmonary fibrosis. Objectives: To define a role for LYCAT in human and murine models of pulmonary fibrosis. Methods: We analyzed the correlation of LYCAT expression in peripheral blood mononuclear cells (PBMCs) with the outcomes of pulmonary functions and overall survival, and used the murine models to establish the role of LYCAT in fibrogenesis. We studied the LYCAT action on cardiolipin remodeling, mitochondrial reactive oxygen species generation, and apoptosis of alveolar epithelial cells under bleomycin challenge. Measurements and Main Results: LYCAT expression was significantly altered in PBMCs and lung tissues from patients with idiopathic pulmonary fibrosis (IPF), which was confirmed in two preclinical murine models of IPF, bleomycin- and radiation-induced pulmonary fibrosis. LYCAT mRNA expression in PBMCs directly and significantly correlated with carbon monoxide diffusion capacity, pulmonary function outcomes, and overall survival. In both bleomycin- and radiation-induced pulmonary fibrosis murine models, hLYCAT overexpression reduced several indices of lung fibrosis, whereas down-regulation of native LYCAT expression by siRNA accentuated fibrogenesis. In vitro studies demonstrated that LYCAT modulated bleomycin-induced cardiolipin remodeling, mitochondrial membrane potential, reactive oxygen species generation, and apoptosis of alveolar epithelial cells, potential mechanisms of LYCAT-mediated lung protection. Conclusions: This study is the first to identify modulation of LYCAT expression in fibrotic lungs and offers a novel therapeutic approach for ameliorating lung inflammation and pulmonary fibrosis.

14 December 2009 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
HLHaiquan Li
Haiquan Li
VBVagner A Benedito
Vagner A Benedito
MUMichael K Udvardi
Michael K Udvardi
PZPatrick Xuechun Zhao
Patrick Xuechun Zhao
Background: Membrane transporters play crucial roles in living cells. Experimental characterization of transporters is costly and time-consuming. Current computational methods for transporter characterization still require extensive curation efforts, especially for eukaryotic organisms. We developed a novel genome-scale transporter prediction and characterization system called TransportTP that combined homology-based and machine learning methods in a two-phase classification approach. First, traditional homology methods were employed to predict novel transporters based on sequence similarity to known classified proteins in the Transporter Classification Database (TCDB). Second, machine learning methods were used to integrate a variety of features to refine the initial predictions. A set of rules based on transporter features was developed by machine learning using well-curated proteomes as guides.Results: In a cross-validation using the yeast proteome for training and the proteomes of ten other organisms for testing, TransportTP achieved an equivalent recall and precision of 81.8%, based on TransportDB, a manually annotated transporter database. In an independent test using the Arabidopsis proteome for training and four recently sequenced plant proteomes for testing, it achieved a recall of 74.6% and a precision of 73.4%, according to our manual curation.Conclusions: TransportTP is the most effective tool for eukaryotic transporter characterization up to date.

29 January 2006 in Bioinformatics
Verified
Journal Article
Open access
PDF file
HLHaiquan Li
Haiquan Li
JLJinyan Li
Jinyan Li
LWLimsoon Wong
Limsoon Wong
Motivation: Protein–protein interaction, mediated by protein interaction sites, is intrinsic to many functional processes in the cell. In this paper, we propose a novel method to discover patterns in protein interaction sites. We observed from protein interaction networks that there exist a kind of significant substructures called interacting protein group pairs, which exhibit an all-versus-all interaction between the two protein-sets in such a pair. The full-interaction between the pair indicates a common interaction mechanism shared by the proteins in the pair, which can be referred as an interaction type. Motif pairs at the interaction sites of the protein group pairs can be used to represent such interaction type, with each motif derived from the sequences of a protein group by standard motif discovery algorithms. The systematic discovery of all pairs of interacting protein groups from large protein interaction networks is a computationally challenging problem. By a careful and sophisticated problem transformation, the problem is solved using efficient algorithms for mining frequent patterns, a problem extensively studied in data mining. Results: We found 5349 pairs of interacting protein groups from a yeast interaction dataset. The expected value of sequence identity within the groups is only 7.48%, indicating non-homology within these protein groups. We derived 5343 motif pairs from these group pairs, represented in the form of blocks. Comparing our motifs with domains in the BLOCKS and PRINTS databases, we found that our blocks could be mapped to an average of 3.08 correlated blocks in these two databases. The mapped blocks occur 4221 out of total 6794 domains (protein groups) in these two databases. Comparing our motif pairs with iPfam consisting of 3045 interacting domain pairs derived from PDB, we found 47 matches occurring in 105 distinct PDB complexes. Comparing with another putative domain interaction database InterDom, we found 203 matches. Availability: Contact:jinyan@i2r.a-star.edu.sg Supplementary information: and Bioinformatics online.