Bibliography#
This page lists all references cited throughout the PhyloZoo documentation.
Kenneth Kalmanson. Edgeconvex circuits and the traveling salesman problem. Canadian Journal of Mathematics, 27(5):1000–1010, 1975.
Michael Held and Richard M. Karp. A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics, 10(1):196–210, 1962. doi:10.1137/0110015.
Nicos Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. In Technical Report 388. Pittsburgh, PA, USA, 1976.
John A Rhodes. Topological metrizations of trees, and new quartet methods of tree inference. IEEE/ACM transactions on computational biology and bioinformatics, 17(6):2107–2118, 2019.
Elizabeth S Allman, Hector Baños, and John A Rhodes. Nanuq: a method for inferring species networks from gene trees under the coalescent model. Algorithms for Molecular Biology, 14(1):24, 2019.
Niels Holtgrefe, Katharina T Huber, Leo van Iersel, Mark Jones, Samuel Martin, and Vincent Moulton. Squirrel: reconstructing semi-directed phylogenetic level-1 networks from four-leaved networks or sequence alignments. Molecular Biology and Evolution, 42(4):msaf067, 2025.
Elizabeth S Allman, Hector Baños, John A Rhodes, and Kristina Wicke. Nanuq+: a divide-and-conquer approach to network estimation. Algorithms for Molecular Biology, 20(1):14, 2025.
Niels Holtgrefe, Elizabeth S Allman, Hector Baños, Leo van Iersel, Vincent Moulton, John A Rhodes, and Kristina Wicke. Distinguishing phylogenetic level-2 networks with quartets and inter-taxon quartet distances. Bulletin of Mathematical Biology, 87(12):168, 2025. doi:10.1007/s11538-025-01549-4.
Laura Jetten and Leo van Iersel. Nonbinary tree-based phylogenetic networks. IEEE/ACM transactions on computational biology and bioinformatics, 15(1):205–217, 2016.
Philippe Gambette, Vincent Berry, and Christophe Paul. The structure of level-k phylogenetic networks. In Annual Symposium on Combinatorial Pattern Matching, 289–300. Springer, 2009.