Abstract
In this paper we compare phylogenetic trees obtained from two alignment free techniques based on topological score.Whether the constraint followed by their respective graphical representation will generate the practical(appropriate)evolutionary tree. The trees are compared by giving the score based on topological similarity of the branches between the given trees and optimizing the overall score by paring up branches from one tree to another. Phylogenetic trees are constructed by UPGMA, NJ and MEdistance based method. The distance matrix required by tree construction methods are built from two alignment free methods, probability distribution method and genome space construction with biological geometry.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Campello, R.J.G.B., Hruschka, E.R.: On comparing two sequences of numbers and its applications to clustering analysis. Information Sciences 179, 1025–1039 (2009)
Huang, G., Liao, B., Li, Y., Yu, Y.: Similarity studies of DNA sequences based on a new 2D graphical representation. Biophysical Chemistry 143, 55–59 (2009)
Liao, B., Wang, T.: New 2D graphical representation of DNA sequences. Journal of Computational Chemistry 25, 1364–1368 (2004)
Pham, T.D., Zuegg, J.: A probabilistic measure for alignment-free sequence comparison. Bioinformatics 20, 3455–3461 (2004)
Reinert, G., Chew, D., Sun, F., Waterman, M.S.: Alignment-free sequence comparison (I): statistics and power. Journal of Computational Biology 16, 1615–1634 (2009)
Vinga, S., Almeida, J.: Alignment-free sequence comparison – a review. Bioinformatics 19, 513–523 (2003)
Hamori, E., Ruskin, J.: H-curves, a novel method of representation of nucleotideseries especially suited for long DNA sequences. Journal Biological Chemistry 258, 1318–1327 (1983)
Gates, M.A.J.: A simple way to look at DNA. Journal Theoretical Biology 119, 319–328 (1986)
Leong, P.M., Morgenthaler, S.: Random walk and gap plots of DNA sequences. Bioinformatics 11, 503–507 (1995)
Nye, T.M.W., Lio, P., Gilks, W.R.: A novel algorithm and web-based tool for comparing two alternative phylogenetic trees. Bioinformatics 22, 117–119 (2006)
Yu, C., Deng, M., Yau, S.S.-T.: DNA sequence comparison by a novel probabilistic method. Information Sciences 181, 1484–1492 (2011)
Yu, C., Liang, Q., Yin, C., He, R.L., Yau, S.S.-T.: A novel construction of genome space with biological geometry. DNA Research 17, 155–168 (2010)
Sokal, R., Michener, C.: A statistical method for evaluating systematic relationships. University of Kansas Science Bulletin 38, 1409–1438 (1958)
Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4, 406–425 (1987)
Kumar, S.: A Stepwise Algorithm for Finding Minimum Evolution Trees. Molecular Biology and Evolution 13, 584–593 (1996)
Juang, B.H., Rabiner, L.R.: A probabilistic distance measure for hidden Markov models. AT& T Technical Journal 64, 391–408 (1985)
Tamura, Peterson, Stecher, Nei, Kumar: Phylogenetic and molecular evolutionary analyses were conducted using MEGA version 5 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, M.K., Niyogi, R., Misra, M. (2012). An Experimental Analysis of Phylogenetic Trees Based on Topological Score. In: Satapathy, S.C., Avadhani, P.S., Abraham, A. (eds) Proceedings of the International Conference on Information Systems Design and Intelligent Applications 2012 (INDIA 2012) held in Visakhapatnam, India, January 2012. Advances in Intelligent and Soft Computing, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27443-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-27443-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27442-8
Online ISBN: 978-3-642-27443-5
eBook Packages: EngineeringEngineering (R0)