Segment-based approach for subsequence searches in sequence databases

The time warping distance can be applied to both whole sequence and subsequence searches and fits well with the databases where sequences are of different lengths.

Abstract

Article Share on Segment-based approach for subsequence searches in sequence databases Authors: Sanghyun Park Department of Computer Science, University of California, Los, Angeles, Los Angeles, CA Department of Computer Science, University of California, Los, Angeles, Los Angeles, CAView Profile , Sang-Wook Kim Department of Computer, Information, and Communications Engineering, Kangwon National University, Korea Department of Computer, Information, and Communications Engineering, Kangwon National University, KoreaView Profile , Wesley W. Chu Department of Computer Science, University of California, Los Angeles, Los Angeles, CA Department of Computer Science, University of California, Los Angeles, Los Angeles, CAView Profile Authors Info & Claims SAC '01: Proceedings of the 2001 ACM symposium on Applied computingMarch 2001 Pages 248–252https://doi.org/10.1145/372202.372334Published:01 March 2001Publication History 84citation438DownloadsMetricsTotal Citations84Total Downloads438Last 12 Months17Last 6 weeks0 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 SiteGet Access