A lot of current data is in form of time-series or sequences and the subsequence matching is very important for processing such data. It can be formulated as follows:
- Given a query sequence, find the best-matching subsequence from the sequences in the database.
DISA has a subsequence matching technology demonstrated by the following prototype application:
The demonstration uses our Subsequence Matching Framework that is desribed and can be downloaded in section Software & Data.
- David Novak, Petr Volny, Pavel Zezula. (2012). Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency. In Database and Expert Systems Applications (Vol. 7447, pp. 256–265). Springer Berlin / Heidelberg. Publisher site
- David Novak, Petr Volny, Pavel Zezula. (2012). Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency (No. arXiv:1206.2510v1) (pp. 1–15). arXiv:1206.2510v1
- Petr Volný, David Novák, Pavel Zezula. (2011) Employing Subsequence Matching in Audio Data Processing. Technical Report, Faculty of Informatics, Masaryk University, Brno, 2011. FIMU-RS-2011-04