冯好娣 教授

yh1122银河国际

山东省青岛市即墨区滨海公路72号

邮编：266237

fenghaodi@sdu.edu.cn

1990.9 - 2000.6 yh1122银河国际运筹学专业：本科、硕士、博士；

2000.7-2003.10 香港城市大学计算机专业：博士；

2014.9-2015.9 美国佐治亚大学(theUniversity of Georgia): 访问学者

2003.12-2009.11 yh1122银河国际副教授

2009.12-yh1122银河国际教授

荣获：yh1122银河国际青年教师讲课比赛二等奖；山东省自然科学三等奖（3）；高校计算机专业优秀教师奖励计划；

招生意向

2人/年

研究方向

生物信息学；计算理论与智能算法。目前侧重基于DNA/RNA测序的数据分析。

讲授课程

本科生课程：算法设计与分析、计算理论

研究生课程：高级算法设计

承担项目

国家自然科学基金2项 主持

山东省自然科学基金1项 主持

山东省优秀中青年科学家奖励基金1项 主持

山东省其它科技专项1项 主持

yh1122银河国际自主创新基金1项 主持

发表论文

Selected Publication(s)

§ Haodi Feng. On Orthogonal (0, f)-Factorizations. Acta Mathematica Scientia, Vol. 19, No.3 (1999) pp.332-336.

§ Haodi Feng. Some Results on Orthogonal Factorizations. Lecture Notes in Computer Science 2108 (COCOON’01), pp. 414-419, August, 20-23, 2001.

§ Haodi Feng. (g, f)-Factorizations Orthogonal to k-subgraphs. Lecture Notes in Computer Science 2204, (WG2001), pp.129-139, June 14—16, 2001.

§ Haodi Feng and GuizhenLiu. Orthogonal Factorizations of Graphs, Journal of Graph Theory，Vol. 40, issue 4, 2002, pp. 267-276.

§ 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

§ 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, 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.

§ Kang Chen, Weimin Zheng, Xiaotie Deng, Haodi Feng and Shanfeng Zhu. Text Distinguishers Used in an Interactive Meta Search Engine. Lecture Notes in Computer Science 2419(WAIM 02) , pp.181-188, August 2002.

§ 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

§ Haodi Feng,Kang Chen,Kit Chunyu, and Xiaotie Deng, Unsupervised Segmentation of Chinese Corpus Using Accessor Variety. The 1st International Joint Conference on Natural Language Processing(IJCNLP-04) pp.255-261, March 22-24,Sanya,2004, also LNAI 3248(2005, January), pp.714-722. Springer

§ 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

§ 赵卫中、冯好娣、朱大铭：欧式空间货郎担问题的一个多项式时间近似方案的改进与实现，《计算机研究与发展》，44（10）1790-1795，2007

§ Haodi Feng，Hong Liu，Minimizing Makespan on an Unbounded Batch Processor with Rejection and Release Times. 2009 World Congress on Computer Science and Information Engineering (CSIE 2009), Vol.2, 587-590.

§ 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 and Haodi Feng. Minimize the sum of total completion time and total rejection penalties on a single parallel batching machine, Proceedings - 2010 WASE International Conference on Information Engineering,ICIE 2010, v 2, p 200-202, 2010

§ Can Chen, Haodi Feng. Microblog recommendation based on user interaction, 2nd International Conference on Computer Science and Network Technology, ICCSNT 2012, pp 2107-2111

§ Mingjie Wang, Haodi Feng. A genetic algorithm for job-shop scheduling with limited part-changing times. 2nd International Conference on Computer Science and Network Technology,ICCSNT 2012, pp 1922-1926

§ Xiuqian Li, Haodi Feng, and Zheng Sun. 最小化完成时间和加惩罚值和的批调度问题，计算机研究与发展，50（8）：1700-1709，2013

§ Zhiliang Zhang, Haodi Feng, and Peng Li. Explore the solution space of transforming permutations by reversals and deletions,Journal of computational information systems, 10(22): 9665-9677， 2014.

§ Yong Zhang, Haodi Feng, and Zheng Sun. A simplified enumeration scheme for minimizing total completion time plus total rejection penalty with release date,Journal of Computational information systems, 11(24): 7653-7662, 2015

§ Haitao Jiang, Haodi Feng, and Daming Zhu. An 5/4-approximation algorithm for sorting permutations by short block moves, ISAAC 2014, LNCS 8889:491-503, 2014

§ 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 :COCOON2017, 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

§ Chenchen Li, Jin Zhao, Haodi Feng, Daming Zhu, TransCoord: Genome-guided Transcripts Assembly by Coordinating Candidate Paths into Two-phased Linear Programming,BIBM2021, 296-301, Online

§ Shu Zhang,Daming Zhu,Haitao Jiang,Jiong Guo, Haodi Feng,Xiaowen Liu:Sorting a Permutation by Best Short Swaps.Algorithmica83(7): 1953-1979 (2021)

§ Jin Zhao, Haodi Feng, Daming Zhu, Yu Lin ,MultiTrans: An Algorithm for Path Extraction Through Mixed Integer Linear Programming for Transcriptome Assembly,IEEE/ACM Transactions on Computational Biology and Bioinformatics , 2022, 19(1), 48-56

§ Shengjun Xie, Haodi Feng,Haitao Jiang,Daming Zhu: Approximation algorithms for sorting by bounded singleton moves.Theoretical Computer Science 917: 51-65 (2022)