Md. Abeed Hassan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we present an algorithm to search and rank <i>top-k</i> approximately matched subtrees from a tree database, where the query is a collection of trees <i>i.e</i>. a forest. Even though existing algorithms can handle a single tree query, we argue that forest query would be significantly useful in some real life applications including biological(More)
  • 1