Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...