Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IPL
2008

favoriteEmaildiscussreport

114views more IPL 2008»

Faster algorithms for guided tree edit distance

13 years 4 months ago

Faster algorithms for guided tree edit distance

Download www.cs.bgu.ac.il

The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a third input forest H is included in F (and G ). The edit operations are relabeling a vertex and deleting a vertex. We show efficient algorithms for this problem that are faster than the previous algorithm for this problem of Peng and Ting [5].

Dekel Tsur

Real-time Traffic

Edit Distance Problem | Edit Operations | Input Forest | IPL 2008 |

claim paper

Related Content

» Designing an A Algorithm for Calculating Edit Distance between RootedUnordered Trees

» Approximate String Matching A Simpler Faster Algorithm

» Statistical Learning Algorithm for Tree Similarity

» Computing the EditDistance between Unrooted Ordered Trees

» Space Efficient Algorithms for Ordered Tree Comparison

» Learning Stochastic Tree Edit Distance

» An Optimal Decomposition Algorithm for Tree Edit Distance

» A Note on BitParallel Alignment Computation

» Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Dekel Tsur

Comments (0)