Jia Jie Liu

Learn More
In this paper, we propose an O(min{mN, Mn}) time algorithm for finding a longest common subsequence of strings X and Y with lengths M and N, respectively, and run-length-encoded lengths m and n, respectively. We propose a new recursive formula for finding a longest common subsequence of Y and X which is in the run-length-encoded format. That is, Y =y 1 y 2(More)
The modern human mandibular symphysis differs from those of all other primates in being vertically orientated and possessing a chin, but the functional significance of this unique morphology is not well understood. Some hypotheses propose that it is an adaptation to specific loads occurring during masticatory function. This study uses finite element(More)
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) space, for two strings of lengths m and n, with m and n runs, respectively. We assume the linear-gap model and make no assumption on the scoring matrices, which maximizes the(More)
A strong alliance in a graph G=(V,E) is a set of vertices S⊆V satisfying the condition that, for each v∈S, the number of its neighbors, including itself, in S is greater than the number of those neighbors not in S. A strong alliance S is global if S forms a dominating set of G. In this paper, we shall propose a way for finding a minimum global strong(More)
Recent developments in simulating musculoskeletal functioning in the craniofacial complex using multibody dynamic analysis and finite elements analysis enable comprehensive virtual investigations into musculoskeletal form and function. Because the growth of the craniofacial skeleton is strongly influenced by mechanical functioning, these methods have(More)
Finite elements analysis (FEA) is now used routinely to interpret skeletal form in terms of function in both medical and biological applications. To produce accurate predictions from FEA models, it is essential that the loading due to muscle action is applied in a physiologically reasonable manner. However, it is common for muscle forces to be represented(More)
Given a set S={S 1,S 2,…,S l } of l strings, a text T, and a natural number k, find a string M, which is a concatenation of k strings (not necessarily distinct, i.e., a string in S may occur more than once in M) from S, whose longest common subsequence with T is largest, where a string in S may occur more than once in M. Such a string is called a k-inlay.(More)