Implementation of Some Similarity Coefficients in Conjunction with Multiple Upgma and Neighbor-joining Algorithms for Enhancing Phylogenetic Trees

نویسنده

  • Tarik S. K. M. Rabie
چکیده

Random Amplified Polymorphic DNA (RAPD) markers was used to analyze the genetic structure of five Indigenous Egyptian’s chicken populations including Fayoumi, Dokki-4, Golden Montazah, Silver Montazah, and ElSalam, based on the taxa generated by the analysis of ten RAPD markers. The population genetic distances were estimated by using two cluster algorithms (UPGMA & NJ neighbor-joining) accompanied with ten similarity coefficients comprising Jaccard, Sørensen-Dice, Russel& Rao, Rogers & Tanimoto, Simple Matching, Pearson Phi, Lance &Williams, Mountford, Michael, and Kulchenzky-1. The results demonstrated that for almost all methodologies, the Jaccard and Sørensen-Dice followed by Simple Matching coefficients revealed extremely close results, because both of them exclude negative co-occurrences. Due to the fact that there is no guarantee that the DNA regions with negative co-occurrences between two strains are indeed identical, the use of coefficients such as Jaccard and Sørensen-Dice that do not include negative cooccurrences was imperative for closely related organisms along with the NJ neighbor-joining cluster algorithm.

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

ثبت نام

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

منابع مشابه

Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances

Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical considerations. We study algorithms which are based on a characterization of edge-weighted trees by distances to LCAs (Least Common Ancestors). This characterization enables a direct application of ultrametric reconstruction te...

متن کامل

An Incremental Phylogenetic Tree Algorithm Based on Repeated Insertions of Species

In this paper, we introduce a new phylogenetic tree algorithm that generates phylogenetic trees by repeatedly inserting species one-by-one. The incremental phylogenetic tree algorithm can work on proteins or DNA sequences. Computer experiments show that the new algorithm is better than the commonly used UPGMA and Neighbor Joining algorithms. Keywords—Data structure, Distance matrix, Phylogeneti...

متن کامل

Distance Based Methods in Phylogentic Tree Construction

One of the most fundamental aspects of bioinformatics in understanding sequence evolution and relationships is molecular phylogenetics, in which the evolutionary histories of living organisms are represented by finite directed (weighted) graphs, in particular, directed (weighted) trees. There are basically two types of phylogenetic methods, distance based methods and character based methods. Di...

متن کامل

Construction of Phylogenetic Trees from Amino Acid Sequences using a Genetic Algorithm

We have developed a novel algorithm to search for the maximum likelihood tree constructed from amino acid sequences. This algorithm is a variant of genetic algorithms which uses scores derived from the log-likelihood of trees computed by the maximum likelihood method. This algorithm is valuable since it may construct more likely tree from randomly generated trees by utilizing crossover and muta...

متن کامل

Towards a Formal Genealogical Classification of the Lezgian Languages (North Caucasus): Testing Various Phylogenetic Methods on Lexical Data

A lexicostatistical classification is proposed for 20 languages and dialects of the Lezgian group of the North Caucasian family, based on meticulously compiled 110-item wordlists, published as part of the Global Lexicostatistical Database project. The lexical data have been subsequently analyzed with the aid of the principal phylogenetic methods, both distance-based and character-based: Starlin...

متن کامل

ذخیره در منابع من


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010