Feng Haodi
Click:
The Last Update Time:..
Paper Publications
- [25] Feng Haodi and Feng Haodi. Minimum Neighbor-getting Problem and Voronoi Games. Journal of computational information systems, 1, 2015.
- [26] 朱大铭 , 姜海涛 , 郭炅 , Feng Haodi , 张舒 and 张舒. Can a permutation be sorted by best short swaps?. 2018.
- [27] 朱大铭 , 姜海涛 , Feng Haodi , 郭炅 , 张舒 and 张舒. The longest common exemplar subsequence problem. 2018.
- [28] 朱大铭 , Feng Haodi and Feng Haodi. ISOtree: A new framework for de novo transcriptome assembly from RNA-seq reads. IEEE/ACM , 2018.
- [29] Feng Haodi , 朱大铭 and 赵瑾. IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads. BIOINFORMATICS RESEARCH AND APPLICATIONS (ISBRA 2017), 10330, 71, 2017.
- [30] Feng Haodi and Feng Haodi. MicroBlog Recommendation based. 2nd International Conference on Computer Science and Network Technology, ICCSNT 2012, 1, 2107, 2012.
- [31] Feng Haodi and Feng Haodi. A Genetic Algorithm for Job Shop Scheduling with Limited Part-chan. 2nd International Conference on Computer Science and Network Technology, ICCSNT 2012, 1, 1922, 2013.
- [32] 姜海涛 , Feng Haodi and Feng Haodi. A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs. Lecture Notes in Computer Science, 9711, 92, 2016.
| TOTAL 59 PIECE 4/8 |
Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University