extensions

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
extensions [2021/03/15 08:39] – [Lattice Polytopes and Toric Geometry] paffenholzextensions [2021/12/07 13:20] (current) panizzut
Line 14: Line 14:
  
 ===== Tropical Geometry ===== ===== Tropical Geometry =====
 +  * Ewgenij Gawrilow, Michael Joswig, Benjamin Schröter: [[extensions:polytropes|polytropes]] 
 +  * Alheydis Geiger and Marta Panizzut: [[extensions:tropicalquarticcurves|TropicalQuarticCurves]]
   * Michael Joswig, Marta Panizzut, Bernd Sturmfels: [[extensions:tropicalcubics|Tropical Cubics]]   * Michael Joswig, Marta Panizzut, Bernd Sturmfels: [[extensions:tropicalcubics|Tropical Cubics]]
-  * Ewgenij Gawrilow, Michael Joswig, Benjamin Schröter: [[extensions:polytropes|polytropes]] 
   * Simon Hampe: [[https://github.com/simonhampe/atint|Algorithmic tropical intersection theory]] (now bundled with polymake)   * Simon Hampe: [[https://github.com/simonhampe/atint|Algorithmic tropical intersection theory]] (now bundled with polymake)
   * Silke Horn: [[http://solros.de/polymake/tropmat/|Tropical Oriented Matroids]]   * Silke Horn: [[http://solros.de/polymake/tropmat/|Tropical Oriented Matroids]]
Line 29: Line 29:
 ===== Phylogenetics ===== ===== Phylogenetics =====
  
-  * Sven Herrmann: [[http://www.uea.ac.uk/computing/quasidec|QuasiDec]]. This extension contains an algorithm for computing the block decomposition of a quasi-median graph obtained from a set of partitions or a sequence alignment. +  * Sven Herrmann: [[https://www.uea.ac.uk/groups-and-centres/computational-biology/software/quasidec|QuasiDec]]. This extension contains an algorithm for computing the block decomposition of a quasi-median graph obtained from a set of partitions or a sequence alignment. 
-  * Sven Herrmann and Andreas Spillner: [[http://www.uea.ac.uk/computing/comrit|CoMRiT]]. This extensions contains a new application metric introducing finite metric spaces as objects. The core feature is an algorithm to compute a realisation of a finite metric space using the tight-span, as described in Herrmann, Moulton, Spillner: Computing Realizations of Finite Metric Spaces.+  * Sven Herrmann and Andreas Spillner: [[https://www.uea.ac.uk/groups-and-centres/computational-biology/software/comrit|CoMRiT]]. This extensions contains a new application metric introducing finite metric spaces as objects. The core feature is an algorithm to compute a realisation of a finite metric space using the tight-span, as described in Herrmann, Moulton, Spillner: Computing Realizations of Finite Metric Spaces.
  
  
  
  • extensions.1615797562.txt.gz
  • Last modified: 2021/03/15 08:39
  • by paffenholz