Constructing circular phylogenetic networks from weighted quartets using simulated annealing

DOI10.1016/J.MBS.2011.11.003MaRDI QIDQ423083zbMATH OpenOpenAlexWikidataFDO

Authors Changiz Eslahchi, Reza Hassanzadeh, Ehsan Mottaghi, Mahnaz Habibi, Hamid Pezeshk, Mehdi Sadeghi

Publication date 18 May 2012

Published in Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mbs.2011.11.003

zbMATH Keywords

circular orderingsupernetworks

Mathematics Subject Classification ID

Mathematical programming (90C99) Systems biology, networks (92C42) Problems related to evolution (92D15)

Recommendations

• Consistency of the QNet algorithm for generating planar split networks from weighted quartets
• Constructing optimal trees from quartets
• scientific article; zbMATH DE number 1746441
• Reconstructing a phylogenetic level-1 network from quartets
• Fishing for minimum evolution trees with neighbor-nets

Cites work

• Cyclic permutations and evolutionary trees
• Equation of state calculations by fast computing machines
• scientific article; zbMATH DE number 1455130 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• Optimization by simulated annealing
• Unique reconstruction of tree-like phylogenetic networks from distances between leaves

Cited in

(1)

• Consistency of the QNet algorithm for generating planar split networks from weighted quartets

Describes a project that uses

Uses Software

• Spectronet
• QNet
• Matlab

This page was built for publication: Constructing circular phylogenetic networks from weighted quartets using simulated annealing

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