Feng Haodi
Click:
The Last Update Time:..
Paper Publications
- [41] 朱大铭 and Feng Haodi. ISOtree: A new framework for de novo transcriptome assembly from RNA-seq reads. IEEE/ACM , 2018.
- [42] Feng Haodi and 姜海涛. An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves. International Symposium on Algorithms and Computation (ISAAC 2014), 2014.
- [43] 朱大铭 , 姜海涛 , 郭炅 , Feng Haodi and 张舒. Can a permutation be sorted by best short swaps?. 2018.
- [44] 朱大铭 , 姜海涛 , Feng Haodi , 郭炅 and 张舒. The longest common exemplar subsequence problem. 2018.
- [45] Feng Haodi and 姜海涛. An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves. International Symposium on Algorithms and Computation (ISAAC 2014), 2014.
- [46] Feng Haodi , 朱大铭 and 赵瑾. IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads. BIOINFORMATICS RESEARCH AND APPLICATIONS (ISBRA 2017), 10330, 71, 2017.
- [47] 姜海涛 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.
- [48] Feng Haodi. Estimating Isoform Abundance by Particle Swarm Optimization. 2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 161, 2016.
| TOTAL 59 PIECE 6/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