Seriation using tree-penalized path length
From MaRDI portal
Publication:2098032
Recommendations
- An experimental comparison of seriation methods for one-mode two-way data
- Seriation in combinatorial and statistical data analysis
- An Optimal Algorithm for Strict Circular Seriation
- Continuation methods for approximate large scale object sequencing
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
Cites work
- An experimental comparison of seriation methods for one-mode two-way data
- Combinatorial data analysis. Optimization by dynamic programming
- FR3D: Finding local and composite recurrent structural motifs in RNA 3D structures
- scientific article; zbMATH DE number 1750179 (Why is no real title available?)
- scientific article; zbMATH DE number 2231543 (Why is no real title available?)
- Lattice. Multivariate data visualization with R
- Statistical Analysis of Financial Data in S-Plus
- The traveling salesman problem and its variations
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
This page was built for publication: Seriation using tree-penalized path length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2098032)
