Paper Info
Title
A Branch And Bound For The Large Live Parsimony Problem
Abstract
In the character-based phylogeny reconstruction for n objects and m characters, the input is an nxm-matrix such that position i, j keeps the state of character j for the object i and the output is a binary rooted tree, where the input objects are represented as leaves and each node v is labeled with a string of m symbols v1... vm, v j representing the state of character j, with minimal number of state changes along the edges of the tree, considering all characters. This is called the Large Parsimony Problem. Live Phylogeny theory 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 this paper we analyze problems related to most parsimonious tree using Live Phylogeny. We introduce the Large Live Parsimony Problem (LLPP), prove that it is NP-complete and provide a branch and bound solution. We also introduce and solve a simpler version, Small Live Parsimony Problem (SLPP), which is used in the branch and bound.
Year
DOI
Venue
2017
10.5220/0006219001840189
PROCEEDINGS OF THE 10TH INTERNATIONAL JOINT CONFERENCE ON BIOMEDICAL ENGINEERING SYSTEMS AND TECHNOLOGIES, VOL 3: BIOINFORMATICS
Keywords
Field
DocType
Phylogeny, Character State Phylogeny, Live Phylogeny, Parsimony, Algorithms
Branch and bound,Computer science,Theoretical computer science,Artificial intelligence,Machine learning
Conference
Citations 
PageRank 
References 
2
0.72
0
Authors
4
Name
Order
Citations
PageRank
Rogério Güths120.72
Guilherme P. Telles219524.72
Maria Emilia M. T. Walter33714.23
Nalvo F. Almeida454.94