| Literature DB >> 28873323 |
Xiuhua Si1, Qian Wang2, Lei Zhang1, Ruo Wu1, Jiquan Ma1.
Abstract
Gene splicing is the process of assembling a large number of unordered short sequence fragments to the original genome sequence as accurately as possible. Several popular splicing algorithms based on reads are reviewed in this article, including reference genome algorithms and de novo splicing algorithms (Greedy-extension, Overlap-Layout-Consensus graph, De Bruijn graph). We also discuss a new splicing method based on the MapReduce strategy and Hadoop. By comparing these algorithms, some conclusions are drawn and some suggestions on gene splicing research are made.Entities:
Keywords: De Bruijn graph; Hadoop; MapReduce; gene splicing; read
Mesh:
Year: 2017 PMID: 28873323 PMCID: PMC5736332 DOI: 10.1080/21655979.2017.1373538
Source DB: PubMed Journal: Bioengineered ISSN: 2165-5979 Impact factor: 3.269