基本情况

李国君、男、山东大学首批泰山教授、博士生导师。1958年8月生于山东栖霞。1996年开始任山东大学教授，2000年被聘为博士生导师。曾任中国图论学会秘书长、常务理事，中国运筹学会组合与图论分会副主任。

学习与工作经历

学习经历：1982年中国首届大学本科毕业于曲阜师大数学系，并获学士学位；1987年硕士研究生毕业于郑州大学数学系并获硕士学位；1996年博士毕业于中国科学院数学与系统科学学院，并获博士学位。

工作经历：1996年前一直在鲁东大学任教。1996年开始任山东大学教授。在此期间，曾短期工作或访问过美国的Vermont大学、Goergia大学；澳大利亚的New South Wales大学；香港中文大学、香港大学、香港城市大学；韩国的Changwon大学，等。2004年曾受聘为中科院软件所兼职研究员，2005年被聘为美国佐治亚大学资深研究员。

研究领域介绍

生物信息学。 主要研究方向：解决各类生物问题的算法研制与软件设计，比如：
蛋白结构预测、功能基因组预测、基因调控网络构建、DNA-motif计算、microarray数据分
析、字符串序列分析、启动子分类、等。
组合最优化。 主要研究各类难解问题的算法设计与分析。
图论。主要研究图的结构性质，图论算法和图论在生物计算科学中的应用。

科研成果

撰写论文70余篇，彻底证明和解决了若干个具有挑战性的猜想和难题，其中包括Chvàtal猜想和识别字符串的可近似性问题。国际组合数学界最权威的杂志“Journal of Combinatorial Theory”、“Combinatorica”和国际计算机科学界最权威的杂志 “SIAM Journal on Computing”、“Journal of Algorithm”、“Algorithmica”、“ACM Transactions On Algorithms“ 均有文章多次出现。在生物信息学研究方面，关于蛋白结构预测、功能基因组分类、motif预测以及基因表达数据分析等研究领域均已取得突破性成果。

