A colored graph approach to perfect phylogeny with persistent characters
A main open question related to character-based tree reconstruction is designing generalizations of the Perfect Phylogeny approach that couple efficient algorithmic solutions to the capability of explaining the input binary data, by allowing back mutations of some characters. Following this goal, th...
|Published in:||Theoretical computer science : the journal of the EATCS, Vol. 658 (2017), p. 60-73|
|Other Involved Persons:||; ; ;|
|QR Code:||Show QR Code|