A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application
Summary: Introduces a subsequence matching framework with gaps-range-tolerances in both query and target, plus max-gap and min-match constraints for Q-by-humming. A space- and time-efficient DP method finds the best-matching subsequence under these constraints, demonstrated on 2D music time-series and outperforming DP-based and probabilistic baselines. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alexios Kotsifakos (University of Athens)
- 2. Panagiotis Papapetrou (Aalto University)
- 3. Jaakko Hollmén (Aalto University)
- 4. Dimitrios Gunopulos (University of Athens)
BibTeX Citation
@article{kotsifakos_vldb11,
title = {{A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application}},
author = {Kotsifakos, Alexios and Papapetrou, Panagiotis and Hollmén, Jaakko and Gunopulos, Dimitrios},
journal = {PVLDB},
series = {{VLDB} '11},
volume = {4},
number = {11},
pages = {761--772},
doi = {10.14778/3402707.3402716},
url = {https://doi.org/10.14778/3402707.3402716},
year = {2011}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,579 | Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System | 2012 | VLDB | 5.2528121e-05 |
| 11,233 | CIVET: Exploring Compact Index for Variable-Length Subsequence Matching on Time Series | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 221 | Robust and Fast Similarity Search for Moving Object Trajectories | 2005 | SIGMOD | 0.00024224879 |
| 303 | On The Marriage of Lp-norms and Edit Distance | 2004 | VLDB | 0.00021956234 |
| 601 | Exact Indexing of Dynamic Time Warping | 2002 | VLDB | 0.00015870156 |
| 1,046 | Warping Indexes with Envelope Transforms for Query by Humming | 2003 | SIGMOD | 0.00012440091 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,692 | Efficient Top-k Algorithms for Approximate Substring Matching | 2013 | SIGMOD |
| 2 | 10,938 | FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping | 2025 | VLDB |
| 3 | 8,780 | The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem | 2022 | VLDB |
| 4 | 41 | Fast Subsequence Matching in Time-Series Databases | 1994 | SIGMOD |
| 5 | 13,928 | Query by Humming - in Action with its Technology Revealed | 2003 | SIGMOD |
| 6 | 5,592 | Ranked Subsequence Matching in Time-Series Databases | 2007 | VLDB |
| 7 | 3,440 | Approximate Embedding-Based Subsequence Matching of Time Series | 2008 | SIGMOD |
| 8 | 6,858 | A Generic Framework for Efficient and Effective Subsequence Retrieval | 2012 | VLDB |
| 9 | 1,046 | Warping Indexes with Envelope Transforms for Query by Humming | 2003 | SIGMOD |
| 10 | 9,579 | Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System | 2012 | VLDB |