On the minimum number of topologies explaining a sample of DNA sequences

DOI10.1016/S0040-5809(02)00004-7zbMath1102.92043OpenAlexW2088402835WikidataQ52028639 ScholiaQ52028639MaRDI QIDQ851299

Carsten Wiuf

Publication date: 20 November 2006

Published in: Theoretical Population Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0040-5809(02)00004-7

zbMATH Keywords

AlgorithmTopologySNPRecombination

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08) Algorithms in computer science (68W99)

Related Items (1)

Some notes on the combinatorial properties of haplotype tagging

Cites Work

• An idealized concept of the true cladistic character
• Efficient algorithms for inferring evolutionary trees
• Subtree transfer operations and their induced metrics on evolutionary trees

This page was built for publication: On the minimum number of topologies explaining a sample of DNA sequences