Efficient algorithms for finding a longest common increasing subsequence - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu. Efficient algorithms for finding a longest common increasing subsequence. J. Comb. Optim., 13(3):277-288, 2007. [doi]

This author has not been identified. Look up 'Wun-Tat Chan' in GoogleThis author has not been identified. Look up 'Yong Zhang' in GoogleThis author has not been identified. Look up 'Stanley P. Y. Fung' in GoogleThis author has not been identified. Look up 'Deshi Ye' in GoogleThis author has not been identified. Look up 'Hong Zhu' in Google

runs on WebDSL