Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
DOI10.1007/s00285-017-1197-3zbMath1397.92465OpenAlexW2776775512WikidataQ47178417 ScholiaQ47178417MaRDI QIDQ1659722
Christian Höner zu Siederdissen, Sarah J. Berkemer, Nancy Retzlaff, Peter F. Stadler, Thomas Gatter, Sonja J. Prohaska, Fabian Gärtner
Publication date: 22 August 2018
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00285-017-1197-3
phylogenetic combinatoricsevolution of gene clustersHamiltonian path problemsKalmanson metricsnon-homologous recombinationunequal crossing over
Applications of statistics to biology and medical sciences; meta analysis (62P10) Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10) Eulerian and Hamiltonian graphs (05C45) Computational methods for problems pertaining to biology (92-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm to recognize Robinsonian dissimilarities
- The neighbor-net algorithm
- Consistency of the QNet algorithm for generating planar split networks from weighted quartets
- A canonical decomposition theory for metrics on a finite set
- Free trees and bidirectional trees as representations of psychological distance
- A note on circular decomposable metrics
- A note on the metric properties of trees
- Steps toward accurate reconstructions of phylogenies from gene-order data.
- Affine and projective tree metric theorems
- An exceptional split geometry
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Cuts in cyclically ordered sets
- Partial and complete cyclic orders
- Total Ordering Problem
- A Geometric Approach to Betweenness
- Unrooted trees for numerical taxonomy
- The structure of circular decomposable metrics
- Edgeconvex Circuits and the Traveling Salesman Problem
- Seriation and matrix reordering methods: An historical overview
- A note on the tree realizability of a distance matrix
This page was built for publication: Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
