A practical algorithm to find the best subsequence patterns

Author： Hirao M. Hoshino H. Shinohara A. Takeda M. Arikawa S.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.292, Iss.2, 2003-01, pp. : 465-479

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases

By Loh Woong-Kee Kim Sang-Wook Whang Kyu-Young

Data Mining and Knowledge Discovery, Vol. 9, Iss. 1, 2004-07 ,pp. : 5-28

Springer Publishing Company

Access to resources Recommend Favorite

A fuzzy MCDM algorithm and practical decision aid tool to determine the best ROV design alternative

By Ülker Birol

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 44, Iss. 4, 2015-04 ,pp. : 623-645

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Towards a practical snapshot algorithm

By Riany Y. Shavit N. Touitou D.

Theoretical Computer Science, Vol. 269, Iss. 1, 2001-10 ,pp. : 163-201

Elsevier

Access to resources Recommend Favorite

Find the maximum k-disjoint coverage sets in WSN using genetic algorithm

By Jia Jie Chen Jian Chang Guiran Li Jie

International Journal of Modelling, Identification and Control, Vol. 9, Iss. 1-2, 2010-04 ,pp. : 43-52

Inderscience Publishers

Access to resources Recommend Favorite

Linear algorithm to find the largest intriangles of a planar convex polygon

By Pujari Arun K Nataraj A

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 25, Iss. 5, 1996-05 ,pp. : 53-59

Emerald Group Publishing Ltd

Access to resources Recommend Favorite