论文代表作：
1.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.
2.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).
3.G. Li, A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Cycle, has been accepted for publication in ACM Transactions on Algorithms.
4.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.
5.G. Li, Edge disjoint cycles in graphs, J. Graph Theory, No. 3 (2000), 8-20.
6.G. Li, Y. Xu, C. Chen, Z. Liu, On connected [g, f+1]-factors in graphs, Combinatorica, Vol. 25 (2005) No. 4, 393-405.
7.G. Li , G. Liu, (g,f)-Factorizations orthogonal to any subgraph in graphs, Science in China , Ser. A, 1(1998), 267-272.
8.D. Che, G. Li, F.Mao, Y. Xu, Detecting Uber-operons in prokaryotic genomes, Nucleic Acid Research, Vol.34, No.8, 2006, 2418-2427.
9.G. Li, B. Liu, D. Che, J. Sun, Y. Xu, Motif Length Could Be Computationally Recognized, has been accepted for publication in Bioinformatics.
10.G. Li, Z. Liu, J. Guo, Y. Xu, An algorithm for simultaneous backbone threading and side-chain packing, Algorithmica (2007)48: 329-342.
所有筛选后的论文：
与生物信息相关的有：
11. G. Li, B. Liu, Jonathan Z. Sun, Y. Xu, Motif length could be computationally recognized, conditionally accepted to be published in Bioinformatics.
12.G. Li, H. Tang, Y. Xu, A Close-to Optimum Bi-clustering for Microarray Gene Expression Data, submitted.
13.Y. Chen, F. Zhou, G. Li, Y. 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.
14.D. Che, G. Li, S. T. Jensen, J. S. Liu, Y. Xu, PFP: a new approach to phylogenetic footprinting in prokaryotic genomes, 4-th International Symposium on Bioinformatics Research and Applications, Georgia State University, Atlanta, USA.
15.G. Li, D. Che, Y. Xu, A Universal Operon Predictor for Prokaryotic Genomes, has been accepted for publication in Journal of Bioinformatics and Computational Biology.
16.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.
17.Y. Chen, G. Li, An effective algorithm of motif finding problem, Int. J. Bioinformatics Research and applications, Vol.4, No.2, 2008, 137-149.
18.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.
19.G. Li, Z. Liu, J. Guo, Y. Xu, An algorithm for simultaneous backbone threading and side-chain packing, Algorithmica (2007)48: 329-342.
20.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.
21.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.
22.X. Deng, G. Li, L. Wang, Center and Distinguisher for string selection on unbounded alphabet, Journal of Combinatorial Optimization, Vol. 6, 383-400. 2002.
23.D. Che, G. Li, F. Mao, Y. Xu, Detecting Uber-Operons in Microbial Genomes, Nucleic Acids Research 24(8) (2006), 2418-2427.
24.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.
25.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.
26.X. Qi, G. Li, S. Li, A faster algorithm for genomic sorting problem, Math. Appl. 19(2006) N.1, 66-74.
27. 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).
28.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).
与图论和组合优化相关的有：
29. Y. Gao, G. Li, Ore-type Condition for Disjoint Cycles and Chorded Cycles in Graphs, submitted.
30.Y. Gao, G.Li, Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs, submitted.
31.Y. Gao, G. Li, J. Yan, Ore-type degree condition for disjoint cycles and forests in graphs, submitted.
32.Y. Gao, G. Li, Vertex disjoint triangle and quadrilaterals in a graph, has been accepted for publication in Discrete Mathematics.
33.H. Zhang, G. Li, A Kind of QP-Free Feasible Method, has been accepted for publication in Journal of Computational and Applied Mathematics.
34.Y. Gao, G. Li, On cycles in regular 3-partite tournaments with at least 12 vertices, has been accepted for publication in Discrete Mathematics.
35.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.
36.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.
37.S. Li, G. Li, Minimizing Total Weighted Completion Time on Parallel Unbounded Batch machines, Journal of Software, Vol.17, No.10, 2063-2068, 2006.
38.S. Li, G. Li, X. Qi, Minimizing total weighted completion time on identical parallel batch machines. Internat. J. Found. Comput. Sci. 17 (2006), no. 6, 1441--1453.
39.S. Li, G. Li, H. Zhao, Minimizing total completion time of bounded batch scheduling, Math. Appl. (Wuhan) 19(2006), no.2, 446-454.
40.X. Qi, G. Li; S. Li, A faster algorithm for genomic sorting problem. Math. Appl. (Wuhan) 19 (2006), no. 1, 66--74
41.G. Li, Y. Xu, C. Chen, Z. Liu, On connected [g, f+1]-factors in graphs, Combinatorica 25 (2005) No. 4, 393-405.
42. 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.
43.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.
44.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
45.S. Li, G. Li, Minimum maximum lateness on identical parallel batch processing machines, COCOON’04.
46.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.
47. 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.
48.X. Deng, G. Li, A PTAS for Embedding Hypergraph in a Cycle, ICALP’04.
49.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).
50.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.
51.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.
52.S. Zhang, G. Li, Linear time algorithm for feedback vertexset problem in serial parallel graphs, Computer Science, Vol. 30, No. 8(2003), 122-125.
53.G. Li, G. Liu, A generalization of orthogonal factorizations in graphs, Acta Mathematica Sinica, Vol. 46, No. 4(2003), 715-720.
54.G. Li, et al, Hamiltonicity in 3-connected claw-free graphs, Discrete Mathematics, 250/1-3(2002), pp.137-151.
55.G. Li, et al, Orthogonal factorizations of graphs, Discrete Mathematics, Vol. 245, No. 1-3, (2002), pp.173-194.
56.G. Li, et al, Connected [k,k+1]-factors in claw-free graphs, ARS Combinatoria , 62 (2002), pp.207-219.
57.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,
58.S. Zhang, G. Li, Wavelength conversion in bi-directed networks, J. Software,Vol.13, No.2, 2002, 1899-1904.
59.M. Cai, X. Deng, H. Feng, G. Li, A PTAS for minimizing total completion time of bounded batch scheduling, IPCO’2002.
60.G. Li, et al, A generalization of orthogonal factorizations of graphs, Acta Mathematica Sinica, Vol. 17, No. 4 (2001). 669-678.
61.G. Li, Edge disjoint cycles in graphs, J. Graph Theory, No. 3 (2000), 8-20.
62.G. Li, W. Zang, Wavelength allocation on a tree of rings, Networks, Vol. 35(4) (2000), 248-252.
63.P. Lin, G. Liu, G. Li, Orthogonal (g,f)-Factorizations in Networks, Networks, Vol. 35(4) (2000), 274-278.
64.M. Wang, G. Li, A Result of Erdos-Sos Conjecture, ARS Combinatoria, Vol. 55 (2000), 123-127.
65.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.
66.G. Li, et al, Disjoint hamiltonian cycles in graphs, Australasian J. Combinatorics, Vol.18(1999), 83-89.
67.G. Li, G. Liu, (g,f)-Factorizations orthogonal to any subgraph in graphs, Science in China, Ser. A, 1(1998), 267-272.
68.G. Li, et al, On connected [2,3]-factors in claw-free graphs, Acta Mathematicae Applicatae Sinica, No. 1(1998).
69.M. Wang, G. Li, A result on Erdos-Sos conjecture, Acta Mathematica Scientia (Special Issue), (1998).
70.G. Li, G. Liu, (g, f)-Factorizations orthogonal to any subgraph in graphs, Science in China, Ser. A, 1(1998), 267-272.
71.G. Li, A result on Erdos-Sos conjecture, Acta Mathematica Scientia (China), Special Issue(1998).
72.G. Li, Factorizations orthogonal to a subgraph in graphs, Advances in Mathematics, No.5(1997).
73.G. Li, et al, A new result on forbidden graphs and hamiltonicity, Chinese Bulletin, No. 2(1996); 93-99.
74.G. Li, et al, Hamiltonicity in 3-connected regular claw-free graphs, Advances in Mathematics, No. 1(1996); 51-57.
75.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.
76.G. Li, Z. Liu, Hamiltonicity of N^2-locally connected claw-free graphs, J. Sys. Sci. and Math. Sci., No. 4(1996); 335-337.
77.G. Li, On 2-factors in claw-free graphs, J. Sys. Sci. and Math. Sci., No. 4(1995); 369-372
78.G. Li, et al, Two sufficient conditions for hamiltonian graphs, J. Sys. Sci. and Sys. Engin., No. 1(1994); 61-65.
79.G. Li, J. Sun, A network flow algorithm for deleting debt circulations, Chinese J. of Operations Research, No. 1(1994), 61-65
80.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.
81.G. Li, Longest cycles in 3-connected regular claw-free graphs, Advances in Mathematics, No. 1(1993).
82.G. Li, A local condition on dominating cycles in graphs, J. Sys. Sci. and Sys. Engin., No. 4(1993).
83.G. Li, Longest cycles in 3-connected regular claw-free graphs, Advances in Mathematics, No. 1(1993)
84.G. Li, Estimation of up-bound of penalization factor of linear programming, Math Research and Math Review (China), No. 3(1993)
85.G. Li, Location for a center in networks, Chinese J. of Operations Research, No. 2(1989).

