A pattern recognition-based approach for phylogenetic network construction with constrained recombination

DOI10.1016/J.PATCOG.2006.06.020zbMATH Open1103.68795OpenAlexW2006071493MaRDI QIDQ850133FDOQ850133

M. A. H. Zahid, Ankush Mittal, Ramesh C. Joshi

Publication date: 15 November 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.06.020

Recommendations

• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• Seeing the trees and their branches in the network is hard
• Research in Computational Molecular Biology
• The fine structure of galls in phylogenetic networks
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study

zbMATH Keywords

pattern recognitionSNPrecombinationphylogenetic networkevolutionary relationshipGall trees

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• The fine structure of galls in phylogenetic networks
• Reconstructing evolution of sequences subject to recombination using parsimony
• Title not available (Why is that?)

Cited In (3)

• Towards the development of computational tools for evaluating phylogenetic network reconstruction methods
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• Bounding the number of hybridisation events for a consistent evolutionary history

Uses Software

• SplitsTree
• T-REX

This page was built for publication: A pattern recognition-based approach for phylogenetic network construction with constrained recombination

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