Seriation using tree-penalized path length (Q2098032): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5706832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental comparison of seriation methods for one-mode two-way data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problem heuristics: leading methods, implementations and latest advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5434187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FR3D: Finding local and composite recurrent structural motifs in RNA 3D structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Analysis of Financial Data in S-Plus / rank
 
Normal rank

Latest revision as of 20:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Seriation using tree-penalized path length
scientific article

    Statements

    Seriation using tree-penalized path length (English)
    0 references
    0 references
    0 references
    17 November 2022
    0 references
    combinatorial optimization
    0 references
    linear orderings
    0 references
    optimal leaf ordering
    0 references
    tree penalized distance
    0 references
    TSP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers