scientific article; zbMATH DE number 1305084

From MaRDI portal
Publication:4252025

zbMath0932.68066MaRDI QIDQ4252025

Philip N. Klein

Publication date: 13 March 2000


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (31)

Generalized LCSA relation between edit distance for ordered trees and edit distance for Euler stringsApproximating tree edit distance through string edit distanceA survey on tree matching and XML retrievalOn the hardness of computing the edit distance of shallow treesFast Algorithms for Computing Tree LCSUnnamed ItemGood edit similarity learning by loss minimizationA theory of subtree matching and tree kernels based on the edit distance conceptRNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.Comparing similar ordered trees in linear-timeSpace efficient algorithms for ordered tree comparisonLearning probabilistic models of tree edit distanceNew dissimilarity measure for recognizing noisy subsequence treesFast RNA structure alignment for crossing input structuresAlgorithms for finding a most similar subforestAverage complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithmFinding common structured patterns in linear graphsFaster algorithms for guided tree edit distanceA survey on tree edit distance and related problemsAn improved algorithm for tree edit distance with applications for RNA secondary structure comparisonA new algorithm for computing similarity between RNA structuresFast algorithms for computing tree LCSAlignment distance of regular tree languagesAlignment distance of regular tree languagesFast RNA Structure Alignment for Crossing Input StructuresA Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression.Decomposition algorithms for the tree edit distance problemEdit distance between unlabeled ordered treesTree edit distance with gapsComputing similarity between RNA structures




This page was built for publication: