2017
DOI: 10.1016/j.tcs.2016.08.015
|View full text |Cite
|
Sign up to set email alerts
|

A colored graph approach to perfect phylogeny with persistent characters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
7
1
1

Relationship

4
5

Authors

Journals

citations
Cited by 16 publications
(25 citation statements)
references
References 16 publications
0
25
0
Order By: Relevance
“…We note that the binary matrix used in these papers is precisely the binary factor matrix obtained from the multi-state matrix A and state trees . While a restricted variant of the k = 1 case was recently shown to be solvable in polynomial time ( Bonizzoni et al. , 2017a ), the hardness for remains an open question.…”
Section: Methodsmentioning
confidence: 99%
“…We note that the binary matrix used in these papers is precisely the binary factor matrix obtained from the multi-state matrix A and state trees . While a restricted variant of the k = 1 case was recently shown to be solvable in polynomial time ( Bonizzoni et al. , 2017a ), the hardness for remains an open question.…”
Section: Methodsmentioning
confidence: 99%
“…We denote as Dollo(k) the evolutionary model in which each mutation can be acquired exactly once and can be lost at most k times. In this way Dollo(0) and Dollo(1) correspond to the perfect [21] and persistent [37][38][39] phylogeny models, respectively. In the tree generation process for the Dollo(k) model (k > 0) we are required to augment a perfect phylogeny representing the cancer progression by adding nodes which represent the loss of a mutation, i.e., a node labeled m − l , representing the potential losses.…”
Section: Methodsmentioning
confidence: 99%
“…(1), (2). We stress the fact that decision problem of determine if an incomplete matrix admits a Perfect Phylogeny can be seen as checking if the former problem has zero value or equivalently a feasible solution for restrictions (1) and (3). The total number of variables and constraints in the formulation are in O(nm + m 2 ) and O(nm 2 ) respectively.…”
Section: Objective Functionmentioning
confidence: 99%
“…Moreover, we denote by Dollo(k) the restriction of the Dollo model where each character can be lost at most k times in the entire tree. Clearly, the Persistent Phylogeny [1] corresponds to the Dollo(1) model which has been recently investigated in several works aiming to develop efficient solutions for the model [3,4,16] since its use is motivated also in other contexts [2,26]. In particular, in [1] it is proved that the Persistent Phylogeny Problem over a binary matrix M can be formulated as finding a special completion of an extended matrix M e that is a Perfect Phylogeny.…”
Section: Introductionmentioning
confidence: 99%