Author

Yangjun Chen

2 articles in our journals

Articles where this person is an author, newest first. People are matched by their name as printed (no ORCID iD is recorded for them), not by name alone; search the name as text to find namesakes too.

Research ArticleOpen accessA New Algorithm for Subset Matching ProblemYangjun ChenThe subset matching problem is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text position is a set of characters drawn from some alphabet ∑. The pattern is said to occur at text position i if the set p[j] is a subset of the … …Journal of Computer Science, Vol. 3, Issue 12 · 31 Dec 2007 · 6,737 accessesView PDF Cite

Research ArticleOpen accessAn Efficient Algorithm for Tree Mapping in XML DatabasesYangjun ChenIn this article, we discuss an efficient algorithm for tree mapping problem in XML databases. Given a target tree T and a pattern tree Q, the algorithm can find all the embeddings of Q in T in O(|T||Q|) time while the existing approaches need exponential time in the worst case. …Journal of Computer Science, Vol. 3, Issue 7 · 21 Jul 2007 · 6,567 accessesView PDF Cite