Buhler, J., Lavastida, T., Lu, K., and Moseley, B. A Scalable Approximation Algorithm for Weighted Longest Common Subsequence. Retrieved from https://par.nsf.gov/biblio/10351479. International European Conference on Parallel and Distributed Computing . Web. doi:10.1007/978-3-030-85665-6_23.
Buhler, J., Lavastida, T., Lu, K., & Moseley, B. A Scalable Approximation Algorithm for Weighted Longest Common Subsequence. International European Conference on Parallel and Distributed Computing, (). Retrieved from https://par.nsf.gov/biblio/10351479. https://doi.org/10.1007/978-3-030-85665-6_23
Buhler, J., Lavastida, T., Lu, K., and Moseley, B.
"A Scalable Approximation Algorithm for Weighted Longest Common Subsequence". International European Conference on Parallel and Distributed Computing (). Country unknown/Code not available. https://doi.org/10.1007/978-3-030-85665-6_23.https://par.nsf.gov/biblio/10351479.
@article{osti_10351479,
place = {Country unknown/Code not available},
title = {A Scalable Approximation Algorithm for Weighted Longest Common Subsequence},
url = {https://par.nsf.gov/biblio/10351479},
DOI = {10.1007/978-3-030-85665-6_23},
abstractNote = {},
journal = {International European Conference on Parallel and Distributed Computing},
author = {Buhler, J. and Lavastida, T. and Lu, K. and Moseley, B.},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.