Title
A Heuristic for the Live Parsimony Problem
Abstract
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 i, j 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.
Year
DOI
Venue
2017
10.1007/978-3-319-94806-5_14
BIOMEDICAL ENGINEERING SYSTEMS AND TECHNOLOGIES (BIOSTEC 2017)
Keywords
Field
DocType
Phylogeny,Character state phylogeny,Live phylogeny Parsimony,Algorithms
Zika virus,Heuristic,Matrix (mathematics),Computer science,Theoretical computer science,Artificial intelligence,Phylogenetics,Machine learning
Conference
Volume
ISSN
Citations 
881
1865-0929
0
PageRank 
References 
Authors
0.34
3
4
Name
Order
Citations
PageRank
Rogério Güths100.34
Guilherme P. Telles219524.72
Maria Emilia M. T. Walter33714.23
Nalvo F. Almeida454.94