Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index
Authors:
- 27 August 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 585-600
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Indexing multi-dimensional time-series with support for multiple distance measures2003
- Warping indexes with envelope transforms for query by humming2003
- Exact Indexing of Dynamic Time Warping2002
- Efficient time-series subsequence matching using duality in constructing windowsInformation Systems, 2001
- Efficient similarity search in sequence databases1993
- Dynamic Programming Algorithm Optimization for Spoken Word Recognition1990