Publications
Publications related to Bioinformatics
• G. Li, B. Liu, D. Che, J. Z. Sun, Y. Xu, Motif Length Could Be Computationally Recognized , conditionally accepted for publication in Bioinformatics.
• G. Li, H. Tang, Y. Xu, A close-to optimum bi-clustering algorithm for microarray gene expression data, submitted.
• Yong Chen, Fengfeng Zhou, Guojun Li, and Ying Xu, "A recently active MITE, Chunjie, inserted into an operon without disturbing the operon structure in Geobacter uraniireducens Rf4", has been accepted for publication in Genetics.
• D. Che, G. Li, S. T. Jensen, J. S. Liu, Y. Xu, PFP: a computational framework for phylogenetic footprinting in prokaryotic genomes, 4-th International Symposium on Bioinformatics Research and Applications, Georgia State University, Atlanta, USA.
• X. Qi, J. Wu, S. Li, G. Li, Sorting by transpositions: dealing with length-weighted models, Int. J. Bioinformatics Research anad Applications Vol.4, No.2, 2008.
• G. Li, D. Che, Y. Xu, A Universal Operon Predictor for Prokaryotic Genomes, has been accepted by Journal of Bioinformatics and Computational Biology.
• X. Qi, G. Li , Y. Xu, Sorting genomes by translocations, insertions and deletions, has been accepted for publication in IEEE/ACM Transactions on Computational Biology and Bioinformatics.
• Y. Chen, G. Li , An effective algorithm of motif finding problem, Int. J. Bioinformatics Research and applications, Vol.4, No.2, 2008, 137-149.
• X. Qi, J. Wu, S. Li, G. Li, Sorting by transpositions: dealing with length-weighted models, Int. J. Bioinformatics Research and applications, Vol.4, No.2, 2008, 164-171.
• G. Li, Z. Liu, J. Guo, Y. Xu, An algorithm for simultaneous backbone threading and side-chain packing, Algorithmica (2007)48: 329-342.
• G. Li, J. Lu, O. Victor, Y. Xu, A Highly Sensitive Algorithm for Identification of cis Regulatory Elements: From Cliques to High Information Content Analysis, Journal of Bioinformatics and Computational Biology, Vol.5, Issue 4 (2007), 817-838 .
• X. Deng, G. Li, Z. Li, B. Ma, L.Wang, Genetic design of drug without side-effects, SIAM J. on Computing, Vol.32, No. 4(2003), 1073-1090.
• X. Deng, G. Li , L. Wang, Center and Distinguisher for string selection on unbounded alphabet, Journal of Combinatorial Optimization, Vol. 6, 383-400. 2002.
• D. Che, G. Li, F. Mao, Y. Xu, Detecting Uber-Operons in Microbial Genomes, Nuc l eic Acids Research 24(8) (2006), 2418-2427.
• X. Qi, G. Li, Y. Xu, An asymptotically optimal algorithm for sorting by reciprocal translocations and deletions/insertions, CSB2006 Conference Proceedings, Stanford CA, 14-18 August 2006.
• X. Qi, G. Li, J. Wu, B. Liu, Sorting signed permutations by fixed-length reversals, International Journal of Foundations of Computer Science, Vol. 17, No. 4 (2006) 933-948.
• X. Qi, G. Li, S. Li, A faster algorithm for genomic sorting problem, Math. Appl. 19(2006) N.1, 66-74.
• X. Deng, G. Li , Z. Li, B. Ma, L. Wang, A PTAS for distinguishing (sub)string selection, Lecture Notes in Computer Science , Vol. 2380, 740-751 (2002) .
• G. Li , X. Qi, X. Wang, A linear-time algorithm for computing translocation distance between signed genomes, Lecture Notes in Computer Science, Vol.3109, 323-332 (2004).
Publications related to graph theory and computer science
• Y. Gao, J. Yan, G. Li , Vertex disjoint triangle and quadrilaterals in a graph, submitted
• Y. Gao, G. Li, J. Yan, Ore-type degree condition for disjoint cycles and forests in graphs, submitted.
• Y. Gao, G. Li, On cycles in regular 3-partite tournaments with at least 12 vertices, has been accepted for publication in Discrete Mathematics.
• H. Zhang, G. Li, A Kind of QP-Free Feasible Method, has been accepted for publication in Journal of Computational and Applied Mathematics.
• G. Li , X. Deng, Y. Xu, A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Cycle, has
been accepted for publication in ACM Transactions on Algorithms.
• Yunshu Gao, G. Li, Jin Yan, and Jonathan Z. Sun, Disjoint Cycles and Chorded Cycles in Graphs, The 2008 International Conference on Foundations of Computer Science (FCS'08: July 14-17, 2008, Las Vegas, USA).
• H. Zhao, G. Li, Batch scheduling with a common due window on a single machine, Journal of Systems Science and Complexity, Vol.21: 296-303, 2008..
• S. Li, G. Li , Minimizing Total Weighted Completion Time on Parallel Unbounded Batch machines, Journal of Software, Vol.17, No. 10, 2063-2068, 2006.
• S. Li, G. Li, H. Zhao, Minimizing total completion time of bounded batch scheduling, Math. Appl. ( Wuhan ) 19(2006), no.2, 446-454.
• G. Li , Y. Xu, C. Chen, Z. Liu, On connected [g, f+1]-factors in graphs, Combinatorica 25 (2005) No. 4, 393-405.
• S. Li, G. Li, S. Zhang , Minimizing makespan on a single batching machine with release times and non-identical job sizes, Discrete Applied Mathematics 148 ( 2005 ) 127-134.
• X. Deng, H. Feng, G. Li , B. Shi, A PTAS for Semiconductor Burn-in Scheduling, Journal of of Combinatorial Optimization, Vol.9, No.1 (2005) 5-17.
• S. Li, G. Li, X. Wang, Minimizing makespan on a single batch machine with release times and non-identical job sizes, O. R Letter, 33(2005), 157-164
• S. Li, G. Li, Minimum maximum lateness on identical parallel batch processing machines, COCOO N '04.
• S.Q. Zhang, G. Li, S.G. Li, A linear time algorithm for the minimum weight feedback vertex set problem in series-parallel graphs, Software Vol.20, No.4 (2004) 1-10.
• X. Deng, G. Li , W. Zang, Proof of Chvatal's conjecture on maximum clique and maximum stable sets, J. Combinatorical Theory, Series B 91(2004) 301-325.
• X. Deng, G. Li, A PTAS for Embedding Hypergraph in a Cycle, ICALP'04.
• X. Deng, G. Li , W. Zang , 2-approximation algorithm for path coloring on restricted trees of rings, Journal of Algorithm, 47(1):1-13(2003).
• M. Wang, G. Li , Packing a tree of order p with a (p, p+1)-graph, J. Syst. Sci. Complex, 16(2003), No. 1, 122--132.
• G. li, S. Zhang , Wavelength assignment in all-optical WDM network with ring topology, Acta Mathematicae Applicatae Sinica , Vol. 26, No. 3 (2003) , 1-7 .
• S. Zhang, G. Li , Linear time algorithm for feedback vertexset problem in serial parallel graphs, Computer Science , Vol. 30, No. 8(2003), 122-125 .
• G. Li, G. Liu, A generalization of orthogonal factorizations in graphs, Acta Mathematica Sinica, Vol. 46, No. 4(2003), 715-720.
• G. Li , et al, Hamiltonicity in 3-connected claw-free graphs, Discrete Mathematics, 250/1-3(2002), pp.137-151.
• G. Li , et al, Orthogonal factorizations of graphs, Discrete Mathematics, Vol. 245, No. 1-3, (2002), pp.173-194.
• G. Li , et al, Connected [k,k+1]-factors in claw-free graphs, ARS Combinatoria , 62 (2002), pp.207-219.
• M. Cai, X. Deng, G. Li , A PTAS for minimizing total completion time of bounded batch scheduling, International Journal of foundations of computer science, Vol. 13 No. 6(2002) 817-827. X. Deng,
• S. Zhang, G. Li , Wavelength conversion in bi-directed networks, J. Software,Vol.13, No.2, 2002, 1899-1904.
• M. Cai, X. Deng, H. Feng, G. Li , A PTAS for minimizing total completion time of bounded batch scheduling, IPCO'2002.
• G. Li , et al, A generalization of orthogonal factorizations of graphs, Acta Mathematica Sinica, Vol. 17, No. 4 (2001). 669-678.
• G. Li , Edge disjoint cycles in graphs, J. Graph Theory, No. 3 (2000), 8-20.
• G. Li , W. Zang, Wavelength allocation on a tree of rings, Networks, Vol. 35(4) (2000), 248-252.
• P. Lin, G. Liu, G. Li , Orthogonal (g,f)-Factorizations in Networks, Networks, Vol. 35(4) (2000), 274-278.
• M. Wang, G. Li , A Result of Erdos-Sos Conjecture, ARS Combinatoria, Vol. 55 (2000), 123-127.
• X. Deng, G. Li , et al, A 2-Approximation Algorithm for path coloring on trees of rings, Letter Notes on computer science, 2000, 144-155.
• G. Li , et al, Disjoint hamiltonian cycles in graphs, Australasian J. Combinatorics, Vol.18(1999), 83-89.
• G. Li , G. Liu, (g,f)-Factorizations orthogonal to any subgraph in graphs, Science in China , Ser. A, 1(1998), 267-272.
• G. Li , et al, On connected [2,3]-factors in claw-free graphs, Acta Mathematicae Applicatae Sinica, No. 1(1998).
• M. Wang, G. L i, A result on Erdos-Sos conjecture, Acta Mathematica Scientia (Special Issue), (1998).
• G. Li, G. Liu, (g,f)-Factorizations orthogonal to any subgraph in graphs, Science in China , Ser. A, 1(1998), 267-272 .
• G. Li, A result on Erdos-Sos conjecture, Acta Mathematica Scientia ( China ), Special Issue(1998).
• G. Li, Factorizations orthogonal to a subgraph in graphs, Advances in Mathematics, No.5(1997) .
• G. Li , et al, A new result on forbidden graphs and hamiltonicity, Chinese Bulletin, No. 2(1996); 93-99.
• G. Li , et al, Hamiltonicity in 3-connected regular claw-free graphs, Advances in Mathematics, No. 1(1996); 51-57.
• G. Li , et al, Hamiltonicity in 2-connected {K_{1,3}, F}-free graphs, J. Sys. Sci. and Math. Sci., No. 4(1996); 295-305.
• G. Li, Z . Liu, Hamiltonicity of N^2-locally connected claw-free graphs, J. Sys. Sci. and Math. Sci., No. 4(1996); 335-337 .
• G. Li, On 2-factors in claw-free graphs, J. Sys. Sci. and Math. Sci., No. 4(1995); 369-372
• G. Li , et al, Two sufficient conditions for hamiltonian graphs, J. Sys. Sci. and Sys. Engin., No. 1(1994); 61-65.
• G. Li, J . Sun , A network flow algorithm for deleting debt circulations, Chinese J. of Operations Research, No. 1(1994), 61-65
• G. Li , J. Sun, An application of Mathematical programming in enterprise management, Theory and practice in systems engineering ( China ), Vol.14, No.2 (1994), pp. 65-69.
• G. Li , Longest cycles in 3-connected regular claw-free graphs, Advances in Mathematics, No. 1(1993).
• G. Li , A local condition on dominating cycles in graphs, J. Sys. Sci. and Sys. Engin., No. 4(1993).
• G. Li, Longest cycles in 3-connected regular claw-free graphs, Advances in Mathematics, No. 1(1993)
• G. Li, Estimation of up-bound of penalization factor of linear programming, Math Research and Math Review ( China ), No. 3(1993)
• G. Li, Location for a center in networks, Chinese J. of Operations Research, No. 2(1989).