Combinatorial methods for barcode analysis
From MaRDI portal
Publication:6589167
Cites work
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Barcodes: The persistent topology of data
- Bruhat interval polytopes
- Circle graphs and monadic second-order logic
- Combinatorics of Coxeter Groups
- Computing persistent homology
- Double occurrence words: their graphs and matrices
- Four-regular graphs with rigid vertices associated to DNA recombination
- Generalizations of the permutohedron
- Genus ranges of chord diagrams
- Homotopy invariants of Gauss words
- Insertions yielding equivalent double occurrence words
- Lattice theory of the poset of regions
- On the join dependency relation in multinomial lattices
- On the realization of double occurrence words
- Patterns and distances in words related to DNA rearrangement
- Permutohedra and associahedra
- Persistent homology -- a survey
- Principles of combinatorics
- Representation of a finite graph by a set of intervals on the real line
- Statistics on trapezoidal words and \(k\)-inversion sequences
- Stirling polynomials
- Stratifying the space of barcodes using Coxeter complexes
- The blossoming of Schröder's fourth problem
- The space of barcode bases for persistence modules
- Topology and data
- Two families of Newman lattices
- Virtual strings.
This page was built for publication: Combinatorial methods for barcode analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589167)