周爱中

Faculty

头像

周爱中

职称: 讲师 学院: 计算机科学与技术学院 电子邮箱: zhouaizhong@ouc.edu.cn 办公室:
  • 基本信息
  • 项目
  • 获奖
  • 论文
  • 课程
  • 教材或专著
  • 专利
  • Research Fields
  • Achievement
  • Social Appointments
  • Teaching Experience
  • Honor Title
  • Additional Information
  • 基本信息
    姓名: 周爱中 出生年月: 1992-08-01 最高学位:博士 入职海大时间: 2021-07
    主要研究方向:智能算法设计,计算复杂性分析,社会选择学,计算生物学 专业技术职务: 导师类别:
    年均课时数: 是否第一学科:是
    国内外重要学术组织任职:
    获得人才称号名称及获得年份:
    其他情况简介:
  • 项目
  • 获奖
  • 论文
    • 1. SVLR: Genome Structural Variant Detection Using Long-Read Sequencing Data Journal of Computational Biology 2021 SCI 二作
    • 2. Parameterized Complexity of Shift Bribery in Iterative Elections International Joint Conference on Autonomous Agents & Multiagent Systems 2020 EI 一作/通讯作者
    • 3. SVLR: Genome Structure Variant Detection Using Long Read Sequencing Data International Symposium on Bioinformatics Research and Applications 2020 EI 二作
    • 4. Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes. International Joint Conference on Autonomous Agents & Multiagent Systems 2019 EI 一作/通讯作者
    • 5. A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction International Conference on Combinatorial Optimization and Applications 2017 EI 一作
    • 6. Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction International Computing and Combinatorics Conference 2017 EI 一作
  • 课程
  • 教材或专著
  • 专利
  • 成果转化与社会服务
  • Research Fields
  • Achievement
  • Social Appointments
  • Teaching Experience
    • 1. SVLR: Genome Structural Variant Detection Using Long-Read Sequencing Data Journal of Computational Biology 2021 SCI 二作
    • 2. Parameterized Complexity of Shift Bribery in Iterative Elections International Joint Conference on Autonomous Agents & Multiagent Systems 2020 EI 一作/通讯作者
    • 3. SVLR: Genome Structure Variant Detection Using Long Read Sequencing Data International Symposium on Bioinformatics Research and Applications 2020 EI 二作
    • 4. Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes. International Joint Conference on Autonomous Agents & Multiagent Systems 2019 EI 一作/通讯作者
    • 5. A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction International Conference on Combinatorial Optimization and Applications 2017 EI 一作
    • 6. Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction International Computing and Combinatorics Conference 2017 EI 一作
  • Honor Title
  • Additional Information