Approximating the longest approximate common subsequence problem
Wen‐Chen Hu, Gerhard X. Ritter, Mark S. Schmalz · 1998
Article Free Access Share on Approximating the longest approximate common subsequence problem Authors: Wen-Chen Hu Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FloridaView Profile , Gerhard X. Ritter Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FloridaView Profile , Mark S. Schmalz Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FloridaView Profile Authors Info & Claims ACM-SE 36: Proceedings of the 36th annual Southeast regional conferenceApril 1998 Pages 166–172https://doi.org/10.1145/275295.283951Online:01 April 1998Publication History 5citation427DownloadsMetricsTotal Citations5Total Downloads427Last 12 Months12Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF