LSLS: A Novel Scaffolding Method Based on Path Extension

被引:1
|
作者
Li, Min [1 ]
Tang, Li [1 ]
Liao, Zhongxiang [1 ]
Luo, Junwei [1 ]
Wu, Fangxiang [1 ,2 ]
Pan, Yi [1 ,3 ]
Wang, Jianxin [1 ]
机构
[1] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China
[2] Univ Saskatchewan, Dept Mech Engn, Div Biomed Engn, Saskatoon, SK S7N 5A9, Canada
[3] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30303 USA
来源
INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2017, PT II | 2017年 / 10362卷
关键词
Genome assembly; Scaffolding; Extension of path; Mate-pair; Greedy algorithm; READS; ALGORITHM; ASSEMBLER; BAMBUS;
D O I
10.1007/978-3-319-63312-1_38
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
While aiming to determine orientations and orders of fragmented contigs, scaffolding is an essential step of assembly pipelines and can make assembly results more complete. Most existing scaffolding tools adopt the scaffold graph approach. However, constructing an accurate scaffold graph is still a challenge task. Removing potential false relationships is a key to achieve a better scaffolding performance, while most scaffolding approaches neglect the impacts of uneven sequencing depth that may cause more sequencing errors, and finally result in many false relationships. In this paper, we present a new scaffolding method LSLS (Loose-Strict-Loose Scaffolding), which is based on path extension. LSLS uses different strategies to extend paths, which can be more adaptive to different sequencing depths. For the problem of multiple paths, we designed a score function, which is based on the distribution of read pairs, to evaluate the reliability of path candidates and extend them with the paths which have the highest score. Besides, LSLS contains a new gap estimation method, which can estimate gap sizes more precisely. The experiment results on the two standard datasets show that LSLS can get better performance.
引用
收藏
页码:428 / 438
页数:11
相关论文
共 50 条
  • [1] A Novel Scaffolding Algorithm Based on Contig Error Correction and Path Extension
    Li, Min
    Tang, Li
    Liao, Zhongxiang
    Luo, Junwei
    Wu, Fang-Xiang
    Pan, Yi
    Wang, Jianxin
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2019, 16 (03) : 764 - 773
  • [2] A Novel Query Extension Method Based on LDA
    Zhang, Yongjun
    Ma, Jialin
    Wang, Zhijian
    Chen, Bolun
    ADVANCES IN INTERNETWORKING, DATA & WEB TECHNOLOGIES, EIDWT-2017, 2018, 6 : 253 - 261
  • [3] A Novel Critical Path Based Routing Method Based on for NOC
    Li Chunqiang
    Hu Wei
    Wang Puzhang
    Song Mengke
    Cao Xinwei
    2015 IEEE 17TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2015 IEEE 7TH INTERNATIONAL SYMPOSIUM ON CYBERSPACE SAFETY AND SECURITY, AND 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS (ICESS), 2015, : 1546 - 1551
  • [4] A Novel Method for SUAV Path Planning Based on MPG
    Wang, Hangyu
    SUSTAINABLE DEVELOPMENT OF NATURAL RESOURCES, PTS 1-3, 2013, 616-618 : 2153 - 2157
  • [5] A Sequential Path Extension Method for Mobile Robot
    Kawabata, Kuniaki
    Xue, Jianru
    Ma, Liang
    Zheng, Nanning
    TENCON 2014 - 2014 IEEE REGION 10 CONFERENCE, 2014,
  • [6] A Novel Program Analysis Method Based On Execution Path Correlation
    Fan, Wenqing
    Zhou, Binbin
    Liang, Hongliang
    Yang, Yixian
    2009 SECOND INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING: KAM 2009, VOL 2, 2009, : 178 - 181
  • [7] A Novel Hybrid Map Based Global Path Planning Method
    Wang, Jikai
    Chen, Zonghai
    2018 3RD ASIA-PACIFIC CONFERENCE ON INTELLIGENT ROBOT SYSTEMS (ACIRS 2018), 2018, : 66 - 70
  • [8] Path extension similarity link prediction method based on matrix algebra in directed networks
    Guo, Feipeng
    Zhou, Wei
    Lu, Qibei
    Zhang, Chen
    COMPUTER COMMUNICATIONS, 2022, 187 : 83 - 92
  • [9] A Novel Local Search-Based Extension Rule Reasoning Method
    Yang Y.
    Liu L.
    Li G.-L.
    Zhang T.-B.
    Lü S.
    Lü, Shuai (lus@jlu.edu.cn), 2018, Science Press (41): : 825 - 839