Sciweavers

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

102

CPM
2001
Springer

96views Combinatorics» more CPM 2001»

A Fast Algorithm for Optimal Alignment between Similar Ordered Trees

15 years 7 months ago

A Fast Algorithm for Optimal Alignment between Similar Ordered Trees

Download www.df.lth.se

Jesper Jansson, Andrzej Lingas

Real-time Traffic

Combinatorics | CPM 2001 |

claim paper

Related Content

» Near optimal multiple alignment within a band in polynomial time

» Fast and simple XML tree differencing by sequence alignment

» A fast algorithm for determining the best combination of local alignments to a query seque...

» IndexBased Approach to Similarity Search in Protein and Nucleotide Databases

» Fast Image Alignment Using Anytime Algorithms

» Large Grain Size Stochastic Optimization Alignment

» Convergent algorithms for protein structural alignment

» Fingerprint Alignment Using Similarity Histogram

» Efficiently Evaluating Order Preserving Similarity Queries over Historical MarketBasket Da...

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CPM
Authors	Jesper Jansson, Andrzej Lingas

Comments (0)