A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Conference Paper) | NSF PAGES

skip to main content

Citation Details

A Scalable Approximation Algorithm for Weighted Longest Common Subsequence

Award ID(s):: 1845146 1725661

NSF-PAR ID:: 10351479

Author(s) / Creator(s):: Buhler, J.; Lavastida, T.; Lu, K.; Moseley, B.

Date Published:: 2021-04-01

Journal Name:: International European Conference on Parallel and Distributed Computing

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1007/978-3-030-85665-6_23