Constrained tree editing (Q1328503): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 17:02, 22 May 2024

scientific article

Language	Label	Description	Also known as
English	Constrained tree editing	scientific article

Statements

scholarly article

0 references

Constrained tree editing (English)

0 references

zbMATH Open document ID

0 references

10.1016/0020-0255(94)90004-3

0 references

0 references

Information Sciences

0 references

publication date

19 September 1995

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

graphs

0 references

webs

0 references

strings

0 references

trees

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0020-0255(94)90004-3

0 references

0 references

A common basis for similarity measures involving two strings†

0 references

A Tree-to-Tree Distance and Its Application to Cluster Analysis

0 references

A Tree-Matching Algorithm Based on Node Splitting and Merging

0 references

Constrained string editing

0 references

Recognition of Noisy Subsequences Using Constrained Edit Distances

0 references

An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules

0 references

The tree-to-tree editing problem

0 references

The Tree-to-Tree Correction Problem

0 references

The String-to-String Correction Problem

0 references

Simple Fast Algorithms for the Editing Distance between Trees and Related Problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1328503

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1328503&oldid=34129109"