A Heuristic for the Live Parsimony Problem

  • Rogério Güths
  • Guilherme P. Telles
  • Maria Emilia M. T. Walter
  • Nalvo F. AlmeidaEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 881)


Live Phylogeny generalizes the phylogeny theory by admitting living ancestors among the taxonomic objects. This theory suits cases of fast-evolving species like virus, and phylogenies of non-biological objects like documents, images and database records. In character-based live phylogeny, the input is a matrix with n objects and m characters, such each position ij keeps the state of character j for the object i. The output is a tree where the input objects are represented as leaves or internal nodes labeled with a string of m symbols, representing the state of the characters. The goal is to obtain a tree with the minimal number of state changes along the edges, considering all characters, called the most parsimonious tree. In this paper we analyze problems related to most parsimonious tree using Live Phylogeny. We propose an improvement to a previously presented branch-and-bound algorithm and also a new heuristic for the problem. We present the results of experiments with a set of 20 Zika virus genome sequences, comparing the performance of our heuristic.


Phylogeny Character state phylogeny Live phylogeny Parsimony Algorithms 



RG and NFA thank Fundect grants TO141/2016 and TO 007/2015. NFA also thanks CNPq grants 305857/2013-4, 473221/2013-6 and CAPES grant 3377/2013. GPT acknowledges CNPq grant 310685/2015-0. MEMT thanks CNPq grant 308524/2015-2.


  1. 1.
    Cartresana, J.: Selection of conserved blocks from multiple alignments for their use in phylogenetic analysis. Mol. Biol. Evol. 17, 540–552 (2000)CrossRefGoogle Scholar
  2. 2.
    Castro-Nallar, E., Perez-Losada, M., Burton, G., Crandall, K.: The evolution of HIV: inferences using phylogenetics. Mol. Phylog. Evol. 62, 777–792 (2012)CrossRefGoogle Scholar
  3. 3.
    Cuadros, A.M., Paulovich, F.V., Minghim, R., Telles, G.P.: Point placement by phylogenetic trees and its application to visual analysis of document collections. In: Proceedings of the 2007 IEEE Symposium on Visual Analytics Science and Technology, pp. 99–106 (2007)Google Scholar
  4. 4.
    Edgar, R.C.: Muscle: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res. 32(5), 1792–1797 (2004)CrossRefGoogle Scholar
  5. 5.
    Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Sunderland (2004)Google Scholar
  6. 6.
    Fitch, W.M.: Toward defining the course of evolution: minimum change for a specific tree topology. Syst. Zool. 20, 406–416 (1971)CrossRefGoogle Scholar
  7. 7.
    Goëffon, A., Richer, J., Hao, J.: Heuristic methods for phylogenetic reconstruction with maximum parsimony, pp. 579–597. Wiley (2011)CrossRefGoogle Scholar
  8. 8.
    Gojobori, T., Moriyama, E.N., Kimura, M.: Molecular clock of viral evolution, and the neutral theory. P. Natl. Acad. Sci. 87(24), 10015–10018 (1990)CrossRefGoogle Scholar
  9. 9.
    Güths, R., Telles, G.P., Walter, M.E.M.T., Almeida, N.F.: A branch and bound for the large live parsimony problem. In: Proceedings of the 10th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2017), pp. 184–189. SCITEPRESS - Science and Technology Publications, Lda (2017)Google Scholar
  10. 10.
    Hendy, M.D., Penny, D.: Branch and bound algorithms to determine minimal evolutionary trees. Math. Biosci. 59(2), 277–290 (1982)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Jones, N.C., Pevzner, P.A., Pevzner, P.: An Introduction to Bioinformatics Algorithms, vol. 2004. MIT Press, Cambridge (2004)Google Scholar
  12. 12.
    Lanciotti, R., Lambert, A., Holodniy, M., Saavedra, S., Signor, L.: Phylogeny of Zika virus in western hemisphere, 2015. Emerg. Infect. Dis. 22(5), 933–935 (2016)CrossRefGoogle Scholar
  13. 13.
    Paiva, J., Florian, L., Pedrini, H., Telles, G., Minghim, R.: Improved similarity trees and their application to visual data classification. IEEE Trans. Vis. Comp. Graph. 17(12), 2459–2468 (2011)CrossRefGoogle Scholar
  14. 14.
    Sankoff, D.: Minimal mutation trees of sequences. SIAM J. Appl. Math. 28(1), 35–42 (1975)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Setubal, J.C., Meidanis, J.: Introduction to Molecular Computational Biology, vol. 1997. PWS, Boston (1997)Google Scholar
  16. 16.
    Telles, G.P., Almeida, N.F., Minghim, R., Walter, M.E.M.T.: Live phylogeny. J. Comput. Biol. 20(1), 30–37 (2013)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Yan, M., Bader, D.A.: Fast character optimization in parsimony phylogeny reconstruction. Technical report TR-CS-2003-53. University of New Mexico (2003)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Rogério Güths
    • 1
  • Guilherme P. Telles
    • 2
  • Maria Emilia M. T. Walter
    • 3
  • Nalvo F. Almeida
    • 1
    Email author
  1. 1.School of ComputingFederal University of Mato Grosso do SulCampo GrandeBrazil
  2. 2.Institute of ComputingUniversity of CampinasCampinasBrazil
  3. 3.Department of Computer ScienceUniversity of BrasiliaBrasiliaBrazil

Personalised recommendations