科研项目

目前在研的国家自然科学基金项目：
1面上项目：DNA数据挖掘中的组合理论与算法设计（60673059），国家自然科学基金（信息部），负责人，2007.1-2009.12。
2 重点项目：信息科学与生物科学中的数学问题和方法(10631070)，国家自然科学基金（数理部），山大负责人，2007.1-2009.12。
3 泰山学者配套经费, 2005-2010。
已完成的国家自然科学基金项目：
4.面上项目：近似算法的设计与分析(60373025), 国家自然科学基金(信息部)，负责，2004.1-2006.12。
5.面上项目：图论与组合技术在理论计算机科学中的应用(10271065)，国家自然科学基金（数理部），负责，2003.1-2005.12。
6.面上项目：图的连通因子与正交因子分解问题及算法研究(19971053)，国家自然科学基金（数理部），负责，2000.1-2002.12。
7.面上项目：禁用子图与哈密尔顿性研究，国家自然科学基金（数理部），负责，1995.1-1997.12。
其它已完成的基金项目：
8.图论在代数中的应用，山东省自然科学基金，负责，2000-2002。
9.图中有约束条件的因子问题研究(69772017)， 国家教委，参加，1998.1-200.12。
10.图与网络技术研究(22000A02),山东省自然科学基金，参加，2001.1-2003.12。

联合培养

与美国佐吉亚大学计算系统和生物实验室徐鹰教授联合培养博士研究生：刘炳强、陈勇。

联系方式

gjli@sdu.edu.cn