Bioinformatics is a burgeoning interdisciplinary scientific field which includes mathematics, statistics and computer science to slove problems about biology. Recently research of Transcription group plays a huge role in the bioinformatics research. De nove transcriptome assembly is an important aspect in this field. Now the popular algorithms about transcriptome assembly are classified into two categories: reference-based algorithm and de nove assembly algorithm. Although the reference-based algorithm has an advantage over other methods, it is used only when a high-quality reference genome exists. In fact, the high-quality reference genome can not be found easily. Though many de novo assemblers such as Trinity have been researched, none of them reflects the value.In this context, we show a new de novo assembly algorithm (SPLICE) based on assembly methods, which uses innovations to cover the shortage of the current algorithms. Then show the strengths with the data of Camellia and Rice during the experiment.SPLICE is an innovative algorithm with the following reasons:(l)It construes a SPLICE graph which reflects variable shear conditions for each gene by the given RNA-seq datas directly. (2)The imformation of Paired-end reads are used when producing graphs to reduce the difficulity of seeking transcripts. (3)By the way of adhibiting a typical graph, a minimum path cover model is applied to the algorithm with the purpose of reducing the false positive rate of transcripts. |