J
Jason T. L. Wang
Researcher at New Jersey Institute of Technology
Publications - 192
Citations - 4570
Jason T. L. Wang is an academic researcher from New Jersey Institute of Technology. The author has contributed to research in topics: Tree (data structure) & Phylogenetic tree. The author has an hindex of 36, co-authored 191 publications receiving 4299 citations. Previous affiliations of Jason T. L. Wang include Courant Institute of Mathematical Sciences & University of Medicine and Dentistry of New Jersey.
Papers
More filters
Proceedings ArticleDOI
Algorithmics and applications of tree and graph searching
TL;DR: This paper surveys both algorithms and applications for generalizing keyword search to keytree and keygraph searching, because trees and graphs have many applications in next-generation database systems.
Proceedings ArticleDOI
Combinatorial pattern discovery for scientific data: some preliminary results
Jason T. L. Wang,Gung-Wei Chirn,Thomas G. Marr,Bruce A. Shapiro,Dennis Shasha,Kaizhong Zhang +5 more
TL;DR: This paper presents an example of combinatorial pattern discovery: the discovery of patterns in protein databases, which give information that is complementary to the best protein classifier available today.
Journal ArticleDOI
Exact and approximate algorithms for unordered tree matching
TL;DR: An efficient enumerative algorithm and several heuristics leading to approximate solutions to the problem of comparison between unordered trees, i.e., trees for which the order among siblings is unimportant are presented.
Journal ArticleDOI
On the editing distance between undirected acyclic graphs
TL;DR: A constrained distance metric is proposed, called the degree-2 distance, by requiring that any node to be inserted (deleted) have no more than 2 neighbors, and an efficient algorithm is presented to solve the problem of comparing CUAL graphs.
Journal ArticleDOI
An algorithm for finding the largest approximately common substructures of two trees
TL;DR: A dynamic programming algorithm is presented that runs as fast as the fastest known algorithm for computing the edit distance of two trees when the distance allowed in the common substructures is a constant independent of the input trees.