Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper
Query: An optimal decomposition algorithm for tree edit distance
Simple fast algorithms for the editing distance between trees and related problems
Streaming algorithms for embedding and computing edit distance in the low distance regime
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
A partition-based method for string similarity joins with edit-distance constraints
Bed-tree: an all-purpose index structure for string similarity search based on edit distance
The Continuous Hint Factory - Providing Hints in Vast and Sparsely Populated Edit Distance Spaces
Accelerating Levenshtein and Damerau edit distance algorithms using GPU with unified memory
Tree Edit Distance Learning via Adaptive Symbol Embeddings
A parallel Smith-Waterman algorithm based on divide and conquer
Computing Geodesic Distances in Tree Space
Efficient parallel partition-based algorithms for similarity search and join with edit distance constraints
The Gilbert-Johnson-Keerthi Distance Algorithm
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction
Fast and simple XML tree differencing by sequence alignment
The Tree-to-Tree Correction Problem
On-Line Construction of Suffix Trees
Algorithms for trie compaction
Engineering a compressed suffix tree implementation
HE INVERSE ECCENTRIC PROBLEM ON TREES UNDER THE H AMMING DISTANCE
Levenshtein distance for graph spectral features
The Dichromatic Reflection Model - Future Research Directions and Applications.
Predictive Analytics for Supply Chains: a Systematic Literature Review
CRONets: Cloud-Routed Overlay Networks
A systematic review of the job-stress intervention evaluation literature, 1990-2005.
Introducing efficient parallelism into approximate string matching and a new serial algorithm