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

DOI10.1016/S0040-5809(02)00004-7MaRDI QIDQ851299zbMATH OpenOpenAlexWikidataFDO

Authors 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

SNPAlgorithmRecombinationTopology

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)

Recommendations

• scientific article; zbMATH DE number 2013796
• The Minimum Entropy Mapping Spectrum of a DNA Sequence
• The arithmetic topology of genetic alignments
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
• Minimal entropy probability paths between genome families
• Directed graphs of DNA sequences and their numerical characterization
• On the unranked topology of maximally probable ranked gene tree topologies
• scientific article; zbMATH DE number 434723

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

Cited in

(5)

• The Minimum Entropy Mapping Spectrum of a DNA Sequence
• scientific article; zbMATH DE number 2013796 (Why is no real title available?)
• Some notes on the combinatorial properties of haplotype tagging
• On the minimum number of recombination events in the evolutionary history of DNA se\-quences
• Quantifying genetic innovation: mathematical foundations for the topological study of reticulate evolution

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

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