An approximation algorithm for the shortest common supersequence problem: an experimental analysis - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Paolo Barone, Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri. An approximation algorithm for the shortest common supersequence problem: an experimental analysis. In Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), March 11-14, 2001, Las Vegas, NV, USA. pages 56-60, ACM, 2001. [doi]

This author has not been identified. Look up 'Paolo Barone' in GoogleThis author has not been identified. Look up 'Paola Bonizzoni' in GoogleThis author has not been identified. Look up 'Gianluca Della Vedova' in GoogleThis author has not been identified. Look up 'Giancarlo Mauri' in Google

runs on WebDSL