Finding Exact and Solo LTR-Retrotransposons in Biological Sequences Using SVM

نویسندگان

  • Ali Masoudi-Nejad Laboratory of Systems Biology and Bioinformatics (LBB), Institute of Biochemistry and Biophysics and Center of Excellence in Biomathematics, University of Tehran, Tehran, I.R. IRAN
  • Fatemeh Zare Laboratory of Systems Biology and Bioinformatics (LBB), Institute of Biochemistry and Biophysics and Center of Excellence in Biomathematics, University of Tehran, Tehran, I.R. IRAN
  • Hesam Torabi Dashti Laboratory of Systems Biology and Bioinformatics (LBB), Institute of Biochemistry and Biophysics and Center of Excellence in Biomathematics, University of Tehran, Tehran, I.R. IRAN
چکیده مقاله:

Finding repetitive subsequences in genome is a challengeable problem in bioinformatics research area. A lot of approaches have been proposed to solve the problem, which could be divided to library base and de novo methods. The library base methods use predetermined repetitive genome’s subsequences, where library-less methods attempt to discover repetitive subsequences by analytical approaches. In this article we propose novel de novo methodology which stands on theory of pattern recognition’s science. Our methodology by using Support Vector Machine (SVM) classification and clustering methods could extract exact and Solo LTR-retrotransposons. This methodology issued to show complexity efficiency and applicability of the pattern recognition theories in bioinformatics and biomathematics research areas.We demonstrate applicability of our methodology by comparing its results with other well-known de novo method. Both applications return classes of discovered repetitive subsequences, were their results when had applied on show more that 90 percents similarities.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

finding exact and solo ltr-retrotransposons in biological sequences using svm

finding repetitive subsequences in genome is a challengeable problem in bioinformatics research area. a lot of approaches have been proposed to solve the problem, which could be divided to library base and de novo methods. the library base methods use predetermined repetitive genome’s subsequences, where library-less methods attempt to discover repetitive subsequences by analytical approaches. ...

متن کامل

LTR Retrotransposons in Fungi

Transposable elements with long terminal direct repeats (LTR TEs) are one of the best studied groups of mobile elements. They are ubiquitous elements present in almost all eukaryotic genomes. Their number and state of conservation can be a highlight of genome dynamics. We searched all published fungal genomes for LTR-containing retrotransposons, including both complete, functional elements and ...

متن کامل

Quadruplex-forming sequences occupy discrete regions inside plant LTR retrotransposons

Retrotransposons with long terminal repeats (LTR) form a significant proportion of eukaryotic genomes, especially in plants. They have gag and pol genes and several regulatory regions necessary for transcription and reverse transcription. We searched for potential quadruplex-forming sequences (PQSs) and potential triplex-forming sequences (PTSs) in 18 377 full-length LTR retrotransposons collec...

متن کامل

Non-LTR retrotransposons and microsatellites

The human genome is laden with both non-LTR (long-terminal repeat) retrotransposons and microsatellite repeats. Both types of sequences are able to, either actively or passively, mutagenize the genomes of human individuals and are therefore poised to dynamically alter the human genomic landscape across generations. Non-LTR retrotransposons, such as L1 and Alu, are a major source of new microsat...

متن کامل

Mining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM

Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 31  شماره 2

صفحات  111- 116

تاریخ انتشار 2012-06-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023