A colored graph approach to perfect phylogeny with persistent characters

DOI10.1016/j.tcs.2016.08.015zbMath1355.92073OpenAlexW2514535054MaRDI QIDQ728267

Anna Paola Carrieri, Gianluca Della Vedova, Gabriella Trucco, Paola Bonizzoni, Raffaella Rizzi

Publication date: 19 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.015

zbMATH Keywords

perfect phylogenycharacter-based evolutionpersistent phylogeny

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Combinatorial perspectives on Dollo-\(k\) characters in phylogenetics ⋮ Combinatorial views on persistent characters in phylogenetics ⋮ Character-based phylogeny construction and its application to tumor evolution

Uses Software

• SNV-PPILP
• rec-BTP

Cites Work

• Unnamed Item
• The binary perfect phylogeny with persistent characters
• The complexity of reconstructing trees from qualitative characters and subtrees
• The haplotyping problem: an overview of computational models and solutions
• A linear-time algorithm for the perfect phylogeny haplotype problem
• Algorithms on Strings, Trees and Sequences
• A Polynomial-Time Algorithm for Near-Perfect Phylogeny
• Incomplete Directed Perfect Phylogeny
• When and How the Perfect Phylogeny Model Explains Evolution
• On the Generalised Character Compatibility Problem for Non-branching Character Trees
• Efficient algorithms for inferring evolutionary trees
• Minimizing phylogenetic number to find good evolutionary trees

This page was built for publication: A colored graph approach to perfect phylogeny with persistent characters