- [1] 张烜. MetaGIN: a lightweight framework for molecular property prediction. Frontiers of Computer Science, 19, 2024.
- [2] 程吉斌. Revolutionizing Enzyme Turnover Predictions with Non-Binary Reaction Fingerprints and AI. 2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024, 663-668, 2025.
- [3] 张烜. CoAtGIN: Marrying Convolution and Attention for Graph-based Molecule Property Prediction. 2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022, 374-379, 2022.
- [4] 崔帅. Enhanced Protein-Ligand Affinity Prediction with Conditional Updating and Proximity Embedding. 2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024, 897-902, 2025.
- [5] 李甜甜. Longest (k]-tuple common substrings. 18 th international joint conference on frontiers of algorithms, 2024.
- [6] 马静静. Algorithms and Hardness for Scaffold Filling to Maximize Increased Duo-Preservations. IEEE/ACM , 19, 2071-2079, 2022.
- [7] 徐慧秀. On Sorting by Flanked Transpositions. 19th International Symposium on Bioinformatics Research and Applications, ISBRA 2023, 14248 LNBI, 292-311, 2023.
- [8] 孙骋程. An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes. 2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021, 86-91, 2021.
- [9] 谢升军. Approximation algorithms for sorting by bounded singleton moves. Theoretical Computer Science, 2022.
- [10] 王雨阳. Minimize Maximum Coverage of Fragment Alignment Selection. BIBM2023, 2023.
- [11] 周培衍. Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs. Theoretical Computer Science, 888, 22-30, 2021.
- [12] 蒲莲蓉. Can a breakpoint graph be decomposed into none other than 2-cycles?. Theoretical Computer Science, 2018.
- [13] 周培衍. Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs. Theoretical Computer Science, 888, 22, 2021.
- [14] 张舒. Sorting a Permutation by Best Short Swaps. Algorithmica (New York), 2021.
- [15] 马静静. On the solution bound of two-sided scaffold filling. Theoretical Computer Science, 873, 47, 2021.
- [16] 蒲莲容. A 1.375-approximation algorithm for unsigned translocation sorting. Journal of Computer and System Sciences, 113, 163, 2020.
- [17] 刘李鑫. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding. JOURNAL OF COMPUTATIONAL BIOLOGY, 27, 200, 2020.
- [18] 姜海涛. Breakpoint distance and PQ-trees. INFORMATION AND COMPUTATION, 275, 2020.
- [19] 姜海涛 and 朱大铭. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding. 15th International Symposium on Bioinformatics Research and Applications, 2019.
- [20] 姜海涛 and 刘宏. Breakpoint distance and PQ-trees. INFORMATION AND COMPUTATION, 2020.
姜海涛 (教授)
教授
性别：男
在职信息：在职
所在单位：计算机科学与技术学院
入职时间：2011-07-16
所属院系： 计算机科学与技术学院
访问量：
最后更新时间：..
最后更新时间：..