Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Oct 5, 2012 · We investigate the problem of reconstructing a near perfect phylogeny over a binary set of characters where characters are persistent: ...
In this framework, persistent characters allow to infer phylogenies by using the gain and loss of introns [19]. We define a generalization of the (rooted) ...
The perfect phylogeny is one of the most investigated models in different areas of computational biology. This model derives from a restriction of the ...
This paper develops a parameterized algorithm for solving the Persistent Perfect Phylogeny problem where the parameter is the number of characters and ...
Mar 27, 2020 · A bi- nary character is called persistent, if it can be realized on a phylogenetic tree by at most one 0 → 1 transition followed by at most one ...
People also ask
We investigate the problem of reconstructing a near perfect phylogeny over a binary set of characters where characters are persistent.
Chiara Braghin, Riccardo Dondi, Gabriella Trucco, Paola Bonizzoni: The Binary Perfect Phylogeny with Persistent characters. CoRR abs/1110.6739 (2011).
The so-called binary perfect phylogeny with persistent characters has recently been thoroughly studied in computational biology as it is less restrictive ...
Nov 21, 2024 · Multi-State Perfect Phylogeny is an extension of Binary Perfect Phylogeny where characters are allowed more than two states.
Oct 17, 2014 · In this paper we consider the computational problem of explaining binary data by the Persistent Perfect Phylogeny model (referred as PPP) and ...