A New AB Initio Repeats Finding Algorithm for Reference Genome
Journal: Journal of Interdisciplinary Sciences (Vol.1, No. 1)Publication Date: 2017-11-02
Authors : Shuaibin Lian Ke Gong Xiangli Zhang; Xinwu Chen;
Page : 32-48
Keywords : Repeat Finder; Unbiased Sampling; Dynamic overlap; greedy extension graph;
Abstract
It has become clear that repetitive sequences have played multiple roles in eukaryotic genome evolution. However, identification of repetitive elements can be difficult in the ab initio manner from reference sequence. Currently, some classical ab initio tools of finding repeats have already presented. The completeness and accuracy of detecting repeats of them are very low and need to be improved. To this end, we proposed a complete and accurate ab initio repeat finding tool, named UnSaReper, which is based on unbiased sampling and dynamic overlapping extension strategy. The performances of UnSaReper are compared in human genome data Hg19 with RepeatScout and RepeatFinder. The results indicate the following conclusions: 1) The completeness of UnSaReper is the best one in almost all chromosomes; 2) In terms of total size, UnSaReper is also more powerful than others. Consequently, UnSaReper is a complete and accurate ab initio repeat finding tool.
Other Latest Articles
- Gain improvement of the Yagi-Uda Antenna Using Genetic Algorithm for Application in DVB-T2 Television Signal Reception in Tanzania
- Student Representation and Modes of Institutional Stakeholder Interaction Platforms. Reconciling University Councils and their Student Stakeholders
- Performance Characteristics of a Diesel Engine with Mustard-Honge Biodiesel
- Inductances and force computation using Multiple model approach to nonlinear modeling and control of a pm linear synchronous actuator
- Design of single tuned passive filter to provide reactive power compensation and to minimize THD
Last modified: 2018-04-13 00:18:53