FENG Haodi
Professor, School of Computer Science & Technology
Education Background
BSc & MSc: Shandong university
PhD: Shandong University
PhD: City University of Hong Kong
Contact
E-mail: fenghaodi@sdu.edu.cn
Profile
From 1990 to 2000, I got my bachelor, master, and PhD degree in Operations Research from Shandong University. In 2004, I got my PhD degree in Computer Science from City University of Hong Kong. In 2003, I joined the school of computer science and technology of Shandong University. My research interests include bioinformatics and algorithm design & analysis. Recently, I mainly study DNA/RNA-seq data analysis including RNA/DNA assembly and molecular analysis of plant mutant. I also work on designing algorithms or approximate algorithms for the theoretical problems arising in the biological problems I study.
Research Area
Bioinformatics; algorithm design and analysis
Courses
Introduction to the Theory of Computation; Algorithm Design and Analysis
Projects
National Natural Science Foundation (2); Natural Science Foundation of Shandong Province (1); Outstanding Young Scientist Award Fund of Shandong Province (1); Independent Innovation Fund of Shandong University (1); Other fund (1).
Selected Publication(s)
Haodi Feng, Kang Chen, Xiaotie Deng, Weimin Zheng. Accessor Variety Criteria for Chinese Word Extraction. Computational Linguistics，Vol.30,issue 1(2004)，pp.75-93
.Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu. 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.
Haodi Feng and Guizhen liu. Orthogonal Factorizations of Graphs, Journal of Graph Theory，Vol. 40, issue 4, 2002, pp. 267-276.
Xiaotie Deng, Haodi Feng, Pixing Zhang, Yuzhong Zhang, Minimizing Mean Response Time in Batch Processing System. Algorithmica. Vol.38, No.4, 2004, pp.513-528
Maocheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu. A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. Lecture Notes in Computer Science 2337(IPCO-02), pp.304--314, May 27—29, 2002
Xiaotie Deng, Haodi Feng, Pixing Zhang, Hong Zhu. A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. Lecture Notes in Computer Science 2223(ISAAC 2001), pp. 26-35, Dec. 19—21, 2001
Haodi Feng. Some Results on Orthogonal Factorizations. Lecture Notes in Computer Science 2108(COCOON’01), pp. 414-419 , August, 20-23, 2001.
.Shenpeng Lu, Haodi Feng, and Xiuqian Li. Minimize the Makespan on a Single Parallel Batching Machine, Theoretical Computer Science, 411(7-9) (2010):1140-1145
Xiuqian Li, Haodi Feng, and Zheng Sun. 最小化完成时间和加惩罚值和的批调度问题，计算机研究与发展，50（8）：1700-1709，2013
Xingfu Li, Haodi Feng, Haitao Jiang, and Binhai Zhu. A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices in interval graphs, FAW2016, LNCS 9711, pp 92-101, 2016
Jin Zhao, Haodi Feng, Estimating Isoform Abundance by using particle swam optimization, BIBM2016：161-166，Shenzhen
Jin Zhao, Haodi Feng, Daming Zhu, Chi Zhang, and Ying Xu, IsoTree: De novo Transcriptome Assembly from RNA-seq Reads, ISBRA 2017, LNBI 10330, pp. 71–83, 2017
Xingfu Li, Haodi Feng, Haitao Jiang, and Binhai Zhu. A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices in interval graphs,Theoretical Computer Science 734 (2018) 32–37
Aizhong Zhou1, Haitao Jiang1(B), Jiong Guo1, Haodi Feng1, Nan Liu2, and Binhai Zhu3，Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction : COCOON 2017, LNCS 10392, pp. 575–587, 2017.
Jin Zhao, Haodi Feng, Daming Zhu, Chi Zhang, and Ying Xu. IsoTree: A New Framework for De novo Transcriptome Assembly from RNA-seq Reads, IEEE/ACM Transactions on Computational Biology and Bioinformatics , DOI 10.1109/TCBB.2018.2808350,
Jin Zhao , Haodi Feng, Daming Zhu , Chi Zhang , and Ying Xu, DTAST: A Novel Radical Framework for de Novo Transcriptome Assembly Based on Suffix Trees, : ICIC 2018, LNCS 10954, pp. 740–745, 2018
Huiqiang Jia, Haichao Wei, Daming Zhu, Ruizhi Wang, Haodi Feng, and Xiangzhong Feng,
PASA: Identifying More Credible Structural Variants of Hedou12, : ICIC 2018, LNCS 10954, pp. 553–558, 2018
Shu Zhang,Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng. Can a permutation be sorted by best short swaps? 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018). Editors: Gonzalo Navarro, David Sankoff, and Binhai Zhu; Article No. 14; pp. 14:1–14:12
Shu Zhang1, Ruizhi Wang1, Daming Zhu1,∗, Haitao Jiang1, Haodi Feng1, Jiong Guo1 and Xiaowen Liu。The Longest Common Exemplar Subsequence Problem，2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)，2018,Dec.3-Dec.6,Madrd Spain.92-95
Shengjun Xie, Haodi Feng, Haitao Jiang, Junfeng Luan, and Daming Zhu。An Approximation Algorithm for Sorting by Bounded Singleton Moves。COCOON 2019, LNCS 11653, pp. 580–590, 2019
.Jin Zhao, Haodi Feng, Daming Zhu, Chi Zhang and Ying Xu. DTA-SiST: de novo transcriptome assembly by using simplified suffix tree, BMC Bioinformatics 2019, 20(suppl25):698
Awards
Natural Science Award of Shandong Province, 3rd prize
