Parsimonious migration history problem: complexity and algorithms

DOI10.4230/LIPICS.WABI.2018.24MaRDI QIDQ5090365zbMATH OpenOpenAlexFDO

Authors Mohammed El-Kebir

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPIcs.WABI.2018.24

zbMATH Keywords

fixed parameter tractabilityinfectionmaximum parsimonymetastasisphylogeneticsphylogeographyreconciliation

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Problems related to evolution (92D15)

Recommendations

• scientific article; zbMATH DE number 1303534
• Tree Compatibility and Inferring Evolutionary History
• scientific article; zbMATH DE number 437563
• Algorithms for phylogeny reconstruction in a new mathematical model
• Combinatorial Pattern Matching

Cites work

• Minimal Mutation Trees of Sequences
• Reducibility among combinatorial problems

Cited in

(3)

• Dispersal routes reconstruction and the minimum cost arborescence problem
• Population migration: A meta-heuristics for stochastic approaches to constraint satisfaction problems
• Inferring temporally consistent migration histories

This page was built for publication: Parsimonious migration history problem: complexity and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090365)