z-logo
open-access-imgOpen Access
An Optimal Way to Index Searching of Duality-Based Time-Series Subsequence Matching
Author(s) -
Sang-Wook Kim,
Dae-Hyun Park,
H. Lee
Publication year - 2004
Publication title -
the kips transactions partd
Language(s) - English
Resource type - Journals
ISSN - 1598-2866
DOI - 10.3745/kipstd.2004.11d.5.1003
Subject(s) - subsequence , matching (statistics) , computer science , sequence (biology) , series (stratigraphy) , tree (set theory) , join (topology) , r tree , longest increasing subsequence , pattern matching , index (typography) , algorithm , blossom algorithm , window (computing) , theoretical computer science , data mining , spatial database , mathematics , combinatorics , artificial intelligence , spatial analysis , bounded function , mathematical analysis , paleontology , statistics , biology , world wide web , genetics , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom