A relation between edit distance for ordered trees and edit distance for Euler strings (Q845840): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969871814 / 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: New Algorithm for Ordered Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low distortion embeddings for edit distance / 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: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank
 
Normal rank

Latest revision as of 10:57, 2 July 2024

scientific article
Language Label Description Also known as
English
A relation between edit distance for ordered trees and edit distance for Euler strings
scientific article

    Statements

    A relation between edit distance for ordered trees and edit distance for Euler strings (English)
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    algorithms
    0 references
    edit distance
    0 references
    ordered trees
    0 references
    alignment
    0 references
    Euler string
    0 references
    0 references