New dissimilarity measure for recognizing noisy subsequence trees (Q2997938): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on tree edit distance and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered and Unordered Tree Inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the unit cost editing distance between trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph distance metric based on the maximal common subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the editing distance between unordered labeled trees / rank
 
Normal rank

Latest revision as of 00:24, 4 July 2024

scientific article
Language Label Description Also known as
English
New dissimilarity measure for recognizing noisy subsequence trees
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references