Combinatorial methods for barcode analysis
From MaRDI portal
Publication:6589167
DOI10.1007/S41468-023-00143-8MaRDI QIDQ6589167FDOQ6589167
Authors: Elena Jaramillo Rodriguez 
Publication date: 19 August 2024
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Permutations, words, matrices (05A05) Persistent homology and applications, topological data analysis (55N31)
Cites Work
- Persistent homology -- a survey
- Topology and data
- Barcodes: The persistent topology of data
- Computing persistent homology
- Combinatorics of Coxeter Groups
- Title not available (Why is that?)
- Stirling polynomials
- Principles of combinatorics
- Representation of a finite graph by a set of intervals on the real line
- Circle graphs and monadic second-order logic
- Generalizations of the permutohedron
- Two families of Newman lattices
- On the join dependency relation in multinomial lattices
- The blossoming of Schröder's fourth problem
- Virtual strings.
- Homotopy invariants of Gauss words
- Lattice theory of the poset of regions
- On the realization of double occurrence words
- Stratifying the space of barcodes using Coxeter complexes
- Four-regular graphs with rigid vertices associated to DNA recombination
- Bruhat interval polytopes
- Permutohedra and associahedra
- Statistics on trapezoidal words and \(k\)-inversion sequences
- Double occurrence words: their graphs and matrices
- Insertions yielding equivalent double occurrence words
- Patterns and distances in words related to DNA rearrangement
- Genus ranges of chord diagrams
- The space of barcode bases for persistence modules
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)
