Evolutionary relationships between species are usually inferred through phylogenetic analysis, which provides phylogenetic trees computed from allelic profiles built by sequencing specific regions of the sequences and abstracting them to categorical indexes. With growing exchanges of people and merchandise, epidemics have become increasingly important, and combining information of country-specific datasets can now reveal unknown spreading patterns. The phylogenetic analysis workflow is mainly composed of four consecutive steps, the distance calculation, distance correction, inference algorithm, and local optimization steps. There are many phylogenetic tools out there, however most implement only some of these steps and serve only one single purpose, such as one type of algorithm. Another problem with these is that they are often hard to use and integrate, since each of them has its own API. This project resulted a library that implements the four steps of the workflow, and is highly performant, extensible, reusable, and portable, while providing common APIs and documentation. It also differs from other tools in the sense that, it is able to stop and resume the workflow whenever the user desires, and it was built to be continuously extended and not just serve a single purpose. The time benchmarks conducted on this library show that its implementations of the algorithms conform to their theoretical time complexity. Meanwhile, the memory benchmarks showcase that the implementations of the NJ algorithms follow a linear memory complexity, while the implementations of the MST and GCP algorithms follow a quadratic memory complexity.
phylo2vec: a library for vector-based phylogenetic tree manipulation
University of Copenhagen(哥本哈根大学);eScience Institute, University of Washington(华盛顿大学e科学研究所);MRC Centre for Global Infectious Disease Analysis, Imperial College London(帝国理工学院全球传染病分析医学研究委员会中心)
Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
Delft University of Technology(代尔夫特理工大学);Middlesex University(米德尔塞克斯大学);ISEM, Université de Montpellier(蒙彼利埃大学生物演化与多样性研究所);LIGM, CNRS, Univsersité Gustave Eiffel(巴黎-塞纳河东高等学院计算机科学与数字科学实验室);Univsersité Gustave Eiffel(古斯塔夫·艾菲尔大学)
Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation
Department of Pure and Applied Mathematics, Graduate School of Fundamental Science and Engineering, Waseda University(早稻田大学基础理工学研究科应用数学系);Department of Applied Mathematics, Faculty of Science and Engineering, Waseda University(早稻田大学理工学部应用数学系)